Simulated Annealing Based Multi-constrained QoS Routing in Mobile ad hoc Networks

• Published in: Wireless personal communications Vol. 41; no. 3; pp. 393 - 405
• Main Authors: Liu, Lianggui, Feng, Guangzeng
• Format: Journal Article
• Language: English
• Published: Dordrecht Springer Nature B.V 01.05.2007
• Subjects: Algorithms; Approximation; Constraints; Heuristic methods; Mobile ad hoc networks; Polynomials; Quality of service architectures; Simulated annealing; Simulation; Topology
• ISSN: 0929-6212; 1572-834X
• DOI: 10.1007/s11277-006-9149-z

Multi-constrained quality-of-service routing (QoSR) is to find a feasible path that satisfies multiple constraints simultaneously, which is a big challenge for mobile ad hoc networks (MANETs) where the topology may change constantly. It has been proved that such a problem is NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions, most of which suffered either from excessive computational complexities or from low performance were proposed only for wired networks and cannot be used directly in wireless MANETs. In this paper a novel QoS routing algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The paper outlines simulated annealing algorithm and analyzes the problems met when we apply it to QoSR in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.