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

A mobile vehicle equipped with wireless energy transmission technology can move around a wireless sensor network and recharge nodes over the air, leading to potentially perpetual operation if nodes can always be recharged before energy depletion. When to recharge which nodes, and in what order, critically impact the outcome. So far only a few works have studied this problem and relatively static recharging policies were proposed. However, dynamic changes such as unpredictable energy consumption variations in nodes, and practical issues like scalable and efficient gathering of energy information, are not yet addressed. In this paper, we propose NETWRAP, an NDN based Real Time Wireless Recharging Protocol for dynamic recharging in wireless sensor networks. We leverage concepts and mechanisms from NDN (Named Data Networking) to design a set of protocols that continuously gather and deliver energy information to the mobile vehicle, including unpredictable emergencies, in a scalable and efficient manner. We derive analytic results on energy neutral conditions that give rise to perpetual operation. We also discover that optimal recharging of multiple emergencies is an Orienteering problem with Knapsack approximation. Our extensive simulations demonstrate the effectiveness and efficiency of the proposed framework and validate the theoretical analysis.

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

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

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

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

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

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

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

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

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

[10]  Yuanyuan Yang,et al.  SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks , 2007, IEEE Trans. Parallel Distributed Syst..

[11]  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).

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

[13]  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.

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

[15]  Mani B. Srivastava,et al.  Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines , 2004, 25th IEEE International Real-Time Systems Symposium.

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

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

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

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

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

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

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

[23]  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).

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

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

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

[27]  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 .

[28]  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.

[29]  Yuanyuan Yang,et al.  Bounded Relay Hop Mobile Data Gathering in Wireless Sensor Networks , 2012, IEEE Transactions on Computers.

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

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

[32]  S. Ross A First Course in Probability , 1977 .

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

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

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

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

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

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

[39]  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).

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