Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

An Opportunistic Routing Protocol for Mobile Ad Hoc Networks Based on Stable Ideology

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In mobile ad hoc networks (MANETs), traditional routing protocols send packets along pre-determined paths which are vulnerable in dealing with unreliable and unpredictable wireless medium. The main difference between the opportunistic routing and the traditional routing is that the former can employ several lossy broadcast links to support a reliable transmission. In order to improve the performance of opportunistic routing, nowadays, the tendency is to blend the idea of stable routing into opportunistic routing algorithms more or less. Just based on this ideology, this paper presents a stable ideology-based opportunistic routing (SIOR) for MANETs. Different from the existing protocols for MANETs, in SIOR, the stable ideology is infused into every step. In this paper, SIOR is described in detail around three issues of opportunistic routing. The first issue is how to select the forwarders among the neighbors; the second one is how to communicate among these forwarders to select a relay; the last one is how and when to relay the packets. The novel contribution of this paper is in dealing with the third issue. The ultimate target is to adapt SIOR to the mobility of MANETs. And then, the theory analysis is depicted on the basis of probability theory to compare SIOR with several relevant mechanisms. Finally, we have implemented simulation experiments. The simulation results show SIOR has prominent performance than other relevant protocols.

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
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  1. Ad, M., Perkins, C. E., & Das, S. R. (2000). Ad hoc on-demand distance vector (AODV) routing. In IETF RFC (p. 90).

  2. Biswas, S., & Morris, R. (2005). ExOR: opportunistic multi-hop routing for wireless networks. In ACM SIGCOMM computer communication review (Vol. 35, pp. 133–144), ACM.

  3. Cacciapuoti, A. S., Caleffi, M., & Paura, L. (2009). A theoretical model for opportunistic routing in ad hoc networks. In International conference on ultra modern telecommunications and workshops (pp. 1–7).

  4. Cacciapuoti, A. S., Caleffi, M., & Paura, L. (2010). Optimal constrained candidate selection for opportunistic routing. In Global telecommunications conference (pp. 1–5).

  5. Cerdà-Alabern, L., Darehshoorzadeh, A., & Pla, V. (2013). Optimum node placement in wireless opportunistic routing networks. Ad Hoc Networks, 11(8), 2273–2287.

    Article  Google Scholar 

  6. Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007). Trading structure for randomness in wireless opportunistic routing (vol. 37), ACM.

  7. De Couto, D. S., Aguayo, D., Bicket, J., & Morris, R. (2005). A high-throughput path metric for multi-hop wireless routing. Wireless Networks, 11(4), 419–434.

    Article  Google Scholar 

  8. Ding, Y., Xu, M., Tian, Y., Li, H., & Liu, B. (2016). A BER and 2-hop routing information-based stable geographical routing protocol in manets for multimedia applications. Wireless Personal Communications, 90(1), 3–32.

    Article  Google Scholar 

  9. Dubois-Ferrière, H., Grossglauser, M., & Vetterli, M. (2011). Valuable detours: Least-cost anypath routing. IEEE/ACM Transactions on Networking, 19(2), 333–346.

    Article  Google Scholar 

  10. Heissenbüttel, M., Braun, T., Bernoulli, T., & WäLchli, M. (2004). BLR: beacon-less routing algorithm for mobile ad hoc networks. Computer Communications, 27(11), 1076–1086.

    Article  Google Scholar 

  11. Hsu, C. J., Liu, H. I., & Seah, W. (2009). Economy: A duplicate free opportunistic routing. In Proceedings of the 6th international conference on mobile technology, application & systems (p. 17). ACM.

  12. Hsu, C. J., Liu, H. I., & Seah, W. K. G. (2011). Opportunistic routing—A review and the challenges ahead. Computer Networks, 55(15), 3592–3603.

    Article  Google Scholar 

  13. Jie, Z., Huang, C., Xu, L., Wang, B., Yang, W., & Chen, X. (2013). Opportunistic unicast and multicast routing protocol for vanet. Journal of Software Engineering and Applications, 06(6), 319–327.

    Article  Google Scholar 

  14. Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in ad hoc wireless networks. In Mobile computing (pp. 153–181). Springer.

  15. Karp, B., & Kung, H. T. (2000). GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th annual international conference on Mobile computing and networking (pp. 243–254). ACM.

  16. Katti, S., Rahul, H., Hu, W., Katabi, D., Médard, M., & Crowcroft, J. (2006). XORs in the air: Practical wireless network coding. In: ACM SIGCOMM computer communication review (Vol. 36, pp. 243–254). ACM.

  17. Ko, Y. B., & Vaidya, N. H. (2000). Location-aided routing (LAR) in mobile ad hoc networks. Wireless Networks, 6(4), 307–321.

    Article  MATH  Google Scholar 

  18. Liu, H., Zhang, B., Mouftah, H., Shen, X., & Ma, J. (2009). Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions. IEEE Communications Magazine, 47(12), 103–109.

    Article  Google Scholar 

  19. Lu, M., & Wu, J. (2009). Opportunistic routing algebra and its applications. In INFOCOM (pp. 2374–2382).

  20. Luk, C. P., Lau, W. C., & Yue, O. C. (2008). An analysis of opportunistic routing in wireless mesh network. In IEEE international conference on communications, 2008. ICC’08 (pp. 2877–2883), IEEE.

  21. Mazumdar, A. P., & Sairam, A. S. (2013). TOAR: Transmission-aware opportunistic ad hoc routing protocol. EURASIP Journal on Wireless Communications and Networking, 2013(1), 1–19.

    Article  Google Scholar 

  22. Rozner, E., Seshadri, J., Mehta, Y., & Qiu, L. (2009). SOAR: Simple opportunistic adaptive routing protocol for wireless mesh networks. IEEE Transactions on Mobile Computing, 8(12), 1622–1635.

    Article  Google Scholar 

  23. Tahooni, M., Darehshoorzadeh, A., & Boukerche, A. (2014). Mobility-based opportunistic routing for mobile ad-hoc networks. In: ACM symposium on performance evaluation of wireless ad hoc, sensor, ubiquitous networks (pp. 9–16).

  24. Wang, Z., Chen, Y., & Li, C. (2011). A new loop-free proactive source routing scheme for opportunistic data forwarding in wireless networks. IEEE Communications Letters, 15(11), 1184–1186.

    Article  Google Scholar 

  25. Wang, Z., Chen, Y., & Li, C. (2012). CORMAN: A novel cooperative opportunistic routing scheme in mobile ad hoc networks. IEEE Journal on Selected Areas in Communications, 30(2), 289–296.

    Article  Google Scholar 

  26. Wang, Z., Li, C., & Chen, Y. (2011). PSR: Proactive source routing in mobile ad hoc networks. In IEEE Communications society (pp. 1–6).

  27. Yang, W., Yang, X., Yang, S., & Yang, D. (2011). A greedy-based stable multi-path routing protocol in mobile ad hoc networks. Ad Hoc Networks, 9(4), 662–674.

    Article  Google Scholar 

  28. Yu, K. M., Yu, C. W., & Yan, S. F. (2011). An ad hoc routing protocol with multiple backup routes. Wireless Personal Communications, 57(4), 533–551.

    Article  Google Scholar 

  29. Zeng, K., Lou, W., & Zhai, H. (2008). Capacity of opportunistic routing in multi-rate and multi-hop wireless networks. IEEE Transactions on Wireless Communications, 7(12), 5118–5128.

    Article  Google Scholar 

  30. Zhen, Y., Wu, M. Q., Su, J. F., Xu, C. X., et al. (2010). A priority based opportunistic routing mechanism for real-time voice service in mobile ad hoc networks. Wireless personal communications, 55(4), 501–523.

    Article  Google Scholar 

Download references

Acknowledgements

The authors wish to thank the reviewers and the editors for their valuable suggestions and comments that will help us to improve the quality of this paper.

Author information

Authors and Affiliations

  1. School of Information Engineering, Jingdezhen Ceramic Institute, Jingdezhen, 333403, China

    Yun-zheng Ding, Yi-cheng Li, Yuan-chun Xu, Yong-zheng Zhou & Yi-lai Zhang

Authors
  1. Yun-zheng Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi-cheng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuan-chun Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yong-zheng Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yi-lai Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yun-zheng Ding.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ding, Yz., Li, Yc., Xu, Yc. et al. An Opportunistic Routing Protocol for Mobile Ad Hoc Networks Based on Stable Ideology. Wireless Pers Commun 97, 309–331 (2017). https://doi.org/10.1007/s11277-017-4506-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4506-7

Keywords

Search

Navigation