TY - GEN
T1 - Energy adaptation techniques to optimize data delivery in store-and-forward sensor networks
AU - Zhang, Pei
AU - Martonosi, Margaret
PY - 2006
Y1 - 2006
N2 - Wireless sensor networks are severely-energy constrained devices. Energy-related issues are one of the common failure modes in sensor deployments. One challenge in systemwide energy management is that individual nodes in a sensor network often have widely varying energy profiles due to the amount of data transmitted, hardware construction, and other environmental effects. These differences result in unpredictable node and system lifetimes. As a result, sensor network bit-rate and reliability may degrade prematurely. Our research explores and evaluates an easily implemented dynamic scheduling policy supported by a battery gauge aimed to solve this problem.The dynamic scheduling policy presented here operates in a slotted manner. The decision for each node to communicate is based on the available energy of that node. Our policy guarantees a minimum communication bandwidth, while allowing nodes with more energy to increase their available bandwidth by a factor related to the amount of "extra" energy they have. We present real-system results measured on test nodes in several different network scenarios. The results show our scheduling, when compared to a fixed schedule, guarantees a longer usable system lifetime by preventing premature degradation of connections. In addition to improving connectivity, it reduces data delay by as much as 50% for intermittently connected nodes, with no added communication overhead.
AB - Wireless sensor networks are severely-energy constrained devices. Energy-related issues are one of the common failure modes in sensor deployments. One challenge in systemwide energy management is that individual nodes in a sensor network often have widely varying energy profiles due to the amount of data transmitted, hardware construction, and other environmental effects. These differences result in unpredictable node and system lifetimes. As a result, sensor network bit-rate and reliability may degrade prematurely. Our research explores and evaluates an easily implemented dynamic scheduling policy supported by a battery gauge aimed to solve this problem.The dynamic scheduling policy presented here operates in a slotted manner. The decision for each node to communicate is based on the available energy of that node. Our policy guarantees a minimum communication bandwidth, while allowing nodes with more energy to increase their available bandwidth by a factor related to the amount of "extra" energy they have. We present real-system results measured on test nodes in several different network scenarios. The results show our scheduling, when compared to a fixed schedule, guarantees a longer usable system lifetime by preventing premature degradation of connections. In addition to improving connectivity, it reduces data delay by as much as 50% for intermittently connected nodes, with no added communication overhead.
KW - Adaptive
KW - Energy
KW - Scheduling
KW - System lifetime
UR - http://www.scopus.com/inward/record.url?scp=34547481859&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547481859&partnerID=8YFLogxK
U2 - 10.1145/1182807.1182878
DO - 10.1145/1182807.1182878
M3 - Conference contribution
AN - SCOPUS:34547481859
SN - 1595933433
SN - 9781595933430
T3 - SenSys'06: Proceedings of the Fourth International Conference on Embedded Networked Sensor Systems
SP - 405
EP - 406
BT - SenSys'06
T2 - SenSys'06: 4th International Conference on Embedded Networked Sensor Systems
Y2 - 31 October 2006 through 3 November 2006
ER -