Skip to main content
SpringerLink
Log in

On selection of forwarding nodes for long opportunistic routes

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Opportunistic routing is a promising routing paradigm which increases the network throughput. It forces the sender’s neighbors, who successfully overheard the transmitted packet, to participate in the packet forwarding process as intermediate forwarding nodes. As a seminal opportunistic routing protocol, MORE combines network coding idea with opportunistic routing to eliminate the need for strict coordination among active forwarding nodes. In this paper, we show that MORE performance does not scale well with the route length, especially when the route length goes beyond two hops. Also, we found that MORE fails to establish a working opportunistic route in sparse networks. Clearly, the network throughput is directly influenced by both the quantity and quality of forwarding nodes, and their cooperation order. In this paper, we propose a new forwarder selection mechanism which considers the route length, link qualities, the distance from the source, and nodes density. It eliminates the occasional route disconnectivity happening in MORE and improves the quality of the established opportunistic routes. The simulation result indicates that our proposal always outperforms MORE when dealing with long opportunistic routes.

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

Similar content being viewed by others

References

  1. Boukerche, A., & Darehshoorzadeh, A. (2015). Opportunistic routing in wireless networks: Models, algorithms, and classifications. ACM Computing Surveys (CSUR), 47(2), 22.

    Google Scholar 

  2. Biswas, S., & Morris, R. (2005). ExOR: opportunistic multi-hop routing for wireless networks. ACM SIGCOMM Computer Communication Review, 3(4), 133–144.

    Article  Google Scholar 

  3. Chachulski, S., Jennings, M., Katti, S., Katabi, D. (2007). Trading structure for randomness in wireless opportunistic routing. In Proceedings of ACM SIGCOM, 2007.

  4. Rozner, E., Seshadri, J., Mebta, Y., Qiu, L. (2006). Simple opportunistic routing protocol for wireless mesh networks. In Proceedings of IEEE WiMesh (pp. 48–54).

  5. Yuan, Y., et al. (2005). ROMER: Resilient opportunistic mesh routing for wireless mesh networks. In Proceedings of IEEE workshop on wireless mesh networks (WiMesh) (vol. 12).

  6. De Couto, D. S. J., Aguayo, D., Bicket, L., Morris, R. (2003) A high throughput path metric for multi-hop wireless routing. In Proceedings of ACM MOBICOM (pp. 134–146).

  7. Laufer, R. P., Dubois-Ferrière, H., Kleinrock, L.: Multirate anypath routing in wireless mesh networks. In: Proceedings of IEEE INFOCOM (pp. 37–45).

  8. Li, Y., Mohaisen, A., & Zhang, Z. L. (2013). Trading optimality for scalability in large-scale opportunistic routing. IEEE Transactions on Vehicular Technology, 62(5), 2253–2263.

    Article  Google Scholar 

  9. Hu, W., Xie, J., and Zhang, Z. (2013). Practical opportunistic routing in high-speed multi-rate wireless mesh networks. In Proceedings of ACM International Symposium on Mobile ad hoc Networking and Computing (pp. 127–136).

  10. Meng, T., Wu, F., Yang, Z., Chen, G., & Vasilakos, A. V. (2016). Spatial reusability-aware routing in multi-hop wireless networks. IEEE Transactions on Computers, 65(1), 244–255.

    Article  MathSciNet  MATH  Google Scholar 

  11. Li, Z., Du, W., Zheng, Y., Li, M., & Wu, D. (2017). From rateless to hopless. IEEE/ACM Transactions on Networking (TON), 25(1), 69–82.

    Google Scholar 

  12. Li, P., Guo, S., Yu, S., Vasilakos, A.V. (2012). CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In Proceedings of IEEE INFOCOM (pp. 100–108).

  13. Sanchez-Iborra, R., & Cano, M. D. (2016). JOKER: A novel opportunistic routing protocol. IEEE Journal on Selected Areas in Communications, 34(5), 1690–1703.

    Article  Google Scholar 

  14. Zhao, M., Kumar, A., Chong, P. H. J., & Lu, R. (2017). A reliable and energy-efficient opportunistic routing protocol for dense lossy networks. IEEE Wireless Communications Letters, 6(1), 26–29.

    Google Scholar 

  15. Salehi, M., Boukerche, A., & Darehshoorzadeh, A. (2016). Towards a novel trust-based opportunistic routing protocol for wireless networks. Wireless Networks, 22(3), 927–943.

    Article  Google Scholar 

  16. Roofnet http://pdos.csail.mit.edu/roofnet/doku.php?id=roofnet.

  17. Varga, A (2017). OMNeT++– Object-oriented discrete event simulator. http://www.omnetpp.org.

Download references

Author information

Authors and Affiliations

  1. Computer Science Group, Islamic Azad University of Kermanshah, Kermanshah, Iran

    Sajad Malekyan

  2. Wireless Network Lab, Engineering Faculty, Ilam University, Ilam, Iran

    Mozafar Bag-Mohammadi

  3. Engineering Faculty, Science and Research Branch, Islamic Azad University of Arak, Arak, Iran

    Marzieh Ghasemi

  4. Engineering Faculty, Kharazmi University, Tehran, Iran

    Mostafa Abdollahi

Authors
  1. Sajad Malekyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mozafar Bag-Mohammadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marzieh Ghasemi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mostafa Abdollahi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mozafar Bag-Mohammadi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Malekyan, S., Bag-Mohammadi, M., Ghasemi, M. et al. On selection of forwarding nodes for long opportunistic routes. Wireless Netw 25, 1847–1854 (2019). https://doi.org/10.1007/s11276-017-1636-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-017-1636-5

Keywords

Search

Navigation