2019 5th International Conference on Advanced Computing & Communication Systems (ICACCS 2019)
Framework for QOS Optimization in MANET using
GA-ACO Techniques
P.Madhavan
Department of CSE
SRMIST, Kattankulathur
Tamilnadu, India
madhavan.p@ktr.srmuniv.ac.in
Abstract— MANET(Mobile Adhoc Network) is dynamically
configured network that consist of collection of wireless mobile
Since the mobile nodes are dynamically configured, frequent
changes occur in its topology and they form unpredictable
behavior, leading to routing overhead. In any wireless network,
when node size is increased, the performance deteriorate. So as to
support scalability, it is essential to optimize the QoS parameters.
The proposed algorithm uses GA-ACO (Genetic Algorithm- Any
Colony Optimization) which optimize the Quality of Service (QoS)
parameters like node speed, link delay, power and bandwidth. In
the proposed model, secure agent based multicast routing scheme
is used which optimizes the parameters based on hybrid GA and
ACO techniques. The Proposed algorithm outperforms the existing
OLSR and AODV protocols and it yields 12.25% and 7.41%
improvement in Throughput, 5.63% and 4.22% improvement in
energy consumption , 45.34% and 42.01% improvement in drop
packet.
Keywords— Mobile ad hoc network, GA,ACO,Optimal
routing.
I. INTRODUCTION
A fuzzy neural network is a learning machine that make use
of approximation techniques from neural networks to
calculate the fuzzy system parameters. Adaptive-Network-
based Fuzzy Inference System (ANFIS) [3] is a fuzzy
inference system originated from adaptive networks. It
includes a set of software agents like Multicast Administer
Agent(MAA), ANFIS Agent (AA), Route Inventing Agent
(RIA), and Guard Agent (GA). It forms route discovery and
maintenance process very quickly. In this model, fuzzy if-
then rules forms input- output mapping which is based on
both human knowledge and stipulated input-output data
pairs. The structure make use of 3 inputs, 4 rules, one
output.Genetic Algorithm (GA) is a machine learning model
that has a behaviour similar to the mechanisms that evolve
in nature. The individuals forms the candidate solutions
which serves as the base for solving the optimization
problem and they are modelled by n-bit binary vectors [1],
where research space is proportionate to an n-dimensional
Boolean space. It is a heuristic method based on natural
selection and genetics designed to solve optimization and
search problems. It holds a population of candidate solutions
called chromosomes. GA produces individuals for the next
generation by performing fitness-dependent probabilistic
selection of individuals from the current population. The
selected individuals is selected for the next level genetic
operators for generating further new individuals that would
act for next generation.
978-1-5386-9533-3/19/$31.00 ©2019 IEEE
Motivated by the natural behavior of ant colonies, Ant
Colony Optimization (ACO) based algorithms were
developed to estimate the shortest path to the food reserves
[2]. It is based on Swarm intelligence. In this, chemical
agent called pheromones are used by the ants for
communication and sense their fellow members with the
smell on their body. . The ants follow shorter optimal
paths.This nature of ant colonies can be used to attack
combinatorial and optimization problems by developing
stochastic search heuristics based on probability density
functions. The ACO algorithms make use of routing
information by sampling of paths using communication
packets named as ants. The ants are replicated in every
nodes to gather information about the quality of a path.
They make use of this information during their journey from
destination to source to alter the routing information both at
the intermediate nodes and at the source.
The paper is streamlined as follows: Section II brief
about the related work. In Section III, proposed model is
summarized. In Section IV, the performance of the
experiments were monitored and analyzed via simulation
experiments.
II. RELATED WORKS
Santhi et al. (2010)[4] have provided an on-demand QoS
routing method for MANETs based on ant colony meta-
heuristic. Santhi & Nachiappan (2010) [4] have used QoS
aware paths to discover an essential multicast route through
the intermediate nodes and the paths are determined. Rai et
al. (2010) have presented a scheme that embeds a fuzzy-
based selection method to initialize the QoS parameter
values for every instance of multicasting. Kharraz et al.
(2012) [6] have elucidated about a multicasting technique in
flooding. The flooding make use of delay characteristics of
the contributing nodes which in turn flood the join-query
messages.
[2] have propounded Ant-Dynamic MANET On-
demand (Ant-DYMO) routing protocol, which uses ant-
based technique in its proactive phase. It is categorized into
artificial ants namely, Explorer ANT (EANT) for
developing routes to its source and Find Ant (FANT).
Sailaja et al. (2011) [7] have realized five factors for
streamlining routing protocols such as reachability, energy
consumption, load balancing effective routing and
congestion avoidance. Wankhade & Ali (2011) [8] make use
of ant colony methods in a fuzzy style and have showed the
effectiveness of new ant protocol. Data packets that pass
through the nodes towards the broken link will end with
529
 2019 5th International Conference on Advanced Computing & Communication Systems (ICACCS 2019)
being lost due to time deficiency in updating the routing
table (Kumar et al. 2011) [9]. Woo (2011) has formed a
recent ant based routing method named Efficient Ant based
Routing (EAR) method to improvize the performance best
path selection.
[6] uses an on-demand multicast routing protocol with
competent route discovery which multiplies the performance
and efficiency of On Demand Multicast Routing Protocol
(ODMRP). The technique is a limited flooding that has
improved the multicasting method by efficiently handling
flooding based on the delay characteristics of the
contributing nodes.
(2011) and Pankajavalli & Arumugam (2011) [10]
propounded changes to DSR protocol making use of ants
and bees They discussed the success of Swarm Intelligence
(SI) inspired protocols in contrast to conventional MANET
protocols. Sharvani et al. (2012) [11] have presented the
usage of ant based routing to control the stagnation by
altering the routes internally and tuning the pheromone
attention. They use this technique for increased the
throughput., reduced end-to-end delay and overhead.
III. PROPOSED METHODOLOGY
The following section elucidate the proposed work. In
this work, Quality of Service (QoS) determines the overall
performance of the network. To quantitatively measure QoS,
several features like bandwidth, throughput,delay are taken
into consideration.
A. Optimized Routing
To provide better scalability and security, secure agent
based multicast routing scheme is proposed. It deals with
optimization of QoS parameters and routing based on hybrid
GA and ACO. Secure agents are configured in every node in
the network. These agents consider an assumptions which is
based on the defined learning to predict the environment
behavior. A hybrid GA-ACO based routing protocol is
proposed which combines Genetic Algorithm (GA) with Ant
Colony Optimization (ACO). During transmission, it
provides an alternate path based on pheromone and fitness
values so as to improve the performance of the network.
• Selection of optimal path using ACO
The neighbours are identified based on the
pheromone value, followed by the computation of
global highest pheromone value and selection of a
path for transmission using the ACO algorithm.
• Pheromone value calculation
The pheromone conserve at each node is determined
from the source node to its neighbours, and the
neighbour with highest pheromone reserve is
selected. At each stage of crossing the neighbor node,
the backward ants virtually establish the path towards
the destination. The routing table entries are created
or updated. The ants make an entry of the previous
node visited as the next hop node to reach the
destination. Each entry has a pheromone value, which
signifies the goodness of the path over the next hop
node. To reach the destination node, it calculates the
average of the inverse of the cost, in terms of both
estimated time and number of hops.
• Algorithm Steps
STEP 1: From the source node, the pheromone value
is computed for the neighbour node.
STEP 2: The node path with highest pheromone
conserve is selected. The routing table is updated for
every node until the destination is reached.
STEP 3:If more than one neighbour node has the
same highest pheromone value, they are selected.
STEP 4: Finally, data transmission takes place only
through the path with highest global reserve..
B. Identifying the fitness value using GA
The fitness value for selecting the optimal path for
transmission is identified. The shortest path identified by
ACO is given as input to the GA. The initial population
includes a path used to measure the fitness for each path. GA
consists of following processes namely, Selection,
Crossover, and Mutation. Selection decides the optimal
fitness path. Crossover is to determine a new path and
Mutation modifies or recombines a new path to obtain an
optimal shortest path. The fitness of each path is determined
based on the cost of each node in the randomly selected path.
The population is trimmed by discarding the worst shortest
path based on the fitness value. Finally, paths with the best
fitness value are obtained. After the selection of pairs of
paths, crossover is applied. The path pairs are considered as
parents, which are crossed over to produce children referred
as new paths. After obtaining the new path, the mutation
operator is applied to modify and obtain an optimal path.
Hybrid optimization using GA-ACO
ACO finds the shortest path using the distance value. The
set of paths obtained by ACO are given as inputs to GA. GA
is capable of solving the problems with no prior knowledge.
The QoS of the paths is based on performance metrics such
as end-to-end delay, throughput, PLR, PDR, control
overhead etc.GA-ACO provides alternate paths using
pheromone and fitness value.
• Algorithm Steps
STEP 1: The shortest path determined by ACO is
applied to GA module.
STEP 2: If there is a failure in the sending path or if
the node is out of range, then GA finds fitness values
of all the paths in the ant colony except the failure
path.
STEP 3: Two best paths are selected based on
fitness, and crossover is applied and the path is
generated.
STEP 4: If the newly generated path is not valid, then
mutation is applied to modify the path.
STEP 5: Newly created path is selected for data
transmission using GA.
530
 2019 5th International Conference on Advanced Computing & Communication Systems (ICACCS 2019)
IV. RESULTS AND DISCUSSION
Fig. 1 illustrates the lifetime comparison of proposed
algorithm with AODV and OLSR protocol. The proposed
algorithm offers better throughput when compared to
existing AODV and OLSR.
Fig. 1 Throughput Vs Number of Nodes
Fig. 2. Energy Consumption Vs Number of Nodes
Fig. 3. Drop Packet Vs Number of Nodes
Fig. 4. Performance Improvement of proposed model
In Fig 1, when the node size is increased from 20 to 40,
both AODV and the proposed remains constant in
throughput. But when increased from 40 to 70, there exists
drastic improvement in both the models. The proposed
algorithm gives better Throughput in contrast to existing
OLSR and AODV. It yields 12.25 and 7.41% improved
throughput. In Fig. 2, the performance of proposed algorithm
is examined in terms of RE and it is compared with the
existing OLSR and AODV protocols by varying number of
nodes. OLSR and AODV preserves more energy and hence
have short RE compared to the proposed model.
Fig. 3 shows the overall execution improvement of the
proposed algorithm with existing AODV and OLSR
protocol. When the node size are moved from 20 to 40,
existing OLSR and AODV shows steep rise in delay. Hence,
dropping of packets are frequent for the AODV and OLSR.
But the proposed model shows constant delay and it
involves 45.34 and 42.01 % less delay in contrast to OLSR
and AODV protocols respectively.
ACKNOWLEDGMENT
The author thank the management of SRM for giving the
continuous support in completion of the work.
REFERENCES
[1] D.E. Goldberg, “Genetic Algorithm in Search, Optimization, and
Machine Learning,” Addison-Wesley, Boston, 1989.
[2] Martens D, De Backer M, Haesen R, Vanthienen J, Snoeck M, and
Baesens B, ”Classification with ant colony optimization. Evolutionary
Computation,” IEEE Transactions, vol. 11(5), pp.651-665,2007.
[3] Budyal, VR & Manvi, SS, “Agent driven delay and power
constrained multicast routing in mobile ad hoc networks by using
anfis”, Journal of Wireless personal communications, vol. 75, pp.
531-556,2014.
[4] Santhi, G & Nachiappan, A, “Agent based adaptive multicast routing
with QoS guarantees in MANETs”, IEEE Proceedings of international
conference in computing communication and networking
technologies (ICCCNT), pp. 1-7,2010.
[5] Rai, SC, Misra, BB, Nayak, AK, Mall, R & Pradhan, SK, “A Multi-
objective QoS optimization with fuzzy based parameter setting for
real-time multicasting”, International Journal of Communications,
Network and System Sciences, vol. 3, no. 6, pp. 530,2010.
531
 2019 5th International Conference on Advanced Computing & Communication Systems (ICACCS 2019)

[6] Kharraz, MA, Sarbazi-Azad, H, & Zomaya, AY, “On-demand

multicast routing protocol with efficient route discovery”,Journal of
Network and Computer Applications, vol. 35, pp. 942-950,2012.
[7] Sailaja, M, Kumar, RK, Murty, PSR & Prasad, PK , “A study on
routing algorithms derived from the nature for MANETs”,
International Magazine on Advances in Computer Science and
Telecommunications, vol. 2, no. 1, pp. 31-37.
[8] Wankhade, SB & Ali, MS, “Route failure management technique for
ant based routing in MANET”, International Journal of Scientific &
Engineering Research, vol. 2, no. 9, pp. 1-5, 2011.
[9] Kumar, L, “Performance evaluation of ACO based on demand routing
algorithm for mobile ad hoc networks”, International Journal of
Engineering Science & Technology, vol. 3, no. 3, pp. 1809-1815,2011
[10] Khosrowshahi-Asl, E, Noorhosseini, M & Pirouz, AS, “A dynamic
ant colony based routing algorithm for mobile ad-hoc networks”,
Journal of information science and engineering, vol. 27, no. 5, pp.
1581-1596,2011.
[11] Sharvani, GS, Ananth, AG & Rangaswamy, TM, “Efficient
stagnation avoidance for manets with local repair strategy using ant
colony optimization’, International Journal of Distributed and Parallel
Systems”, vol. 3, no. 5, pp. 123.

532