On-Demand Charging in Wireless Sensor Networks: Theories and Applications

被引:91
作者
He, Liang [1 ]
Gu, Yu [1 ]
Pan, Jianping [2 ]
Zhu, Ting [3 ]
机构
[1] Singapore Univ Technol & Design, Singapore, Singapore
[2] Univ Victoria, Victoria, BC, Canada
[3] SUNY Binghamton, Binghamton, NY USA
来源
2013 IEEE 10TH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR SYSTEMS (MASS 2013) | 2013年
基金
加拿大自然科学与工程研究理事会; 新加坡国家研究基金会;
关键词
D O I
10.1109/MASS.2013.51
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, adopting mobile energy chargers to replenish the energy supply of sensor nodes in wireless sensor networks has gained increasing attention from the research community. The utilization of the mobile energy chargers provides a more reliable energy supply than the systems that harvested dynamic energy from the surrounding environment. While pioneering works on the mobile recharging problem mainly focus on the optimal offline path planning for the mobile chargers, in this work, we aim to lay the theoretical foundation for the on-demand mobile charging problem, where individual sensor nodes request charging from the mobile charger when their energy runs low. Specifically, in this work we analyze the on-demand mobile charging problem using a simple but efficient Nearest-Job-Next with Preemption (NJNP) discipline for the mobile charger, and provide analytical results on the system throughput and charging latency from the perspectives of the mobile charger and individual sensor nodes, respectively. To demonstrate how the actual system design can benefit from our analytical results, we present an example on determining the optimal remaining energy level for individual sensor nodes to send out their recharging requests. Through extensive simulation with real-world system settings, we verify our analysis matches the simulation results well and the system designs based on our analysis are effective.
引用
收藏
页码:28 / 36
页数:9
相关论文
共 29 条
[1]   QUEUING IN-SPACE [J].
ALTMAN, E ;
LEVY, H .
ADVANCES IN APPLIED PROBABILITY, 1994, 26 (04) :1095-1116
[2]   A STOCHASTIC AND DYNAMIC VEHICLE-ROUTING PROBLEM IN THE EUCLIDEAN PLANE [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1991, 39 (04) :601-615
[3]   Stochastic properties of the random waypoint mobility model [J].
Bettstetter, C ;
Hartenstein, H ;
Pérez-Costa, X .
WIRELESS NETWORKS, 2004, 10 (05) :555-567
[4]   Controlled mobility in stochastic and dynamic wireless networks [J].
Celik, Guener D. ;
Modiano, Eytan H. .
QUEUEING SYSTEMS, 2012, 72 (3-4) :251-277
[5]  
David H. A., 2003, ORDER STAT
[6]  
Fu L., 2013, INFOCOM 13
[7]   New policies for the dynamic traveling salesman problem [J].
Ghiani, Gianpaolo ;
Quaranta, Antonella ;
Triki, Chefi .
OPTIMIZATION METHODS & SOFTWARE, 2007, 22 (06) :971-983
[8]  
Gorlatova M., 2009, MOBICOM 09
[9]  
Gross D., 2008, FUNDAMENTALS QUEUEIN, P232
[10]  
Guo S., 2013, INFOCOM'13