Abstract
Delay Tolerant Networks (DTNs) are characterized by very long delay paths and frequent network partitions. In this paper, a novel E-Scheme is proposed which can be utilized by most of the existing routing approaches that employ the ‘probability to deliver’ metric. Providing there are n opportunities, the E-Scheme is to let the first (n − 1)/e opportunities go by (except for encountering the destination of messages) and then accept the first one to appear that is better than all of those. Meanwhile a probabilistic metric, called Two-Hop (TH) delivery predictability value, is presented here according to the small world theory. Our scheme has been evaluated using some existing approaches as well as the TH delivery predictability value and been shown to exhibit excellent performances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chaintreau, A., Jui, P., Crowcroft, J., Diot, C., Gass, R., Scott, J.: Impact of human mobility on the design of opportunistic forwarding algorithms. In: Proceedings of IEEE INFOCOM, Barcelona, ES (2006)
Song, L., Kotz, D.: Evaluating opportunistic routing protocols with large realistic contact traces. In: ACM MobiCom workshop on Challenged Networks (2007)
Chen, L.-J., Yu, C.-H., Sun, T., Chen, Y.-C.: A hybrid routing approach for opportunistic networks. In: CHANTS 2006: Proceedings of the 2006 SIGCOMM workshop on Challenged networks, pp. 213–220 (2006)
Elizabeth, D., Mads, H.: Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs. In: MobiHoc 2007, pp. 32–40 (2007)
Muhammad, A., Robert, S.: The Impact of the Mobility Model on Delay Tolerant Networking Performance Analysis. In: Proceedings of the 40th Annual Simulation Symposium (2007)
Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks. Technical Report CS-2000-06, Duke University (2000)
Hui, P., Crowcroft, J.: Bubble rap: Forwarding insmall world dtns in ever decreasing circles. Technical Report UCAM-CL-TR-684, University of Cambridge (2007)
Fall, K.: A Delay-Tolerant Network Architecture for Challenged Internets. SIGCOMM (2003)
Lindgren, A., Doria, A.: Probabilistic routing protocol for intermittently connected networks. Technical report, draft-lindgren-dtnrg-prophet-01.txt, IETF Internet draft (2005)
Lindgren, A., Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review 7(3), 19–20 (2003)
Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: Maxprop: Routing for vehicle-based disruption-tolerant networking. In: Proc. Infocom 2006, vol. 4, pp. 1688–1698. IEEE, Los Alamitos (2006)
Dubois-Ferriere, H., GrossGlauser, M., And Verrerli, M.: Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In: Proc. MobiHoc 2003, pp. 257–266. ACM Press, New York (2003)
Musolesi, M., Hailes, S., Masxolo, C.: Adaptive routing for intermittently connected mobile ad hoc networks. In: Proc. WoWMoM 2005, pp. 183–189. IEEE, Los Alamitos (2005)
Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. In: SIGMOBILE Mobile Computing Communications Review (2003)
Chen, X., Murphy, A.L.: Enabling Disconnected Transitive Communication in Mobile Adhoc Networks. In: Workshop on Principles of Mobile Computing (August 2001)
Ross, S.M.: Introduction to Probability Models. 9. Elsevier, Amsterdam (2007)
Watts, D.J.: Small Worlds.: the dynamics of networks between order and randomness. Princeton University Press, Chichester (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, ZT., Qu, YG., Wang, QH., Zhao, BH. (2008). E-Scheme in Delay-Tolerant Networks. In: Ma, Y., Choi, D., Ata, S. (eds) Challenges for Next Generation Network Operations and Service Management. APNOMS 2008. Lecture Notes in Computer Science, vol 5297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88623-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-88623-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88622-8
Online ISBN: 978-3-540-88623-5
eBook Packages: Computer ScienceComputer Science (R0)