Communication capacity-based message exchange mechanism for delay-tolerant networks

Delay-tolerant networks (DTNs) are wireless networks where connectivity is sporadic because of node mobility, wireless signal blockage, sleep schedules, and power outages. The absence of contemporary routes between nodes can significantly delay message delivery. To accomplish data delivery in such challenging environments, researchers have proposed the use of store-carry-forward protocols, according to which a node stores a message and carries it until a forwarding opportunity arises by encountering another appropriate node. Since the encounter duration follows the power-law or exponential distribution mostly being short, the message exchange mechanism should avoid message losses. In this paper, we propose a communication capacity-based message exchange mechanism (CCME) that extends the existing DTN routing protocols. With CCME, the communication capacity is estimated by using both predicted encounter duration and communication bandwidth. Predicting encounter duration and estimating communication bandwidth are challenging issues. In this paper, we mainly focus on predicting encounter duration. We present a statistical method of predicting encounter duration to show the baseline for encounter duration estimation, and propose a real-time estimation mechanism for encounter duration. Our mechanism can be fine-tuned either to minimize the average delivery delay or to maximize the average delivery rate. The simulation results show that CCME successfully approximates the communication capacity. The performance of the existing protocols increases significantly with CCME.

[1]  J. Crowcroft,et al.  Bubble Rap: Forwarding in small world DTNs in ever decreasing circles , 2007 .

[2]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[3]  Vikram Srinivasan,et al.  PeopleNet: engineering a wireless virtual social network , 2005, MobiCom '05.

[4]  Wee-Seng Soh,et al.  A Comprehensive Study of Bluetooth Signal Parameters for Localization , 2007, 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications.

[5]  Ravi Mazumdar,et al.  Scaling laws for capacity and delay in wireless ad hoc networks with random mobility , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[6]  Upamanyu Madhow,et al.  A Reaction-Diffusion Model for Epidemic Routing in Sparsely Connected MANETs , 2010, 2010 Proceedings IEEE INFOCOM.

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

[8]  Injong Rhee,et al.  Routing performance analysis of human-driven delay tolerant networks using the truncated levy walk model , 2008, MobilityModels '08.

[9]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

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

[11]  Kevin Curran,et al.  Disruption Tolerant Networking , 2008, Comput. Inf. Sci..

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

[13]  Hojung Cha,et al.  Autonomous Management of Everyday Places for a Personalized Location Provider , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

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

[15]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

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

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

[18]  Pan Hui,et al.  Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding , 2005 .

[19]  Thrasyvoulos Spyropoulos,et al.  Optimal Buffer Management Policies for Delay Tolerant Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

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

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

[22]  Yuan Li,et al.  Research challenges and applications for underwater sensor networking , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

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

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

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

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

[27]  Injong Rhee,et al.  DTN routing strategies using optimal search patterns , 2008, CHANTS '08.

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

[29]  David Lazer,et al.  Inferring friendship network structure by using mobile phone data , 2009, Proceedings of the National Academy of Sciences.

[30]  Matteo Migliavacca,et al.  A Context and Content-Based Routing Protocol for Mobile Sensor Networks , 2009, EWSN.

[31]  I. Yeom,et al.  Minimizing the Impact of Buffer Overflow in DTN , 2008 .

[32]  Thierry Turletti,et al.  Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations , 2009, IEEE Transactions on Mobile Computing.

[33]  Qinghua Li,et al.  Routing in Socially Selfish Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[34]  Acm Sigmobile MobiHoc'09 : proceedings of the tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing : New Orleans, Luisiana, USA, May 18-21, 2009 , 2009 .

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

[36]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.