SMART: A selective controlled-flooding routing for delay tolerant networks

Delay-Tolerant network (DTN) is a network in which no simultaneous end-to-end path exists. And the messages delivered in the DTN usually have large delivery latency due to network partition. These special characteristics make DTN routing a challenging problem. In this paper, we propose a DTN routing protocol SMART. SMART uses travel companions of the destinations (i.e. nodes that frequently meet the destination) to increase the delivery opportunities. In the first phase of SMART, a fixed number of copies of a message are injected into the network to forward the message to the companions of the destination. In the second phase of SMART, a companion of the destination only forwards the message to a fixed number of the destination’s companions. Our analysis and simulation results show that SMART has a higher delivery ratio and smaller delivery latency than opportunistically controlled-flooding schemes and has a significantly smaller routing overhead than pure flooding schemes.

[1]  Chunming Qiao,et al.  Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN) , 2006, IWCMC '06.

[2]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

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

[4]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[5]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[6]  Xiaoyan Hong,et al.  An agenda based mobility model , 2006, 39th Annual Simulation Symposium (ANSS'06).

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

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

[9]  Timur Friedman,et al.  DTN routing in a mobility pattern space , 2005, WDTN '05.

[10]  Maria Udén,et al.  Providing connectivity to the Saami nomadic community , 2002 .

[11]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

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

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

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

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

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

[17]  W. O. Kermack,et al.  A contribution to the mathematical theory of epidemics , 1927 .

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

[19]  Oliver Brock,et al.  MV routing and capacity building in disruption tolerant networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[21]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.