Optimization of polling protocols in sensor networks
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04L-012/26
H04W-004/00
H04J-003/16
출원번호
US-0014543
(2011-01-26)
등록번호
US-8565109
(2013-10-22)
발명자
/ 주소
Poovendran, Radha
Nabar, Sidharth
Walling, Jeffrey
출원인 / 주소
University of Washington through its Center of Commercialization
대리인 / 주소
McDonnell Boehnen Hulbert & Berghoff LLP
인용정보
피인용 횟수 :
11인용 특허 :
6
초록▼
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 ac
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 timselots at which the network nodes are polled, and/or other network performance considerations.
대표청구항▼
1. A method comprising: assigning, to at least one network node in a set of network nodes, a respective polling interval based at least in part on a respective cost contribution of the at least one network node;during a timeslot selected according to the respective polling interval, (a) polling the
1. A method comprising: assigning, to at least one network node in a set of network nodes, a respective polling interval based at least in part on a respective cost contribution of the at least one network node;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 wherein the assigning further comprises assigning a first network node a first polling interval and assigning a second network node a second polling interval;after the assigning, detecting that a same first time slot has been selected for both the first network node and the second network node;responsive to the detecting, selecting 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; andpolling the selected network node during the particular time slot. 2. The method of claim 1, further comprising: prior to the assigning, determining the cost contribution of the at least one network node based on one or more of an energy-consumption metric associated with the at least one network node and a latency metric associated with the at least one network node. 3. The method of claim 1, further comprising: prior to the assigning, determining the cost contribution of the at least one network node based on an energy-consumption metric associated with the at least one network node and a latency metric associated with the at least one network node, wherein the latency metric and the respective energy-consumption metric are relatively weighted according to an energy-latency factor. 4. 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. 5. 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. 6. The method of claim 1, wherein the priority metric is one of an environment indicator function, remaining buffer space, remaining energy, or relative rank. 7. The method of claim 1, the method further comprising: during a second time slot after the first timeslot, polling the unselected one 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 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; andprogram instructions stored in the data storage and executable by the processor to: assign, to at least one network node in a set of network nodes, a respective polling interval based at least in part on a respective cost contribution of the at least one network node;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 wherein the assigning further comprises assigning a first network node a first polling interval and assigning a second network node a second polling interval;after the assigning, detecting that a same first time slot has been selected for both the first network node and the second network node;responsive to the detecting, selecting 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; andpolling the selected network node during the particular time slot. 17. The base station of claim 16, wherein the program instructions further comprise instructions to: prior to the assigning, determine the cost contribution of the at least one network node based on one or more of an energy-consumption metric associated with the at least one network node and a latency metric associated with the at least one network node. 18. The base station of claim 16, wherein the program instructions further comprise instructions to: during a second time slot after the first timeslot, poll the unselected one of the first network node and the second network node. 19. A physical computer-readable medium having computer executable instructions stored thereon, the instructions comprising: instructions for assigning, to at least one network node in a set of network nodes, a respective polling interval based at least in part on a respective cost contribution of the at least one network node;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 wherein the assigning further comprises assigning a first network node a first polling interval and assigning a second network node a second polling interval;after the assigning, detecting that a same first time slot has been selected for both the first network node and the second network node;responsive to the detecting, selecting 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; andpolling the selected network node during the particular time slot.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (6)
Li,Li; Paul,Sanjoy; Thottan,Marina K.; Yao,Bin, Distributed network monitoring with bounded link utilization in IP networks.
George Jude ; Schlecht Leslie ; McCabe James D. ; LeKashman ; Jr. John, Scalable hierarchical network management system for displaying network information in three dimensions.
Azzarito, Doug; Rose, Robert A., Universal serial bus transaction processing tasks scheduling method for computer system, involves assigning transaction to periodic queue head list with faster polling interval.
Song, June-Hwa; Ju, Young-Hyun; Min, Chul-Hong; Lee, Young-Ki; Yu, Ji-Hyun; Shin, In-Sik, Mobile apparatus for executing sensing flow for mobile context monitoring, method of executing sensing flow using the same, method of context monitoring using the same and context monitoring system including the same.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.