Abstract
It is challenging to deliver messages in a network where no instant end-to-end path exists, so called delay-tolerant network (DTN). Node encounters are used for message forwarding. In this paper, we propose a DTN routing protocol SMART. SMART utilizes the travel companions of the destinations (i.e. nodes that frequently meet the destination) to increase the delivery opportunities while limiting message overhead to a bounded number. Our approach differs from related work in that it does not propagate node encounter history nor the delivery probabilities derived from the encounter history. In SMART, a message source injects a fixed number of message copies into the network to forward the message to a companion of the destination, which 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 a smaller delivery latency than the schemes that only use controlled opportunistically-forwarding mechanism and has a significantly smaller routing overhead than a pure flooding scheme.














Similar content being viewed by others
References
Juang P, Oki H, YW, et al. (2002) Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet. In: Proceedings of ASPLOS-X
Doria A, Udn M, Pandey DP (2002) Providing connectivity to the Saami Nomadic community. In: Proc. 2nd int. conf. on open collaborative design for sustainable innovation
Johnson DB, Maltz DA (1996) Dynamic source routing in ad hoc wireless networks. In: Mobile computing. pp 153–181
Perkins C, Royer E (1999) Ad hoc on-demand distance vector routing. In: 2nd IEEE workshop on mobile computing systems and applications
Vahdat A, Becker D (2000) Epidemic routing for partially-connected ad hoc networks. Technical report, Duke University
Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. In: ACM sigcomm
Wang Y, Jain S, Martonosi M, Fall K (2005) Erasure coding based routing in opportunistic networks. In: ACM SIGCOMM workshop on delay tolerant networking
Spyropoulos T, Psounis K, Raghavendra CS (2004) Single-copy routing in intermittently connected mobile networks. In: Proc. of IEEE Secon ’04
Spyropoulos T, Psounis K, Raghavendra C (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: WDTN ’05, pp 252–259
Spyropoulos T, Psounis K, Raghavendra CS (2007) Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In: PERCOMW ’07. Washington, DC, USA, pp 79–85
Lindgren A, Doria A, Schelen O (2003) Probabilistic routing in intermittently connected networks. In: SIGMOBILE mobile computing communications review. July, pp 7:19–20
Burgess J, Gallagher B, Jensen D, Levine B (2006) Maxprop: routing for vehicle-based disruption-tolerant networking. In: IEEE infocom
Burns B, Brock O, Levine BN (2005) MV routing and capacity building in disruption tolerant networks. In: IEEE infocom
Musolesi M, Hailes S, Mascolo C (2005) Adaptive routing for intermittently connected mobile ad hoc networks. In: WOWMOM’05
Leguay J, Friedman T, Conan V (2005) DTN routing in a mobility pattern space. In: ACM SIGCOMM – workshop on delay tolerant networking and related topics (WDTN-05)
Ghosh J, Ngo HQ, Qiao C (2006) Mobility profile based routing within intermittently connected mobile ad hoc networks (icman). In: IWCMC ’06. pp 551–556
Zhao W, Ammar M, Zegura E (2004) A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: MobiHoc
Tuduce C, Gross T (2005) A mobility model based on wlan traces and its validation. In: INFOCOM 2005. IEEE, pp 664–674
Kim M, Kotz D, Kim S (2006) Extracting a mobility model from real user traces. In: INFOCOM 2006, April
Hsu W, Spyropoulos T, Psounis K, Helmy A (2007) Modeling time-variant user mobility in wireless mobile networks. In: INFOCOM 2007. Anchorage, Alaska, March
Zhang X, Kurose JK, Levine BN, Towsley D, Zhang H (2007) Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing. In: MobiCom ’07. pp 195–206
Walker BD, Glenn JK, Clancy TC (2007) Analysis of simple counting protocols for delay-tolerant networks. In: CHANTS ’07. New York, NY, USA, pp 19–26
Shah R, Roy S, Jain S, Brunette W (2003) Data MULEs: modeling a three-tier architecture for sparse sensor networks. In: IEEE SNPA
Song L, Kotz DF (2007) Evaluating opportunistic routing protocols with large realistic contact traces. In: CHANTS ’07. New York, NY, USA, pp 35–42
Tariq MMB, Ammar M, Zegura E (2006) Message ferry route design for sparse ad hoc networks with mobile nodes. In: MobiHoc ’06. pp 37–48
Kermack W, McKendrick A (1927) A contribution to the mathematical theory of epidemics. In: Proceedings of the royal society of London series A. pp 700–721
Scalable Network Technologies (SNT) Qualnet network simulator. http://www.qualnet.com/
Zheng Q, Hong X, Liu J (2006) An agenda based mobility model. In: 39th annual simulation symposium
National Household Travel Survey (2001) http://nhts.ornl.gov/2001/index.shtml
Author information
Authors and Affiliations
Corresponding author
Additional information
The work is an extension to the paper presented at the International Conference on Broadband Communications, Networks, and Systems (Broadnets 2007), Raleigh, NC, Sept 2007.
Rights and permissions
About this article
Cite this article
Tang, L., Zheng, Q., Liu, J. et al. Selective Message Forwarding in Delay Tolerant Networks. Mobile Netw Appl 14, 387–400 (2009). https://doi.org/10.1007/s11036-008-0096-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11036-008-0096-7