Mesh Node Mobility Across Static and Mobile Mesh Networks

• US 20130329582A1
• Filed: 12/20/2012
• Published: 12/12/2013
• Est. Priority Date: 10/13/2006
• Status: Active Grant

• Current Assignee: FireTide Incorporated (UNICOM Global, Inc.)
• Original Assignee: FireTide Incorporated (UNICOM Global, Inc.)
• Inventors: JETCHEVA, Jorjeta Gueorguieva, KANODIA, Sachin, KAILAS, Sivakumar, REPAKULA, Murali
• Granted Patent: US 10,959,289 B2
• Time in Patent Office: Days
• US Class Current: 370/252
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/124 using a combination of metrics
• CPC Class Codes: H04W 40/04 based on wireless node resources
• CPC Class Codes: H04W 80/04 Network layer protocols, e.g. mobile IP [Internet Protocol]
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

Methods and systems for mobility of mobile nodes in mesh networks are taught wherein the mobile mesh nodes choose an attachment point to another mesh node based on predetermined criteria, such as the characteristics of the attachment point'"'"'s path to a reference destination, and other factors local to the attachment point, such as load and available capacity. The mobile nodes forward packets on each other'"'"'s behalf. Static and mobile nodes and the links between them are treated differently from each other in view of their respectively different properties. A special metric is used for paths that include mobile links in addition to the static mesh links and wired mesh links. Mobility is handled completely transparently to any client devices attached to the mesh nodes, where this attachment could be wireless or wired.

Claims

1. A mobile node adapted to participate in a mesh network connected to an external network, the mobile node comprising:

means for selecting a reference destination coupled to the external network;

means for identifying respective paths to the reference destination via each of a plurality of attachment point candidates;

means for determining a favored path of the respective paths by comparatively evaluating as required the respective paths in accordance with criteria, in order of preference, comprising fewest links having at least one mobile endpoint, superior available bandwidth, and fewest wireless links;

means for choosing one of the candidates as a primary attachment point based at least in part on the determining; and

wherein the reference destination and the candidates are among a plurality of nodes of the mesh network, and the selecting, the identifying, the evaluating, and the choosing, are with respect to the mobile node.

7. The mobile node of claim 1, wherein the criteria, in order of preference, further comprises fewest total links-of-any-type.

8. The mobile node of claim 1, wherein the candidates comprise at least one mobile node.

9. The mobile node of claim 1, wherein at least one of the respective paths comprises at least one mobile node.

2. A non-transitory computer readable medium having a set of instructions stored therein that, when executed by a processing element of at least one mobile node in a mesh network connected to an external network, causes the processing element to perform functions comprising:

selecting a reference destination coupled to the external network;

identifying respective paths to the reference destination via each of a plurality of attachment point candidates;

determining a favored path of the respective paths by comparatively evaluating as required the respective paths in accordance with criteria, in order of preference, comprising fewest links having at least one mobile endpoint, superior available bandwidth, and fewest wireless links;

choosing one of the candidates as a primary attachment point based at least in part on the determining; and

wherein the reference destination and the candidates are among a plurality of nodes of the mesh network, and the selecting, the identifying, the evaluating, and the choosing, are with respect to the mobile node.

10. The non-transitory computer readable medium of claim 2, wherein the criteria, in order of preference, further comprises fewest total links-of-any-type.

11. The non-transitory computer readable medium of claim 2, wherein the candidates comprise at least one mobile node.

25. The non-transitory computer readable medium of claim 2, wherein at least one of the respective paths comprises at least one mobile node.

3. A method for facilitating the mobility of a mobile node in a mesh network connected to an external network, the method comprising:

selecting a reference destination coupled to the external network;

identifying respective paths to the reference destination via each of a plurality of attachment point candidates;

determining a favored path of the respective paths by comparatively evaluating as required the respective paths in accordance with criteria, in order of preference, comprising fewest links having at least one mobile endpoint, superior available bandwidth, and fewest wireless links;

choosing one of the candidates as a primary attachment point based at least in part on the determining; and

wherein the reference destination and the candidates are among a plurality of nodes of the mesh network, and the selecting, the identifying, the evaluating, and the choosing, are with respect to the mobile node.

4. The method of claim 3, wherein the criteria, in order of preference, further comprises fewest total links-of-any-type.

5. The method of claim 3, wherein the candidates comprise at least one mobile node.

6. The method of claim 3, wherein at least one of the respective paths comprises at least one mobile node.

12. The method of claim 3, wherein at least some of the plurality of nodes comprise a static mesh infrastructure.

13. The method of claim 12, wherein the static mesh infrastructure is comprised at least in part of a plurality of wireless hops.

14. The method of claim 3, wherein at least some of the plurality of nodes are mobile and the mobile nodes forward packets on each other'"'"'s behalf.

15. The method of claim 3, wherein client devices obtaining connectivity via the mesh network need not take into account whether any of the plurality of nodes are mobile.

16. The method of claim 3, further comprising:

at least one node of the plurality of nodes behaving like a static node at a first time and behaving like a mobile node at a second time.

17. The method of claim 16, further comprising:

predetermining the times at which each behaving state occurs.

18. The method of claim 16, further comprising:

with respect to the at least one node, detecting the behaving state change and repeating at least the evaluating and the choosing.

19. The method of claim 3, wherein the reference destination is a mesh portal through which it is expected that a majority of the mobile node'"'"'s packets will traverse into and out of the mesh network.

20. The method of claim 3, wherein the reference destination is a virtual portal conceptually coupled to the external network and to at least two physical mesh network portals actually coupled to the external network.

21. The method of claim 3, wherein at least a plurality of the nodes act as mesh portals coupling the mesh network with the external network and the selecting the reference destination comprises selecting the particular one of the mesh portals closest to a wired network infrastructure portion of the external network.

22. The method of claim 3, wherein at least a plurality of the nodes act as mesh portals coupling the mesh network with the external network and the selecting the reference destination comprises selecting the particular one of the mesh portals through which the majority of the mobile node'"'"'s packets traverse into and out of the mesh network.

23. The method of claim 3, further comprising:

choosing one of the candidates as a backup attachment point based at least in part on the evaluating.

24. (canceled)