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

Abstract

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.

Dynamic Quality of Service Stability Based Multicast Routing Protocol for MANETs (DQSMRP)

“…In [15], Simulated Annealing (SA) was introduced to solve the QoS routing problems. Reference [16] discussed Bees Life Algorithm (BLA) to solve the QoS multicast routing problem and constraints such as delay, allowed jitter, and requested bandwidth have been studied.…”

Performance Analysis of Dijkstra-Based Weighted Sum Minimization Routing Algorithm for Wireless Mesh Networks

“…There are many other instances of multiobjective optimization for routing in the literature. For example, in [9], a QoS multiconstrained routing algorithm based on simulated annealing (SA-RA) is proposed. This algorithm first uses an energy function to translate multiple QoS metrics into a single metric and then seeks to find a feasible path by simulated annealing.…”

“…A genetic-algorithm-based routing method called GAMAN was proposed in [11] to cope with the multiconstrained QoS routing problem. The algorithm, however, suffers from untimely convergence as with most computationally complex GA algorithms, and the SA-RA method of [9] is shown to outperform it. However, even simulated annealing (SA) has the weakness of slow convergence time; typical values are 1 ms for 100 nodes and 20 seconds for 1000-node networks [10].…”

Dynamic Quality of Service Stability Based Multicast Routing for Manet

“…In [15], a novel QoS routing algorithm based on Simulated Annealing (SA) is presented. Reference [16] discusses a novel bee colony optimization algorithm called bees life algorithm (BLA) to solve the QoS multicast routing problem; the key point here is three constraints which are delay, allowed jitter, and requested bandwidth which are taken into consideration.…”