Robust Routing of Data in Wireless Networks

• US 20100302933A1
• Filed: 10/22/2008
• Published: 12/02/2010
• Est. Priority Date: 10/22/2007
• Status: Abandoned Application

• Current Assignee: University College Dublin
• Original Assignee: University College Dublin
• Inventors: Sreenan, Cormac J., Benson, Jonathan, Roedig, Utz
• Application Number:
  US12/739,277
• Publication Number:
  US 20100302933A1
• Time in Patent Office: Days
• US Class Current: 370/217
• CPC Class Codes: H04L 41/0654 using network fault recovery ring fault isolation or reconfiguration in loop networks without recovery actions by a network management system H04L12/437
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/021 Ensuring consistency of routing table updates, e.g. by using epoch numbers
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/32 Flooding denial of service attacks H04L63/1458
• CPC Class Codes: H04W 40/14 based on stability
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update
• CPC Class Codes: H04W 40/26 for hybrid routing by combining proactive and reactive routing
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A wireless network (1) comprises a base station (2) and sensor nodes (3). The base station (2) comprises a network interface (10), an application interface (11), topology control functions (12) a timer (13), and a buffer (14). Each sensor node (3) comprises a network interface (20), route control functions (21), processing functions (22), sensors (23), flood mechanism programs (24), tree mechanism programs (25), and data forwarding programs (26). The network operates by establishing a conventional routing tree from the sink node that is used when the network is stable. But when a sending node detects a node or link failure it dynamically switches to sending its data packets using a flooding mechanism, rather than waiting for the routing tree to be reestablished. This reduces the latency for data delivery. Also, when flooding the data packets, it allows the packets to be flooded to nodes that are an equal number of hops from the sink node as the send node is from the sink node. This approach is suitable in situations where an obstacle causes the path between the sending node and the sink to be blocked, thus requiring a strategy in which packets are routed by less direct means. It increases the probability of delivery.

Claims

1. A wireless network comprising a plurality of nodes having transmitters and receivers and being interconnected by links, the nodes being adapted for sending data so that it is routed through the network, wherein at least some nodes comprise means for:

using either a routing mechanism based on a stored network topology or a flooding mechanism for sending data to a destination node in the network, and

dynamically switching in real time for data delivery from the routing mechanism to the flooding mechanism if a link failure is detected.

2. A wireless network as claimed in claim 1, wherein said nodes comprise means for dynamically employing the flooding mechanism without topology re-build allowing for use of the routing mechanism on the next occasion.

3. A wireless network as claimed in claim 1, wherein the flooding mechanism of at least some nodes directs data laterally to nodes which are an equal number of links from a sink node as the sending node.

4. A wireless network as claimed in claim 1, wherein the flooding mechanism of at least some nodes directs data laterally to nodes which are an equal number of links from a sink node as the sending node, and wherein at least some nodes maintain a count indicating lateral transmissions.

5. A wireless network as claimed in claim 1, wherein a lateral transmission count is included with transmitted data, and a receiving node is adapted to decide to re-transmit if the lateral count does not indicate that there have been an excessive number of lateral transmissions, wherein the lateral count is updated with each transmission, such that the lateral count is updated by decrementing it if a lateral transmission is made.

8. A wireless network as claimed in claim 1, wherein a lateral transmission count is included with transmitted data, and a receiving node is adapted to decide to re-transmit if the lateral count does not indicate that there have been an excessive number of lateral transmissions, wherein the lateral count is updated with each transmission, such that the lateral count is updated by decrementing it if a lateral transmission is made, wherein said receiving node is adapted to decide according to comparison of the lateral count value with a threshold which is common across all of the nodes.

9. A wireless network as claimed in claim 1, wherein a lateral transmission count is included with transmitted data, and a receiving node is adapted to decide to re-transmit if the lateral count does not indicate that there have been an excessive number of lateral transmissions, wherein the lateral count is updated with each transmission, such that the lateral count is updated by decrementing it if a lateral transmission is made, and wherein said receiving node is adapted to decide according to comparison of the lateral count value with a threshold which is per-node, being set according to the number of hops between the node and a destination node.

10. A wireless network as claimed in claim 1, wherein a lateral transmission count is included with transmitted data, and a receiving node is adapted to decide to re-transmit if the lateral count does not indicate that there have been an excessive number of lateral transmissions, wherein the lateral count is updated with each transmission, such that the lateral count is updated by decrementing it if a lateral transmission is made, and wherein said receiving node is adapted to decide according to comparison of the lateral count value with a threshold which is per-node, being set according to the number of hops between the node and a destination node, said receiving node is adapted to determine the threshold according to the number of hops to the destination node for the data.

11. A wireless network as claimed in claim 1, wherein at least some nodes comprise means for maintaining a link-break counter and at least some nodes are adapted to automatically perform topology re-build if the link-break parameter value is exceeded.

12. A wireless network as claimed in claim 1, wherein at least some nodes comprise means for maintaining a link-break counter and at least some nodes are adapted to automatically perform topology re-build if the link-break parameter value is exceeded the link-break parameter is per node and said nodes are adapted to update the counter upon each detection of a link break.

13. A wireless network as claimed in claim 1, wherein at least some nodes comprise means for maintaining a link-break counter and at least some nodes are adapted to automatically perform topology re-build if the link-break parameter value is exceeded, wherein the parameter is time, topology discovery being performed periodically.

14. A wireless network as claimed in claim 1, wherein said nodes maintain a sequence number of a current valid topology.

15. A wireless network as claimed in claim 1, wherein at least some nodes are adapted to detect a link break if an acknowledgement is not received from a node to which it has sent data.

16. A wireless network as claimed in claim 1,

wherein at least some nodes maintain a variable, h, of the distance in links between the node and another node, and for using said parameter for the routing mechanism, wherein the other node is a base station.

18. A wireless network as claimed in claim 1, wherein at least some nodes store an address of a parent node and means for using said address for the routing mechanism.

19. A wireless network as claimed in claim 1, wherein the network comprises a base station node adapted to manage topology maintenance for the nodes, the base station node is adapted to transmit to each node via the network an address of a parent node and a maximum hop distance to the base station node.

21. A wireless network as claimed in claim 1, wherein at least some nodes incorporate sensors and means for sending sensed data, and at least one node is a base station for collecting said data, the network comprises means for changing from a full mode in which there is dynamic switching from a routing mechanism to a flooding mechanism, to a flooding mode in which a flooding mechanism is always employed.

23. A wireless network as claimed in claim 1, wherein the flooding mechanism of a flooding mode is a restricted flooding mechanism in which there is no topology re-building.

24. A wireless network as claimed in claim 1, wherein the network is adapted to change to the flooding mode if an excessive number of link failures is detected.

25. A wireless network as claimed in claim 1, wherein at least one node is adapted to change mode individually on a per-node basis.

6. (canceled)

7. (canceled)

17. (canceled)

20. (canceled)

22. (canceled)