Skip to main content

Advertisement

SpringerLink
Log in

Primate-inspired adaptive routing in intermittently connected mobile communication systems

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

An intermittently connected mobile ad hoc network is a special type of wireless mobile network without fully connected path between the source and destination most of the time. In some related works on mobility models, the missing realism of mobility model has been discussed. However, very few routing protocols based on realistic mobility models have been proposed so far. In this paper, we present a primate-inspired mobility model for intermittently connected mobile networks. Such a mobility model can represent and reflect the mobile features of humans. Traditional routing schemes in intermittently connected mobile networks fail to integrate the mobility model with routing strategy to fully utilize the mobility features. To overcome such a drawback, we propose a new routing scheme called primate-inspired adaptive routing protocol (PARP), which can utilize the features of the primate mobility to assist routing. Furthermore, our proposed protocol can determine the number of message copies and the routing strategy based on the walking length of the mobility model. The predictions of the walking lengths are implemented by a particle filter based algorithm. Our results demonstrate that PARP can achieve a better performance than a few typical routing protocols for intermittently connected mobile ad hoc networks.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  1. Alresaini, M., Sathiamoorthy, M., Krishnamachari, B., & Neely, M. J. (2012). Backpressure with adaptive redundancy (BWAR). In Proceedings of IEEE, INFOCOM, (pp. 2300–2308). IEEE.

  2. Ariyakhajorn, J., Wannawilai, P., & Sathitwiriyawong, C. (2006). A comparative study of random waypoint and Gauss–Markov mobility models in the performance evaluation of manet. In International Symposium on communications and information technologies, ISCIT’06 (pp. 894–899). IEEE.

  3. Atkinson, R. P. D., Rhodes, C. J., Macdonald, D. W., & Anderson, R. M. (2002). Scale-free dynamics in the movement patterns of jackals. Oikos, 98(1), 134–140.

    Article  Google Scholar 

  4. Bettstetter, C., Resta, G., & Santi, P. (2003). The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2(3), 257–269.

    Article  Google Scholar 

  5. 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 

  6. Chiang, K.-H., & Shenoy, N. (2004). A 2-d random-walk mobility model for location-management studies in wireless networks. IEEE Transactions on Vehicular Technology, 53(2), 413–424.

    Article  Google Scholar 

  7. Dalu, S. S., Naskar, M. K., & Sarkar, C. K. (2008). Implementation of a topology control algorithm for manets using nomadic community mobility model. In IEEE Region 10 and the third international conference on industrial and information systems, ICIIS 2008 (pp. 1–5). IEEE.

  8. Doucet, A., et al. (2000). On sequential Monte Carlo sampling methods for Bayesian filtering. Statistics and computing, 10(3), 197–208.

    Google Scholar 

  9. Dubois-Ferriere, H., Grossglauser, M., & Vetterli, M. (2003). Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages. In Proceedings of the 4th ACM international Symposium on mobile ad hoc networking and computing (pp. 257–266). ACM.

  10. Dvir, A., & Vasilakos, A. V. (2010). Backpressure-based routing protocol for DTNs. ACM SIGCOMM Computer Communication Review, 40, 405–406.

    Google Scholar 

  11. Ekici, E., Yaoyao, G., & Bozdag, D. (2006). Mobility-based communication in wireless sensor networks. IEEE Communications Magazine, 44(7), 56.

    Article  Google Scholar 

  12. Fang, Y. (2003). Movement-based mobility management and trade off analysis for wireless mobile networks. IEEE Transactions on Computers, 52(6), 791–803.

    Article  Google Scholar 

  13. Gustafsson, F., Gunnarsson, F., Bergman, N., Forssell, U., Jansson, J., Karlsson, R., et al. (2002). Particle filters for positioning, navigation, and tracking. IEEE Transactions on Signal Processing, 50(2), 425–437.

    Article  Google Scholar 

  14. Hong, X., Gerla, M., Pei, G., & Chiang, C.-C. (1999). A group mobility model for ad hoc wireless networks. In Proceedings of the 2nd ACM international workshop on modeling, analysis and simulation of wireless and mobile systems (pp. 53–60). ACM.

  15. Hsu, W., Spyropoulos, T., Psounis, K., & Helmy, A. (2007). Modeling time-variant user mobility in wireless mobile networks. In 26th IEEE international conference on computer communications INFOCOM 2007 (pp. 758–766). IEEE.

  16. Hwang, D., & Kim, D. (2008). DFR: Directional flooding-based routing protocol for underwater sensor networks. In OCEANS 2008 (pp. 1–7). IEEE.

  17. Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. (2002). Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. In ACM Sigplan Notices (Vol. 37, pp. 96–107). ACM.

  18. Leguay, J., Friedman, T., & Conan, V. (2005). DTN routing in a mobility pattern space. In Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking (pp. 276–283). ACM.

  19. Li, Z., & Shen, H. (2008). Probabilistic routing with multi-copies in delay tolerant networks. In 28th international conference on distributed computing systems workshops, ICDCS’08 (pp. 471–476). IEEE.

  20. Lin, Y., Li, B., & Liang, B. (2008). Stochastic analysis of network coding in epidemic routing. IEEE Journal on Selected Areas in Communications, 26(5), 794–808.

    Article  Google Scholar 

  21. Lindgren, A., Doria, A., & Schelén, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19–20.

    Article  Google Scholar 

  22. Liu, Y., Xiong, N., Zhao, Y., Vasilakos, A. V., Gao, J., & Jia, Y. (2010). Multi-layer clustering routing algorithm for wireless vehicular sensor networks. IET Communications, 4(7), 810–816.

    Article  Google Scholar 

  23. Mathurapoj, A., Pornavalai, C., & Chakraborty, G. (2009). Fuzzy-spray: Efficient routing in delay tolerant ad-hoc network based on fuzzy decision mechanism. In IEEE international conference on fuzzy systems, FUZZ-IEEE 2009 (pp. 104–109). IEEE.

  24. Musolesi, M., & Mascolo, C. (2006). A community based mobility model for ad hoc network research. In Proceedings of the 2nd international workshop on multi-hop ad hoc networks: From theory to reality (pp. 31–38). ACM.

  25. Psounis, K., & Raghavendra, C. S. (2004). Multiple-copy routing in intermittently connected mobile networks. Technical report CENG-2004-12, USC.

  26. Ramanathan, R., & Steenstrup, M. (1998). Hierarchically-organized, multihop mobile wireless networks for quality-of-service support. Mobile Networks and Applications, 3(1), 101–119.

    Article  Google Scholar 

  27. Ramjee, R., Varadhan, K., Salgarelli, L., Thuel, S. R., Wang, S.-Y., & La Porta, T. (2002). Hawaii: A domain-based approach for supporting mobility in wide-area wireless networks. IEEE/ACM Transactions on Networking, 10(3), 396–410.

    Article  Google Scholar 

  28. Rhee, I., Shin, M., Hong, S., Lee, K., Kim, S. J., & Chong, S. (2011). On the levy-walk nature of human mobility. IEEE/ACM Transactions on Networking (TON), 19(3), 630–643.

    Article  Google Scholar 

  29. Sánchez, M., & Manzoni, P. (2001). Anejos: A java based simulator for ad hoc networks. Future Generation Computer Systems, 17(5), 573–583.

    Article  Google Scholar 

  30. Sasson, Y., Cavin, D., & Schiper, A. (2003). Probabilistic broadcast for flooding in wireless mobile ad hoc networks. In Wireless communications and networking, WCNC 2003 (Vol. 2, pp. 1124–1130). IEEE.

  31. Shah, R. C., Roy, S., Jain, S., & Brunette, W. (2003). Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks, 1(2), 215–233.

    Article  Google Scholar 

  32. Shin, M., Hong, S., & Rhee, I. (2008). DTN routing strategies using optimal search patterns. In Proceedings of the third ACM workshop on challenged networks (pp. 27–32). ACM.

  33. Shlesinger, M. F., Klafter, J., & Wong, Y. M. (1982). Random walks with infinite spatial and temporal moments. Journal of Statistical Physics, 27(3), 499–512.

    Article  MathSciNet  MATH  Google Scholar 

  34. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2004). Single-copy routing in intermittently connected mobile networks. In First annual IEEE communications society conference on sensor and ad hoc communications and networks, IEEE SECON 2004 (pp. 235–244). IEEE.

  35. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2007). Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Fifth annual IEEE international conference on pervasive computing and communications workshops, PerCom Workshops’ 07 (pp. 79–85). IEEE.

  36. 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 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  39. Vahdat, A., Becker, D., et al. (2000) Epidemic routing for partially connected ad hoc networks. Technical report.

  40. Vahdat, A., Becker, D., et al. (2000). Epidemic routing for partially connected ad hoc networks. Technical report CS-200006, Duke University.

  41. Viswanathan, G. M., Afanasyev, V., Buldyrev, S. V., Murphy, E. J., Prince, P. A., & Stanley, H. E. (1996). Lévy flight search patterns of wandering albatrosses. Nature, 381(6581), 413–415.

    Article  Google Scholar 

  42. Vo, B.-N., Singh, S., & Doucet, A. (2005). Sequential monte carlo methods for multitarget filtering with random finite sets. IEEE Transactions on Aerospace and Electronic Systems, 41(4), 1224–1245.

    Article  Google Scholar 

  43. Xue, J., Fan, X., Cao, Y., Fang, J., & Li, J. (2009). Spray and wait routing based on average delivery probability in delay tolerant network. In International conference on networks security, wireless communications and trusted computing, NSWCTC’09 (Vol. 2, pp. 500–502). IEEE.

  44. Yang, J., & Fei, Z. (2010). Hdar: Hole detection and adaptive geographic routing for ad hoc networks. In International conference on computer communications and networks, ICCCN'10 (pp. 1–6). IEEE.

  45. Yang, J., & Fei, Z. (2013). Broadcasting with prediction and selective forwarding in vehicular networks. International Journal of Distributed Sensor Networks. doi:10.1155/2013/309041.

  46. Yuan, S., Zhu, Y., Wu, X., & Zeng, M. (2008). Mobility assisted routing strategy (MARS) for hybrid ad hoc networks. In Wireless communications and mobile computing conference, IWCMC’08 (pp. 292–297). IEEE.

  47. 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 

  48. Zhang, X., Neglia, G., Kurose, J., & Towsley, D. (2007). Performance modeling of epidemic routing. Computer Networks, 51(10), 2867–2891.

    Article  MATH  Google Scholar 

  49. Zhang, Y., & Fromherz, M. (2006). A robust and efficient flooding-based routing for wireless sensor networks. Journal of Interconnection Networks, 7(04), 549–568.

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported in part by the U.S. National Science Foundation (IIS-0915862) and the University of Alabama Research Grant Committee (14242-214251-200). Any idea presented in this paper does not necessarily reflect the opinions of the sponsors.

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, California State University San Bernardino, San Bernardino, CA, 92407, USA

    Qingquan Sun

  2. Department of Electrical and Computer Engineering, University of Alabama, Tuscaloosa, AL, 35487, USA

    Fei Hu & Yeqing Wu

  3. Department of Information and Communication Engineering, Tongji University, Shanghai, 201804, China

    Xinlin Huang

Authors
  1. Qingquan Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fei Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yeqing Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xinlin Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qingquan Sun.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, Q., Hu, F., Wu, Y. et al. Primate-inspired adaptive routing in intermittently connected mobile communication systems. Wireless Netw 20, 1939–1954 (2014). https://doi.org/10.1007/s11276-014-0719-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-014-0719-9

Keywords

Search

Navigation