TY - GEN
T1 - Bounding communication delay in energy harvesting sensor networks
AU - Gu, Yu
AU - He, Tian
PY - 2010
Y1 - 2010
N2 - In energy-harvesting sensor networks, limited ambient energy from environment necessitates sensor nodes to operate at a low-duty-cycle, i.e., they communicate briefly and stay asleep most of time. Such low-duty-cycle operation leads to orders of magnitude longer communication delays in comparison with traditional always-active networks, imposing a new challenge in many time-sensitive sensor network applications (e.g., tracking and alert). In this paper, we introduce novel solutions for bounding sink-to-node communications in energy-harvesting sensor networks. We first present an optimal solution for the sink-to-one case and its distributed implementation. For the sink-to-many case, we theoretically prove its NP-Hardness and inapproximability property, followed by an efficient heuristic solution.We have evaluated our design with both extensive simulation and a TinyOS/Mote based implementation. Compared with an improved version of a state-of-the-art design, our delay maintenance design effectively provides E2E delay guarantees while consuming as much as 60% less energy.
AB - In energy-harvesting sensor networks, limited ambient energy from environment necessitates sensor nodes to operate at a low-duty-cycle, i.e., they communicate briefly and stay asleep most of time. Such low-duty-cycle operation leads to orders of magnitude longer communication delays in comparison with traditional always-active networks, imposing a new challenge in many time-sensitive sensor network applications (e.g., tracking and alert). In this paper, we introduce novel solutions for bounding sink-to-node communications in energy-harvesting sensor networks. We first present an optimal solution for the sink-to-one case and its distributed implementation. For the sink-to-many case, we theoretically prove its NP-Hardness and inapproximability property, followed by an efficient heuristic solution.We have evaluated our design with both extensive simulation and a TinyOS/Mote based implementation. Compared with an improved version of a state-of-the-art design, our delay maintenance design effectively provides E2E delay guarantees while consuming as much as 60% less energy.
UR - http://www.scopus.com/inward/record.url?scp=77955883748&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955883748&partnerID=8YFLogxK
U2 - 10.1109/ICDCS.2010.41
DO - 10.1109/ICDCS.2010.41
M3 - Conference contribution
AN - SCOPUS:77955883748
SN - 9780769540597
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 837
EP - 847
BT - ICDCS 2010 - 2010 International Conference on Distributed Computing Systems
T2 - 30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010
Y2 - 21 June 2010 through 25 June 2010
ER -