Node device and method of allocating resources in wireless sensor networks

• US 10,028,276 B2
• Filed: 10/25/2016
• Issued: 07/17/2018
• Est. Priority Date: 02/25/2016
• Status: Expired due to Fees

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: Jeong, Wun Cheol, Lee, Joon Hee
• Primary Examiner(s): Huynh, Dung B
• Application Number:
  US15/333,456
• Publication Number:
  US 20170251471A1
• Time in Patent Office: 630 Days
• CPC Class Codes: H04W 52/0216 using a pre-established activity schedule, e.g. traffic indication frame
• CPC Class Codes: H04W 52/0219 where the power saving management affects multiple terminals
• CPC Class Codes: H04W 72/54 based on quality criteria
• 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 method of allocating resources in a multi-hop wireless sensor network includes (A) when two arbitrary adjacent links among links connecting all nodes have a violation relationship where the two arbitrary adjacent links occupy the same time slot, by a network coordinator node, allocating different time slots to the two arbitrary adjacent links according to a resource allocation request command message from each of nodes configuring the multi-hop wireless sensor network, (B) when two arbitrary links which are not adjacent to each other among the links are within a communication distance, by the network coordinator node, allocating different frequency channels to the two arbitrary links, and (C) when resource allocation for all of the links is completed according to steps (A) and (B), checking whether an end-to-end maximum allowable time required by each of paths established by the links is satisfied.

Claims

1. A method of allocating resources in a multi-hop wireless sensor network, the method comprising:

(A) when two arbitrary adjacent links among links connecting all nodes have a violation relationship where the two arbitrary adjacent links occupy the same time slot, by a network coordinator node, allocating different time slots to the two arbitrary adjacent links according to a resource allocation request command message from each of nodes configuring the multi-hop wireless sensor network;

(B) when two arbitrary links which are not adjacent to each other among the links are within a communication distance, by the network coordinator node, allocating different frequency channels to the two arbitrary links; and

(C) when resource allocation for all of the links is completed according to steps (A) and (B), checking whether an end-to-end maximum allowable time required by each of paths established by the links is satisfied,

wherein resources are allocated to each of the links according to a resource allocation schedule including steps (A) to (C).

2. The method of claim 1, wherein the resource allocation schedule is performed in descending power of rank values which are respectively set to the links.

3. The method of claim 1, wherein the resource allocation schedule is performed in ascending power of rank values which are respectively set to the links.

4. The method of claim 1, wherein the resource allocation schedule is performed in ascending power of rank values respectively set to the links, and then, is again performed in descending power of the rank values respectively set to the links, based on a link-based result of resource allocation which has been performed in ascending power of the rank values.

5. The method of claim 1, wherein the communication distance is a two-hop distance.

6. The method of claim 1, wherein the resource allocation request command message is collected from all of the nodes configuring the multi-hop wireless sensor network, and then, the resource allocation schedule is performed.

7. The method of claim 1, further comprising:

transmitting a resource allocation response command message to the nodes in response to the resource allocation request command message, the resource allocation response command message including resource allocation schedule information generated based on the resource allocation schedule; and

receiving a resource allocation notification command message, notifying completion of resource allocation, from the nodes which have received the resource allocation response command message.

8. The method of claim 7, wherein the resource allocation response command message comprises a plurality of fields in which resource allocation schedule information about nodes included in a communication path is recorded.

9. The method of claim 8, wherein the plurality of fields each comprise a field, in which time slot information generated through scheduling in step (A) is recorded, and a field in which frequency channel information generated through scheduling in step (B) is recorded.

10. The method of claim 9, wherein the field in which the time slot information is recorded comprises a field, in which SuperFrame ID is recorded, and a field in which Slot ID is recorded.

11. A node device for allocating resources to each of links connecting child nodes according to a resource allocation request command message from each of the child nodes configuring a multi-hop wireless sensor network, the node device comprising:

a system bus;

a memory configured to store a resource allocation algorithm for allocating the resources to each of the links; and

a processor configured to execute the resource allocation algorithm, stored in the memory, through the system bus,

wherein

when two arbitrary adjacent links among the links connecting the child nodes have a violation relationship where the two arbitrary adjacent links occupy the same time slot, the processor allocates different time slots to the two arbitrary adjacent links according to the resource allocation request command message,

when two arbitrary links which are not adjacent to each other among the links are within a communication distance, the processor allocates different frequency channels to the two arbitrary links, and

when resource allocation for all of the links is completed, the processor allocates the resources to each of the links according to a resource allocation schedule which checks whether an end-to-end maximum allowable time required by each of paths established by the links is satisfied.

12. The node device of claim 11, wherein the processor allocates the resources to each of the links according to the resource allocation schedule which is performed in descending power of rank values respectively set to the links.

13. The node device of claim 11, wherein the processor allocates the resources to each of the links according to the resource allocation schedule which is performed in ascending power of rank values respectively set to the links.

14. The node device of claim 11, wherein the processor performs the resource allocation schedule in ascending power of rank values respectively set to the links, and then, again performs the resource allocation schedule in descending power of the rank values respectively set to the links, based on a link-based result of resource allocation which has been performed in ascending power of the rank values.

15. The node device of claim 11, wherein the processor allocates the resources to each of the links according to the resource allocation schedule which is performed after the resource allocation request command message is collected from all of the child nodes.