Plankton: An efficient DTN routing algorithm

In this paper, we present an efficient routing algorithm, Plankton, for Delay/Disruptive Tolerant Network (DTN). Plankton utilizes replica control to reduce overhead and contact probability estimates to improve performance. Plankton has two major features. First, it uses a combination of both short-term bursty contacts and long-term association based statistics for contact prediction. Second, it dynamically adjusts replication quotas based on estimated contact probabilities and delivery probabilities. Our evaluation on extensive traces shows that Plankton achieves significantly better prediction accuracy than existing algorithms for contact probability prediction. In addition, we show that while Plankton incurs much lower communication overhead compared to Spray-and-Wait, MaxProp and RAPID with savings from 14% to 88%, it can also achieve similar if not better delivery ratios and latencies.

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

[2]  Yih-Chun Hu,et al.  CRAWDAD dataset rice/ad_hoc_city (v.2003-09-11) , 2003 .

[3]  Arun Venkataramani,et al.  Replication Routing in DTNs: A Resource Allocation Approach , 2010, IEEE/ACM Transactions on Networking.

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

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

[6]  Robin Kravets,et al.  Encounter-Based Routing in DTNs , 2009, INFOCOM.

[7]  Robin Kravets,et al.  Retiring Replicants: Congestion Control for Intermittently-Connected Networks , 2010, 2010 Proceedings IEEE INFOCOM.

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

[9]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Matthias Grossglauser,et al.  A parsimonious model of mobile partitioned networks with clustering , 2009, 2009 First International Communication Systems and Networks and Workshops.

[11]  Laurent Massoulié,et al.  The diameter of opportunistic mobile networks , 2007, CoNEXT '07.

[12]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.

[13]  Marcelo Dias de Amorim,et al.  The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing , 2009, IEEE INFOCOM 2009.

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

[15]  Jean-Yves Le Boudec,et al.  Traps and pitfalls of using contact traces in performance studies of opportunistic networks , 2012, 2012 Proceedings IEEE INFOCOM.

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

[17]  Jie Wu,et al.  Social feature-based multi-path routing in delay tolerant networks , 2012, 2012 Proceedings IEEE INFOCOM.

[18]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[19]  Boleslaw K. Szymanski,et al.  Friendship Based Routing in Delay Tolerant Mobile Social Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[20]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

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

[22]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[23]  T. Charles Clancy,et al.  Analysis of simple counting protocols for delay-tolerant networks , 2007, CHANTS '07.

[24]  Sajal K. Das,et al.  LeZi-update: an information-theoretic approach to track mobile users in PCS networks , 1999, MobiCom.

[25]  Boleslaw K. Szymanski,et al.  Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks , 2010, IEEE/ACM Transactions on Networking.

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

[27]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

[28]  Martin Vetterli,et al.  Locating nodes with EASE: last encounter routing in ad hoc networks through mobility diffusion , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[29]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[30]  Jie Wu,et al.  Predict and relay: an efficient routing in disruption-tolerant networks , 2009, MobiHoc '09.

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

[32]  Injong Rhee,et al.  Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.