# US 2019/0059041 A1 · Systems and methods for wireless communication network loop detection

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

- Number: US 2019/0059041 A1
- Document ID: US20190059041A1
- Status: Published application
- Kind: A1
- Application number: 15/839,607
- Filed: 2017-12-12
- Published: 2019-02-21
- Earliest claimed: 2017-08-17
- Assignees: Hype Labs Inc.
- Applicants: Hype Labs Inc.
- Inventors: André Francisco; Carlos Santos; Pedro Júlio
- Web page: https://patentgrep.com/patent/US20190059041A1

## CPC

- H04W 40/246: {Connectivity information discovery}
- H04L 45/18: Loop-free operations
- H04W 40/02: Communication route or path selection, e.g. power-based or shortest path routing
- H04W 40/28: for reactive routing
- H04W 84/18: Self-organising networks, e.g. ad-hoc networks or sensor networks
- 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

A method for detecting communication loop in an ad hoc network is provided. The method may comprise: receiving, at a node of the ad hoc network, a message comprising a commutative value, wherein the node is associated with a node identifier and the commutative value pertains to node identifiers associated with one or more nodes along a path the message has been traversed along regardless of the order of the nodes; and determining, with aid of one or more processors, presence of a loop based on whether the commutative value is identical to a previously obtained commutative value.

## Claims

### Claim 1

A method for detecting a communication loop of an ad hoc network comprising:
receiving, at a node of the ad hoc network, a message comprising a commutative value, wherein the node is associated with a node identifier and the commutative value pertains to node identifiers associated with one or more nodes along a path the message has been traversed along regardless of the order of the nodes; and
determining, with aid of one or more processors, presence of a loop based on whether the commutative value is identical to a previously obtained commutative value.

### Claim 2 (depends on 1)

The method of claim 1, further comprising extracting the commutative value from a predetermined field of the message.

### Claim 3 (depends on 1)

The method of claim 1, wherein the node functions as a broadcast node, relay node, or recipient node.

### Claim 4 (depends on 1)

The method of claim 1, wherein the message comprises a header portion and a payload portion.

### Claim 5 (depends on 4)

The method of claim 4, wherein at least one of the commutative value is included in the header portion.

### Claim 6 (depends on 4)

The method of claim 4, further comprising dividing the payload portion into a plurality of fragments each of which comprises a content identifier and a commutative value.

### Claim 7 (depends on 6)

The method of claim 6, further comprising computing an updated commutative value for each of the plurality of fragments individually.

### Claim 8 (depends on 1)

The method of claim 1, wherein the commutative value is obtained by performing a commutative operation to the node identifier and a previous commutative value of the message.

### Claim 9 (depends on 1)

The method of claim 1, wherein the commutative operation comprises at least one of addition, multiplication, and exclusive or (XOR).

### Claim 10 (depends on 1)

The method of claim 1, wherein the message further comprises a message identifier.

### Claim 11 (depends on 10)

The method of claim 10, wherein the message identifier is uniquely associated with a source of the message.

### Claim 12 (depends on 1)

The method of claim 1, further comprising performing at least one of discarding, relaying, storing the message according to a predetermined reaction scheme after the node determines the presence of a loop.

### Claim 13 (depends on 1)

The method of claim 1, wherein the node supports multiple communication technologies.

### Claim 14

A method for detecting a communication loop of an ad hoc network comprising:
receiving, at a node of the ad hoc network, a message comprising a plurality of sub-contents, wherein each sub-content comprises a commutative value, wherein the node is associated with a node identifier and the commutative value is pertained to node identifiers associated with one or more nodes along a path each of sub-contents has been traversed along regardless of the order of the nodes; and
determining, with the aid of the one or more processors, presence of a loop for the plurality of sub-contents individually, based on whether the commutative value and is identical to a previously obtained commutative value.

### Claim 15 (depends on 14)

The method of claim 14, further comprising extracting the commutative value from a predetermined field of the message.

### Claim 16 (depends on 14)

The method of claim 14, wherein the node functions as a broadcast node, relay node, or recipient node.

### Claim 17 (depends on 14)

The method of claim 14, wherein the message comprises a message identifier associated with a source of the message.

### Claim 18 (depends on 14)

The method of claim 14, wherein the commutative operation comprises at least one of addition, multiplication, and exclusive or.

### Claim 19 (depends on 14)

The method of claim 14, further comprising performing at least one of discarding, relaying, storing the sub-content according to a predetermined reaction scheme after the node determines the presence of a loop.

### Claim 20 (depends on 14)

The method of claim 14, wherein the node supports multiple communication technologies.
