Efficient QoS Routing in Manet using Quantum

Abstract

In mobile ad hoc networks, there is always a requirement of transferring real time multimedia information between a source-destination pair through a communication network. To support these communications and emergence of real-time applications, the basic requirement is to determine a feasible path which can join the source node and the destination node with a minimal cost .The paths are subjected to some constraints such as bandwidth, end-to-end delay, jitter and hop count. So, in order to assure an efficient performance, these QoS routing constraints must be properly handled. Therefore, complication of the problem is considered and accessible solution is provided using meta-heuristic algorithm rather than any other methods. To resolve the multi-constrained QoS routing problem in Mobile Ad-hoc Networks (MANETs), an intelligent algorithm has been proposed here to find the feasible path. This paper proposes a QPSO algorithm for solving multimedia routing which is capable of finding the low-cost route with bandwidth, delay and hop count as the constraints. In the proposed algorithm, the feasible path from the source node to the destination node is selected for communication which satisfies the minimum required bandwidth, less end-to-end delay and minimum hop count. The simulation results illustrate that the proposed QPSO algorithm with a novel node selection technique is able to find a better optimal path with multiple QoS constrains such as Bandwidth, hop count and network delay (end-to-end delay). It can meet the real-time requirements in multimedia communication networks.