A novel heuristic routing algorithm using simulated annealing in ad hoc networks

Authors:
Lianggui Liu;Guangzeng Feng
Affiliations:
Department of Communication Engineering, Nanjing University of Posts & Telecommunications, Nanjing, China;Department of Communication Engineering, Nanjing University of Posts & Telecommunications, Nanjing, China
Venue:
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Year:
2005

Citing 6
Cited 0

Simulated annealing: theory and applications

Simulated annealing: theory and applications
Routing support for providing guaranteed end-to-end quality-of-service

Routing support for providing guaranteed end-to-end quality-of-service
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
QoS routing in ad hoc wireless networks

IEEE Journal on Selected Areas in Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm

IEEE Journal on Selected Areas in Communications
Distributed quality-of-service routing in ad hoc networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.