International Journal of Computer Science and Information Security (IJCSIS),

Vol. 14, No. 10, October 2016

Enhanced Routing Algorithm in Mobile Ad-

Hoc Network using Hybrid Algorithm
T. Prince, Dr S. Thabasu Kannan

Abstract - In this paper, we suggest a routing
optimization algorithm to proficiently decide an ideal
path from a source to a destination in mobile ad-hoc
networks. To decide an ideal path for the nodes is
critical for transmitting information between hubs in
thickly conveyed networks. Keeping in mind the end
goal to proficiently transmit information to its
destination, the proper routing algorithms must be
executed in mobile ad-hoc networks. The proposed
algorithm is composed by utilizing a Tabu search with
genetic algorithm system that is an agent meta-heuristic
algorithm. The proposed Tabu search with genetic
algorithm does two neighborhood creating operations
keeping in mind the end goal to decide an ideal path and
minimize algorithm execution time. We contrast the
proposed Tabu search and genetic algorithm with
different algorithms, regarding the routing cost and
algorithm execution time. The correlation results
demonstrate that the proposed Tabu search with genetic
algorithm beats alternate algorithms and that it is
reasonable for adapting the routing optimization issue.
Keywords:
Mobile Ad-Hoc Network (MANET), Tabu search,
Genetic Algorithm (GA), Routing.
I. INTRODUCTION
A MANET (mobile ad-hoc network) might be
presented as a foundation less dynamic network which
is an accumulation of free number of mobile nodes that
can convey to each other by means of radio wave. A
MANET is a self-arranging base, less networks of
mobile gadgets associated by remote. It is an
arrangement of remote gadgets called remote nodes,
which progressively associate and exchange data.
Every node in a MANET is allowed to move
autonomously in any bearing, and will thusly change
its connections to different gadgets much of the time;
each must forward activity inconsequential to its own
utilization, and along these lines be a switch. The
MANET network empowers servers and customers to
convey in a non-altered topology zone and it's utilized
as a part of an assortment of utilizations and quickly
developing networks [1]. With the expanding number
of mobile gadgets, giving the registering force and
network to run applications like multiplayer diversions
or cooperative work devices, MANETs are getting
increasingly vital as they meet the prerequisites of
today's clients to associate and connect suddenly.
Routing is a procedure of exchanging packets
from source node to destination node with least cost.
Consequently the algorithm for routing needs to sort
out and convey the data about the network states.
Routing algorithms produce attainable courses between
source node and destination node to accomplish the
base cost. Routing in conjunction with blockage
control and admission control characterizes the
execution of the network. Routing algorithm ought to
have bland target of routing methodology to be both
progressively reconfigurable and in view of locally
accessible data.
The reason for this proposed work is to create
arrangement utilizing genetic and advance the
arrangement utilizing Tabu search algorithms. Genetic
algorithm is one in which the populace connected with
every node co-advance to tackle the issue as entirety. A
routing algorithm in mobile ad-hoc networks requires a
period limitation administration to decide a path from a
source to a destination since the topologies of mobile
ad-hoc networks are more as frequently as possible
changed than those of different sorts of networks. In
the event that the routing algorithm can't give a period
limitation administration, then the nodes can't
appropriately transmit information to the destinations
on time. In this way, keeping in mind the end goal to
give time-limitation benefits, the routing algorithm
ought to locate an ideal arrangement inside a sensible
time. With a specific end goal to take care of this issue,
latest studies on such issues appear to concentrate on
heuristic algorithms. Among heuristic algorithms, the
comprehensive search algorithm is a general strategy
that comprises of deliberately specifying all
conceivable possibility for finding a worldwide answer
for NP-difficult issues, and the routing optimization
issue can likewise be comprehended by utilizing this
algorithm. Be that as it may, finding the ideal
arrangement by utilizing this algorithm requires
inordinate computational time. To evade numerical
troubles and lessen the computational weight,
endeavors have been dedicated in discovering superb
arrangements in a sensible computational time by
meta-heuristic optimization methods instead of finding
a worldwide arrangement [3]. Despite the fact that
meta-heuristic algorithms don't promise accomplishing
the ideal arrangement, these algorithms will
accomplish a worthy arrangement in a sensible time.
Genetic algorithms (GAs) and Tabu search
(TS) techniques are usually seen as in view of various
establishments and points of view [2]. Albeit critical
contrasts between the techniques exist, the two
methodologies share certain components in like
manner that frequently have been neglected and left
unexploited. The topic of this paper is to recognize
associations and differences between the strategies that
offer a ripe means for making crossover systems. The

334 https://sites.google.com/site/ijcsis/
ISSN 1947-5500
 International Journal of Computer Science and Information Security (IJCSIS),
Vol. 14, No. 10, October 2016
improvement of GA/TS crossovers offers a practically
undiscovered region for exact research. The various
effective uses of both GA and TS approaches
unequivocally contend for the value of researching
brought together methodology. We propose ways that
the varying systems of genetic algorithms and Tabu
search can be favorably accommodated, welcoming
research and computational studies to recognize the
best approaches to coordinate these techniques.
II. RELATED WORKS
In wired networks, traditional routing
protocols are generally taking into account join state
or separation vector algorithms, for example, the
Dijkstra algorithm or the Bellman-Ford algorithm.
Vasilakos et al. [4] proposed a computational
knowledge approach for advancing the routing in
various leveled ATM networks. This methodology
plans to productively apportion the network assets
while guaranteeing the nature of administration
necessities for every association. In remote networks,
perhaps mobile, multi-jump network, diverse
methodologies are required. Routing protocols ought
to be dispersed, have low overhead, act naturally
designing and have the capacity to adapt to habitually
changing network topologies [5]. Because of this
prerequisite, an expansive number of routing protocols
have as of late been created for ad-hoc networks.
These protocols for mobile ad-hoc networks are
generally characterized [6] as either table-driven or
proactive protocols, which do attempt to keep precise
data in their routing tables, or as on-interest protocols,
which just build routing tables when information is
sent to a destination. The destination sequenced
separation vector [7] and the remote routing protocol
[8] are well known case of table-driven protocols.
Dynamic source routing [9], on-interest separation
vector routing and associativity-construct routing [10]
are illustrative in light of interest protocols. Vitality
effectiveness is an imperative thought for mobile ad-
hoc networks. For vitality effectiveness, it might be
alluring to utilize not just a solitary path between a
source and a destination however to investigate
different paths. The traditional various routing plans
[11–13] have additionally been considered in mobile
ad-hoc networks. Deciding the improved path amongst
source and destination nodes under a few compels is
an essential key in numerous routing protocols. In any
case, by utilizing traditional algorithms, it is hard to
discover an answer inside an adequate calculation time
on the grounds that if there are a substantial number of
nodes in the network, then the routing optimization
issue is NP-hard.
Some routing protocols for deferral tolerant
networks have likewise been proposed to overcome
continuous, long-span availability disturbances. They
are arranged into three sorts: deterministic, upheld,
and astute methodology [14, 15]. The deterministic
methodology can be composed when the data of
335
network is known in advance. The Tabu search [16, 17]
is a scientific optimization strategy that has a place
with the nearby search strategies. It upgrades the
execution of the nearby search technique by utilizing
memory structures. The Tabu records contain traits
that are a great deal more successful, yet they raise
another issue. Ordinarily, more than one arrangement
is pronounced as Tabu and some of these
arrangements may have brilliant qualities that may
have not yet been gone by. To beat this issue, the
yearning criteria are acquainted with permit the
abrogating Tabu condition of the arrangement. The
generally utilized yearning paradigm is permitting the
utilization of preferred arrangements over the best as
of now known arrangements. The genetic algorithm
[18, 19] comprises of effective and broadly relevant
stochastic search and optimization strategies in view
of the standards of advancement hypothesis. This
algorithm has gotten impressive consideration
concerning its potential as an upgrading procedure for
complex issues. It has been effectively connected to
mechanical designing, for example, a fuzzy
framework, which can be alluded in neuro framework,
bio savvy framework, and encompassing knowledge
applications [20, 21]. Vasilakos et al. [22] proposed a
fuzzy set rationale based genetic algorithms for
between space routing of broadband network
associations with nature of administration
prerequisites in a coordinated ATM and SDH
networking engineering.
III. PROPOSED WORK
A. Genetic Algorithm (GA)
GA is a developmental procedure for huge
space search. The general strategy of GA search is as
per the following:
1) Population generation: A population is an
arrangement of chromosomes and each speaks to a
conceivable arrangement, which is a mapping grouping
amongst undertakings and machines. The underlying
population can be created by other heuristic
algorithms, for example, Min-min (called seeding the
population with a Min-min chromosome).
2) Chromosome assessment: Each chromosome is
connected with a fitness worth, which is the makespan
of the assignment machine mapping this chromosome
speaks to. The objective of GA search is to discover
the chromosome with ideal fitness esteem.
3) Crossover and Mutation operation: Crossover
operation chooses an arbitrary pair of chromosomes
and picks an irregular point in the main chromosome.
For the segments of both chromosomes starting there
to the end of every chromosome, crossover trades
machine assignments between comparing
undertakings. Mutation haphazardly chooses a
chromosome, then arbitrarily chooses an errand inside
the chromosome, and haphazardly reassigns it to
another machine.
https://sites.google.com/site/ijcsis/
ISSN 1947-5500
 International Journal of Computer Science and Information Security (IJCSIS),
Vol. 14, No. 10, October 2016
4) Finally, the chromosomes from this changed
population are assessed once more. This finishes one
cycle of the GA. The GA stops when a predefined
number of advancements are come to or all
chromosomes unite to the same mapping
This genetic algorithm arbitrarily chooses
chromosomes. Crossover is the procedure of swapping
certain sub-successions in the chose chromosomes.
Mutation is the procedure of supplanting certain sub-
successions with some undertaking mapping decisions
new to the present population. Both crossover and
mutation are done randomly. After crossover and
mutation, another population is produced. At that point
this new population is assessed, and the procedure
begins once again until some halting criteria are met.
The ceasing criteria can be, for instance, 1) no change
in late assessments; 2) all chromosomes meet to the
same mapping; 3) a cost bound is met.
B. Tabu Search (TS)
TS is actualized starting with an irregular
mapping as the underlying arrangement, produced
from a uniform dissemination. To control the present
arrangement and travel through the arrangement space,
a short bounce is performed. The natural reason for a
short jump is to discover the closest neighborhood least
arrangement inside the arrangement space. The
fundamental method to perform a short bounce is to
consider, for every conceivable pair of undertakings,
every conceivable pair of machine assignments, while
alternate assignments are unaltered. On the off chance
that the new makespan is a change, the new
arrangement is spared, supplanting the present
arrangement. The short bounce technique closes when
(1) each pair-wise remapping mix has been depleted
with no change, or (2) the point of confinement on the
aggregate number of fruitful jumps (limithops) is come
to. At the point when the short bounce method closes,
the last mapping from the nearby arrangement space
search is added to the Tabu rundown. The Tabu
rundown is a technique for monitoring the areas of the
arrangement space that have already been searched.
Next, another arbitrary mapping is created, and it must
vary from every mapping in the Tabu rundown by at
any rate half of the machine assignments (an effective
long jump). The instinctive motivation behind a long
bounce is to move to another area of the arrangement
space that has not already been searched. After each
effective long bounce, the short jump method is
rehashed. The ceasing rule for the whole heuristic is
the point at which the entirety of the aggregate number
of fruitful short jumps and effective long bounces
squares with limithops. At that point, the best mapping
from the Tabu rundown is the last reply.
C. Problem Definition
The network under thought is spoken to as G
= (V, E), an associated diagram with N nodes. The
metric of optimization is cost of path between the
336
nodes. The aggregate cost is the entirety of cost of
individual bounces. The objective is to discover the
path with least aggregate cost between source node Vs
and destination Vd, where Vs and Vd have a place with
V. This paper displays the productive on-interest,
source started routing algorithm utilizing Tabu search
algorithm and genetic algorithm. It is actualized as two
modules viz., Network generation or introduction of
routing tables utilizing Genetic algorithm and
generation of ideal path utilizing Tabu search
algorithm. At long last information is sent along the
created path.
D. Hybrid TS/GA Algorithm
Hybridization is a pattern in numerous chips
away at meta-heuristics recent years. It exploits the
advantages accumulated from various meta-heuristics,
to such an extent that the essential meta-heuristics are
simply canvas, beginning stages to start to take care of
an optimization issue [23]. In the figures beneath, we
propose an optimization technique in view of a half
and half approach in Fig.1.
Pseudo code for Hybrid Algorithm
Algorithm 1:
1. Central node generates n initial solutions using GA.
It runs GA for fixed number of iterations, t.
a. Select first population of fixed size and set j=1
b. While(j<=t) Begin i. Apply the operator on the two
parent schedules selected randomly to create two
offspring and replace the parents by the best two the
four schedules. ii. J=j+1 End
2. Central node leads m best solutions picked to the m
remote worker nodes
3. Each worker node runs the TS algorithm by means
of the first state received.
4. Upon receiving a converged result from one of the
worker nodes, the central node stops execution
In GA, an initial population consisting of a set
of solution is chosen and then the solutions are
estimated. Comparatively more effective solutions are
nominated to have more off springs which are, in some
way, related to the novel solutions. If the genetic
operator is selected correctly, the final population will
have better solutions. GA expands the entire
population. TS aim at producing one best solution. For
the TS, we require several good initial solutions to
confirm the necessary number of good early solution.
The pseudo-code for the GA and GTA is given
Algorithm 1.
https://sites.google.com/site/ijcsis/
ISSN 1947-5500
 International Journal of Computer Science and Information Security (IJCSIS),
Vol. 14, No. 10, October 2016

Performance Comparison - (Tabu with GA) Vs (GA) Vs (Simulated Annealing)

3500
Tabu with GA
Tabu
3000
Simulated annealing

2500

Minimum Routing Cost

2000

1500

1000

500

A B C D
Problem

Fig. 2(a): Minimum Routing cost

Fig.1: TS/GA Hybrid algorithm Performance Comparison - (Tabu with GA) Vs (GA) Vs (Simulated Annealing)
3.5

IV. RESULTS AND DISCUSSION 3

Tabu with GA
Tabu
Simulated annealing
In this area, we contrast the proposed Tabu
Average Execution Time(Sec)

2.5
search algorithm and two meta-heuristic algorithms,
the genetic algorithm and the simulated annealing, by 2

means of PC tests. All the examinations are executed

with the utilization of MATLAB, and they are 1.5

performed on a 1.80 GHz Pentium®4 that is furnished

1
with a Windows OS, 8 GB of memory and an Intel®
processor. The algorithms were connected to enhance 0.5
the routing issues with four distinctive network
topologies. The topologies are called issues A, B, C 0
A B C D
and D. Every issue contains a few nodes and Problem
connections, as is appeared in Table 1. Besides, the Fig 2(b): Average Execution Time
parameters of the algorithms that are utilized as a part
of the tests are appeared in Table 2. Fig. 2(a) shows the comparisons of the
Table 1: Problems for the experiments
minimum routing cost of three meta-heuristic
Problem Num. of Nodes Num. of links
algorithms: Tabu with genetic search, genetic
A 80 225 algorithm and simulated annealing. We applied three
B 160 456 algorithms to the given problems according to the
C 320 923 following conditions. In the Tabu with genetic search,
D 640 1862 Kmax is set to 100. In the genetic algorithm, p and q are
set to 1 and 0.25, respectively, and in the simulated
Table 2: The parameters of the meta-heuristic algorithms
annealing, β is set to 0.5. We see that in terms of the
Algorithms Param Values routing cost, the Tabu with genetic search algorithm
eters outperforms the genetic algorithm and the simulated
Tabu with Genetic K max 10/50/100/200 annealing. The Tabu with genetic search and the
algorithm Search simulated annealing algorithms activity the same
Genetic Algorithm Np 50 neighborhood generating operations, which are the
P 1/0.5 remove and the replace operations, but since the Tabu
Kmax 100 with genetic search regularly produces more next
Simulated Annealing Tinit 0.1 generation solutions than the simulated annealing, we
T final 0.00005 observe that the Tabu with genetic search has better
α 0.1 performance than the simulated annealing in the figure.
β 0.1/0.3/0.5/0.7/0.9 We also see that the Tabu with genetic search
Kmax 100 outperforms the genetic algorithm with the crossover

337 https://sites.google.com/site/ijcsis/
ISSN 1947-5500
 International Journal of Computer Science and Information Security (IJCSIS),
Vol. 14, No. 10, October 2016
and the mutation processes. This highest reason is that [3].
the Tabu with genetic search with regularly generating
neighborhood solutions is better useful to the routing
problem than the genetic algorithm with stochastically
generating results. Fig. 2(b) shows evaluations of the [4].
average execution time for the meta-heuristic
algorithms in the given problems. The results show
that the Tabu with genetic search takes a shorter time
than the genetic algorithm and the simulated annealing.
This is because the Tabu with genetic search reaches
the optimal solution faster than other algorithms. [5].
Moreover, though the Tabu with genetic search
produces more neighborhood solutions for the current
solution than the simulated annealing, it takes a [6].
smaller time than the simulated annealing that
randomly produces a next generation for the current
solution.
[7].
V. CONCLUSION
In this paper, we proposed a routing
optimization algorithm to productively decide an ideal
path from a source to a destination in mobile ad-hoc [8].
networks. The proposed algorithm was planned by
utilizing the tabu with genetic search algorithm, which
is an ordinary meta-heuristic algorithm. We initially
depicted the generally utilized operations, which are [9].
encoding arrangement, the creation of the underlying
arrangement and the repair capacity, and we
introduced the area producing operations of the
algorithm that incorporates the end condition. To look [10].
at the performance of the proposed algorithm, we
additionally built up the genetic algorithm and the
simulated annealing that are the agent meta-heuristic
algorithms. We assessed the performance of the
algorithms via doing the analyses by shifting the [11].
quantity of nodes and connections, and we contrasted
the proposed algorithm and other meta-heuristic
algorithms regarding the routing cost and the normal
execution time for the routing issue. The examination
results demonstrated that the tabu with genetic search [12].
beats different algorithms regarding the routing cost
and normal execution time under different
requirements, and it is appropriate for adapting the [13].
routing optimization issue.
REFERENCES
[14].
[1]. Jaspal Jindal and Vishal Gupta, Fuzzy
Improved Genetic Approach for Route
Optimization in MANET, International
Journal of Advanced Research in Computer
Science and Software Engineering, Volume 3, [15].
Issue 6, June 2013.
[2]. FRED GLOVER,~f JAMES P. KELLY~ and
MANUEL LAGUNA§, GENETIC
ALGORITHMS AND TABU SEARCH: [16].
HYBRIDS FOR OPTIMIZATION,
Computers Ops Res. Vol. 22, No. 1, pp. 111-
134, 1995.
338
Zhao, W., Ammar, M., & Zegura, E. (2004).
A message ferrying approach for data delivery
in sparse mobile ad hoc networks. In
Proceedings of ACM/IEEE MOBIHOC
Vasilakos, A., Saltouros, M., Atlasis, A., &
Pedrycz, W. (2003). Optimizing QoS routing
in hierarchical ATM networks using
computational intelligence techniques. IEEE-
Transactions on Systems, Man and
Cybernetics, Part C, 33(3), 297–312.
Akkaya, K., & Younis, M. (2005). A survey
on routing protocols for wireless sensor
networks. Ad hoc networks, 3, 325–349.
Royer, E. M., & Toh, C. K. (1999). A review
of current routing protocols for ad-hoc mobile
wireless networks. IEEE Personal
Communications, 6, 46–55.
Perkins, C. E., & Bhagwat, P. (1994). Highly
dynamic destinationsequenced distance-vector
routing (DSDV) for mobile computer. In
Proceedings of the ACM SIGCOMM (pp.
234–244).
Raju, J., & Garcia-Luna-Aceves, J. J. (2000).
A comparison of ondemand and table driven
routing for ad-hoc wireless networks. In
Proceedings of ICC.
Maltz, D. (2001). On-demand routing in
multi-hop wireless ad hoc networks. PhD
thesis, Carnegie Mellon University, Pittsburgh,
PA.
Perkins, C. E., & Royer, E. M. (1999). Ad-hoc
on-demand distance vector routing. In
Proceedings of the 2nd IEEE workshop on
mobile computing systems and applications
(pp. 90–100).
Toh, C. K. (1999). A novel distributed routing
protocol to support ad hoc mobile computing.
In Proceedings of IEE 15th annual
international conference on computers and
communications (pp. 460–486).
Nasipuri, A., & Das, S. R. (1999). On-demand
multipath routing for mobile ad hoc networks.
In Proceedings of the 8th ICCCN.
Valera, A., Seah, W. K., & Rao, S. V. (2003).
Cooperative packet caching and shortest
multipath routing in mobile ad hoc networks.
In Proceedings of IEEE INFOCOM.
Spyropoulos, T., Rais, R. N. B., Turletti, T.,
Obraczka, K., & Vasilakos, A. (2010).
Routing for disruption tolerant networks:
taxonomy and design. In Wireless networks
(pp. 1–22).
Pedrycz, W., & Vasilakos, A. (2001).
Computational intelligence in
telecommunications networks. USA: CRC
Press
Glover, F. (1989). Tabu search, Part I.
ORsimulated Annealing Journal on
Computing, 1, 190–206.
https://sites.google.com/site/ijcsis/
ISSN 1947-5500
 International Journal of Computer Science and Information Security (IJCSIS),
Vol. 14, No. 10, October 2016
[17]. Glover, F. (1990). Tabu search, Part II.
ORsimulated Annealing Journal on
Computing, 2, 4–32.
[18]. Holland, J. (1975). Adaptation in natural and
artificial systems. Ann Arbor: Univ. of
Michigan Press.
[19]. Goldberg, D. E. (1989). Genetic algorithms
in search, optimization & machine learning.
Reading: Addison–Wesley.
[20]. Pedrycz, W., & Vasilakos, A. V. (1999).
Linguistic models and linguistic modeling.
IEEE Transaction on Systems, Man, and
Cybernetics-Part B: Cybernetics, 29(6), 745–
757.
[21]. Acampora, G., Gaeta, M., Loia, V., &
Vasilakos, A. V. (2010). Interoperable and
adaptive fuzzy services for ambient
intelligence applications. ACM Transactions
on Autonomous and Adaptive Systems, 5(2).
[22]. Vasiliakos, A., Ricudis, C., Anagnostakis, K.,
Pedrycz, W., & Pitsillides, A. (1998).
Evolutionary-fuzzy prediction for strategic
QoS routing in broadband networks. In
Proceedings of IEEEFUZZ (pp. 1488–1493).
[23]. Bouzeboudja H., Chaker A., Allali A.,
Naama B., Economic Dispatch Solution
Using a Real-Coded Genetic Algorithm, Acta
Electrotechnica et Informatica, 2005, 5(4), p.
1-5.
[24]. Naama B., Bouzeboudja H., Ramdani Y.,
Chaker A., Hybrid Approach to the
Economic Dispatch Problem Using a Genetic
and a Quasi-Newton Algorithm, Acta
Electrotechnica et Informatica, 2008, 8(3), p.
31-35.
Mr T.Prince received his B.E degree
in Electronics and Communication Engineering from
Government Engineering College under Anna
339
University and M.E degree in Computer Science and
Engineering from Rajas Engineering College under
Anna University in 2005 and 2009, respectively. He is
currently pursuing his research in MAHER University.
His research interests include Mobile Computing,
MANET, Cloud Computing and so forth.
Dr S. Thabasu Kannan received his
M.Tech degree in Computer Science and Engineering
from PRIST University. He received his Ph.D in the
area of Bioinformatics in Madurai Kamaraj
University. He worked as HOD, Principal and
Director in different Engneering colleges. Currently he
is working as Director in Theni College of Arts and
Science. He published 49 research papers in
International Journals. He published 28 papers in
confereences. His 5 research papers were published in
research books. He got 8 prestigious awards for
academic and research excellence like Glory of
Education Excellence Award, Bharat Vidya
Shironmani Award, Eminent Educationist Award,
Golden Educationist of India Award, Rashtriya Vidya
Saraswathi Puraskar award, Mother Teresa Sadbhavna
Award, Bharat Vidya Ratan Award, Life time
education achievement award from different
organizations. He published 6 books in different field.
His research interests include Clustering and
modeling, pattern significance, privacy preserving,
watermarking database, Similarity search, diagnostics,
drug design. Health care cloud, Educational domain
and so forth.
https://sites.google.com/site/ijcsis/
ISSN 1947-5500