Optimization of polling protocols in sensor networks

• US 9,078,259 B2
• Filed: 08/27/2013
• Issued: 07/07/2015
• Est. Priority Date: 01/29/2010
• Status: Expired due to Fees

• Current Assignee: University of Washington
• Original Assignee: University of Washington
• Inventors: Poovendran, Radha, Nabar, Sidharth, Walling, Jeffrey
• Primary Examiner(s): Qureshi, Afsar M
• Application Number:
  US14/011,706
• Publication Number:
  US 20130343360A1
• Time in Patent Office: 679 Days
• Field of Search: 370252-346
• US Class Current: 1/1
• CPC Class Codes: H04L 67/12 specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
• CPC Class Codes: H04W 4/38 for collecting sensor information
• 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/0446 Resources in time domain, e.g. slots or frames
• CPC Class Codes: H04W 72/56 based on priority criteria
• CPC Class Codes: H04W 84/22 with access to wired networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A communication-management method involves a recurring polling scheme, wherein network nodes are polled by a base station according to optimized and/or user-preferred polling intervals assigned to each network node. The polling interval assigned to a given node may be optimized to minimize and/or achieve user-preferred thresholds for energy consumption and latency associated with each network node in the sensor network. Optimized and/or user-preferred polling intervals may be constrained in accordance with various network performance considerations, for example, a recommended update interval for each network node, characteristics of the network nodes themselves, the duration of the timeslots at which the network nodes are polled, and/or other network performance considerations.

Claims

1. A method comprising:

determining a respective cost contribution of at least one network node in a set of network nodes, wherein the respective cost contribution comprises an energy-consumption metric associated with the at least one network node;

assigning, to the at least one network node, a respective polling interval based at least in part on the respective cost contribution of the at least one network node; and

during a timeslot selected according to the respective polling interval, (a) polling the at least one network node and (b) as a result of the polling, receiving from the at least one network node one or more of network-node data and environment data.

2. The method of claim 1, wherein determining the respective cost contribution comprises determining the cost contribution of the at least one network node based on the energy-consumption metric and a latency metric associated with the at least one network node, wherein the latency metric and the energy-consumption metric are relatively weighted according to an energy-latency factor.

3. The method of claim 1, wherein the network-node data comprises one or more of measurement frequency, measurement size, buffer size, relative rank, remaining buffer space, and remaining energy.

4. The method of claim 1, wherein the environment data comprises one or more of a measurement of an environment condition and an environment indicator function.

5. The method of claim 1, further comprises:

after the assigning, detecting that a same first timeslot has been selected for both a first network node and a second network node, wherein the set of network nodes includes at least the first network node and the second network node;

responsive to detecting that the same first timeslot has been selected, selecting a network node of the first network node and the second network node based on a comparison between a priority metric of the first network node and a priority metric of the second network node; and

polling the selected network node during the particular timeslot.

6. The method of claim 5, wherein the priority metric is one of an environment indicator function, remaining buffer space, remaining energy, or relative rank.

7. The method of claim 5, further comprising:

during a second timeslot after the first timeslot, polling the unselected network node of the first network node and the second network node.

8. The method of claim 1, wherein the at least one network node of the set of network nodes is a cluster-head node, and wherein the receiving comprises receiving one or more of network-node data associated with a network node that is not the cluster-head node and environment data measured by a network node that is not the cluster-head node.

9. The method of claim 1, wherein the at least one network node in the set of network nodes is at least one sensor in a set of sensors.

10. The method of claim 9, wherein the cost contribution of the at least one sensor is based on one or more metrics selected from the group of metrics consisting of:

an energy-consumption metric associated with the at least one sensor and a latency metric associated with the at least one sensor.

11. The method of claim 10, wherein the energy-consumption metric comprises a ratio of (i) a product of a power consumption of a sensor radio of the at least one sensor and a number of overhead bits transmitted by the at least one sensor, and (ii) a product of a data rate of transmission of the at least one sensor and a polling interval of the at least one sensor.

12. The method of claim 10, wherein the latency metric comprises an average latency.

13. The method of claim 10, wherein the assigning, to the at least one sensor in the set of sensors, the respective polling interval based at least in part on the respective cost contribution of the at least one sensor is further based on both (i) the respective cost contribution of the at least one sensor and (ii) a weighted-average summation of (a) an energy-consumption metric associated with each sensor in the set of sensors and (b) a latency metric associated with each sensor in the set of sensors.

14. The method of claim 13, wherein the assigning based on both (i) the respective cost contribution of the at least one sensor and (ii) a weighted-average summation of (a) an energy-consumption metric associated with each sensor in the set of sensors and (b) a latency metric associated with each sensor in the set of sensors is further based on an optimization of a respective polling interval assigned to each sensor, and wherein the respective polling interval assigned to each sensor is assigned so as to not exceed, for each sensor, (i) each of (a) a recommended update interval, (b) a buffer-fill constraint, and (c) an overhead constraint, and (ii) a timeslot-duration constraint.

15. The method of claim 13, wherein the assigning based on both (i) the respective cost contribution of the at least one sensor and (ii) a weighted-average summation of (a) an energy-consumption metric associated with each sensor in the set of sensors and (b) a latency metric associated with each sensor in the set of sensors is further based on a maximum polling interval determined according to at least one of (i) a physician requirement, (ii) a hardware parameter of the at least one sensor, and (ii) an amount of data generated by the at least one sensor.

16. A base station comprising:

a wireless-communication interface;

a processor;

data storage; and

program instructions stored in the data storage and executable by the processor to;

determine a respective cost contribution of at least one network node in a set of network nodes, wherein the respective cost contribution comprises an energy-consumption metric associated with the at least one network node;

assign, to the at least one network node, a respective polling interval based at least in part on a respective cost contribution of the at least one network node; and

during a timeslot selected according to the respective polling interval, (a) poll the at least one network node and (b) as a result of the polling, receive from the at least one network node one or more of network-node data and environment data.

17. The base station of claim 16, wherein the set of network nodes includes at least the first network node and the second network node, and wherein the instructions to assign further comprise instructions to assign a first network node a first polling interval and assign a second network node a second polling interval.

18. The base station of claim 16, wherein the program instructions further comprise instructions to:

after the assigning, detect that a same first timeslot has been selected for both a first network node and a second network node, wherein the set of network nodes includes at least the first network node and the second network node;

responsive to the detecting, select one of the first network node and the second network node based on a comparison between a priority metric of the first network node and a priority metric of the second network node; and

poll the selected network node during the particular timeslot.

19. The base station of claim 18, wherein the program instructions further comprise instructions to:

during a second timeslot after the first timeslot, poll the unselected one of the first network node and the second network node.

20. A physical computer-readable medium having computer executable instructions stored thereon, the instructions comprising:

instructions for determining a respective cost contribution of at least one network node in a set of network nodes, wherein the respective cost contribution comprises an energy-consumption metric associated with the at least one network node;

instructions for assigning, to the at least one network node, a respective polling interval based at least in part on the respective cost contribution of the at least one network node; and

instructions for during a timeslot selected according to the respective polling interval, (a) polling the at least one network node and (b) as a result of the polling, receiving from the at least one network node one or more of network-node data and environment data.