Skip to main content
SpringerLink
Log in

Contention aware mobility prediction routing for intermittently connected mobile networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

This paper introduces a novel multi-copy routing protocol, called predict and forward (PF), for delay tolerant networks, which aims to explore the possibility of using mobile nodes as message carriers for end-to-end delivery of the messages. With PF, the message forwarding decision is made by manipulating the probability distribution of future inter-contact and contact durations based on the network status, including wireless link condition and nodal buffer availability. In particular, PF is based on the observations that the node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. We implemented the proposed protocol and compared it with a number of existing encounter-based routing approaches in terms of delivery delay, delivery ratio, and the number of transmissions required for message delivery. The simulation results show that PF outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. DTN Research Group (DTNRG). http://www.dtnrg.org.

  2. Broch, J., Maltz, D. A., Johnson, D. B., Y.-C. Hu, Y. -Y, & Jetcheva, J. (1998). A performance comparison of multi-hop wireless ad hoc network routing protocols. In ACM MobiCom (pp. 85–97).

  3. Merugu, S., Ammar, M. H., & Zegura, E. W. (2004). Routing in space and time in networks with predictable mobility. Technical Report, Georgia Institute of Technology.

  4. Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. In ACM SIGCOMM (pp. 145–157).

  5. Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., Durst, B., & Scott, K. (2003). Delay-tolerant networking:an approach to interplanetary internet. IEEE Communications Magazine, 41, 128–136.

    Article  Google Scholar 

  6. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially-connected ad hoc networks. Duke University, Tech. Rep. CS-200006.

  7. Tseng, Y., Ni, S., Chen, Y., & Sheu, J. (1999). The broadcast storm problem in a mobile ad hoc network. In ACM/IEEE MobiCom (pp. 151–162).

  8. Spyropoulous, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In ACM WDTN (pp. 252–259).

  9. Lindgren, A., Doria A., & Schelen O. (2004). Probabilistic routing in intermittently connected networks. Lecture Nodes in Computer Science, 3126, 239–254.

    Google Scholar 

  10. Balasubramanian, A., Levine, B. N., & Venkataramani, A. (2010). Replication routing in DTNs: A resource allocation approach. IEEE/ACM Transactions on Networking, 18(2), 596–609.

    Article  Google Scholar 

  11. Elwhishi, A. & Ho, P. (2009). SARP—A novel multi-copy routing protocol for intermittently connected mobile networks. In IEEE GLOBECOM (pp. 4482–4488).

  12. Yuan, Q., Cardei I., & Wu, J. (2012). An efficient prediction-based routing protocol in disruption-tolerant networks. IEEE Transactions on Parallel and Distributed Systems, 23(1), 19–31.

    Article  Google Scholar 

  13. Erramilli, V., Crovella, M., Chaintreau, A. , & Diot, C. (2008). Delegation forwarding. In ACM MobiHoc (pp. 251–260).

  14. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The single-copy case. IEEE/ACM Transactions on Networking, 16(1), 63–76.

    Article  Google Scholar 

  15. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking, 16(1), 77–90.

    Article  Google Scholar 

  16. Nelson, S., Bakht, M., Kravets, R., & Harris, A. (2009). Encounter: Based routing in DTNs. SIGMOBILE Mobile Computing and Communications Review, 13(1), 56–59.

    Article  Google Scholar 

  17. Jones, E., Lily, L., Schmidke, J. K., & Ward, P. (2007). Practical routing in delay-tolerant networks. IEEE Transactions on Mobile Computing, 6(8), 943–959.

    Article  Google Scholar 

  18. Ling, S. & Wei, W. (2009). Feedback adaptive routing algorithm for DTN. In WRI International Conference on Communications and Mobile Computing, CMC, (Vol. 2, pp. 267–271).

  19. Erramilli, V., & Crovella, M. (2008). Forwarding in opportunistic networks with resource constraints. In ACM CHANTS (pp. 41–48).

  20. Li, Z., & Shen, H. (2008). Utility-based distributed routing in intermittently connected networks. InICPP (pp. 604–611).

  21. Musolesi, M., & Mascolo, C. (2009). CAR: Context-aware adaptive routing for delay-tolerant mobile netwoks. IEEE Transactions on Mobile Computing, 8(2), 246–260.

    Article  Google Scholar 

  22. Elwhishi, A., Ho, P., Naik, K., & Shihadda, B. (2010). ARBR: Adaptive reinforcement-based routing for DTNs. In IEEE WiMob (pp. 376–385).

  23. Samuel, H., Zhuang, W., & Preiss, B. (2009). DTN based dominating set routing for MANET in heterogeneous wireless networking. ACM Mobile Networks and Applications, 14(2), 154–164.

    Article  Google Scholar 

  24. Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2007). Impact of human mobility on opportunistic forwarding algorithms. IEEE Transactions on Mobile Computing, 6(6), 606–620.

    Article  Google Scholar 

  25. Spyropoulos, T., Turletti, T., & Obraczka, K. (2009). Routing in delay-tolerant networks comprising heterogeneous node populations. IEEE Transactions on Mobile Computing, 8(8), 1132–1147.

    Article  Google Scholar 

  26. DTN java simulator, http://people.ee.ethz.ch/spyropot/dtnsim.html.

  27. Liao, Y., Zhang, Z., Ryu, B., & Gao, L. (2007). Cooperative robust forwarding scheme in DTNs using erasure coding. In IEEE MILCOM (pp.1917–1923).

  28. Spyropoulos, T., Rais, R., Turletti, T., Obraczka, K., & Vasilakos, A. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349–2370.

    Article  Google Scholar 

  29. Dvir, A., & Vasilakos, A. (2010). Backpressure-based routing protocol for DTNs. In SIGCOMM (pp. 405–406).

  30. Alresaini, A., Sathiamoorthy, M., Krishnamachari, B., & Neely, M. (2012). Backpressure with Adaptive Redundancy (BWAR). In INFOCOM (pp. 2300–2308).

  31. Zeng, Y., Xiang, K., Li, D., & Vasilakos, A. V. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.

    Article  Google Scholar 

  32. Jindal, A., & Psounis, K. (2009). Contention-aware performance analysis of mobility-assisted routing. IEEE Transactions on Mobile Computing, 8(2), 145–161.

    Article  Google Scholar 

  33. Groenevelt, R., Nain, P., & Koole, G. (2005). The message delay in mobile ad hoc networks. Performance Evaluation, 62(1–4), 210–228.

    Article  Google Scholar 

  34. Akkouchi, M. (2008). On the convolution of exponential distributions. Journal of Chungcheong Mathematical Society, 21(4), 501–510.

    Google Scholar 

  35. Karagiannis, T., Boudec, J., & Vojnović, M. (2010). Power law and exponential decay of intercontact times between mobile devices. IEEE Transactions on Mobile Computing, 9(10), 1377–1390.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada

    Ahmed Elwhishi & Pin-Han Ho

  2. Computer, Electrical, Math Sciences and Engineering, KAUST, Thuwal, Saudi Arabia

    Basem Shihada

Authors
  1. Ahmed Elwhishi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pin-Han Ho
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Basem Shihada
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ahmed Elwhishi.

Electronic supplementary material

Below is the link to the electronic supplementary material.

PDF (26 KB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elwhishi, A., Ho, PH. & Shihada, B. Contention aware mobility prediction routing for intermittently connected mobile networks. Wireless Netw 19, 2093–2108 (2013). https://doi.org/10.1007/s11276-013-0588-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-013-0588-7

Keywords

Search

Navigation