A Novel Heuristic Routing Algorithm Using Simulated Annealing in Ad Hoc Networks

• Published in: Advances in Informatics pp. 849 - 857
• Main Authors: Liu, Lianggui, Feng, Guangzeng
• Format: Book Chapter Conference Proceeding
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2005; Springer
• Series: Lecture Notes in Computer Science
• Subjects: Applied sciences; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Convergence Time; Exact sciences and technology; Feasible Path; Route Computation; Simulated Annealing; Software; Transmission Success Rate; Routing algorithm; Energy function; Heuristic method; Simulated annealing; Multipath propagation; Routing; Wireless network; Metric; Ad hoc network; Service quality; Polynomial time
• ISBN: 9783540296737; 3540296735
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/11573036_81

Multi-constrained quality-of-service routing (QoSR) is to find a feasible path that satisfies multiple constraints simultaneously, as an NPC problem, which is also a big challenge for ad hoc networks. In this paper, we propose a novel heuristic routing algorithm based on Simulated Annealing (SA_HR). This algorithm first uses an energy function to translate multiple QoS weights into a single 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 ad hoc networks. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximate algorithms showing good performance in seeking the (approximate) optimal configuration within a period of polynomial time.