An Enhanced End to End Route Discovery in

AODV using Multi-Objectives Genetic Algorithm
Firas Al Balas
Faculty of Computer and Information
Technology,
Jordan University Of Science And
Technology, Irbid, Jordan
Faalbalas@just.edu.jo
Omar Almomani
Network Computer and Information
Systems Department Faculty of
Information Technology
The World Islamic Sciences &
Education University Amman, Jordan
Omar.almomani@wise.edu.jo
Reema M. Abu Jazoh
Faculty of Computer and Information
Technology,
Jordan University Of Science And
Technology, Irbid, Jordan

Yaser M. Khamayseh
Faculty of Computer and Information Adeeb Saaidah
Technology Network Computer and Information
Jordan University Of Science And Systems Department Faculty of
Technology Irbid, Jordan Information Technology
yaser@just.edu.jo The World Islamic Sciences &
Education University Amman, Jordan
adeeb.saaidah@wise.edu.jo
management or network infrastructure. Ad-hoc Networks
considered the main enabler technology for deployments of
Abstract—this paper presents a multi objectives genetic smart meter which has characteristics such as Less
algorithm approach for the Ad-hoc On-Demand Distance transmitting energy requirements and increased redundancy
Vector (AODV) Routing Protocol for Wireless Sensor Network
(WSN). AODV used individual routing metric in the form of
and reliability that can be useful for smart metering
minimum-hop count and this led to generate two problems: communication.
First, utilizing shortest path all time that can be overloaded in To reduce the complexity and to facilitate the addition and
the selected path which produce to unbalanced energy the alteration operations, the communication functionality in
depletion and traffic congestion. Secondly, routing during ad hoc networks is divided into five layers [3]. Each layer is
short path and weak link quality is more harmful than over implemented separately with a set of protocols that are
long path strong link quality as it can suffer retransmissions separated from the other layers which make the process of
and packet drops. The proposed algorithm will overcome these addition of a new protocol or modification of an exist
problems by using Genetic algorithm in which composite multi protocol possible. Moreover, each layer provides a well-
metric routing criterion are used by integrating three
parameters energy factor, traffic load and hop factor the
defined services to the next higher layer and hides the
protocol called MGAOVD. Routing based multiple criterions complexity of the below layers [4][5] .
can be combined into a individual criterion to get better Ad-hoc Networks have the properties of conventional
performance. The MGAOVD proposed protocol implemented wireless networks but also possess some unique properties.
using simulation environments using NS2 simulation. Results These distinct properties of ad-hoc networks need to be
from MGAOVD proposeed algorithm show outperform considered when designing, deploying and analyzing the
compare to original AODV in terms of increase packet delivery performance of the stationary or mobile ad-hoc networks [6].
ratio, decreased energy consumption, decreased end-to-end These distinct properties are:
delay, and decreased overhead.
• Multi hopping
Keywords—AODV, Genetic Algorithm, Ad-hoc network, NS2 In case there is any node needs to send data packet to
simulation another node that is not within its radio range, the
packet will transmit via the intermediate nodes which
I. INTRODUCTION are located between the sender and receiver [7][8].
• Self-organization
The wireless network is a collection of computers, In case there is any nodes in ad-hoc networks self-
stations, or nodes that use a radio signal frequency (RF) organize that dependent on network requirements.
instead of the physical wire to communicate among the
There is no central control of the network operations.
network devices. Ad Hoc Networks [1] is a decentralized
Therefore, the control of the network operations is
type of the wireless network where the devices in the
wireless network are possible to set up to communicate in distributed among all the nodes of the network.
Infrastructure Mode or in Ad Hoc mode [2]. By using the According to that, all the nodes in the network should
Infrastructure Mode, the devices will communicate indirectly communicate among themselves and cooperate with
through an access point, while by using the Ad Hoc mode each other to implement a specific function on the
they will communicate directly without a need to any access network such as security and routing.
point between them. • Resource considered nodes
Some nodes rely on battery to get the energy which has
Ad-Hoc Networks are a set of mobile devices like smart limited power storage. Moreover, the memory storage
phones, laptops, sensors, etc which are connected via of the mobile devices and the capacity of the mobile
wireless links; these devices dynamically constitute a devices CPU are also limited.
temporary network without a need to any central
• Scalability

978-1-5386-7942-5/19/$31.00 ©2019 IEEE 209
















 
In case there is an ad-hoc network growing in size.
Therefore, Ad-hoc networks can contain numerous
hundreds of nodes.
The WSN Routing protocols can be classified into three
categories which are: Proactive (Table driven) protocols,
Reactive (On demand) protocols and Hybrid protocols
[8][9][7].
II. AODV ROUTING PROTOCOL
AODV [10] is a reactive routing protocol that is specifically
developed for MANETs. This protocol is based on two
mechanisms for routing, which are: route discovery and
route maintenance [9][11].
A. Route Discovery
When the source node needs to communicate with any other
node in the network in order to transmit data to that node,
first it will check if there is an available route to that node in
its routing table. If the route is found, the source node will
use this route to send the packets of data through it to the
destination node. But, if the route is not found, the route
discovery process will be initiated by the source node. The
source node discovers the route by broadcasting a Route
Request Control Message (RREQ) to all its neighbours. The
RREQ message contains: both the IP addresses for the
source node and destination node, the most recent sequence
number for each of source node and destination node,
broadcast ID number and hop count. In case the
neighbouring nodes receive the RREQ message, they update
their routing table information for the source node depending
on the content of the RREQ. Moreover, they create
backwards pointers for the source node in order to be
followed by the Route Reply Control Message (RREP).
There are three possibilities for the node that receive the
RREQ message: this node is the destination itself, this node
is an intermediate node having in its routing table an active
route to the destination node or this node is an intermediate
node doesn’t have a route to the destination node in its
routing table. In the first case the RREQ message is received
by the destination itself so the destination node will unicast
the RREP message back to the source node.
RREQ received by Intermediate, in the second case, the
RREQ is received by an intermediate node that has a route to
the destination node. In this case, the intermediate node
unicast the RREP message back to the source node only if it
has a valid route. The route will be valid if the sequence
number of the destination node which is stored in the routing
table is equal to or greater than destination sequence number
that contained in the RREQ. Otherwise, this intermediate
node doesn’t send RREP to the source node but it
rebroadcasts the RREQ to its neighbors [11] valid route
Figure 1 shows RREQ moving through Intermediate node to
the destination case. [7][9], the RREQ is received by an
intermediate node that doesn’t have a route to the destination
node in its routing table, so this intermediate node
rebroadcast the RREQ to its neighbors. RREQ moves from
intermediate node to another until faces case 1 or case 2
which are mentioned previously or it is dropped when the
210
hop count for this RREQ equal zero.
Figure 1: RREQ moving through Intermediate node(s) to the
destination
In the RREQ message, the broadcast ID is used to determine
if a Specific RREQ is received previously by the node where
each node can maintain the (Source address, Broadcast_id)
pair for all the RREQ which received recently. Therefore, if
any node receives two RREQ with the same (Source address,
Broadcast_id), it Responds only for one of them while it
drops the other, which contributes to prevent rebroadcasting
the same RREQ from the same node [12] [13]
B. Route Maintenance
Routes in MANETs are vulnerable to the breakages due to
the mobility of the nodes. In AODV protocol, any link
breakage along the established route between the source
node and the destination node can be detected by using the
route maintenance mechanism [14]. According to this
mechanism, if any intermediate node discovers a link failure,
it initiates a Route Error (RERR) message and sends it back
to the source node in order to inform the source node that
this route become not valid to the destination node. When the
source node receives the RRER it initiates a new route
discover process for the destination. In addition to that, when
the RRER is back through the intermediate nodes to the
source, the route that containing the failure link will be
removed from the route caches of these nodes [15].
III. GENETIC ALGORITHM (GA)
In recently years, with an increase of the problems and the
importance of solving them in an optimal manner the
scholars have more flair to the biological development
algorithms like a GA [16], Particle Swarm Optimization
(PSO) [17] , Ant Colony Optimization (ACO) [18], and so
on. In this research paper GA will be used to get an
optimized solution for selecting a route in WNS.
GA[16] is the meta-heuristic search techniques that depend
on the natural genetics principles to determine an optimal
solution for difficult issue. It generates a set of the
populations as solutions towards an optimum one using the
biological techniques such as mutation, selection, crossover,
and inheritance. GA has two steps to solve problem. The first
step is initialization to generate the chromosomes randomly
and then these chromosomes are calculated value of them to
use a manner to select a better solution for the problem
would be provided more solutions. GA is based on some
terminologies:
i. Population is the subset of all the possible solutions that
encoded for the problem.
ii. Chromosome is one of these solutions to the problem.
iii. Gene is position of one element of the chromosome
iv. Allele is the value a gene takes for the chromosome
Gene type is the population in computation space. In the
computation space, the solutions will be presented in a















 
manner to easy understand an implementation in system.
Phenotype is the population in real world solution space
where the solution will be represented in actual real world.
Decoding and encoding- in simple case, the phenotype and
genotype spaces are the same. However, the phenotype and
genotype spaces are different in most cases of problems.
Decoding is the process of convert solutions from gene type
to phenotype when encoding is a process convert solution
from phenotype to gene type. Decoding must be fast process
as it executed Many times in GA during the fitness function
calculation. Fitness Function is a process to measure the
quality of solution that were generating. In GA, the fitness
function designed to be a part of modelling process of
optimization approach. This technique is designed to guide
the search to optimal solution.
GA is started with random creation of the population and
then the selection, crossover and mutation process are led to
determine the best population. In another meaning, taking
into consider the initial random population generates genetic
algorithm execution by basic operation [19]:
A. Selection
This operation is selected of parents to be generated
successive generations that is played important role in
genetic algorithm. This allows the filter individuals to be
select more to reproduce. In this way, the number of
individuals is copied to population randomly and the best of
the number of individuals into population for work genetic
processing. This process is working repeatedly. we have K-
way tournament selection [20]; it is selected K individuals
from population at random and selects best at parent that
selection dependent of fitness function. The same process is
working repeatedly for selecting next parent. The K-way
tournament used because it has lower radio interference in all
the sizes and types of networks [20] .
B. Crossover
Crossover [21] is the important operation of the GA. The
main aim of crossover is reorder the information of two
different individuals and created a new individual. Crossover
is the structured process but it is using random method to
exchange formation between strings and it useful to
exploration of new felids in search space. The main
technique in crossover, cross swapping operator is using on
parents which by Determination two different cross sites of
parents chromosomes are selected randomly. The crossover
operation is finished by exchanging the substring between
parents.
C. Mutation
Mutation [21] is working randomly through the string and it
works sometimes in the crossover operation by inserting one
or more genes during reproduction. The main goal of this
operation is included diversity in the individuals on a long
period of time and prevented stagnation in emergence of
individuals. Mutation works to exchange gene such as 0 to 1
and vice versa. All of these operations of selection, crossover
and mutation are repeated unto the optimal individual is
detected.
211
IV. LITERATURE REVIEW
In recently years, the researchers were interested in
improving AODV by using GA This section describes the
literature review of some research papers related to GA that
proposed to improve the AODV routing over ad hoc
network.
C. Garg and B. Wadhwa in [22]. They improve AODV
routing protocol by using GA to select best optimum path
between source and destination. The proposed protocol
enhanced the route selection. It used shortest path algorithm
to find three routes between source node and destination
node. The GA used random technique in route discovery to
find paths between source node and destination node. The
fitness function dependents on the minimum number of hops
to find best path between all paths. After that the best three
paths are saved in table of AODV routing table. Therefore,
there are alternative paths when any error occurs in a path.
P. U. Vidhate, R. S. Bichkar, and Y. Wankhade [23] they
improved AODV routing protocol based GA to get optimal
route between source node and destination node that selected
based on the amount of energy consumption in routing. The
proposed protocol operates it in two phases. First phase, it
uses API ant algorithm [24] which used to search in Ant
Colony Optimization algorithm to explore the paths between
source node and destination node. The results used to
generate initial population for genetic algorithm. In the
second phase, the genetic algorithm use basic operation as
selection, crossover and mutation to find optimal path. GA
executed based of AODV to find optimal path which used
fitness function based energy and number of hops.
A. Maleki and M. Sadeghzadeh [25] they improve AODV
routing protocol to get best path using a GA to improve the
route recovery mechanism .The proposed protocol improve
route recovery mechanism which defined new parameters for
selected route of local repair . The GA used random
technique in route recovery to find paths between source
node and destination node. The parameters are Snum ,
Dnum, Sneigh and Uneigh. Snum is a number of hops
between source node and upstream node before drop route .
Dnum is number of hops between upstream node and
destination node. Sneigh and Uneigh are number of
neighbours node of source node and upstream node. This
parameter use to calculate the fitness function to select route.
GA is use selection conditions which if the output collection
Snum and Sneigh are larger than the output collection Dnum
and Uneigh then local repair is done. Other than that the
routing starts from source node again.
V. MGAOVD PROPOSED PROTOCOL
This paper proposed reliable routing approach for AODV
using GA called MGAOVD to get a light weight and energy
efficient routing ad-hoc network. The most ad-hoc routing
protocols are considered a single criteria routing that use
either the hop count , the energy or traffic load. The route
selection based on single routing criteria has some problems
such as congestion, Energy consumption and unstable routes.
Also ad-hoc routing protocols select the first path its
received which was not effective because the network can
have other routes better than it. The MGAOVD proposed
AODV by Using multi objective GA based on composite















 
multi metric routing criterion by merging the following three
parameters.
A. Energy Factor
The proposed MGAOVD uses the remaining energy of the
nodes participation in route discovery process with the main
objective of selecting those nodes that have highest
remaining energies. The energy factor (En) is normalized to
[0,1] by using the following Equation.
En= (1)
Where “Er “represents the remaining energy of the node and
“Emax” represents the maximum energy in the ready node.
Thus, the energy factor of node “En” ranges between 0 and
1. En has value 1 pointing at full battery and 0 for empty
battery. In our proposed MGAOVD the node will include
nodes which have maximum energy factor in route selection.
B. Traffic load
The traffic load factor of nodes is calculated on the basis of
the interval between two received packets when nodes are
broadcasting data from the large number of nodes where it
will have smaller inter-arrival times between data packets.
According to study in [26], the value of the traffic load is
calculated on the time of arrival between two packets which
helps the load balancing in network. The interval scaled to
range between 0 and 1. Where 1 is indicated no traffic load
node and 0 is indicated a fully traffic load node. The main
aim of route selection is to select those nodes with lowest
traffic load Tf values.Tf is calculating using the following
equation:
Tf = (1-)* intvlold +  *intvlnew (2)
to update of the interval for removed the sudden traffic
jitters. The traffic load can use other method like a interface
queue status but the traffic load should be scaled to range [0,
1]. Where “intvlold“ and “intvlnew” are represented old and
new time intervals and  is scaled to range of 0 to 1. It uses
 close to one have less effected and more sensitive to new
fluctuations and if the values close to 0 have large effected
and less sensitive to new fluctuations. here consider  value
is 0.2 in our MGAOVD proposed protocol.
C. Link Quality
Here link quality is used based on Received Signal Strength
(RSS) with the aim of route selection with highest quality
links in route discovery phase. According to study in [27]
implemented many experimental tests on different hardware
and it use RSS to select link quality that is a good filter if its
value highest than threshold value. The RSS depends on
proportional distance between transmitter and receiver when
the greater then distance or increase the number of hop in the
route that leads to reduction the RSS and reduction the
link quality. The link quality”LQ” scaled to range of [0,1]
and calculated using the following equation.
LQ= (3)
Where “SP “ is represented the signal strength of received
packet and “Smax “ is the maximum signal strength
probable .
212
The MGAOVD proposed protocol was designed for mobile
ad-hoc networks where proportion of route cutting off is
higher compared with static networks. In this section we
present the sender and receiver phases for MGAOVD
proposed algorithms that will be executed at the route
discovery. Sender will be executed in Route Discovery
Phase, while receiver executed router selection by the
Destination Node.
The source node start sending a request massages to all
neighbour nodes to find the destination node. Then nodes
start calculating some parameter as energy factor, traffic
load, and link quality according to the energy model, traffic
load model and link quality model. In the original AODV,
the source node attempts to discover the route to the
destination node by flooding the RREQ message across the
network. In the MGAOVD proposed protocol a new field
called Elpath was added in RREQ packet. The source node
provides RREQ packet with Elpath field initialized to 1 and
broadcast RREQ packet. Figure 2 show new format for the
RREQ packet.
Figure 2: The RREQ packet with ELpath field
On receiving RREQ packet , each intermediate node checks
if it has previously received this RREQ packet before then it
drops the packet , otherwise , it adds the route entry to source
node with the last hop as next hop in its routing table
,thereafter it calculates its Elnode using Equation 4 multiply
it with the cumulative Elpath value stored by RREQ packet
in Elpath field of RREQ packet using Equation 5.
(4)
Where “” , “”, and “” are weighted factors for
calculating “ELnode “ .
ELpath = EL’path * ELnode (5)
Where “EL’path “ is the cumulative values of the Previous
nodes in the route . Thus the multiplication process ELnode
values of all nodes in the route can calculated using Equation
6.
ELpath = (6)
where “k” is number of nodes in route and “i” is run for all
“k” .the result of equation range of [0,1]. Thereafter, the
intermediate node forward RREQ packet.
For the destination node , it has ELnode value equals to its
link quality because the energy and traffic load are
Considered as limitation then the destination node is
calculated its ELnode value which is same its link quality
value and multiplies it with ELpath value of RREQ packet















 

to obtain new ELpath value using Equation 6.

Figure 3 shows pseudocode for source node and Figure 4

pseudocode for intermediate node.

Figure 3: pseudocode for source node

Figure 5: Pseudocode for Destination node

VI. EXPERIMENTAL RESULTS

Figure 4 Pseudocode for intermediate node
The original AODV routing protocol has main objective is
find the shortest path in network where the destination node
receives the first RREQ packet , it replies packet back and
discards other RREQ packets. Route selection in the
MGAOVD proposed, the destination node receives first
RREQ packet, it doesn’t reply back which maybe received
shortest path while that the destination node waits amount of
time t for possible received some paths are used as initial
population required for GA. The destination node is keeping
paths in path cache which received path and stored path as
Time . After that, The GA is using the biological
techniques like a mutation, selection, crossover, and
inheritance to get optimal path. GA divided to some parts.
We will discuss each part in details: figure 5: show GA
begins of initial population of paths generated individuals.
Many solutions chosen from the current solutions and
several operations are executed on that population to get a
new population. the initial population can be presented as
In order to evaluate the performance of MGAODV the
experiment run using NS2 simulation. The simulation
values were chosen as based on the literature review. We
used grid topology The number of node was varied from 25
to 100 for evaluating the performance of the proposed
algorithm. We used different energy from 100J to 500J.All
of the wireless nodes were configured to start sending data
to sink at a time chosen from uniform random distribution
(0-60) seconds with interval chosen as 1 packet per minute
and CBR were used as traffic type and packet size were
100Byte, queue size were 50 packets.
A. Results and Analysis
a) Packet Delivery Ratio (PDR)
Figure 6. Show result of PDR for four scenarios. The results
shows that MGAODV outperformed the AODV because
MGAODV considers Energy , Traffic Load , Hop-count and
Link Quality during select route formation so more stable
routes are formed thus able to improve the PDR. When the
value of the energy and the number of nodes increased, the
MGAODV effectiveness compared with the original AODV
protocol of energy dependence and the choice of the path to
rely on it.

Pi = P(Sn ,Dn) (7)

where Pi is the individual i of population with i = 1,…., m

and P is a path from source node S to destination node D in
the range [Sn ,Dn] limited by n dimension and m is the
number of population size. Figure 5 shows pseudocode for
destination node.

Figure 6. Packet Delivery Ratio

213















 
b) Normalized Routing Load (NRL)
Figure7. Show result of NRL for four scenarios. MGAODV
has lower overhead as compared to the original AODV. The
MGAODV was affected by changes energy values and
number of nodes. However, The MGAODV provides stable
routes by used all parameters leading to decrease exchange
of control packets. NRL for AODV is very high as the
number of routing packets becomes greater than number of
data packets with increase in number of nodes in the
network.
Figure 7. Normalized Routing Load
c) Average End-to-End Delay (E2E)
Figure 8. Show result of E2E for four scenarios, Both
protocols show increasing delay with increase in number of
nodes. However, MGAODV provides lower delay as
compared to the original AODV protocol because of
produce of stable routes.
Figure 8: Average End-to-End Delay (E2E)
VII. CONCLUSION
This paper was proposed the Multi objective GA AODV
routing protocol called MGAODV, the MGAODV protocol
work dynamically depending on energy, traffic load and link
quality of network. The MGAODV was implemented and
tested in simulation environments using NS2.the simulation
results showed that MGAODV outperforms AODV routing
protocol in term of packets delivery ratio, Normalized
Routing Load and Average End-to-End Delay.
REFERENCES
[1] C. E. Perkins and others, Ad hoc networking, vol. 1. Addison-
wesley Reading, 2001.
[2] J. Jan, R. Lee, L. Chow, F. Huang, and X. Luo, “Enhanced IEEE
power save in ad hoc wireless mode.” Google Patents, 2016.
[3] J. Yu, C. Xiuzhen, J. Honglu, and D. Yu, Hierarchical Topology
Control for Wireless Networks: Theory, Algorithms, and
Simulation. CRC Press, 2018.
[4] N. Garg and R. P. Mahapatra, “Manet security issues,” IJCSNS,
vol. 9, no. 8, p. 241, 2009.
214
[5] J. Hoebeke, I. Moerman, B. Dhoedt, and P. Demeester, “An
overview of mobile ad hoc networks: applications and
challenges,” Journal-Communications Netw., vol. 3, no. 3, pp.
60–66, 2004.
[6] M. B. Yassein, Y. Khamayseh, and B. Nawafleh, “Improved
AODV Protocol to Detect and Avoid Black Hole Nodes in
MANETs,” in The Sixth International Conference on Future
Computational Technologies and Applications.
[7] P. Goyal, V. Parmar, and R. Rishi, “Manet: vulnerabilities,
challenges, attacks, application,” IJCEM Int. J. Comput. Eng.
Manag., vol. 11, no. 2011, pp. 32–37, 2011.
[8] A. Baadache and A. Belmehdi, “Avoiding black hole and
cooperative black hole attacks in wireless ad hoc networks,”
arXiv Prepr. arXiv1002.1681, 2010.
[9] A. Saini and H. Kumar, “Comparison between various black hole
detection techniques in MANET,” in National Conference on
Computational Instrumentation, Chandigarh, India, 2010, pp. 19–
20.
[10] C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc on-demand
distance vector (AODV) routing,” 2003.
[11] D. S. S. Aarti, “Tyagi,‘Study Of Manet: Characteristics,
challenges, application and security attacks,’” Int. J. Adv. Res.
Comput. Sci. Softw. Eng., vol. 3, no. 5, pp. 252–257, 2013.
[12] S. H. Raut and H. P. Ambulgekar, “Proactive and reactive routing
protocols in multihop mobile ad hoc network,” Int. J. Adv. Res.
Comput. Sci. Softw. Eng., vol. 3, no. 4, 2013.
[13] A.-S. K. Pathan, Security of self-organizing networks: MANET,
WSN, WMN, VANET. CRC press, 2016.
[14] S.-L. Wu, S.-Y. Ni, J.-P. Sheu, and Y.-C. Tseng, “Route
maintenance in a wireless mobile ad hoc network,” Telecommun.
Syst., vol. 18, no. 1–3, pp. 61–84, 2001.
[15] S. Bitam, A. Mellouk, and S. Zeadally, “Bio-inspired routing
algorithms survey for vehicular ad hoc networks,” IEEE
Commun. Surv. Tutorials, vol. 17, no. 2, pp. 843–867, 2015.
[16] J. Loo, J. L. Mauri, and J. H. Ortiz, Mobile ad hoc networks:
current status and future trends. CRC Press, 2016.
[17] K.-L. Du and M. N. S. Swamy, “Particle swarm optimization,” in
Search and optimization by metaheuristics, Springer, 2016, pp.
153–173.
[18] M. Sama, P. Pellegrini, A. D’Ariano, J. Rodriguez, and D.
Pacciarelli, “Ant colony optimization for the real-time train
routing selection problem,” Transp. Res. Part B Methodol., vol.
85, pp. 89–108, 2016.
[19] M. Kaliappan, S. Augustine, and B. Paramasivan, “Enhancing
energy efficiency and load balancing in mobile ad hoc network
using dynamic genetic algorithms,” J. Netw. Comput. Appl., vol.
73, pp. 35–43, 2016.
[20] S. M. Hosseinirad and S. K. Basu, “Wireless sensor network
design through genetic algorithm,” J. AI Data Min., vol. 2, no. 1,
pp. 85–96, 2014.
[21] S. Jin, M. Zhou, and A. S. Wu, “Sensor network optimization
using a genetic algorithm,” in Proceedings of the 7th world
multiconference on systemics, cybernetics and informatics, 2003,
pp. 109–116.
[22] C. Garg and B. Wadhwa, “G-AODV: A Novel Approach to
Improve AODV by Using Genetic Algorithm in VANET,” Int. J.
Innov. Res. Comput. Commun. Eng., vol. 4, no. 6, pp. 11328–
11334, 2016.
[23] P. U. Vidhate, R. S. Bichkar, and Y. Wankhade, “Optimizing
Routes in Mobile Ad Hoc Networks Using Genetic Algorithm
and Ant Colony Optimization,” in Proceedings of the Second
International Conference on Computer and Communication
Technologies, 2016, pp. 557–565.
[24] N. Monmarché, G. Venturini, and M. Slimane, “On how
Pachycondyla apicalis ants suggest a new search algorithm,”
Futur. Gener. Comput. Syst., vol. 16, no. 8, pp. 937–946, 2000.
[25] A. Maleki and M. Sadeghzadeh, “Improved AODV route
recovery in mobile ad-hoc networks using a genetic algorithm,”
Manag. Sci. Lett., vol. 4, no. 9, pp. 2171–2176, 2014.
[26] S. M. Sadiq, “Traffic estimation in mobile ad-hoc networks,”
Master’s thesis, Radio Communication Systems Laboratory,
Department of Signals, Sensors And Systems, Kungl Tekniska
Högskolan (Royal Institute of Technology), Stockholm, Sweden,
2004.
[27] K. Levis and others, “RSSI is under appreciated,” in Proceedings
of the Third Workshop on Embedded Networked Sensors,
Cambridge, MA, USA, 2006, vol. 3031, p. 239242.