Method and system for an adaptive wireless routing protocol in a mesh network

• US 20070127503A1
• Filed: 12/01/2005
• Published: 06/07/2007
• Est. Priority Date: 12/01/2005
• Status: Active Grant

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Azalea Networks (Hewlett-Packard Enterprise Company)
• Inventors: Zhao, Fuyong
• Granted Patent: US 7,668,173 B2
• Time in Patent Office: Days
• US Class Current: 370/400
• CPC Class Codes: H04L 45/18 Loop-free operations
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04W 40/248 Connectivity information update
• CPC Class Codes: H04W 40/26 for hybrid routing by combining proactive and reactive routing
• CPC Class Codes: H04W 84/22 with access to wired networks

Abstract

A method and system for an adaptive wireless routing protocol in a mesh network are disclosed. In one embodiment, the method comprises routing datagrams between a plurality of nodes in a mesh network. Update messages are routed to one or more of the plurality of nodes, wherein the update messages include hello packets and update packets.

Claims

1. A method, comprising:

routing datagrams between a plurality of nodes in a mesh network; and

routing messages to one or more of the plurality of nodes, wherein the routing messages include hello packets and update packets.

2. The method of claim 1, wherein the hello packets establish and maintain neighbor relationships.

3. The method of claim 1, wherein the update packets maintain routing tables stored in the plurality of nodes.

4. The method of claim 3, wherein the routing tables include a destination IP address, a destination mark, a router ID, a highest sequence number route, a least metric route, an immediate update flag, and messenger information.

5. The method of claim 2, wherein the update packets include periodic update packets, immediate trigger update packets, and normal triggered update packets.

6. The method of claim 1, wherein routing datagrams comprises choosing a route having the highest destination sequence number.

7. The method of claim 1, wherein the update packets include messengers.

8. The method of claim 1, further comprising monitoring if links with one or more neighbor nodes are broken.

9. The method of claim 8, further comprising performing a local repair procedure when links to a destination node are broken.

10. A computer-readable medium having stored thereon a plurality of instructions, said plurality of instructions when executed by a computer, cause said computer to perform:

routing datagrams between a plurality of nodes in a mesh network; and

routing messages to one or more of the plurality of nodes, wherein the routing messages include hello packets and update packets.

11. The computer-readable medium of claim 10, wherein the hello packets establish and maintain neighbor relationships.

12. The computer-readable medium of claim 10, wherein the update packets maintain routing tables stored in the plurality of nodes.

13. The computer-readable medium of claim 12, wherein the routing tables include a destination IP address, a destination mark, a router ID, a highest sequence number route, a least metric route, an immediate update flag, and messenger information.

14. The computer-readable medium of claim 11, wherein the update packets include periodic update packets, immediate trigger update packets, and normal triggered update packets.

15. The computer-readable medium of claim 10, having stored thereon-additional instructions, said additional instructions when executed by a computer for routing datagrams, cause said computer to further perform choosing a route having the highest destination sequence number.

16. The computer-readable medium of claim 10, wherein the update packets include messengers.

17. The computer-readable medium of claim 10, having stored thereon-additional instructions, said additional instructions when executed by a computer, cause said computer to further perform monitoring if links with one or more neighbor nodes are broken.

18. The computer-readable medium of claim 11 having stored thereon-additional instructions, said additional instructions when executed by a computer, cause said computer to further perform performing a local repair procedure when links to a destination node are broken.

19. A mesh router, comprising:

a processor;

memory coupled to the processor; and

a bus coupling the processor and memory;

wherein the memory stores instructions that are executed by the processor to route datagrams between a plurality of nodes in a mesh network; and

routing messages to one or more of the plurality of nodes, wherein the routing messages include hello packets and update packets.

20. The router of claim 19, wherein the hello packets establish and maintain neighbor relationships.

21. The router of claim 19, wherein the update packets maintain routing tables stored in the memory.

22. The router of claim 21, wherein the routing tables include a destination IP address, a destination mark, a router ID, a highest sequence number route, a least metric route, an immediate update flag, and messenger information.

23. The method of claim 20, wherein the update packets include periodic update packets, immediate trigger update packets, and normal triggered update packets.

24. The method of claim 19, wherein routing datagrams comprises chosing a route having the highest destination sequence number.

25. The method of claim 19, wherein the update packets include messengers.

26. The method of claim 19, further comprising monitoring if links with one or more neighbor nodes are broken.

27. The method of claim 26, further comprising performing a local repair procedure when links to a destination node are broken.