TY - GEN
T1 - On minimum delay duty-cycling protocol in sustainable sensor network
AU - Tang, Shaojie
AU - Wu, Jie
AU - Chen, Guihai
AU - Wang, Cheng
AU - Liu, Xuefeng
AU - Li, Tao
AU - Li, Xiang Yang
PY - 2012
Y1 - 2012
N2 - To ensure sustainable operations of wireless sensor networks, environmental energy harvesting has been well recognized as one promising solution for long-term applications. Unlike in battery-powered sensor networks, we are targeting a duty-cycle adjustment to optimize the network performance, e.g., delay minimization, with full harvested energy utilization. In this paper, we introduce a set of duty-cycle adjustment schemes that will minimize cross traffic delay (CTD) in energy-harvesting sensor networks. We first present an offline solution by assuming that the link reliability and traffic distribution are known a priori. Based on the submodular property of the CTD function, we theoretically prove that a simple greedy algorithm can achieve constant approximation. We next propose a class of online algorithms that do not require the knowledge of link reliability and traffic distribution. For each of these algorithms, we give a theoretical bound on the performance. We have evaluated our design with a TelosB-based implementation and experimental results corroborate our theoretical analysis.
AB - To ensure sustainable operations of wireless sensor networks, environmental energy harvesting has been well recognized as one promising solution for long-term applications. Unlike in battery-powered sensor networks, we are targeting a duty-cycle adjustment to optimize the network performance, e.g., delay minimization, with full harvested energy utilization. In this paper, we introduce a set of duty-cycle adjustment schemes that will minimize cross traffic delay (CTD) in energy-harvesting sensor networks. We first present an offline solution by assuming that the link reliability and traffic distribution are known a priori. Based on the submodular property of the CTD function, we theoretically prove that a simple greedy algorithm can achieve constant approximation. We next propose a class of online algorithms that do not require the knowledge of link reliability and traffic distribution. For each of these algorithms, we give a theoretical bound on the performance. We have evaluated our design with a TelosB-based implementation and experimental results corroborate our theoretical analysis.
KW - duty-cycle
KW - solar powered
KW - submodular
KW - Wireless sensor networks
UR - https://www.scopus.com/pages/publications/84874556381
U2 - 10.1109/ICNP.2012.6459969
DO - 10.1109/ICNP.2012.6459969
M3 - Conference contribution
AN - SCOPUS:84874556381
SN - 9781467324472
T3 - Proceedings - International Conference on Network Protocols, ICNP
BT - 2012 20th IEEE International Conference on Network Protocols, ICNP 2012
T2 - 2012 20th IEEE International Conference on Network Protocols, ICNP 2012
Y2 - 30 October 2012 through 2 November 2012
ER -