Soft state framework for mobile WSN routing

• US 8,855,050 B2
• Filed: 09/01/2011
• Issued: 10/07/2014
• Est. Priority Date: 09/02/2010
• Status: Active Grant

• Current Assignee: Hedera Terra Technology
• Original Assignee: Hedera Terra Technology
• Inventors: Chen, Weixiang
• Primary Examiner(s): Shah, Chirag
• Assistant Examiner(s): REDDIVALAM, SRINIVASA R
• Application Number:
  US13/223,936
• Publication Number:
  US 20120057526A1
• Time in Patent Office: 1,132 Days
• Field of Search: None
• US Class Current: 370/328
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A soft state framework to support routing functionality in a mobile wireless sensor network is provided. This invention allows each node of the wireless sensor network to move in random directions in a three dimensional space. The invention seeks to minimize resource consumption while optimizing routing functionality in a mobile condition.

Claims

1. A routing protocol method for a wireless sensor network utilizing a network node comprising the steps of:

identifying, by the network node, a plurality of network elements;

organizing, by the network node, the plurality of network elements into a first community and a second community depending on attributes and refreshing time interval of each of the plurality of network elements between the first community and a second community;

organizing, by the network node, the plurality of network elements of the first community into a first group and a second group depending on a changing condition of the plurality of network elements, specific needs of the plurality of network elements and an evenness of distribution of the plurality of network elements between the first group and the second group;

refreshing periodically and dynamically the plurality of network elements belonging to the first community and the second community;

timing the refreshing of the plurality of network elements using only one timer, the only one timer refreshing different groups of the first and second communities at different times the only one timer timing the refreshing of the first community by using a step count having a plurality of steps, each step corresponding to one group of the first community, the step count refreshing the corresponding group once each step is reached, and increasing incrementally after each refreshing based on the timer, the step count recycling to an initial step after a final step corresponding to a final group of the first community, the only one timer timing the refreshing of the second community by using a second step count having a plurality of steps, each step corresponding to one group of the second community, the step count refreshing the corresponding group once each step is reached, and increasing incrementally after each refreshing based on the timer, the step count recycling to an initial step after a final step corresponding to a final group of the second community;

sending a first plurality of refreshing packets containing routing information that reflects the content of the refreshed first group of the first community via a virtual socket to a second network node; and

sending a second plurality of refreshing packets containing routing information that reflects the content of the refreshed second group of the first community via a virtual socket to a second network node at a different time from the sending of the first plurality of refreshing packets.

2. The routing protocol method for a wireless sensor network utilizing a network node of claim 1 wherein the plurality of network elements are a plurality of different network routes.

3. The routing protocol method for a wireless sensor network utilizing a network node of claim 1 further comprising the steps of:

changing a physical location of the network node; and

re-organizing the plurality of network elements into the first community, the second community, the first group or the second group based at least partially on the change in physical location of the network node.

4. The routing protocol method for a wireless sensor network utilizing a network node of claim 1 comprising the step sending a substantially consistent number of the plurality of refreshing packets reflecting the content of the refreshed community at each of the plurality of different time intervals.

5. The routing protocol method for a wireless sensor network utilizing a network node of claim 1 further comprising the step of optimizing electrical efficiency by sending the refreshing packet relating to each of the plurality of network elements in the first community.

6. The routing protocol method for a wireless sensor network utilizing a network node of claim 1 wherein the step of sending a refreshing packet is performed wirelessly.

7. The routing protocol method for a wireless sensor network utilizing a network node of claim 1 wherein the step of sending via the virtual socket comprises sending of the refreshing packet via either a beacon channel or a socket channel.

8. The routing protocol method for a wireless sensor network utilizing a network node of claim 1:

wherein the step of refreshing a network element maintains a soft state framework; and

wherein failing to refresh the network element removes the soft state framework.

9. The routing protocol method for a wireless sensor network utilizing a network node of claim 1 further comprising the step of organizing, by the network node, the plurality of network elements of the first group into a first sub-group and a second sub-group depending at least partially on the maximum transition unit value of the network node.

10. The routing protocol method for a wireless sensor network utilizing a network node of claim 1 further comprising the step of refreshing periodically and dynamically the plurality of network elements belonging to the first group and the second group depending on the changing conditions of the plurality of network elements, specific needs of the plurality of network elements and the evenness of distribution of the plurality of network elements between the first group and the second group.

11. The routing protocol method for a wireless sensor network utilizing a network node of claim 10 further comprising the step of sending a refreshing packet reflecting the content of the refreshed first group via the virtual socket to the second network node.

12. The routing protocol method for a wireless sensor network utilizing a network node of claim 9 further comprising the step of refreshing periodically and dynamically the plurality of network elements belonging to the first sub-group and the second sub-group depending at least partially on the maximum transition unit value of the network node.

13. The routing protocol method for a wireless sensor network utilizing a network node of claim 12 further comprising the step of sending a refreshing packet reflecting the content of the refreshed first sub-group via the virtual socket to the second network node.

14. The routing protocol method for a wireless sensor network utilizing a network node of claim 1 wherein the routing protocol method is employed by a plurality of network nodes comprising a sink node, and a router node further comprising the step of moving physically the plurality of network nodes.

15. A routing protocol method for a wireless sensor network utilizing a plurality of network nodes comprising a sink node and a router node, comprising the steps of:

moving each of the plurality of network nodes randomly in a three dimensional space;

communicating wirelessly between each of the network nodes;

utilizing each of the plurality of network nodes to perform steps comprising;

identifying a plurality of network elements;

organizing the plurality of network elements into a first community and a second community depending on attributes and refreshing time interval of the plurality of network elements between the first community and the second community;

organizing the plurality of network elements of the first community into a first group and a second group depending on a changing condition of the plurality of network elements, specific needs of the plurality of network elements and the evenness of distribution of the plurality of network elements between the first group and the second group;

refreshing periodically and dynamically the plurality of network elements belonging to the first community and the second community;

timing the refreshing of the plurality of network elements using only one timer, the only one timer refreshing different groups of the first and second communities at different times the only one timer timing the refreshing of the first community by using a step count having a plurality of steps, each step corresponding to one group of the first community, the step count refreshing the corresponding group once each step is reached, and increasing incrementally after each refreshing based on the timer, the step count recycling to an initial step after a final step corresponding to a final group of the first community, the only one timer timing the refreshing of the second community by using a second step count having a plurality of steps, each step corresponding to one group of the second community, the step count refreshing the corresponding group once each step is reached, and increasing incrementally after each refreshing based on the timer, the step count recycling to an initial step after a final step corresponding to a final group of the second community; and

sending a refreshing packet reflecting the content of each refreshed community via a virtual socket to another one of the plurality of network nodes.

16. The routing protocol method for a wireless sensor network utilizing a plurality of network nodes of claim 15 further comprising the step of evenly spreading the distribution of the refreshing of the first and second communities over time;

and avoiding flooding, jitter and packet loss of a contents of the routing packet.

17. The routing protocol method for a wireless sensor network utilizing a plurality of network nodes of claim 16 wherein the plurality of network elements are a plurality of routes.

18. The routing protocol method for a wireless sensor network utilizing a plurality of network nodes of claim 17 wherein the plurality of network nodes further perform the steps of:

refreshing periodically and dynamically the plurality of network elements belonging to the first group and the second group depending on the changing conditions of the plurality of network elements, specific needs of the plurality of network elements and the evenness of distribution of the plurality of network elements between the first group and a second group;

sending a refreshing packet reflecting the content of the refreshed first group via the virtual socket to another one of the plurality of network nodes;

refreshing periodically and dynamically the plurality of network elements belonging to the first sub-group and the second sub-group depending at least partially on the maximum transition unit value of the network node;

sending a refreshing packet reflecting the content of the refreshed first sub-group via the virtual socket to another one of the plurality of network nodes.

19. A routing protocol method for a wireless sensor network utilizing a plurality of network nodes comprising the steps of:

moving each of the plurality of network nodes randomly in a three dimensional space;

communicating wirelessly between each of the network nodes;

utilizing each of the plurality of network nodes to perform steps comprising;

identifying a plurality of network elements;

organizing, by the network node, the plurality of network elements into a first community and a second community depending on the attributes and refreshing time interval of the plurality of network elements between the first community and a second community;

organizing the plurality of network elements of the first community into a first group and a second group depending on a changing condition of the plurality of network elements, specific needs of the plurality of network elements and the evenness of distribution of the plurality of network elements between the first group and the second group;

refreshing periodically and dynamically the plurality of network elements belonging to the first community and the second community;

timing the refreshing of the plurality of network elements using only one timer, the only one timer refreshing different communities at different times;

sending a routing packet reflecting the content of each refreshed community via a virtual socket to another one of the plurality of network nodes;

refreshing periodically and dynamically the plurality of network elements belonging to the first group and the second group depending on the changing conditions of the plurality of network elements, specific needs of the plurality of network elements and the evenness of distribution of the plurality of network elements between the first group and a second group;

sending a routing packet reflecting the content of the refreshed first group via the virtual socket to another one of the plurality of network nodes;

refreshing periodically and dynamically the plurality of network elements belonging to the first sub-group and the second sub-group depending at least partially on the maximum transition unit value of the network node;

sending a routing packet reflecting the content of the refreshed first sub-group via the virtual socket to another one of the plurality of network nodes;

wherein the step of refreshing a network element maintains a soft state framework;

wherein failing to refresh the network element removes the soft state framework;

wherein the step of sending via the virtual socket comprises sending of a routing packet via both a beacon channel and a socket channel;

changing the physical location of one of the plurality of network nodes; and

wherein upon changing the physical location, each of the plurality of network nodes performs the steps of;

re-organizing the plurality of network elements of the first and second community based at least partially on the change in physical location of the one of the plurality of network nodes;

refreshing periodically and dynamically the plurality of network elements belonging to the first community and the second community;

timing the refreshing of the plurality of network elements using only one timer, the only one timer refreshing different communities at different times; and

sending a routing packet reflecting the content of the refreshed and re-organized community via a virtual socket to another of the plurality of network nodes.