Simple mesh network for wireless transceivers

Patent metadata

Field	Value
Publication number	US-12114246-B2
Application number	US-202217568430-A
Country	US
Kind code	B2
Filing date	Jan 4, 2022
Priority date	Sep 19, 2013
Publication date	Oct 8, 2024
Grant date	Oct 8, 2024

Abstract

A method of operating a mesh network is disclosed (FIG. 6 ). The method includes receiving a data frame ( 600 ) having a header with plural addresses (FIG. 1 ) and determining that the data frame is not from an access point or a leaf node ( 602 ) of the mesh network. A next recipient address of the plural addresses is removed ( 610 ) when the next recipient is a final destination. The next recipient address is set ( 612 ) when the next recipient of the data frame is not a final destination. The data frame is transmitted ( 614 ) to the next recipient.

First claim

What is claimed is:

1. A method comprising:
receiving, by a first network device, a data frame from a second network device, wherein the first network device has a first hop number with respect to an access point, and the second network device has a second hop number with respect to the access point;
determining, by the first network device, whether the second network device is upstream or downstream from the first network device;
determining, by the first network device, whether a network loop is present based on whether the second network device is upstream or downstream from the first network device and on a comparison of the first hop number with the second hop number; and
based on the network loop being present, modifying the first hop number of the first network device.

2. The method of claim 1 , wherein the modifying includes incrementing the first hop number when the second network device is downstream from the first network device and the second hop number is not greater than the first hop number.

3. The method of claim 1 , wherein the modifying includes decrementing the first hop number when the second network device is upstream from the first network device and the second hop number is not less than the first hop number.

4. The method of claim 1 , further comprising determining whether the first network device is a relay node and the second network device is a relay node, wherein each of: the determining of whether the second network device is upstream or downstream from the first network device, the determining of whether the network loop is present, and the modifying of the first hop number is performed based on the first network device being a relay node and the second network device being a relay node.

5. The method of claim 1 , wherein each of: the determining of whether the second network device is upstream or downstream from the first network device, the determining of whether the network loop is present, and the modifying of the first hop number is performed based on the second network device not being an access point or a leaf node.

6. The method of claim 1 , wherein:
the data frame includes a header that includes a source address and a destination address;
the method further comprises determining whether the header includes a third address other than the source address and the destination address; and
each of: the determining of whether the second network device is upstream or downstream from the first network device, the determining of whether the network loop is present, and the modifying of the first hop number is performed based on the header including the third address.

7. The method of claim 6 , further comprising:
based on the header not including the third address, adding the third address to the header such that the third address indicates a third network device; and
transmitting, by the first network device, the data frame to the third network device.

8. The method of claim 6 , further comprising:
determining whether a subsequent transmission of the data frame is a final hop; and
based on the header including the third address and the subsequent transmission being the final hop, removing the third address from the header.

9. The method of claim 1 , wherein:
the first network device serves a set of network devices; and
the method further comprises:
determining whether the second network device is in the set of network devices; and
based on the second network device not being in the set of network devices, not transmitting the data frame by the first network device.

10. The method of claim 9 , wherein:
the data frame includes a header that includes a source address, a destination address, and a third address that is different from the source address and the destination address; and
the determining of whether the second network device is in the set of network devices serviced by the first network device is based on whether the third address specifies the first network device.

11. A method comprising:
receiving, by a first network device, a data frame from a second network device, wherein the data frame includes a header that includes a source address and a destination address;
determining whether the header includes a third address other than the source address and the destination address; and
based on the header including the third address:
determining whether a network loop is present; and
based on the network loop being present, modifying a hop number of the first network device.

12. The method of claim 11 , wherein:
the hop number of the first network device is a first hop number;
the second network device is associated with a second hop number;
the method further comprises determining, by the first network device, whether the second network device is upstream or downstream from the first network device; and
the determining of whether the network loop is present is based on whether the second network device is upstream or downstream from the first network device and on a comparison of the first hop number with the second hop number.

13. The method of claim 12 , wherein the modifying includes incrementing the first hop number when the second network device is downstream from the first network device and the second hop number is not greater than the first hop number.

14. The method of claim 12 , wherein the modifying includes decrementing the first hop number when the second network device is upstream from the first network device and the second hop number is not less than the first hop number.

15. The method of claim 11 , further comprising determining whether the first network device is a relay node and the second network device is a relay node, wherein each of: the determining of whether the network loop is present and the modifying of the hop number of the first network device is performed based on the first network device being a relay node and the second network device being a relay node.

16. The method of claim 15 , wherein the determining of whether the second network device is a relay node is based on whether the header includes the third address.

17. The method of claim 11 , wherein each of: the determining of whether the network loop is present and the modifying of the hop number of the first network device is performed based on the second network device not being an access point or a leaf node.

18. The method of claim 11 , further comprising:
based on the header not including the third address, adding the third address to the header such that the third address indicates a third network device; and
transmitting, by the first network device, the data frame to the third network device.

19. The method of claim 11 , further comprising:
determining whether a subsequent transmission of the data frame is a final hop; and
based on the header including the third address and the subsequent transmission being the final hop, removing the third address from the header.

20. The method of claim 11 , wherein:
the first network device serves a set of network devices; and
the method further comprises:
determining whether the second network device is in the set of network devices; and
based on the second network device not being in the set of network devices, not transmitting the data frame by the first network device.

Assignees

• Texas Instruments Inc

Inventors

• Estevez Leonardo
• Baum Avraham
• Gabay Benzy

Classifications

• H04W84/18

  Self-organising networks, e.g. ad-hoc networks or sensor networks · CPC title

• H04W40/00 Primary

  Communication routing or communication path finding · CPC title