TY - GEN
T1 - Towards perpetual sensor networks via deploying multiple mobile wireless chargers
AU - Xu, Wenzheng
AU - Liang, Weifa
AU - Lin, Xiaola
AU - Mao, Guoqiang
AU - Ren, Xiaojiang
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/11/13
Y1 - 2014/11/13
N2 - In this paper, we study the use of multiple mobile charging vehicles to charge sensors in a large-scale wireless sensor network for a given monitoring period, where sensors can be charged by the vehicles with wireless power transfer. Since each sensor may experience multiple charges to avoid its energy expiration for the period, we first consider a charging problem of scheduling the multiple mobile vehicles to collaboratively charge sensors so that none of the sensors will run out of its energy and the sum of traveling distance (referred to as the service cost) of these vehicles can be minimized. Due to NP-hardness of the problem, we then propose a novel approximation algorithm for it, assuming that sensor energy consumption rates do not change over time. Otherwise, we devise a heuristic algorithm through minor modifications to the approximation algorithm. We finally evaluate the performance of the proposed algorithms via simulations. Experimental results show that the proposed algorithms are very promising, which can reduce upto 45% of the service cost in comparison with the service cost delivered by a greedy algorithm.
AB - In this paper, we study the use of multiple mobile charging vehicles to charge sensors in a large-scale wireless sensor network for a given monitoring period, where sensors can be charged by the vehicles with wireless power transfer. Since each sensor may experience multiple charges to avoid its energy expiration for the period, we first consider a charging problem of scheduling the multiple mobile vehicles to collaboratively charge sensors so that none of the sensors will run out of its energy and the sum of traveling distance (referred to as the service cost) of these vehicles can be minimized. Due to NP-hardness of the problem, we then propose a novel approximation algorithm for it, assuming that sensor energy consumption rates do not change over time. Otherwise, we devise a heuristic algorithm through minor modifications to the approximation algorithm. We finally evaluate the performance of the proposed algorithms via simulations. Experimental results show that the proposed algorithms are very promising, which can reduce upto 45% of the service cost in comparison with the service cost delivered by a greedy algorithm.
KW - Approximation algorithms
KW - Combinatorial optimization problems
KW - Periodic charging cycles
KW - Rechargeable sensor networks
KW - Traveling salesman problem
KW - Wireless power transfer
UR - http://www.scopus.com/inward/record.url?scp=84932631921&partnerID=8YFLogxK
U2 - 10.1109/ICPP.2014.17
DO - 10.1109/ICPP.2014.17
M3 - Conference contribution
T3 - Proceedings of the International Conference on Parallel Processing
SP - 80
EP - 89
BT - Proceedings - 43rd International Conference on Parallel Processing, ICPP 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 43rd International Conference on Parallel Processing, ICPP 2014
Y2 - 9 September 2014 through 12 September 2014
ER -