Abstract
In this paper, we analyze the problem of context adaptation in delay and disruption tolerant networks (DTNs). Initially, we performed experiments with well-known routing protocols to evaluate how much distinct configurations impact their performance. The results show that the performance is highly configuration dependent and improper configuration can lead to a performance up to 506.6 % worse than the best configuration tested. This motivates us to propose CARTOON (context-aware routing protocol for opportunistic networks), a novel routing protocol for DTNs based on the concept of context-adaptation. We evaluate CARTOON through simulations and the results show that our propose outperformed other well-known protocols, exhibiting results that are, on average, at 95 % of the computed optimum delivery rate.
Similar content being viewed by others
Notes
Notice that, while spray-and-wait limits the dissemination by imposing a limit on the number of copies for each message, it is still epidemic in nature. While the limit of copies has not been reached, spray-and-wait continues to disseminate epidemically, disregarding any other information.
References
Abdelkader T, Naik K, Nayak A, Goel N, Srivastava V (2016) A performance comparison of delay-tolerant network routing protocols. IEEE Network pp 46–53
Balasubramanian A, Levine B, Venkataramani A (2007) DTN routing as a resource allocation problem. In: Proceedings of the ACM SIGCOMM, Kyoto, Japan, pp 373–384
Banerjee N, Corner M, Towsley D, Levine BN (2008) CRAWDAD trace umass/diesel/transfer/fall2007 (v. 2008-09-14). Downloaded from http://crawdad.cs.dartmouth.edu/umass/diesel/transfer/fall2007
Benamar M, Ahnana S, Saiyari FZ, Benamar N, El Ouadghiri MD, Bonnin JM (2014) Study of vdtn routing protocols performances in sparse and dense traffic in the presence of relay nodes. J Mob Multimed 10(1 & 2):78–93, http://dl.acm.org/citation.cfm?id=2638623.2638630
Benamar N, Singh KD, Benamar M, Ouadghiri DE, Bonnin JM (2014) Routing protocols in vehicular delay tolerant networks: a comprehensive survey. Computer Communications
Burgess J, Gallagher B, Jensen D, Levine BN (2006) MaxProp: Routing for vehicle-based disruption-tolerant networks. In: Proceedings of IEEE Infocom, pp 1–11
Cao Y, Sun Z (2013) Routing in delay/disruption tolerant networks: A taxonomy, survey and challenges. Communications Surveys & Tutorials, IEEE 15(2):654–677
Daly EM, Haahr M (2009) Social network analysis for information flow in disconnected delay-tolerant manets. IEEE Transactions on Mobile Computing 8(5):606–621
Dini G, Lo Duca A (2012) Towards a reputation-based routing protocol to contrast blackholes in a delay tolerant network. Ad Hoc Networks 10(7):1167–1178
Ekman F, Keränen A, Karvo J, Ott J (2008) Working day movement model. In: Proceeding of the 1st ACM SIGMOBILE workshop on Mobility models, ACM, MobilityModels ’08, pp 33–40
Huang TK, Lee CK, Chen LJ (2010) PRoPHET+: An adaptive PRoPHET-Based routing protocol for opportunistic network. In: 2010 24th IEEE International Conference on Advanced Information Networking and Applications, IEEE, pp 112–119
Iranmanesh S, Chin KW (2015) A novel mobility-based routing protocol for semi-predictable disruption tolerant networks. International Journal of Wireless Information Networks pp 138–146
Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. In: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM), pp 145–158
Karvo J, Ott J (2008) Time scales and delay-tolerant routing protocols. In: Proceedings of the third ACM workshop on Challenged networks, ACM, New York, NY, USA, CHANTS ’08, pp 33–40
Keränen A, Ott J, Kärkkäinen T (2009) The ONE Simulator for DTN Protocol Evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, ICST, Simutools ’09, pp 55:1–55:10
Kotz D, Henderson T, Abyzov I, Yeo J (2005) CRAWDAD trace set dartmouth/campus/movement (v. 2005-03-08). Downloaded from http://crawdad.cs.dartmouth.edu/dartmouth/campus/movement
Lindgren A, Doria A, Schelén O (2003) Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing and Communications Review 7(3):19–20
Miranda ES, Naves JF, Moraes IM, Velloso PB (2012) A joint custody-based forwarding policy for delay-tolerant networks. In: Global Information Infrastructure and Networking Symposium, pp 1–6
Musolesi M, Mascolo C (2009) Car: Context-aware adaptive routing for delay-tolerant mobile networks. IEEE Transactions on Mobile Computing 8(2):246–260
Oliveira E, Albuquerque C (2009) NECTAR: A DTN routing protocol based on neighborhood contact history. In: Proceedings of the 24th ACM Symposium on Applied Computing—SAC09, ACM Press, pp 359–365
Perkins CE, Bhagwat P (1994) Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. ACM SIGCOMM Computer Communication Review 24(4):234–244
Sadiq U, Kumar M (2011) Proximol: Proximity and mobility estimation for efficient forwarding in opportunistic networks. In: Mobile Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference on, IEEE, pp 312–321
Sandulescu G, Nadjm-Tehrani S (2008) Opportunistic dtn routing with window-aware adaptive replication. In: Proceedings of the 4th Asian Conference on Internet Engineering, ACM, New York, NY, USA, AINTEC ’08, pp 103–112
Scott J, Gass R, Crowcroft J, Hui P, Diot C, Chaintreau A (2009) CRAWDAD trace cambridge/haggle/imote/infocom2006 (v. 2009-05-29). Downloaded from http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote/infocom2006
Spyropoulos T, Psounis K, Raghavendra C (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: WDTN ’05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, ACM Press, New York, NY, USA, pp 252–259
Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Tech. Rep. CS-200006, Duke University
Vastardis N, Yang K (2013) Multi-phase socially-aware routing in distributed mobile social networks. In: Proceedings of the 9th International Wireless Communications and Mobile Computing Conference, pp 1353–1358
Wang Y, Zhang P, Liu T, Sadler C, Martonosi M (2007) CRAWDAD trace set princeton/zebranet/movement (v. 2007-02-14). Downloaded from http://crawdad.cs.dartmouth.edu/princeton/zebranet/movement
Zhang J, Luo G (2012) Adaptive spraying for routing in delay tolerant networks. Wireless Personal Communications 66(1):217–233
Zhu H, Dong M, Chang S, Zhu Y, Li M, Shen XS (2013) ZOOM: scaling the mobility for fast opportunistic forwarding in vehicular networks. In: Proceedings of the IEEE INFOCOM, pp 2832–2840
Zhu K, Li W, Fu X (2014) Smart: A social and mobile aware routing strategy for disruption tolerant networks. Vehicular Technology, IEEE Transactions on In Press
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by CNPq, CAPES, FAPERJ, TBE/ANEEL and CELESC/ANEEL.
Rights and permissions
About this article
Cite this article
de Oliveira, E.C.R., Silva, E.F., Passos, D. et al. Context-Aware Routing in Delay and Disruption Tolerant Networks. Int J Wireless Inf Networks 23, 231–245 (2016). https://doi.org/10.1007/s10776-016-0315-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10776-016-0315-2