# US 2025/0158976 A1 · Access and messaging in a multi client network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0158976 A1
- Document ID: US20250158976A1
- Status: Published application
- Kind: A1
- Application number: 18/974,016
- Filed: 2024-12-09
- Published: 2025-05-15
- Earliest claimed: 2020-03-26
- Assignees: View, Inc.
- Applicants: View, Inc.
- Inventors: Mahender Reddy Vangati; Darrel Q. Pham; Daniel Dah Tai; Michael Edgar Larson
- Web page: https://patentgrep.com/patent/US20250158976A1

## CPC

- H04L 63/0823: {using certificates (cryptographic mechanisms or cryptographic arrangements for entity authentication involving certificates H04L9/3263)}
- H04W 4/12: Messaging; Mailboxes; Announcements
- H04L 51/214: using selective forwarding
- H04L 63/0428: {wherein the data content is protected, e.g. by encrypting or encapsulating the payload}
- H04L 63/101: {Access control lists [ACL]}
- H04L 63/108: {when the policy decisions are valid for a limited amount of time}
- H04L 67/10: in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46)
- H04L 67/55: Push-based network services
- H04W 4/08: User group management
- H04W 4/33: for indoor environments, e.g. buildings
- H04W 12/069: using certificates or pre-shared keys
- H04W 12/08: Access security
- G02F 1/163: Operation of electrochromic cells, e.g. electrodeposition cells; Circuit arrangements therefor
- G05B 2219/2642: Domotique, domestic, home control, automation, smart house
- H04L 12/1859: {adapted to provide push services, e.g. data channels}
- Y02P 90/02: Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- G02F: OPTICAL DEVICES OR ARRANGEMENTS FOR THE CONTROL OF LIGHT BY MODIFICATION OF THE OPTICAL PROPERTIES OF THE MEDIA OF THE ELEMENTS INVOLVED THEREIN; NON-LINEAR OPTICS; FREQUENCY-CHANGING OF LIGHT; OPTICAL LOGIC ELEMENTS; OPTICAL ANALOGUE/DIGITAL CONVERTERS
- G05B: CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS (systems for controlling or regulating non-electric variables G05D; systems for regulating electric or magnetic variables G05F; control devices or systems insofar as characterised by mechanical features only G05G)
- Y02P: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS

## Abstract

A messaging system for exchanging messages between nodes in a network via a broker that uses a publish-subscribe message protocol, which nodes have object identifications (IDs). Messages between the nodes are routed using the object IDs of the nodes. Secure communication is provided using authentication according to digital certificates being used as first and second tiers by a commissioning broker and a data broker, respectively, in which the second tier certificate used by the data broker has a shorter lived expiration time.

## Claims

### Claim 1

(canceled)

### Claim 2

A method for operating a device of a facility, the method comprising:
(a) sending a message from a first node to a second node, wherein the message is communicated through a network, the second node has an object identification (ID), and the message comprises a string ID that comprises (i) the object ID or (ii) a group ID with the object ID is associated with; and
(b) using the message to operate a device of the facility, wherein the device is coupled to, or includes, the second node.

### Claim 3 (depends on 2)

The method of claim 2, further comprising using the first node to compile the message.

### Claim 4 (depends on 2)

The method of claim 2, wherein the message comprises (i) a routing address and (ii) a message data.

### Claim 5 (depends on 2)

The method of claim 2, wherein the device comprises a sensor, an emitter, an antenna, or a tintable window.

### Claim 6 (depends on 2)

The method of claim 2, wherein the network comprises a building management system.

### Claim 7

A non-transitory computer readable medium comprising instructions inscribed thereon for message delivery in a network of a facility, wherein the instructions, when executed by one or more processors, cause the one or more processors to execute operations, comprising:
(a) sending a message from a first node to a second node, wherein the message is communicated through a network, the second node has an object identification (ID), and the message comprises a string ID that comprises (i) the object ID or (ii) a group ID with which the object ID is associated with; and
(b) using the message to operate a device of the facility, wherein the device is coupled to, or includes, the second node.

### Claim 8 (depends on 7)

The non-transitory computer readable medium of claim 7, wherein the object ID and/or the group ID are in a routing address of the message.

### Claim 9

A method for message delivery in a network, the method comprising:
(a) routing a message from a first node to a second node, wherein the message comprises: (i) a first object ID of the first node and (ii) a second object ID of the second node or a group ID with which the second node is associated with;
(b) receiving the message by the second node; and
(c) using the second node to issue an acknowledgement of the message received by the second node.

### Claim 10 (depends on 9)

The method of claim 9, wherein the first node routes the acknowledgement to a broker that mediates any messages sent between the second node and the first node.

### Claim 11

A non-transitory computer readable medium comprising instructions inscribed thereon for message delivery in a network, wherein the instructions, when executed by one or more processors, cause the one or more processors to execute operations, comprising:
(a) routing a message from a first node to a second node, wherein the message comprises: (i) a first object ID of the first node and (ii) a second object ID of the second node or a group ID with which the second node is associated with;
(b) receiving the message by the second node; and
(c) using the second node to issue an acknowledgement of the message received by the second node.

### Claim 12 (depends on 11)

The non-transitory computer readable medium of claim 11, wherein the executed operations comprise using the first node to compile the message.

### Claim 13 (depends on 11)

The non-transitory computer readable medium of claim 11, wherein the message comprises (i) a routing address and (ii) a message data.

### Claim 14

A method for message delivery in a network, the method comprising:
(a) routing a message from a first node to a second node through a broker, wherein the message comprises: (i) a first object ID of the first node in a header of the message having a first encryption level and (ii) a second object ID of the second node in a routing address, and (ii) a content of the message having a second encryption level higher than the first encryption level;
(b) receiving the message by the broker that is unauthorized for the second encryption level; and
(c) using the broker to route the message to the second node, the broker being unable to decipher the content of the message.

### Claim 15 (depends on 14)

The method of claim 14, wherein the object ID of the second node is a second object ID, and wherein data of the message comprises (i) a message header that comprises a first object ID of the first node, and/or (ii) a message content that comprises one or more values.

### Claim 16

A non-transitory computer readable medium comprising instructions inscribed thereon for message delivery in a network, wherein the instructions, when executed by one or more processors, cause the one or more processors to execute operations, comprising:
(a) routing a message from a first node to a second node through a broker, the message comprising: (i) a first object ID of the first node in a header of the message having a first encryption level and (ii) a second object ID of the second node in a routing address, and (ii) a content of the message having a second encryption level higher than the first encryption level;
(b) receiving the message by the broker that is unauthorized for the second encryption level; and
(c) using the broker to route the message to the second node, the broker being unable to decipher the content of the message.

### Claim 17 (depends on 16)

The non-transitory computer readable medium of claim 16, wherein the object ID of the second node is a second object ID, and wherein data of the message comprises (i) a message header that comprises a first object ID of the first node, and/or (ii) a message content that comprises one or more values.
