Real-time wireless sensor network protocol having linear configuration

• US 7,885,251 B2
• Filed: 12/27/2005
• Issued: 02/08/2011
• Est. Priority Date: 12/21/2005
• Status: Active Grant

• Current Assignee: Korea Electronics Technology Institute (Government of South Korea)
• Original Assignee: Korea Electronics Technology Institute (Government of South Korea)
• Inventors: Kim, Seong-Dong, Kim, Jae-Ho, Ahn, Il-Yeup, Lee, Sang-Shin, Won, Kwang-Ho
• Primary Examiner(s): Harper; Kevin C
• Assistant Examiner(s): ANDREWS, LEON T
• Application Number:
  US11/316,712
• Publication Number:
  US 20070140303A1
• Time in Patent Office: 1,869 Days
• Field of Search: 370/319, 370/321, 370/328, 370/337, 370/338, 370/347, 370/349, 370/350, 370/442, 370/503, 370/329, 455/13.2, 455/435.1, 455/459, 455/502, 455/433, 709/203, 709/251, 710/6
• US Class Current: 370/350
• CPC Class Codes: B61L 27/53 for trackside elements or systems, e.g. trackside supervision of trackside control system conditions
• CPC Class Codes: H04J 3/0652 Synchronisation among time division multiple access [TDMA] nodes, e.g. time triggered protocol [TTP] bus network with centralized control in which slots are of a TDMA packet structure H04L12/4035
• CPC Class Codes: H04J 3/0655 using timestamps
• CPC Class Codes: H04W 56/00 Synchronisation arrangements
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A network configuration method of a sensor network configured to collect sensed data from a plurality of sensor nodes comprising: arranging linearly a path of respective node so as to enable all sensor nodes except for a sink node and a terminal node to have respectively a predecessor and a successor; and setting the time synchronization of whole network by fixing the each node take its own time synchronization on the basis of an operation section of the predecessor.

Claims

1. A method comprising:

forming a linear sensor network by arranging a sink sensor node, a plurality of sensor nodes, and a terminal sensor node serially along a path, wherein each sensor node has a single predecessor sensor node and a single successor sensor node along the path, the sink sensor node being at the beginning of the linear sensor network, the terminal sensor node being at the end of the linear sensor network, and the plurality of sensor nodes being between the sink sensor node and the terminal sensor node;

synchronizing an operational interval of respective sensor nodes based on operational intervals of corresponding single predecessor sensor nodes starting with a first sensor node beyond the sink sensor node, each operational interval having reception, transmission, and acknowledgment intervals in that order, such that a transmit interval of a sensor node corresponds to a reception interval of a single predecessor sensor node and an acknowledgement interval of a single successor sensor node, and such that the operational interval of a successor sensor node starts before the operation interval of a predecessor sensor node and ends before the operational interval of the predecessor sensor node ends in order to provide time staggered operational intervals from the terminal sensor node to the sink sensor node, wherein the first sensor node beyond the sink sensor node synchronizes with the sink sensor node and successive sensor nodes synchronize thereafter;

receiving at an arbitrary sensor node in the linear sensor network data transmitted from a corresponding single successor sensor node during a reception interval of the arbitrary sensor node;

confirming at the arbitrary sensor node whether the received data are normal; and

transmitting the data from the arbitrary sensor node to a corresponding single predecessor sensor node during a transmission interval of the arbitrary sensor node, when the data are confirmed to be normal.

2. The method of claim 1, wherein transmitting further comprises:

generating a transmission packet including the data received from the corresponding single successor sensor node and/or data detected by the arbitrary sensor node;

inserting an acknowledgement (ACK) signal into the transmission packet, wherein the ACK signal indicates that the data was received from the corresponding single successor sensor node; and

transmitting the transmission packet to the corresponding single predecessor sensor node and the corresponding single successor sensor node simultaneously.

3. The method of claim 2, further comprising:

retransmitting the transmission packet by the arbitrary sensor node in a next transmission interval when the transmission packet is not received by the corresponding single predecessor sensor node; and

deleting data transmitted in the transmission packet buffered by the arbitrary sensor node when said transmission packet is received by the corresponding single predecessor sensor node.

4. The method of claim 2, wherein the transmission packet includes data grouped into sub-payloads, each sub-payload comprising an identifier of a node which detected the data in the sub-payload, a data type identifier which represents a data type of the data in the sub-payload, and the detected data.

9. A sensor node configured to perform a method as described in one of claim 1 or claim 8 comprising:

a high priority buffer configured to temporarily store emergency data; and

a low priority buffer configured to temporarily store general data;

wherein when a transmission packet is generated, the emergency data temporarily stored in the high priority buffer are included firstly in the transmission packet, and when space remains in a data field of the transmission packet, the general data temporarily stored in the low priority buffer are included in the transmission packet.

14. The method of claim 9, wherein synchronizing comprises synchronizing each sensor node in the linear sensor network based on a captured timestamp received from its single predecessor sensor node.

15. The method of claim 14, wherein the captured time stamp is received during an acknowledgement interval of a respective sensor node during a transmission interval of the respective sensor node'"'"'s single predecessor sensor node.

16. The method of claim 14, wherein the captured time stamp is captured from a Start of Frame Delimiter field in a received packet.

5. A method comprising:

forming a linear sensor network by arranging a sink sensor node, a plurality of sensor nodes, and a terminal sensor node serially along a path, wherein each non-endpoint node has a single predecessor sensor node and a single successor sensor node along the path, the sink sensor node being at the beginning of the linear sensor network, the terminal sensor node being at the end of the linear sensor network, and the plurality of sensor nodes being between the sink sensor node and the terminal sensor node;

broadcasting periodically a hello message from the terminal sensor node;

calculating at each of one or more new sensor nodes which are configured to join the linear sensor network a link quality indication (LQI) from a received hello message;

determining which of the one or more new sensor nodes has the highest LQI;

transmitting a preemption message from the new sensor node having the highest determined LQI to delay remaining new sensors from joining the linear sensor network;

transmitting a join message from the new sensor node to the terminal sensor node during a next wakeup interval; and

advertising that the new sensor node has become a new terminal sensor node, when the new sensor node receives an acknowledgement message corresponding to the join message.

6. The method of claim 5, further comprising:

determining which of the one or more new sensor nodes has the second highest LQI; and

transmitting a preemption message from the new sensor node having the second highest LQI during a subsequent transmission interval to delay remaining new sensor nodes from joining the linear sensor network.

7. A method comprising:

forming a linear sensor network by arranging a plurality of sensor nodes serially along a path, wherein each non-endpoint sensor node has a single predecessor sensor node and a single successor sensor node;

setting by each sensor node its own network identifier (ID) configured to indicate an order of the plurality sensor nodes along the path, wherein each sensor node sets its network ID to a value that is higher than a network ID of a single predecessor sensor node such that sensor nodes with lower network IDs are closer to a sink sensor node;

initiating a process for rearranging the linear sensor network when the arbitrary sensor node does not receive an acknowledgement to a message previously transmitted to a corresponding single predecessor sensor node by transmitting a join message from the arbitrary sensor node to a sensor node having lower network ID and a smallest difference in network IDs; and

completing the process for rearranging the linear sensor network by setting the sensor node having the lower network ID and the smallest difference in network IDs to the single predecessor sensor node of the arbitrary sensor node, when the arbitrary sensor node receives a response message corresponding to the join message.

8. A method comprising:

forming a linear sensor network by physically arranging a sink sensor node, a plurality of sensor nodes, and a terminal sensor node serially along a path, wherein each of the plurality of sensor nodes has a single predecessor sensor node and a single successor sensor node along the path, the sink sensor node has a single successor sensor node, the terminal sensor node has a single predecessor sensor node, and the plurality of sensor nodes being between the sink sensor node and the terminal sensor node; and

synchronizing linear sensor network time with the sink sensor node, wherein each sensor node in the linear sensor network synchronizes its operational interval with an operational interval of its single predecessor sensor node.

10. The method of claim 8, wherein synchronizing further comprises synchronizing an operational interval of respective sensor nodes based on operational intervals of corresponding single predecessor sensor nodes starting with a first sensor node beyond the sink sensor node, each operational interval having, reception, transmission, and acknowledgment intervals, such that a transmit interval of a sensor node corresponds to a reception interval of a single predecessor sensor node and an acknowledgement interval of a single successor sensor node, and such that the operational interval of a successor sensor node starts before the operation interval of a predecessor sensor node and ends before the operational interval of the predecessor sensor node ends in order to provide time staggered operational intervals from the terminal sensor node to the sink sensor node, wherein the first sensor node beyond the sink sensor node synchronizes with the sink sensor node and successive sensor nodes synchronize thereafter.

11. The method of claim 10, wherein transmission and reception intervals are allocated according to distributed time division multiple access (DTDMA), wherein each sensor node allocates its TDMA time slot based on a predecessor sensor node'"'"'s time slot.

12. The method of claim 8, wherein the path comprises a virtual sensor line, and the plurality of sensor nodes are arranged in the virtual sensor line according to a ranking of a unique identifier assigned to each sensor node, and wherein each sensor node can assign its own unique identifier.

13. The method of claim 8, wherein the path comprises a virtual sensor line, and the plurality of sensor nodes are arranged in the virtual sensor line according to a link quality indicator (LQI), and wherein two neighboring sensor nodes with the highest LQIs are selected as single predecessor and single successor sensor nodes respectively.