Method of mapping optimal communication routes through a mesh network

• US 10,448,310 B2
• Filed: 07/12/2017
• Issued: 10/15/2019
• Est. Priority Date: 08/06/2015
• Status: Active Grant

• Current Assignee: Gooee Limited (Gooee Group Holdings Ltd.)
• Original Assignee: Gooee Limited (Gooee Group Holdings Ltd.)
• Inventors: Fuhrmann, Amir
• Primary Examiner(s): Sheikh, Ayaz R
• Assistant Examiner(s): Aga, Sori A
• Application Number:
  US15/648,449
• Publication Number:
  US 20170311226A1
• Time in Patent Office: 825 Days
• Field of Search: None
• CPC Class Codes: H04L 41/08 Configuration management of networks or network elements address allocation H04L61/50
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 43/10 Active monitoring, e.g. heartbeat, ping or trace-route
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04W 4/80 Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication
• CPC Class Codes: H04W 40/246 Connectivity information discovery
• CPC Class Codes: H04W 40/30 for proactive routing
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

Disclosed is a method of mapping optimal communication routes through a mesh network.

Claims

1. A method of mapping optimal communication routes through a mesh network, the method comprises the steps of:

(A) providing a root node and a plurality of intermediate nodes, wherein the root node and each intermediate node communicates amongst each other through the mesh network;

(B) listening for at least one topology-mapping packet with each intermediate node, wherein the topology-mapping packet includes a distance from the root node and a route description;

(C) receiving the topology-mapping packet with an arbitrary intermediate node, wherein the arbitrary intermediate node is any node from the plurality of intermediate nodes;

(D) assessing the topology-mapping packet with the arbitrary intermediate node in order to identify an optimal upstream-neighbor node;

(E) generating a new topology-mapping packet with the arbitrary intermediate node, wherein the new topology-mapping packet includes an updated distance from the root node and an updated route description;

(F) periodically broadcasting the new topology-mapping packet with the arbitrary intermediate node;

(G) repeating steps (C) through (F) with each intermediate node as the arbitrary intermediate node in order to establish a topology of optimal communication routes through the mesh network; and

(H) selectively forwarding information packets through the topology of optimal communication routes.

2. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 1 comprises the steps of:

providing the at least one topology-mapping packet as a single packet, wherein the route description of the single packet discloses an origination node; and

designating the origination node from the single packet as the optimal upstream-neighbor node for the arbitrary intermediate node during step (D).

3. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 2 comprises the step of:

generating the updated distance from the root node during step (E) by appending the arbitrary intermediate node into the distance from the root node disclosed in the single packet.

4. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 2 comprises the step of:

generating the updated route description during step (E) by appending the arbitrary intermediate node into the route description disclosed in the single packet.

5. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 2, wherein the origination node is the root node, if the distance from the root node disclosed in the single packet is zero.

6. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 2, wherein the origination node is another intermediate node from the plurality of intermediate nodes, if the distance from the root node disclosed in the single packet is greater than zero.

7. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 1 comprises the steps of:

providing the at least one topology-mapping packet as a plurality of topology-mapping packets, wherein the route description of each topology-mapping packet discloses an origination node;

comparing the distance from the root node disclosed in each topology-mapping packet against each other during step (D) in order to identify a specific packet with a shortest distance from the root node, wherein the specific packet is from the plurality of topology-mapping packets; and

designating the origination node from the specific packet as the optimal upstream-neighbor node for the arbitrary intermediate node during step (D).

8. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 7 comprises the steps of:

identifying multiple data packets each having a multiple data packet distance from the root node equal to the shortest distance from the root node of the specific packet, wherein the multiple packets are from the plurality of topology-mapping packets;

measuring a signal strength for each of the multiple packets with the arbitrary intermediate node; and

comparing the signal strength for each of the multiple data packets and the specific packet against each other in order to identify an optimal packet with a strongest signal strength.

9. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 7 comprises the step of:

generating the updated distance from the root node during step (E) by appending the arbitrary intermediate node into the distance from the root node disclosed in the specific packet.

10. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 7 comprises the step of:

generating the updated route description during step (E) by appending the arbitrary intermediate node into the route description disclosed in the specific packet.

11. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 7, wherein the origination node is the root node, if the distance from the root node disclosed in the specific packet is zero.

12. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 7, wherein the origination node is another intermediate node from the plurality of intermediate nodes, if the distance from the root node disclosed in the specific packet is greater than zero.

13. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 1 comprises the step of:

designating the arbitrary intermediate node as an optimal downstream-neighbor node for the optimal upstream-neighbor node after step (D), wherein the optimal upstream-neighbor node is either the root node or another intermediate node.

14. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 1 comprises the step of:

compiling a topology reference table for each intermediate node as the topology of optimal communication routes through the mesh network during step (G), wherein the topology reference table for each intermediate node refers to a single optimal upstream-neighbor node and to at least one optimal downstream-neighbor node.

15. The method of mapping optimal communication routes through a mesh network, the method as claimed in claim 14 comprises the step of:

serially forwarding the information packets through the plurality of intermediate nodes based on the topology reference table.