Multicriteria routing algorithms in wireless mesh networks
https://doi.org/10.37661/1816-0301-2026-23-1-39-57
Abstract
Objectives. Modern wireless mesh networks place high demands on the adaptability of routing protocols. Standard algorithms are not always able to ensure the required quality of service (QoS) due to variability in parameters such as signal-to-noise ratio, channel load, and node mobility.
Methods. A method for multi-criteria routing is proposed using an integral quality of service criterion in a modified Dijkstra's algorithm.
Results. Routing results in an eight-node network and in a network with four clusters of five devices are analyzed. A mechanism for reducing the probability of false route discards in the multi-criteria routing method is proposed.
Conclusion. An iterative algorithm for adjusting weighting coefficients has been developed. In combination with the minimax criterion, it allows to eliminate false positives regarding the absence of a QoS-feasible route and to obtain acceptable solutions for different traffic profiles. A two-level approach and routing algorithm in a clustered network have been developed, ensuring a reduction in computational complexity and localization of route recalculation when the network state changes – specifically the quality of radio channels or the energy state of nodes.
About the Authors
Anton K. Shulgan
Belarusian State University
Belarus
Belarus
Anton K. Shulgan, Postgraduate Student
av. Nezavisimosti, 4, Minsk, 220030
Yury I. Vorotnitsky
Belarusian State University
Belarus
Belarus
Yury I. Vorotnitsky, Cand. Sci. (Phys.-Math.), Assoc. Prof., Head of Department
av. Nezavisimosti, 4, Minsk, 220030
References
1. Al-Karaki J. N., Kamal A. E. Routing techniques in wireless sensor networks: a survey. IEEE Wireless Communications, 2004, vol. 11, no. 6, рр. 6–28.
2. Akkaya K., Younis M. A survey on routing protocols for wireless sensor networks. Ad Hoc Networks, 2005, vol. 3, no. 3, рр. 325–349.
3. Pantazis N. A., Nikolidakis S. A., Vergados D. D. Energy-efficient routing protocols in wireless sensor networks: a survey. IEEE Communications Surveys & Tutorials, 2013, vol. 15, no. 2, рр. 551–591.
4. Mokrani S., Belkadi M., Sadoun T., Lloret J., Aoudjit R. LEA-RPL: lightweight energy-aware RPL protocol for internet of things based on particle swarm optimization. Telecommunication Systems, 2025, vol. 88, iss. 1, art. 14, рр. 433–454.
5. Alotaibi M. A., Alwakeel S. S., Alyahya A. N. A novel reliable and trust objective function for RPL-based IoT routing protocol. Computers, Materials and Continua, 2025, vol. 82, iss. 2, рр. 3467–3497.
6. Listopad N. I., Vorotnitsky Y. I., Hayder A. A. Routing in multiservice telecommunication networks based on a modified Dijkstra algorithm. Vestnik Belorusskogo gosudarstvennogo universiteta. Serija 1 [Journal of the Belarusian State University. Series 1], 2015, no. 1, рр. 70–76 (In Russ.).
7. Listopad N. I., Vorotnitsky Y. I., Bortnovsky V. V., Hayder A. A. Multi-criterial routing of information flows. Problemy fiziki, matematiki i tehniki [Problems of Physics, Mathematics and Technics], 2017, no. 2(31), рр. 84–90 (In Russ.).
8. Cardellini V., Casalicchio E., Grassi V., Presti F. L., Mirandola R. A scalable approach to QoS-aware self-adaptation in service-oriented architectures. Proceedings of 6th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, Q Shine 2009 and 3rd International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications, AAA-IDEA 2009, Las Palmas, Gran Canaria, 23–25 November 2009. Berlin, Heidelberg, New York, 2009, рр. 431–447.
9. Mahmoud W. A., Kadhim D. J. A proposal algorithm to solve delay constraint least cost optimization problem. Journal of Engineering. University of Baghdad, 2013, vol. 19, no. 1, рр. 155–160.
10. Dijkstra E. W. A note on two problems in connexion with graphs. Numerische Mathematik, 1959, vol. 1, рр. 269 –271.
Review
For citations:
Shulgan A.K., Vorotnitsky Yu.I. Multicriteria routing algorithms in wireless mesh networks. Informatics. 2026;23(1):39-57. (In Russ.) https://doi.org/10.37661/1816-0301-2026-23-1-39-57
Views:
508
JATS XML
Email this article 