Energy-aware probing period dimensioning algorithms for mobile WSN-HEAP

This paper presents two approaches for energy management in the context of mobile sensor networks. Such networks are characterised by well-studied energy consumption models where the discovery procedure a.k.a. 'probing phase' of a majority of transmission protocols is extremely expensive, as compared to other network operations. Optimising the probing phase is, therefore, of high importance in order to maximise the network's lifetime. We propose PPM-BM and PPM-EML, two probing period modulation methods. On the first hand, PPM-BM is based on the residual energy of the node. On the other hand, PPM-EML is based on the estimation of the geolocalised encounting probabilities learning of nodes of the network. Experimental results show that PPM-BM and PPMEML enable the overall WSN to efficiently lower its energy consumption and consequently increase its sustainability. Moreover, the delay and deliverability loss due to our probing period modulation algorithms remain negligible for all the routing protocol we studied.

[1]  Kate Ching-Ju Lin,et al.  EFFORT: energy-efficient opportunistic routing technology in wireless sensor networks , 2013, Wirel. Commun. Mob. Comput..

[2]  Cecilia Mascolo,et al.  Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.

[3]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[4]  E.-O. Blass,et al.  Towards a Realistic Energy Model for Wireless Sensor Networks , 2008, 2008 Fifth Annual Conference on Wireless on Demand Network Systems and Services.

[5]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[6]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[7]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[8]  M. Vetterli,et al.  Locating mobile nodes with EASE: learning efficient routes from encounter histories alone , 2006, IEEE/ACM Transactions on Networking.

[9]  Joaquim Macedo,et al.  Energy impact analysis on DTN routing protocols , 2012 .

[10]  Robin Kravets,et al.  Encounter: based routing in DTNs , 2009, MOCO.

[11]  Jie Wu,et al.  An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.

[12]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM 2007.

[13]  Richard E. Hansen,et al.  Prioritized epidemic routing for opportunistic networks , 2007, MobiOpp '07.

[14]  Yan Gao,et al.  Modeling of Node Energy Consumption for Wireless Sensor Networks , 2011, Wirel. Sens. Netw..

[15]  Shaojie Tang,et al.  Energy-Efficient Opportunistic Routing in Wireless Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[16]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[17]  Mostafa H. Ammar,et al.  On the Relevance of Social Information to Opportunistic Forwarding , 2010, 2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[18]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2011 .

[19]  Maurizio A. Spirito,et al.  Opportunistic Data Collection in Sparse Wireless Sensor Networks , 2011, EURASIP J. Wirel. Commun. Netw..

[20]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[21]  Hwee Pink Tan,et al.  Energy-neutral scheduling and forwarding in environmentally-powered wireless sensor networks , 2013, Ad Hoc Networks.

[22]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2007, PerCom Workshops.

[23]  Jorge M. Soares,et al.  CHARON: Routing in low-density opportunistic wireless sensor networks , 2009, 2009 2nd IFIP Wireless Days (WD).

[24]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[25]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[26]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[27]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.