TY - GEN
T1 - Fault-tolerant topology for energy-harvesting heterogeneous wireless sensor networks
AU - Yin, Zhiyuan
AU - Li, Fan
AU - Shen, Meng
AU - Wang, Yu
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/9/9
Y1 - 2015/9/9
N2 - Recent advances in ambient energy-harvesting wireless sensor networks (WSNs) technologies have made it possible to power the network by energy generated from the environment and thereby increase its lifetime. Various energy sources including light, vibration and heat can be harvested by sensor nodes. However, time-varying energy harvesting also bring new design challenging for WSNs. In this paper, we study a fault-tolerant topology design problem for an energy-harvesting heterogeneous WSN, where multiple supernodes with rich resources are used to improve the performance. We first model the network as a directed and weighted space-time graph in which both spacial and temporal information are preserved. We then define the fault-tolerant topology problem which aims to build a sparser time-varying structure from the original space-time graph while maintaining k-connectivity for the fault-tolerant purpose. Six different algorithms are proposed to solve the problem. Simulation results demonstrate that our proposed methods can save up to around 80% costs.
AB - Recent advances in ambient energy-harvesting wireless sensor networks (WSNs) technologies have made it possible to power the network by energy generated from the environment and thereby increase its lifetime. Various energy sources including light, vibration and heat can be harvested by sensor nodes. However, time-varying energy harvesting also bring new design challenging for WSNs. In this paper, we study a fault-tolerant topology design problem for an energy-harvesting heterogeneous WSN, where multiple supernodes with rich resources are used to improve the performance. We first model the network as a directed and weighted space-time graph in which both spacial and temporal information are preserved. We then define the fault-tolerant topology problem which aims to build a sparser time-varying structure from the original space-time graph while maintaining k-connectivity for the fault-tolerant purpose. Six different algorithms are proposed to solve the problem. Simulation results demonstrate that our proposed methods can save up to around 80% costs.
UR - http://www.scopus.com/inward/record.url?scp=84953705974&partnerID=8YFLogxK
U2 - 10.1109/ICC.2015.7249403
DO - 10.1109/ICC.2015.7249403
M3 - Conference contribution
AN - SCOPUS:84953705974
T3 - IEEE International Conference on Communications
SP - 6761
EP - 6766
BT - 2015 IEEE International Conference on Communications, ICC 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE International Conference on Communications, ICC 2015
Y2 - 8 June 2015 through 12 June 2015
ER -