NETWRAP: An NDN Based Real-TimeWireless Recharging Framework for Wireless Sensor Networks

Using vehicles equipped with wireless energy transmission technology to recharge sensor nodes over the air is a game-changer for traditional wireless sensor networks. The recharging policy regarding when to recharge which sensor nodes critically impacts the network performance. So far only a few works have studied such recharging policy for the case of using a single vehicle. In this paper, we propose NETWRAP, an NDN based Real Time Wireless Recharging Protocol for dynamic wireless recharging in sensor networks. The real-time recharging framework supports single or multiple mobile vehicles. Employing multiple mobile vehicles provides more scalability and robustness. To efficiently deliver sensor energy status information to vehicles in real-time, we leverage concepts and mechanisms from named data networking (NDN) and design energy monitoring and reporting protocols. We derive theoretical results on the energy neutral condition and the minimum number of mobile vehicles required for perpetual network operations. Then we study how to minimize the total traveling cost of vehicles while guaranteeing all the sensor nodes can be recharged before their batteries deplete. We formulate the recharge optimization problem into a Multiple Traveling Salesman Problem with Deadlines (m-TSP with Deadlines), which is NP-hard. To accommodate the dynamic nature of node energy conditions with low overhead, we present an algorithm that selects the node with the minimum weighted sum of traveling time and residual lifetime. Our scheme not only improves network scalability but also ensures the perpetual operation of networks. Extensive simulation results demonstrate the effectiveness and efficiency of the proposed design. The results also validate the correctness of the theoretical analysis and show significant improvements that cut the number of nonfunctional nodes by half compared to the static scheme while maintaining the network overhead at the same level.

[1]  Mani B. Srivastava,et al.  Harvesting aware power management for sensor networks , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[2]  Adam Meyerson,et al.  Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.

[3]  Yuanyuan Yang,et al.  SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[4]  Randolph D. Nelson,et al.  Probability, stochastic processes, and queueing theory - the mathematics of computer performance modeling , 1995 .

[5]  Ramesh Krishnamurti,et al.  The multiple TSP with time windows: vehicle bounds based on precedence graphs , 2006, Oper. Res. Lett..

[6]  José D. P. Rolim,et al.  Fast and energy efficient sensor data collection by multiple mobile sinks , 2007, MobiWac '07.

[7]  Angelika Bayer,et al.  A First Course In Probability , 2016 .

[8]  Gaurav S. Sukhatme,et al.  Studying the feasibility of energy harvesting in a mobile sensor network , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[9]  Daji Qiao,et al.  J-RoC: A Joint Routing and Charging scheme to prolong sensor network lifetime , 2011, 2011 19th IEEE International Conference on Network Protocols.

[10]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[11]  Ossama Younis,et al.  Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.

[12]  Yuanyuan Yang,et al.  Bounded relay hop mobile data gathering in wireless sensor networks , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[13]  Mani B. Srivastava,et al.  Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks , 2005, DCOSS.

[14]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[15]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[16]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[17]  Steve Goddard,et al.  Stochastic Analysis of Energy Consumption in Wireless Sensor Networks , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[18]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[19]  Sun Youxian,et al.  Energy Provisioning in Wireless Rechargeable Sensor Networks , 2011 .

[20]  M. Soljačić,et al.  Wireless Power Transfer via Strongly Coupled Magnetic Resonances , 2007, Science.

[21]  Daji Qiao,et al.  Prolonging Sensor Network Lifetime Through Wireless Charging , 2010, 2010 31st IEEE Real-Time Systems Symposium.

[22]  Bezalel Gavish,et al.  Note---A Note on “The Formulation of the M-Salesman Traveling Salesman Problem” , 1976 .

[23]  Guiling Wang,et al.  How Wireless Power Charging Technology Affects Sensor Network Deployment and Routing , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[24]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[25]  Jie Wu,et al.  Collaborative mobile charging for sensor networks , 2012, 2012 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS 2012).

[26]  Michel Gendreau,et al.  A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows , 1998, Oper. Res..

[27]  Luca Faust,et al.  Modern Operating Systems , 2016 .

[28]  Hanif D. Sherali,et al.  On renewable sensor networks with wireless energy transfer , 2011, 2011 Proceedings IEEE INFOCOM.

[29]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[30]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[31]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[32]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[33]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[34]  M. Soljačić,et al.  Efficient wireless non-radiative mid-range energy transfer , 2006, physics/0611063.

[35]  A SomasundaraA.,et al.  Mobile Element Scheduling for Efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines , 2004 .

[36]  Hoong Chuin Lau,et al.  Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..

[37]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[38]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[39]  Jiming Chen,et al.  Energy provisioning in wireless rechargeable sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[40]  Sotiris E. Nikoletseas,et al.  Efficient energy management in wireless rechargeable sensor networks , 2012, MSWiM '12.

[41]  Yuanyuan Yang,et al.  Joint mobile energy replenishment and data gathering in wireless rechargeable sensor networks , 2011, ITC.

[42]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[43]  Yuanyuan Yang,et al.  Data gathering in wireless sensor networks with mobile collectors , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.