An Energy-Efficient n-Epidemic Routing Protocol for Delay Tolerant Networks

In Delay Tolerant Networks (DTN), as disconnections between nodes are frequent, establishing routing path from the source node to the destination node may not be possible. However, if a node transmits packets to all its encounters, its batteries will be used up quickly. Many researches have been done on routing and forwarding algorithms in DTN, but few of them have explicitly address the energy issue. In this paper, we propose n-epidemic routing protocol, an energy-efficient routing protocol for DTN. The n-epidemic routing protocol is based on the reasoning that in order to reach a large audiences with low number of transmissions, it is better to transmit only when the number of neighbors reaching a certain threshold. We compare the delivery performance of n-epidemic routing protocol with basic epidemic routing protocol using both analytical approach and empirical approach with real experimental dataset. The experiment shows that n-epidemic routing protocol can increase the delivery performance of basic epidemic-routing by 434% averagely.

[1]  Donald F. Towsley,et al.  LOPP: A Location Privacy Protected Anonymous Routing Protocol for Disruption Tolerant Network , 2010, IEICE Trans. Inf. Syst..

[2]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.

[3]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[4]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[6]  Ellen W. Zegura,et al.  Controlling the mobility of multiple data transport ferries in a delay-tolerant network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  Donald F. Towsley,et al.  Performance Modeling of Epidemic Routing , 2006, Networking.

[8]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[9]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[11]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[12]  Frank Stajano,et al.  Location Privacy in Pervasive Computing , 2003, IEEE Pervasive Comput..

[13]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[14]  Xiaoyan Hong,et al.  Mobility changes anonymity: new passive threats in mobile ad hoc networks: Research Articles , 2006 .

[15]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[16]  Wade Trappe,et al.  Enhancing Source-Location Privacy in Sensor Network Routing , 2005, ICDCS.

[17]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[18]  A. Kottas,et al.  Bayesian mixture modeling for spatial Poisson process intensities, with applications to extreme value analysis , 2007 .

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

[20]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

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

[22]  Xiaoyan Hong,et al.  Mobility changes anonymity: new passive threats in mobile ad hoc networks , 2006, Wirel. Commun. Mob. Comput..