Multicriteria routing algorithms in wireless mesh networks

Read full text Summarise with VIRAT
Authors: Anton K. Shulgan, Yury I. Vorotnitsky
Cited by: 0
References: 9

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

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.

Fields of Study & Subjects

Mobile Ad Hoc Networks Network Traffic and Congestion Control Advanced Wireless Network Optimization

Publication details

Journal / source
Informatics
Volume
23
Issue
1
Pages
39–57
Publication date
27 March 2026
Language
EN