Policy-Based Topology Maintenance for Wireless Networks that Employ Hybrid Tree-Based Routing with AODV

• US 20070053309A1
• Filed: 08/28/2006
• Published: 03/08/2007
• Est. Priority Date: 09/06/2005
• Status: Abandoned Application

• Current Assignee: Texas Instruments, Inc.
• Original Assignee: Texas Instruments, Inc.
• Inventors: Kangude, Shantanu, Xhafa, Ariton, Poojary, Neeraj
• Application Number:
  US11/467,843
• Publication Number:
  US 20070053309A1
• Time in Patent Office: Days
• US Class Current: 370/256
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04W 40/28 for reactive routing
• CPC Class Codes: H04W 40/34 Modification of an existing route
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A mesh point operable in a decentralized wireless network is provided. The mesh point includes a transceiver and a processor. The transceiver is operable to communicate with other mesh points. The processor is programmed to execute a routing protocol such that, when a first policy of the routing protocol is selected and a transmission failure occurs between the mesh point and a current parent node of the mesh point, the processor is operable to execute instructions to promote finding another route to a root. The other route to the root is found by referencing a topology, if the topology is available, to identify the route to the root. If the route is not found, the transceiver transmits a one-hop broadcast route request. If the route is still not found, the mesh point enters a route discovery state.

Claims

1. A mesh point operable in a decentralized wireless network, comprising:

a transceiver operable to communicate with other mesh points;

a processor programmed to execute a routing protocol, when a first policy of the routing protocol is selected and a transmission failure occurs between the mesh point and a current parent node of the mesh point, the processor is operable to execute instructions to promote finding another route to a root by;

referencing a topology, if the topology is available, to identify the route to the root,

and if the route is not found, the transceiver transmitting a one-hop broadcast route request,

and if the route is not found, the mesh point entering a route discovery state.

2. The mesh point of claim 1, further comprising when a second policy of the routing protocol is selected, the processor is operable to execute instructions to promote the transceiver periodically verifying that the mesh point is in communication with the current parent node of the mesh point, and when the mesh point cannot communicate with the current parent node of the mesh point then the processor is operable to find another route to the root by:

referencing a topology, if the topology is available, to identify the route to the root,

and if the route is not found, the transceiver transmitting a one-hop broadcast route request,

and if the route is not found, the mesh point entering a route discovery state.

3. The mesh point of claim 2, further comprising when a third policy of the routing protocol is selected, the processor is operable to execute instructions substantially implementing the second policy of the routing protocol and further to promote the transceiver periodically transmitting a one-hop route request to find a different route to the root, and when the mesh point determines to use the different route to the root, the transceiver transmitting to the root the different route to the root to be used by the mesh point.

4. The mesh point of claim 3, further comprising when a fourth policy of the routing protocol is selected, the processor is operable to execute instructions substantially implementing the third policy of the routing protocol and further to promote the transceiver transmitting to downstream mesh points the different route to the root being used by the mesh point.

5. The mesh point of claim 3, wherein when the third policy is selected the different route is further defined as a more efficient route to the root.

6. The mesh point of claim 3, wherein when the third policy is selected the different route is further defined as an optimal route to the root.

7. The mesh point of claim 1, wherein the mesh point is further defined as at least one of:

an access point;

a root;

a combination mesh point/access point;

a computer;

a laptop computer;

a portable computer;

a wireless handset; and

a server computer.

8. The mesh point of claim 1, wherein finding another route to the root includes:

referencing a topology, if the topology is available, to identify the route to the root;

if identifying the route to the root by referencing the topology fails, then next, the transceiver transmitting a one-hop broadcast route request; and

if identifying the route to the root by transmitting the one-hop broadcast route request fails, then next, the mesh point entering a route discovery state.

9. The mesh point of claim 4, wherein one of the first policy, the second policy, the third policy, and the fourth policy is selected at least one of:

a time when the network is initially configured;

a time when at least one parameter of the network changes; and

a time when a different policy is desired.

10. A data signal embodied in a carrier wave, the data signal operable to promote execution by a mesh point in a decentralized network of a routing protocol comprising:

when a first policy of the routing protocol is selected and a transmission failure occurs between the mesh point and a current parent node of the mesh point, a processor is operable to execute instructions to promote finding another route to a root by;

referencing a topology, if the topology is available, to identify the route to the root,

and if the route is not found, the transceiver transmitting a one-hop broadcast route request,

and if the route is not found, the mesh point entering a route discovery state.

11. The data signal of claim 10, wherein the routing protocol further comprises, when a second policy of the routing protocol is selected, the processor is operable to execute instructions to promote the transceiver periodically verifying that the mesh point is in communication with the current parent node of the mesh point, and when the mesh point cannot communicate with the current parent node of the mesh point then the processor is operable to find another route to the root by:

referencing a topology, if the topology is available, to identify the route to the root,

and if the route is not found, the transceiver transmitting a one-hop broadcast route request,

and if the route is not found, the mesh point entering a route discovery state.

12. The data signal of claim 11, further comprising when a third policy of the routing protocol is selected, the processor is operable to execute instructions substantially implementing the second policy of the routing protocol and further to promote the transceiver periodically transmitting a one-hop route request to find a different route to the root, and when the mesh point determines to use the different route to the root, the transceiver transmitting to the root the different route to the root to be used by the mesh point.

13. The data signal of claim 12, further comprising when a fourth policy of the routing protocol is selected, the processor is operable to execute instructions substantially implementing the third policy of the routing protocol and further to promote the transceiver transmitting to downstream mesh points the different route to the root being used by the mesh point.

14. The data signal of claim 12, wherein when the third policy is selected the different route is further defined as a more efficient route to the root.

15. The data signal of claim 12, wherein when the third policy is selected the different route is further defined as an optimal route to the root.

16. The data signal of claim 10, wherein the mesh point is further defined as at least one of:

an access point;

a root;

a combination mesh point/access point;

a computer;

a laptop computer;

a portable computer; and

a server computer.

17. The data signal of claim 10, wherein finding another route to the root includes:

referencing a topology, if the topology is available, to identify the route to the root;

if identifying the route to the root by referencing the topology fails, then next, the transceiver transmitting a one-hop broadcast route request; and

if identifying the route to the root by transmitting the one-hop broadcast route request fails, then next, the mesh point entering a route discovery state.

18. The data signal of claim 13, wherein one of the first policy, the second policy, the third policy, and the fourth policy is selected at least one of:

a time when the network is initially configured;

a time when at least one parameter of the network changes; and

a time when a different policy is desired.

19. A method of communicating in a decentralized wireless network, comprising:

when a first policy of a routing protocol is selected and a transmission failure occurs, attempting to find another route to a root by;

referencing a topology, if the topology is available, to identify the route to the root,

and if the route is not found, transmitting a one-hop broadcast route request,

and if the route is not found, entering a route discovery state;

when a second policy of the routing protocol is selected, periodically verifying that a mesh point is in communication with a current parent node of the mesh point, and when the mesh point cannot communicate with the current parent node of the mesh point, finding another route to the root by;

referencing a topology, if the topology is available, to identify the route to the root,

and if the route is not found, transmitting a one-hop broadcast route request,

and if the route is not found, entering a route discovery state;

when a third policy of the routing protocol is selected, substantially implementing the second policy of the routing protocol and periodically transmitting a one-hop route request to find a different route to the root, and when it is determined to use the different route to the root, transmitting to the root the different route to the root to be used; and

when a fourth policy of the routing protocol is selected, substantially implementing the third policy of the routing protocol and transmitting to downstream mesh points the different route to the root being used.

20. The method of claim 19, wherein when the third policy is selected the different route is further defined as a more efficient route to the root.