TY - GEN
T1 - Network lifetime maximization in delay-tolerant sensor networks with a mobile sink
AU - Xu, Zichuan
AU - Liang, Weifa
AU - Xu, Yinlong
PY - 2012
Y1 - 2012
N2 - In this paper we investigate the network lifetime maximization problem in a delay-tolerant wireless sensor network with a mobile sink by exploiting a nontrivial tradeoff between the network lifetime and the data delivery delay. We formulate the problem as a joint optimization problem that consists of finding a trajectory for the mobile sink and designing an energy-efficient routing protocol to route sensing data to the sink, subject to the bounded delay on data delivery and the given potential sink location space. Due to NP-hardness of the problem, we then propose a novel optimization framework, which not only prolongs the network lifetime but also improves the other performance metrics including the network scalability, robustness, and the average delivery delay. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm against other heuristics. The experimental results demonstrate that the proposed algorithm outperforms the others significantly in terms of network lifetime prolongation.
AB - In this paper we investigate the network lifetime maximization problem in a delay-tolerant wireless sensor network with a mobile sink by exploiting a nontrivial tradeoff between the network lifetime and the data delivery delay. We formulate the problem as a joint optimization problem that consists of finding a trajectory for the mobile sink and designing an energy-efficient routing protocol to route sensing data to the sink, subject to the bounded delay on data delivery and the given potential sink location space. Due to NP-hardness of the problem, we then propose a novel optimization framework, which not only prolongs the network lifetime but also improves the other performance metrics including the network scalability, robustness, and the average delivery delay. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm against other heuristics. The experimental results demonstrate that the proposed algorithm outperforms the others significantly in terms of network lifetime prolongation.
KW - QoS
KW - energy conservation
KW - joint optimization
KW - load-balanced forest
KW - network lifetime prolongation
KW - routing algorithms
KW - set cover
UR - http://www.scopus.com/inward/record.url?scp=84864261600&partnerID=8YFLogxK
U2 - 10.1109/DCOSS.2012.17
DO - 10.1109/DCOSS.2012.17
M3 - Conference contribution
SN - 9780769547077
T3 - Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012
SP - 9
EP - 16
BT - Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012
T2 - 8th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012
Y2 - 16 May 2012 through 18 May 2012
ER -