TY - JOUR
T1 - Maintaining large-scale rechargeable sensor networks perpetually via multiple mobile charging vehicles
AU - Liang, Weifa
AU - Xu, Wenzheng
AU - Ren, Xiaojiang
AU - Jia, Xiaohua
AU - Lin, Xiaola
N1 - Publisher Copyright:
© 2016 ACM.
PY - 2016/5
Y1 - 2016/5
N2 - Wireless energy transfer technology based on magnetic resonant coupling has been emerging as a promising technology for wireless sensor networks (WSNs) by providing controllable yet perpetual energy to sensors. In this article, we study the deployment of the minimum number of mobile charging vehicles to charge sensors in a large-scale WSN so that none of the sensors will run out of energy, for which we first advocate a flexible on-demand charging paradigm that decouples sensor energy charging scheduling from the design of sensing data routing protocols. We then formulate a novel optimization problem of scheduling mobile charging vehicles to charge life-critical sensors in the network with an objective to minimize the number of mobile charging vehicles deployed, subject to the energy capacity constraint on each mobile charging vehicle. As the problem is NP-hard, we instead propose an approximation algorithm with a provable performance guarantee if the energy consumption of each sensor during each charging tour is negligible. Otherwise, we devise a heuristic algorithm by modifying the proposed approximation algorithm. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are very promising, and the solutions obtained are fractional of the optimal ones. To the best of our knowledge, this is the first approximation algorithm with a nontrivial approximation ratio for a novel scheduling problem of multiple mobile charging vehicles for charging sensors.
AB - Wireless energy transfer technology based on magnetic resonant coupling has been emerging as a promising technology for wireless sensor networks (WSNs) by providing controllable yet perpetual energy to sensors. In this article, we study the deployment of the minimum number of mobile charging vehicles to charge sensors in a large-scale WSN so that none of the sensors will run out of energy, for which we first advocate a flexible on-demand charging paradigm that decouples sensor energy charging scheduling from the design of sensing data routing protocols. We then formulate a novel optimization problem of scheduling mobile charging vehicles to charge life-critical sensors in the network with an objective to minimize the number of mobile charging vehicles deployed, subject to the energy capacity constraint on each mobile charging vehicle. As the problem is NP-hard, we instead propose an approximation algorithm with a provable performance guarantee if the energy consumption of each sensor during each charging tour is negligible. Otherwise, we devise a heuristic algorithm by modifying the proposed approximation algorithm. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are very promising, and the solutions obtained are fractional of the optimal ones. To the best of our knowledge, this is the first approximation algorithm with a nontrivial approximation ratio for a novel scheduling problem of multiple mobile charging vehicles for charging sensors.
KW - Approximation algorithms
KW - Combinatorial optimization problem
KW - Critical sensor lifetime
KW - Energy recharging scheduling
KW - Mobile vehicle routing problem
KW - Rechargeable wireless sensor networks
KW - Tree decomposition
KW - Wireless energy transfer
UR - http://www.scopus.com/inward/record.url?scp=84969909640&partnerID=8YFLogxK
U2 - 10.1145/2898357
DO - 10.1145/2898357
M3 - Article
SN - 1550-4859
VL - 12
JO - ACM Transactions on Sensor Networks
JF - ACM Transactions on Sensor Networks
IS - 2
M1 - 14
ER -