# US 10,375,597 B2 · System and method for multicast over highly mobile mesh networks

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

- Number: US 10,375,597 B2
- Document ID: US10375597B2
- Status: Granted
- Kind: B2
- Application number: 15/828,062
- Filed: 2017-11-30
- Published: 2018-04-05
- Granted: 2019-08-06
- Earliest claimed: 2012-12-18
- Assignees: Rajant Corporation
- Applicants: Rajant Corporation
- Inventors: David Acker; Paul R. Hellhake; William Jordan; Joseph E. Parks
- Web page: https://patentgrep.com/patent/US10375597B2

## CPC

- H04W 28/021: {in wireless networks with changing topologies, e.g. ad-hoc networks (self-organizing networks H04W84/18)}
- H04L 12/1877: {Measures taken prior to transmission}
- H04L 12/189: {in combination with wireless systems (selective distribution or broadcast in wireless communication networks H04W4/06)}
- H04L 47/15: {in relation to multipoint traffic (arrangements for broadcast or multicast in data networks H04L12/18)}
- H04W 40/12: based on transmission quality or channel quality
- H04L 45/16: Multipoint routing
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems, devices, and methodology for removing echo and reducing congestion in multicast (broadcast) over a dynamic self-healing mobile mesh network, by use of discrete embedded computers synchronously tracking mesh connections and link quality across multiple RF connections, keeping multicast both efficient and effective in a highly kinetic, ever changing, mesh topology.

## Claims

### Claim 1

A method for multicasting over a mesh network, the mesh network comprising a plurality of nodes, the method comprising:
maintaining, in each of the nodes, a list of nearby nodes with good links;
broadcasting, from each of the nodes, the maintained list to other ones of the nodes within range; and
relaying a multicast from each of the nodes only if the node can reach at least one node not seen as good by the node sending the multicast.

### Claim 2 (depends on 1)

The method as in claim 1, further comprising using mesh management/routing data to optimize selection of good link lists.

### Claim 3 (depends on 1)

The method as in claim 1, further comprising using a randomized delay on the good link list broadcast, that prevents multiple nodes from transmitting on top of each other when a peer goes on or off the mesh network.

### Claim 4 (depends on 1)

The method as in claim 1, operating at OSI Network Layer 2, in which all network addressing is done using MAC-level addresses.

### Claim 5 (depends on 1)

The method as in claim 1, wherein total path traversal time is used to help establish a cost metric for each link into the local node, and wherein each good link is determined using the cost metric.

### Claim 6 (depends on 1)

The method as in claim 1, wherein the broadcasting is performed periodically.

### Claim 7 (depends on 1)

The method as in claim 1, wherein the relaying of the multicast from each of the nodes is performed only if the node can reach a plurality of nodes not seen as good by the node sending the multicast.

### Claim 8

A node for multicasting over a mesh network, the network comprising a plurality of other nodes, the node comprising:
a communication component for connecting to the mesh network; and
a processor configured for:
maintaining a list of nearby nodes with good links;
broadcasting the maintained list to other ones of the nodes within range; and
relaying a multicast only if the node can reach at least one node not seen as good by the node sending the multicast.

### Claim 9 (depends on 8)

The node as in claim 8, wherein the processor is further configured for mesh management/routing data to optimize selection of good link lists.

### Claim 10 (depends on 8)

The node as in claim 8, wherein the processor is further configured for using a randomized delay on the good link list broadcast that prevents multiple nodes from transmitting on top of each other when a common neighbor goes on or off the mesh network.

### Claim 11 (depends on 8)

The node as in claim 8, operating at OSI Network Layer 2, in which all network addressing is done using MAC-level addresses.

### Claim 12 (depends on 8)

The node as in claim 8, wherein the processor is further configured for:
establishing a cost metric for each link into the local node using total path traversal time; and
determining each good link using the cost metric.

### Claim 13 (depends on 8)

The node as in claim 8, wherein the broadcasting is performed periodically.

### Claim 14 (depends on 8)

The node as in claim 8, wherein the relaying of the multicast is performed only if the node can reach a plurality of nodes not seen as good by the node sending the multicast.