# US 2018/0026806 A1 · System and method for broadcasting messages to nodes within a wireless mesh network

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

- Number: US 2018/0026806 A1
- Document ID: US20180026806A1
- Status: Published application
- Kind: A1
- Application number: 15/714,777
- Filed: 2017-09-25
- Published: 2018-01-25
- Earliest claimed: 2012-09-24
- Assignees: Silver Spring Networks, Inc.
- Applicants: Silver Spring Networks, Inc.
- Inventors: Jana VAN GREUNEN; Sterling HUGHES; Peter HUNT; William E. SAN FILIPPO, III
- Web page: https://patentgrep.com/patent/US20180026806A1

## CPC

- H04L 12/1895: {for short real-time information, e.g. alarms, notifications, alerts, updates}
- G06F 15/16: Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs {(coordinating program control therefor G06F9/52; in regulating and control system G05B)}
- H04L 27/28: with simultaneous transmission of different frequencies each representing one code element
- H04L 12/413: with random access, e.g. carrier-sense multiple-access with collision detection [CSMA-CD]
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A node within a wireless mesh network is configured to forward a high-priority message to adjacent nodes in the wireless mesh network by either (i) transmitting the message during successive timeslots to the largest subset of nodes capable of receiving transmissions during each timeslot, or (ii) transmitting the message on each different channel during the timeslot when the largest subset of nodes are capable of receiving transmissions on each of those channels.

## Claims

### Claim 1

A computer-implemented method, comprising:
selecting a first channel from a set of channels on which nodes residing adjacent to a first node receive transmissions;
identifying a first time interval subsequent to a current time interval during which the greatest number of nodes residing adjacent to the first node will receive transmissions on the first channel; and
transmitting the message on the first channel during the first time interval.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising:
excluding the first channel from the set of channels;
selecting a second channel from a set of channels;
identifying a second time interval subsequent to the current time interval during which the greatest number of nodes residing adjacent to the first node will receive transmissions on the second channel; and
transmitting the message on the second channel during the second time interval.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, further comprising analyzing each time slot in a sequence of time slots based on channel hopping sequences associated with a plurality of nodes residing adjacent to the first node to determine one or more adjacent nodes that a capable of receiving transmissions on the first channel during the first time interval.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, further comprising analyzing each time slot in the sequence of time slots based on the channel hopping sequences associated with the plurality of nodes residing adjacent to the first node to determine one or more adjacent nodes capable of receiving transmissions on the second channel during the second time interval.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, further comprising determining that each channel on which the nodes residing adjacent to the first node receive transmissions has been excluded from the set of channels.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, wherein the first node and the nodes residing adjacent to the first node comprise at least a portion of a wireless mesh network configured to manage the operation of an electricity distribution infrastructure.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, further comprising transmitting the message once on each channel in the set of channels after excluding the first channel.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein the message comprises a high-priority message.

### Claim 9

A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause the processor to perform the steps of:
selecting a first channel from a set of channels on which nodes residing adjacent to a first node receive transmissions;
identifying a first time interval subsequent to a current time interval during which the greatest number of nodes residing adjacent to the first node will receive transmissions on the first channel; and
transmitting the message on the first channel during the first time interval.

### Claim 10 (depends on 9)

The non-transitory computer-readable medium of claim 9, further comprising:
excluding the first channel from the set of channels;
selecting a second channel from a set of channels;
identifying a second time interval subsequent to the current time interval during which the greatest number of nodes residing adjacent to the first node will receive transmissions on the second channel; and
transmitting the message on the second channel during the second time interval.

### Claim 11 (depends on 10)

The non-transitory computer-readable medium of claim 10, further comprising analyzing each time slot in a sequence of time slots based on channel hopping sequences associated with a plurality of nodes residing adjacent to the first node to determine one or more adjacent nodes that a capable of receiving transmissions on the first channel during the first time interval.

### Claim 12 (depends on 11)

The non-transitory computer-readable medium of claim 11, further comprising analyzing each time slot in the sequence of time slots based on the channel hopping sequences associated with the plurality of nodes residing adjacent to the first node to determine one or more adjacent nodes capable of receiving transmissions on the second channel during the second time interval.

### Claim 13 (depends on 9)

The non-transitory computer-readable medium of claim 9, further comprising determining that each channel on which the nodes residing adjacent to the first node receive transmissions has been excluded from the set of channels.

### Claim 14 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein the first node and the nodes residing adjacent to the first node comprise at least a portion of a wireless mesh network configured to manage the operation of an electricity distribution infrastructure.

### Claim 15 (depends on 9)

The non-transitory computer-readable medium of claim 9, further comprising transmitting the message once on each channel in the set of channels after excluding the first channel.

### Claim 16 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein the message comprises a high-priority message.

### Claim 17

A device, comprising:
a memory storing instructions; and
a processor that is coupled to the memory and, when executing the instructions, is configured to:
select a first channel from a set of channels on which nodes residing adjacent to a first node receive transmissions;
identify a first time interval subsequent to a current time interval during which the greatest number of nodes residing adjacent to the first node will receive transmissions on the first channel; and
transmit the message on the first channel during the first time interval.

### Claim 18 (depends on 9)

The device of claim 9, wherein the processor is further configured to:
exclude the first channel from the set of channels;
select a second channel from a set of channels;
identify a second time interval subsequent to the current time interval during which the greatest number of nodes residing adjacent to the first node will receive transmissions on the second channel; and
transmit the message on the second channel during the second time interval.

### Claim 19 (depends on 10)

The device of claim 10, wherein the processor is further configured to analyze each time slot in a sequence of time slots based on channel hopping sequences associated with a plurality of nodes residing adjacent to the first node to determine one or more adjacent nodes that a capable of receiving transmissions on the first channel during the first time interval.

### Claim 20 (depends on 11)

The device of claim 11, wherein the processor is further configured to analyze each time slot in the sequence of time slots based on the channel hopping sequences associated with the plurality of nodes residing adjacent to the first node to determine one or more adjacent nodes capable of receiving transmissions on the second channel during the second time interval.

### Claim 21 (depends on 9)

The device of claim 9, wherein the processor is further configured to determine that each channel on which the nodes residing adjacent to the first node receive transmissions has been excluded from the set of channels.

### Claim 22 (depends on 9)

The device of claim 9, wherein the first node and the nodes residing adjacent to the first node comprise at least a portion of a wireless mesh network configured to manage the operation of an electricity distribution infrastructure.

### Claim 23 (depends on 9)

The device of claim 9, wherein the processor is further configured to transmit the message once on each channel in the set of channels after excluding the first channel.

### Claim 24 (depends on 9)

The device of claim 9, wherein the message comprises a high-priority message.
