QoS Routing enhancement using metaheuristic approach in mobile ad-hoc network

Abstract

The Quality of Service Routing (QoSR) is always a tricky problem, due to dynamic nature of network, which is always Non-deterministic Polynomial-time (NP) hard. To resolve the problem, multi-constrained QoSR in Mobile Ad-hoc Network (MANET), an intelligent algorithm have been proposed to find the feasible path. This paper focuses on, satisfying the constraint of QoS in MANET inspiring Cuckoo Search(CS) algorithm, based on enhancing conventional CS technique using on-demand protocol. This approach select QoS path based on computation of best fitness value instead of shortest path for Route Replay (RRPLY) packet of Ad-hoc On-Demand Distance Vector (AODV) protocol. The fitness value is computed using three different parameters namely, routing load, residual energy and hop count. The algorithm is applied on AODV protocol for RRPLY, where multiple routes are available. The Cuckoo Search Optimization AODV (CSO-AODV) protocol gives better QoS routing metrics, satisfying QoS constraint. The obtained results of proposed CSO-AODV protocol are compared with, Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and basic AODV protocol, tested for three different condition i.e. mobility, scalability and congestion. The simulation results of the proposed algorithm is superior compared to ACO, PSO, and AODV algorithms.

Introduction

As technology is growing rapidly, it requires many hand-held devices like laptop, palmtop, mobile phones etc. Which are advanced by increasing CPU time, disk space, power consumption and memory size. MANET [1], [2], opens the door for these devices. MANET is self-healing, multihop, infrastructure less network free to move from one place to another place. There are several applications of MANET like audio, video, multimedia etc, which requires good communication and QoS [3], [4]. Similarly other wireless network CDMA, GSM and Wi-Fi, MANET is unable to provide reliable QoS [5]. Therefore, selecting appropriate protocol is important and challenging task, due to number of protocols presented in the literature, differ from each other and required guarantee of stringent QoS [6]. The main aim of QoS routing [7] is to find relevant path, that must satisfy QoS constraint requirements such as, packet loss, bandwidth, delay, jitter, energy consumption which are transmission characteristics of topology. The routing problem is NP complete if two QoS constraint are satisfied i.e. two additives or combination of additive or multiplicative metrics. QoS routing also satisfies constraint like link, path and tree constraint [8]. Where, bandwidth, jitter-delay and end-to-end delay are main, link and path constraint respectively [9]. Thus, to satisfy the above constraints with multiple objectives, there is need of potentially new approach or technique for solving the QoS routing. Therefore, complication in the problem is considered, and accessible solution is provided using metaheuristic algorithm rather than other methods. To solve QoS routing, past researchers used various metaheuristic algorithms [10], [11]. But, there is necessity of enhancing routing protocols in MANETS, to provide stringent QoS enhancement [12].

Section in this paper is organized as follows. Section 2 presents the related work on metaheuristic approaches. Overview of basic AODV algorithm with problem formulation is given in Section 3. Proposed solution with CSO-AODV algorithm, experimental setup and simulation results and discussion are illustrated in Sections 4–6 respectively. Conclusion drawn based on the simulation results is given in Section 7.