Abstract
Typical delay tolerant networks (DTNs) often suffer from long and variable delays, frequent connectivity disruptions, and high bit error rates. In DTNs, the design of an efficient routing algorithm is one of the key issues. The existing methods improve the accessibility probability of the data transmission by transmitting many copies of the packet to the network, but they may cause a high network overhead. To address the tradeoff between a successful delivery ratio and the network overhead, we propose a DTN routing algorithm based on the Markov location prediction model, called the spray and forward routing algorithm (SFR). Based on historical information of the nodes, the algorithm uses the second-order Markov forecasting mechanism to predict the location of the destination node, and then forwards the data by greedy routing, which reduces the copies of packets by spraying the packets in a particular direction. In contrast to a fixed mode where a successful-delivery ratio and routing overhead are contradictory, a hybrid strategy with multi-copy forwarding is able to reduce the copies of the packets efficiently and at the same time maintain an acceptable successful-delivery ratio. The simulation results show that the proposed SFR is efficient enough to provide better network performance than the spray and wait routing algorithm, in scenarios with sparse node density and fast mobility of the nodes.
Similar content being viewed by others
References
Leguay J, Friedman T, Cunan V. DTN routing in a mobility pattern space. In: Proceeding of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. New York: ACM Press, 2005. 276–283
Jain S, Fall K, Patra R. Routing in a delay tolerant network. In: Proc. ACM SIGCOMM, 2004
Lu X F, Hui P, Towsley D, et al. LOPP: A location privacy protected anonymous routing protocol for disruption tolerant network. IEICE Trans Inf Syst, 2010, E93-D: 503–509
Yoon H, Kim J W, Ott M, et al. Mobility emulator for DTN and MANET applications. In: Proceedings of the 4th ACM International Workshop on Experimental Evaluation and Characterization. Beijing, China, 2009. 51–58
Costa P, Mascolo C, Musolesi M, et al. Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. J Select Areas Commun, 2008, 26: 748–760
Spyropoulos T, Psounis K, Raghavendra C S, et al. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In: Proceedings of ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN), 2005. 252–259
Tang L, Hong X Y, Zheng Q W, et al. SMART: A selective controlled-flooding routing for delay tolerant networks. In: International Conference on Broadband Communications, Networks, and Systems (Broadnets 2007), Raleigh, NC, 2007. 356–365
Yang P, Chuah M. Performance evaluations of data-centric information retrieval schemes for DTNs. Computer Networks: The Int J Comput Telecommun Netw, 2009, 53: 541–555
Zhang X, Neglia G, Kurose J, et al. Performance modeling of epidemic routing. Comput Netw, 2007, 51: 2867–2891
Keränen A, Ott J. Increasing reality for DTN protocol simulations. Technical Report, Helsinki University of Technology, Networking Laboratory, July 2007
Song L B, Kotz D, Ja I R, et al. Evaluating location predictors with extensive Wi2Fi mobility data. In: Proceedings of INFOCOM. Hong Kong: IEEE, 2004. 1414–1424
Li Z, Shen H Y. Utility-based distributed routing in intermittently connected networks. In: 37th International Conference on Parallel Processing, Portland, Oregon, USA, 2008. 604–611
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dang, F., Yang, X. & Long, K. Spray and forward: Efficient routing based on the Markov location prediction model for DTNs. Sci. China Inf. Sci. 55, 433–440 (2012). https://doi.org/10.1007/s11432-011-4345-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-011-4345-1