Method of routing path in wireless sensor networks based on clusters

• US 8,432,831 B2
• Filed: 10/30/2007
• Issued: 04/30/2013
• Est. Priority Date: 10/30/2007
• Status: Active Grant

• Current Assignee: Ajou University Industry Cooperation Foundation
• Original Assignee: Ajou University Industry Cooperation Foundation
• Inventors: Jung, Sung Young, Lee, Dong Wook, Cho, We Duck, Kim, Jain Hoon
• Primary Examiner(s): Rutkowski, Jeffrey M
• Application Number:
  US12/739,793
• Publication Number:
  US 20100254302A1
• Time in Patent Office: 2,009 Days
• Field of Search: 370254-258, 370315-327, 709238-244
• US Class Current: 370/254
• CPC Class Codes: H04W 28/06 Optimizing the usage of the radio link, e.g. header compression, information sizing , discarding information system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365
• CPC Class Codes: H04W 40/20 based on geographic position or location
• CPC Class Codes: H04W 40/32 for defining a routing cluster membership
• CPC Class Codes: H04W 52/0219 where the power saving management affects multiple terminals
• CPC Class Codes: H04W 88/04 adapted for relaying to or from another terminal or user
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A routing method for a cluster-based wireless sensor network is provided for improving lifespan of the network and reducing network traffic. A routing method is proposed for a wireless sensor network having a sensor field defined by a plurality of clusters each including a plurality of sensor nodes and a header node, one of the cluster is a head cluster including a sink node. The routing method includes announcing, at least one sensor node which is the sensor node detected an event, the event; requesting, at the sink node, the source node to transmit data required for ubiquitous services; and transmitting, at the at least one source node, data to the sink node. Announcing the event includes relaying, at the at least one source node, a data announcement packet from a source cluster to which the source node belongs to a destination cluster which is arranged along an ith second direction axis through the header nodes of the clusters arranged along a first direction axis of the source cluster. The routing method of the present invention reduces the transmission amounts of data request and data packets, thereby conserving the energy and bandwidth, resulting in improvement of network life time.

Claims

1. A routing method for a wireless sensor network having a sensor field defined by a plurality of clusters each including a plurality of sensor nodes and a header node, one of the cluster is a destination cluster including a sink node, comprising:

announcing, at at least one source node which is the sensor node detecting an event, the event by transmitting a data announcement packet;

requesting, at the sink node, the source node to transmit data required for ubiquitous services; and

transmitting, at the at least one source node, data to the sink node,

wherein announcing the event comprises;

relaying, at the at least one source node, a data announcement packet from a source cluster to which the source node belongs to a destination cluster which is arranged along an i^th second direction axis through the header nodes of the clusters arranged along a first direction axis of the source cluster,

wherein the i^th second direction axis is a center second direction axis in the sensor field, and the first direction axis is a vertical direction axis in the sensor field, wherein the sensor field comprises the clusters defined at cross sections of a plurality of first and second direction axes.

2. The routing method of claim 1, wherein a plurality of source nodes and source and destination clusters exist in the sensor field.

3. The routing method of claim 1, wherein announcing the event comprises:

detecting the event;

generating a data announcement packet as the source node; and

forwarding the data announcement packet to a header node of the destination cluster via header nodes arranged along a routing path to the destination cluster.

4. The routing method of claim 3, wherein forwarding the data announcement packet comprises:

transmitting the data announcement packet to a header node of the source cluster;

caching, at the header node of the source cluster, the data announcement packet;

determining, at the header node of the source cluster, whether to relaying the data announcement packet to the header node of the destination cluster via header nodes of the neighbor clusters arranged on the routing path; and

relaying, if it is determined to forward the data announcement packet, the data announcement packet to the header node of the destination cluster.

5. The routing method of claim 4, wherein relaying the data announcement packet to the header node of the destination cluster comprises:

determining, at the header node of each clusters arranged on the routing path to the destination cluster, whether to forward the data announcement packet to a predetermined cluster; and

forwarding the data announcement packet to the predetermined cluster on the basis of the determination result.

6. The routing method of claim 5, wherein the predetermined cluster is a next hop cluster arranged on the routing path.

7. The routing method of claim 1, wherein requesting the source node to transmit data comprises:

transmitting a first phase data request packet to header nodes of clusters arranged along the i^th second direction axis; and

transmitting, at the header nodes of the clusters arranged along the second direction axis, a second phase data request packet to the source node of the corresponding source cluster.

8. The routing method of claim 7, wherein transmitting a first phase data request packet comprises forwarding the first phase data request packet to header nodes of clusters arranged along j^th second direction axis together with the head cluster which includes at least one immediate agent node corresponding to the sink node, header nodes of the clusters arranged along i^th second direction axis, and header nodes of the clusters arranged along an second direction axis on which the source cluster is positioned between the j^th and i^th horizontal axes.

9. The routing method of claim 8, wherein the immediate agent node is a sensor node located at a nearest position from the sink node.

10. The routing method of claim 8, wherein the first direction axis is a vertical axis and the second direction axis is a horizontal axis.

11. The routing method of claim 7, wherein transmitting a second phase data request packet comprises:

determining, at the header node of each cluster arranged along the second direction axis, whether the cached data announcement packet is valid;

determining, if the cached data announcement packet is valid, whether to forward the second phase data request packet to the source node; and

forwarding, if it is determined to forward the second phase data request packet, the second phase data request packet to the source node.

12. The routing method of claim 11, wherein determining whether the cached data announcement packet is valid is performed on the basis of a data generation time contained in the data announcement packet.

13. The routing method of claim 12, wherein determining whether to forward the second phase data request packet to the source node is performed on the basis of relative locations of the source node and sink node.

14. The routing method of claim 13, wherein determining whether to forward the second phase data request packet to the source node comprises:

dividing the sensor field into a first and second half areas; and

determining, if the source and sink nodes are located in the same half area, to forward second phase data request packet to the source node.

15. The routing method of claim 14, wherein the sensor field is divided into the first and second by a second direction axis.

16. The routing method of claim 11, wherein forwarding the second phase data request packet comprises transmitting the second phase data request packet in an inverse direction of the routing path of the data announcement packet.

17. The routing method of claim 8, wherein transmitting a first phase data request packet comprises:

detecting a movement of the sink node after transmitting the first phase data request packet; and

forwarding, if a movement of the sink node is detected, the first phase data request packet from an old immediate agent node to a new immediate agent node.

18. The routing method of claim 1, wherein the method is used in community computing.