SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS

Multi-constrained Quality-of-Service （QoS） routing is a big challenge for Mobile Ad hoc Networks （MANETs） where the topology may change constantly. 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 Qos Routing （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.