Skip to main content
SpringerLink
Log in

Buffer occupancy and link state opportunistic routing for wireless mesh networks

  • Original Paper
  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Providing a high level of Quality of Service is essential for future wireless networks. This article presents a new multihop wireless routing protocol that opportunistically takes profit from variations of radio conditions in terms of path loss, shadowing and multipath fading to maximize the system capacity. However, guaranteeing high system capacity should not evade the packet delay minimization objective. Consequently, the best path should not only be considered as the path with best throughput but a combination of a good link throughput and, in addition, low router buffer occupancy load. Taking into account the available router buffer occupancy in its path selection, our proposal uses queuing theory information in order to also provide an efficient load balancing solution that adequately distributes the traffic load in the whole network. Exploiting this information, our solution dynamically adapts the selected path across time avoiding overexploited efficient links as well as low throughput link usage. This adaptation is performed considering each link state and the amount of channel information available. This improves the throughput and delay with only small marginal overhead cost. Our proposal applies to all wireless multihop networks, with increased benefit for extending cell coverage. We demonstrate through our simulation study that our solution raises the system capacity by more than 50% in several scenarii as well as reduces packet delays compared to state-of-the-art protocols such as Ad-hoc On-demand Distance Vector, Optimized Link State Routing and Link State Opportunistic Routing.

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

Data availability

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

Notes

  1. Note that OLSR is hardly improvable by taking short term throughput values into consideration. To create accurate routing tables, OLSR has to converge and it seems hardly realistic with link values changing very fast over time. Even more, RFC 7181 defining OLSRv2 [4] sets signaling frame exchange timer to about one second which is much longer than multipath fading variation time. It makes OLSR unable to consider those values.

  2. AODV floods the whole network with signaling RREQ packets until the first one reaches destination. It will establish the route that will regularly be the best in terms of throughput (if not overloaded) at this moment.

References

  1. Gueguen, C., Rachedi, A., & Guizani, M. (2013). Incentive scheduler algorithm for cooperation and coverage extension in wireless networks. IEEE Transactions on Vehicular Technology, 62(2), 797–808.

    Article  Google Scholar 

  2. Gonzalez, A., Kuehlmorgen, S., Festag, A., & Fettweis, G. (2017). Resource allocation for block-based multi-carrier systems considering QoS requirements. In IEEE global communications conference, GLOBECOM 2017 (pp. 1–7).

  3. Goldsmith, A. (2005). Wireless Communications. Cambridge University Press.

    Book  Google Scholar 

  4. Clausen, T., Dearlove, C., Jacquet, P., & Herberg, U. (2014). Rfc7181: The optimized link state routing protocol version 2. In IETF-Proposed Standard RFC (Vol. 7681).

  5. Ferronato, J. J., & Trentin, M. A. S. (2017). Analysis of routing protocols OLSR, AODV and ZRP in real urban vehicular scenario with density variation. IEEE Latin America Transactions, 15(9), 1727–1734.

    Article  Google Scholar 

  6. Das, S. R., Perkins, C. E., & Belding-Royer, E. M. (2003). Ad hoc on-demand distance vector (AODV) routing, RFC 3561. [Online]. Retrieved July 2020 from https://rfc-editor.org/rfc/rfc3561.txt.

  7. Singh, D., & Ghosh, S. C. (2019). Mobility-aware relay selection in 5G D2D communication using stochastic model. IEEE Transactions on Vehicular Technology, 68(3), 2837–2849.

    Article  Google Scholar 

  8. Wong, C. Y., & Cheng, R. S. (1999). Multiuser OFDM with adaptive subcarrier, bit, and power allocation. IEEE Journal on Selected Areas in Communications, 17(10), 1747–1758.

    Article  Google Scholar 

  9. Viswanath, P., Tse, D. N. C., & Laroia, R. (2002). Opportunistic beamforming using dumb antennas. IEEE Transactions on Information Theory, 48, 1277–1294.

    Article  MathSciNet  Google Scholar 

  10. Gueguen, C., & Baey, S. (2009). A fair opportunistic access scheme for multiuser OFDM wireless networks. Journal on Wireless Communications and Networking. European Association for Signal Processing (EURASIP). Special issue: Fairness in Radio Resource Management for Wireless Network.

  11. Costantino, G., Maiti, R. R., Martinelli, F., & Santi, P. (2016). LoSeRo: A locality sensitive routing protocol in opportunistic networks. In Proceedings of the 31st annual ACM symposium on applied computing. ACM (pp. 644–650).

  12. Biswas, S., & Morris, R. (2005). ExOR: Opportunistic multi-hop routing for wireless networks. SIGCOMM Computer Communication Review, 35(4), 133–144.

    Article  Google Scholar 

  13. Athanasopoulou, E., Bui, L. X., Ji, T., Srikant, R., & Stolyar, A. (2013). Back-pressure-based packet-by-packet adaptive routing in communication networks. IEEE/ACM Transactions on Networking, 21(1), 244–257.

    Article  Google Scholar 

  14. Mao, X., Tang, S., Xu, X., Li, X. Y., & Ma, H. (2011). Energy-efficient opportunistic routing in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 22(11), 1934–1942.

    Article  Google Scholar 

  15. Darehshoorzadeh, A., Cerda-Alabern, L., & Pla, V. (2011). Modeling and comparison of candidate selection algorithms in opportunistic routing. Computer Networks, 55(13), 2886–2898.

    Article  Google Scholar 

  16. Ostovari, P., Wu, J., & Khreishah, A. (2017). Cooperative internet access using helper nodes and opportunistic scheduling. IEEE Transactions on Vehicular Technology, 66(7), 6439–6448.

    Article  Google Scholar 

  17. Liu, F., Riihijärvi, J., & Petrova, M. (2017). Analysis of proportional fair scheduling under bursty on-off traffic. IEEE Communications Letters, 21(5), 1175–1178.

    Article  Google Scholar 

  18. Chen, W., Lea, C. T., He, S., & XuanYuan, Z. (2017). Opportunistic routing and scheduling for wireless networks. IEEE Transactions on Wireless Communications, 16(1), 320–331.

    Article  Google Scholar 

  19. Gueguen, C., Fabian, P., & Lagrange, X. (2019). Link state opportunistic routing for multihop wireless networks. Wireless Networks, 25, 3983–3998. https://doi.org/10.1007/s11276-018-01930-3.

    Article  Google Scholar 

  20. Ma, L., & Denko, M. K. (2007). A routing metric for load-balancing in wireless mesh networks (pp. 409–414).

  21. Jacquet, P., Muhlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., & Viennot, L. (2001). Optimized link state routing protocol for ad hoc networks. In Proceedings of IEEE international multi topic conference. IEEE INMIC 2001. Technology for the 21st century (pp. 62–68).

  22. Huhtonen, A. (2004). Comparing AODV and OLSR routing protocols. Telecommunications Software and Multimedia (pp. 1–9).

  23. Eom, H. (2008). Information-dynamics-conscious development of routing software: A case of routing software that improves link-state routing based on future link-delay-information estimation. The Computer Journal, 51(2), 144–161.

    Article  Google Scholar 

  24. Ade, S., & Tijare, P. (2010). Performance comparison of AODV, DSDV, OLSR and DSR routing protocols in mobile ad hoc networks. International Journal of Information Technology and Knowledge Management, 2(2), 545–548.

    Google Scholar 

  25. Truman, T. E., & Brodersen, R. W. (1997). A measurement-based characterization of the time variation of an indoor wireless channel. In Proceedings of IEEE international conference on universal personal communications record (ICUPC) (Vol. 1, pp. 25–32).

  26. Little, J., & Graves, S. (2008). Building intuition. Springer.

    Google Scholar 

  27. Brassard, G., & Bratley, P. (1996). Fundamentals of algorithmics. Prentice Hall.

    MATH  Google Scholar 

  28. Seo, H., & Lee, B. G. (2004). A proportional-fair power allocation scheme for fair and efficient multiuser OFDM systems. In IEEE global telecommunications conference (Vol. 6, pp. 3737–3741).

  29. Horvath, G., & Fazekas, P. (2015). Modelling of YouTube traffic in high speed mobile networks. In Proceedings of 21st European wireless conference (pp. 1–6).

  30. 3GPP. (2018). User Equipment (UE) radio transmission and reception. 3rd Generation Partnership Project (3GPP), TS 38.101-2 version 15.2.0 Release 15

  31. Gueguen, C., & Merlhe, C. (2020). Fair energy efficient scheduler providing high system capacity for wireless networks. SN Applied Sciences, 2(12), 1–15.

    Article  Google Scholar 

  32. Anchun, W., Liang, X., Shidong, Z., Xibin, X., & Yan, Y. (2003). Dynamic resource management in the fourth generation wireless systems. In Proceedings of IEEE international conference on communication technology (ICCT) (Vol. 2, pp. 1095–1098).

Download references

Author information

Authors and Affiliations

  1. IRISA D2, University of Rennes 1, Rennes, France

    Jean-Baptiste Bordier, Christopher Merlhe, Dylan Garnaud, Keryann Bussereau, Erwan Livolant & Cédric Gueguen

  2. LIGM, University of Paris-Est, Marne-la-Vallée, France

    Philippe Fabian

  3. CNRS, LIP6, Sorbonne Université, 75005, Paris, France

    Sébastien Baey

Authors
  1. Jean-Baptiste Bordier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christopher Merlhe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Philippe Fabian
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sébastien Baey
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Dylan Garnaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Keryann Bussereau
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Erwan Livolant
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Cédric Gueguen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christopher Merlhe.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bordier, JB., Merlhe, C., Fabian, P. et al. Buffer occupancy and link state opportunistic routing for wireless mesh networks. Wireless Netw 27, 4133–4150 (2021). https://doi.org/10.1007/s11276-021-02736-6

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-021-02736-6

Keywords

Search

Navigation