Minimizing transmission energy in sensor networks via trajectory control

Energy optimization is a significant component of Wireless Sensor Network (WSN) design. In this paper we consider transmission energy optimization in WSNs where messages are collected by a mobile receiver (collector). The collector is responsible for gathering data messages by choosing the optimal path that minimizes the total transmit energy at the sensors subject to a maximum travel delay constraint. We show, both analytically and through simulation, that letting the mobile collector come closer to sensors with more data to transmit leads to significant reduction in energy consumption. Using this intuition, we propose an algorithm for choosing both the transmission radii and the mobile collector's path that achieves over 50% improvement in energy consumption compared to schemes that use a fixed communication radius for every sensor, and a 95% improvement as compared to the case of a stationary base station. We extend our results to the case of stochastic arrivals to the sensors and propose an Adaptive Algorithm that dynamically adjusts the transmission radii of the sensors based on the sensors' current queue sizes. We show that it can achieve 80% transmission energy improvement with respect to a non-adaptive scheme that uses fixed radii computed using the average arrival rates.

[1]  Deborah Estrin,et al.  Controllably mobile infrastructure for low energy embedded networks , 2006, IEEE Transactions on Mobile Computing.

[2]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[3]  Moshe Sidi,et al.  Dominance relations in polling systems , 1990, Queueing Syst. Theory Appl..

[4]  Wei Wang,et al.  Using mobile relays to prolong the lifetime of wireless sensor networks , 2005, MobiCom '05.

[5]  Jie Lin,et al.  Towards mobility as a network control primitive , 2004, MobiHoc '04.

[6]  J. Michael Steele,et al.  Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space , 1990, Math. Oper. Res..

[7]  Khaled M. Elbassioni,et al.  Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods , 2009, Int. J. Comput. Geom. Appl..

[8]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[9]  Joseph S. B. Mitchell,et al.  Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.

[10]  Gaetano Borriello,et al.  Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks , 2006, Mob. Networks Appl..

[11]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[12]  Wendi B. Heinzelman,et al.  An analysis of strategies for mitigating the sensor network hot spot problem , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[13]  Yiwei Thomas Hou,et al.  Theoretical Results on Base Station Movement Problem for Sensor Network , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[14]  Eytan Modiano,et al.  Random access wireless networks with controlled mobility , 2009, 2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop.

[15]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[16]  Joachim Gudmundsson,et al.  TSP with neighborhoods of varying size , 2005, J. Algorithms.

[17]  Rajesh K. Gupta,et al.  Optimizing Energy-Latency Trade-Off in Sensor Networks with Controlled Mobility , 2009, IEEE INFOCOM 2009.

[18]  Jun Luo,et al.  Joint mobility and routing for lifetime elongation in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[19]  Khaled M. Elbassioni,et al.  On Approximating the TSP with Intersecting Neighborhoods , 2006, ISAAC.

[20]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[21]  Yi Xie,et al.  Stability-constrained optimization for energy efficiency in polling-based wireless networks , 2006, valuetools '06.

[22]  Joachim Gudmundsson,et al.  A Fast Approximation Algorithm for TSP with Neighborhoods , 1999, Nord. J. Comput..

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

[24]  Anthony Ephremides,et al.  Energy concerns in wireless networks , 2002, IEEE Wirel. Commun..

[25]  Milind Dawande,et al.  Energy efficient schemes for wireless sensor networks with multiple mobile base stations , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[26]  Volkan Isler,et al.  Data gathering tours for mobile robots , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[27]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

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