Trail-Based Data Gathering Mechanism for Wireless Sensor Networks with Mobile Sinks

• US 20120093087A1
• Filed: 06/29/2009
• Published: 04/19/2012
• Est. Priority Date: 06/29/2009
• Status: Abandoned Application

• Current Assignee: Nokia Technologies Oy (Nokia Corporation)
• Original Assignee: Nokia Corporation
• Inventors: Chen, Canfeng, Ma, Jian, Zhang, Baoxian
• Application Number:
  US13/378,321
• Publication Number:
  US 20120093087A1
• Time in Patent Office: Days
• US Class Current: 370/328
• CPC Class Codes: H04L 45/025 Updating only a limited number of routers, e.g. fish-eye update
• CPC Class Codes: H04L 45/026 Details of "hello" or keep-alive messages
• CPC Class Codes: H04L 45/54 Organization of routing tables
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update

Abstract

A method, apparatus, and computer program product are provided for routing data packets through a wireless sensor network to a mobile sink in a relatively quick and efficient manner while utilizing low protocol overhead. Additionally, a method, apparatus, and computer program product are provided such that a sensor node within a wireless sensor network maintains sink information and routing information to facilitate efficient delivery of a data packet to a mobile sink within a wireless sensor network.

Claims

1. A method comprising:

determining whether next-hop information is available regarding a mobile sink to which a prior message intended for receipt by a mobile sink was directed;

providing for transmission of a current message based upon the next-hop information in instances in which the next-hop information is available;

determining whether timestamp information is available regarding prior receipt of a beacon message from a mobile sink; and

providing for transmission of the current message based on the timestamp information in instances in which the timestamp information is available.

2. A method according to claim 1, further comprising:

determining whether neighboring network nodes have timestamp information available regarding prior receipt of a beacon message from a mobile sink; and

providing for transmission of the current message based on the most recent timestamp information where more than one network node possesses timestamp information.

3. A method according to claim 1 or 2, further comprising receiving a beacon message from a mobile sink wherein the beacon message includes timestamp information and mobile sink identification information.

4. A method according to claim 3, further comprising generating a table to include the timestamp information and mobile sink identification information contained in the beacon message.

5. A method according to claim 4, further comprising receiving a signal from a neighboring sensor node and replacing the information contained in the table with the information contained in the signal from the neighboring sensor node in instances in which the timestamp information from the neighboring sensor node is more recent than the timestamp information contained within the table.

6. A method according to claim 4, further comprising initiating a timer upon receipt of the beacon message wherein the timestamp information and mobile sink identification information are removed from the table upon expiration of the timer.

7. A method according to claim 1 or 2, further comprising initiating a random walk in instances in which no timestamp information is available.

8. An apparatus comprising:

at least one processor; and

at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform;

determine whether next-hop information is available regarding a mobile sink to which a prior message intended for receipt by a mobile sink was directed;

provide for transmission of a current message based upon the next-hop information in instances in which the next-hop information is available;

determine whether timestamp information is available regarding prior receipt of a beacon message from a mobile sink; and

provide for transmission of the current message based on the timestamp information in instances in which the timestamp information is available.

9. An apparatus according to claim 8, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to:

determine whether neighboring network nodes have timestamp information available regarding prior receipt of a beacon message from a mobile sink; and

provide for transmission of the current message based on the most recent timestamp information where more than one network node possesses timestamp information.

10. An apparatus according to claim 8 or 9, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to receive a beacon message from a mobile sink wherein the beacon message includes timestamp information and mobile sink identification information.

11. An apparatus according to claim 10, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to generate a table to include the timestamp information and mobile sink identification information contained in the beacon message.

12. An apparatus according to claim 11, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to receive a signal from a neighboring sensor node and replacing the information contained in the table with the information contained in the signal from the neighboring sensor node in instances in which the timestamp information from the neighboring sensor node is more recent than the timestamp information contained within the table.

13. An apparatus according to claim 11, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to initiate a timer upon receipt of the beacon message wherein the timestamp information and mobile sink identification information are removed from the table upon expiration of the timer.

14. An apparatus according to claim 8 or 9, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to initiate a random walk in instances in which no timestamp information is available.

15. A computer program product comprising at least one computer-readable storage medium having computer-readable program instructions stored therein, the computer-readable program instructions configured to cause an apparatus at least to perform:

determine whether next-hop information is available regarding a mobile sink to which a prior message intended for receipt by a mobile sink was directed;

provide for transmission of a current message based upon the next-hop information in instances in which the next-hop information is available;

determine whether timestamp information is available regarding prior receipt of a beacon message from a mobile sink; and

provide for transmission of the current message based on the timestamp information in instances in which the timestamp information is available.

16. A computer program product according to claim 15, wherein the computer-readable program instructions are further configured to cause the apparatus to:

determine whether neighboring network nodes have timestamp information available regarding prior receipt of a beacon message from a mobile sink; and

provide for transmission of the current message based on the most recent timestamp information where more than one network node possesses timestamp information.

17. A computer program product according to claim 15 or 16, wherein the computer-readable program instructions are further configured to cause the apparatus to receive a beacon message from a mobile sink wherein the beacon message includes timestamp information and mobile sink identification information.

18. A computer program product according to claim 17, wherein the computer-readable program instructions are further configured to cause the apparatus to generate a table to include the timestamp information and mobile sink identification information contained in the beacon message.

19. A computer program product according to claim 18, wherein the computer-readable program instructions are further configured to cause the apparatus to receive a signal from a neighboring sensor node and replacing the information contained in the table with the information contained in the signal from the neighboring sensor node in instances in which the timestamp information from the neighboring sensor node is more recent than the timestamp information contained within the table.

20. A computer program product according to claim 18, wherein the computer-readable program instructions are further configured to cause the apparatus to initiate a timer upon receipt of the beacon message wherein the timestamp information and mobile sink identification information are removed from the table upon expiration of the timer.

21. A computer program product according to claim 15 or 16, wherein the computer-readable program instructions are further configured to cause the apparatus to initiate a random walk in instances in which no timestamp information is available.