Near-Optimal Velocity Control for Mobile Charging in Wireless Rechargeable Sensor Networks

被引:130
作者
Shu, Yuanchao [1 ]
Yousefi, Hamed [2 ]
Cheng, Peng [1 ]
Chen, Jiming [1 ]
Gu, Yu [3 ]
He, Tian [4 ]
Shin, Kang G. [5 ]
机构
[1] Zhejiang Univ, Coll Control Sci & Engn, State Key Lab Ind Control Technol, Hangzhou 310003, Zhejiang, Peoples R China
[2] Sharif Univ Technol, Dept Comp Engn, Tehran, Iran
[3] IBM Watson Hlth, Austin, TX 78758 USA
[4] Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA
[5] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
基金
美国国家科学基金会;
关键词
Wireless rechargeable sensor networks; velocity control; energy harvesting; mobile charging; ENERGY REPLENISHMENT;
D O I
10.1109/TMC.2015.2473163
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Limited energy in each node is the major design constraint in wireless sensor networks (WSNs). To overcome this limit, wireless rechargeable sensor networks (WRSNs) have been proposed and studied extensively over the last few years. In a typical WRSN, batteries in sensor nodes can be replenished by a mobile charger that periodically travels along a certain trajectory in the sensing area. To maximize the charged energy in sensor nodes, one fundamental question is how to control the traveling velocity of the charger. In this paper, we first identify the optimal velocity control as a key design objective of mobile wireless charging in WRSNs. We then formulate the optimal charger velocity control problem on arbitrarily-shaped irregular trajectories in a 2D space. The problem is proved to be NP-hard, and hence a heuristic solution with a provable upper bound is developed using novel spatial and temporal discretization. We also derive the optimal velocity control for moving the charger along a linear (1D) trajectory commonly seen in many WSN applications. Extensive simulations show that the network lifetime can be extended by 2.5 x with the proposed velocity control mechanisms.
引用
收藏
页码:1699 / 1713
页数:15
相关论文
共 46 条
[1]   General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems [J].
Aissi, Hassene ;
Bazgan, Cristina ;
Vanderpooten, Daniel .
DISCRETE OPTIMIZATION, 2010, 7 (03) :136-148
[2]  
Alsalih W., 2009, PROC IEEE INT C COMM, P1
[3]   Wireless energy transfer in sensor networks with adaptive, limited knowledge protocols [J].
Angelopoulos, Constantinos Marios ;
Nikoletseas, Sotiris ;
Raptis, Theofanis P. .
COMPUTER NETWORKS, 2014, 70 :113-141
[4]  
[Anonymous], POW DEB RF EN HARV K
[5]  
[Anonymous], 2009, 2009 WIRELESS TELECO
[6]  
[Anonymous], 2013, P 16 ACM INT C MOD A
[7]  
[Anonymous], MAGN RES IND
[8]  
[Anonymous], 2012, IEEE T MOBILE COMPUT, DOI DOI 10.1109/TMC.2012.161
[9]  
[Anonymous], WARP WIR AMB RAD POW
[10]  
[Anonymous], ROBOTIC WAREHOUSING