Method for establishing data transmission path and sensor network employing the same

• US 8,125,978 B2
• Filed: 05/30/2006
• Issued: 02/28/2012
• Est. Priority Date: 08/19/2005
• Status: Expired due to Fees

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Lim, Hun, Kim, You-sun, Park, Chun-su, Ko, Sung-jea
• Primary Examiner(s): Sheikh, Ayaz
• Assistant Examiner(s): HALIYUR, VENKATESH N
• Application Number:
  US11/442,387
• Publication Number:
  US 20070042711A1
• Time in Patent Office: 2,100 Days
• Field of Search: 370228-463, 455/403, 455/455, 455/456.1, 455/456.3
• US Class Current: 370/351
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04W 40/246 Connectivity information discovery
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A sensor network system and method for establishing a data transmission path are is disclosed. The method for establishing a data transmission path of a sink node and the network system which includes a plurality of nodes including the sink node, includes a) requesting nodes on a previously established data transmission path to give their adjacent node information, b) receiving the adjacent node information, c) retrieving adjacent nodes as the sink node moves, and d) reestablishing the data transmission path through the result of retrieval and the adjacent node information. Since the data transmission path is reestablished without flooding, it is possible to reduce energy of the nodes. Also, the method for establishing a data transmission path can be applied to any routing protocols without additional conditions.

Claims

1. A method for establishing a data transmission path of a sink node applied to a network system that includes a plurality of nodes including the sink node, the method comprising:

a) requesting nodes on a previously established data transmission path to give their adjacent node information;

b) receiving the adjacent node information;

c) retrieving information regarding adjacent nodes as the sink node moves; and

d) reestablishing the data transmission path through a result of the retrieval result and the adjacent node information, wherein

the step c) includes c1) broadcasting a predetermined message to the adjacent nodes, and c2) receiving information including node IDs from the adjacent nodes; and

the step d) includes d1) selecting a first node from among the adjacent nodes on the data transmission path according to a priority order, wherein the priority order is set according to a number of hops of the reestablished data transmission path.

2. The method as claimed in claim 1, wherein the nodes on the data transmission path at the step a) are first and second nodes from the sink node.

3. The method as claimed in claim 1, further comprising storing the requested adjacent node information.

4. The method as claimed in claim 1, wherein a node having a first priority is an adjacent node closest to the sink node on the previously established data transmission path among the adjacent nodes.

5. The method as claimed in claim 4, wherein a node having a second priority is an adjacent node corresponding to a second node from the sink node among the adjacent nodes.

6. The method as claimed in claim 5, wherein a node having a third priority is an adjacent node corresponding to the first node from the sink node among the adjacent nodes.

7. The method as claimed in claim 4, wherein a predetermined weight value is accumulated depending on the priority order, and the data transmission path is wholly reestablished if the accumulated weight value exceeds a predetermined threshold value.

8. The method as claimed in claim 7, wherein the accumulated predetermined weight value is initiated if the data transmission path is wholly reestablished.

9. The method as claimed in claim 1, further comprising receiving the adjacent node information of the nodes on the reestablished data transmission path.

10. The method as claimed in claim 1, wherein the adjacent nodes are those within a distance of one hop from the nodes.

11. A network system, comprising:

a plurality of nodes in which one of the nodes is a sink node and a data transmission path is established to the sink node;

wherein,

the sink node requests nodes on the established data transmission path to give their adjacent node information, the sink node receives the adjacent node information, the sink node retrieves information regarding adjacent nodes as the sink node moves, and the data transmission path is reestablished through a result of the retrieval result and the adjacent node information;

the sink node retrieves the information regarding the adjacent nodes by broadcasting a predetermined message to the adjacent nodes and receiving information including node IDs from the adjacent nodes; and

the data transmission path is reestablished by selecting a first node from among the adjacent nodes on the data transmission path according to a priority order, wherein the priority order is set according to a number of hops of the reestablished data transmission path.

12. The network system of claim 11, further comprising:

a memory in which the requested adjacent node information is stored.