Improved route selection algorithm based on TORA over mobile adhoc network

Abstract

MANETs are used in a variety of applications due to their ability to establish and release networks instantly without the need for a pre-established network or infrastructure. Here the challenging task is to search for the most efficient routing Energy is the main source of MANET and each node consumes energy during transmission. Energy-efficient protocols like AODV, DSR, TORA, etc. have already been proposed. In our proposed work we are using TORA to improve route selection. “Temporarily Ordered Routing Algorithm (TORA) is an adaptive loop-free routing protocol that works on route reversal method. The protocol is based on a link reversal algorithm and uses a direct acyclic graph (DAG) for route finding. As TORA maintains multi routes from source to destination, the energy drain is an issue so energy efficiency is of utmost importance. In this work, Mod TORA work as a load balancer with successor and feasible successor path for each connection considers the energy parameter & modifies the routing table. The purpose of selecting load balance is for the Fair battery consumption of the nodes and link failure purpose. We are changing the route selection mechanism. Mod TORA used Energy and multipath mechanism with optimized routing. The two best routes are found and if the first one fails then the second route is selected, to improve the performance of TORA and thus ultimately leading to load balancing.

Full text

Full Terms & Conditions of access and use can be found at
https://www.tandfonline.com/action/journalInformation?journalCode=tdmc20
Journal of Discrete Mathematical Sciences and
Cryptography
ISSN: 0972-0529 (Print) 2169-0065 (Online) Journal homepage: https://www.tandfonline.com/loi/tdmc20
Improved route selection algorithm based on
TORA over mobile adhoc network
Payal M Thakrar, Vijander Singh & Ketan Kotecha
To cite this article: Payal M Thakrar, Vijander Singh & Ketan Kotecha (2020) Improved route
selection algorithm based on TORA over mobile adhoc network, Journal of Discrete Mathematical
Sciences and Cryptography, 23:2, 617-629, DOI: 10.1080/09720529.2020.1729508
To link to this article: https://doi.org/10.1080/09720529.2020.1729508
Published online: 14 May 2020.
Submit your article to this journal
View related articles
View Crossmark data

©
Improved route selection algorithm based on TORA over mobile adhoc
network
Payal M Thakrar †
Amity Institute of Information Technology
Amity University Jaipur
Jaipur 303007
Rajasthan
India
Vijander Singh *
Department of Computer Science and Engineering
Manipal University Jaipur
Jaipur 303007
Rajasthan
India
Ketan Kotecha §
Faculty of Engineering
Symbiosis Institute of Technology
Pune 412115
Maharastra
India
Abstract
MANETs are used in a variety of applications due to their ability to establish and
release networks instantly without the need for a pre-established network or infrastructure.
Here the challenging task is to search for the most efficient routing Energy is the main
source of MANET and each node consumes energy during transmission. Energy-efficient
protocols like AODV, DSR, TORA, etc. have already been proposed. In our proposed work
we are using TORA to improve route selection. “Temporarily Ordered Routing Algorithm
(TORA) is an adaptive loop-free routing protocol that works on route reversal method. The
protocol is based on a link reversal algorithm and uses a direct acyclic graph (DAG) for route
finding. As TORA maintains multi routes from source to destination, the energy drain is an
†E-mail: payal.mashru@yahoo.com
*E-mail: vijan2005@gmail.com (Corresponding Author)
§E-mail: drketankotecha@gmail.com
Journal of Discrete Mathematical Sciences & Cr yptography
ISSN 0972-0529 (Print), ISSN 2169-0065 (Online)
Vol. 23 (2020), No. 2, pp. 617–629
DOI : 10.1080/09720529.2020.1729508

618 P. M. THAKRAR, V. SINGH AND K. KOTECHA
issue so energy efficiency is of utmost importance. In this work, Mod TORA work as a load
balancer with successor and feasible successor path for each connection considers the energy
parameter & modifies the routing table. The purpose of selecting load balance is for the
Fair battery consumption of the nodes and link failure purpose. We are changing the route
selection mechanism. Mod TORA used Energy and multipath mechanism with optimized
routing. The two best routes are found and if the first one fails then the second route is
selected, to improve the performance of TORA and thus ultimately leading to load balancing.
Subject Classification: 68M12 network protocols
Keywords: TORA, Load balancing, Energy, Multipath.
1. Introduction
Infrastructure less wireless network is also known as Mobile Ad
Network (MANET). These are the systems which are having no fixed
nodes [3]. The association and control of the network is simply the duty
shared by the nodes themselves. The entire network is portable and the
individual nodes are permitted to move freely communicate to each other
[9].Network nodes have an additional capacity of being switches, which
are capable of finding and keeping up the courses to different nodes in the
network [11]. A variety of areas of the nodes are found for instance the
node might be situated in or on planes, ships, trucks, autos, maybe even
on individuals or little gadgets.
1.1 Routing Protocol
Routing is an important concern because of MANET’s distributed
and dynamic nature[1]. There are two types of routing schemes supported
by MANET as shown in Fig 1.
[Source : Self]
Figure 1
Types of Routing Protocols.

IMPROVED ROUTE SELECTION ALGORITHM 619
1.2 Objective
The aim of this research is to study the Energy Efficiency in TORA
routing protocol and its effects on the network performance and finding a
feasible solution to overcome this problem of energy drainage and to find
the optimal path for efficient routing.
2. Introduction of TORA
The Temporally Ordered Routing Algorithm (TORA) is a profoundly
versatile circle free disseminated steering calculation dependent on
the connection inversion idea. TORA is intended to limit response to
topological changes. [5] The design idea of TORA is to decouple the age
of possibly spread-out control messages from the pace of topological
changes. [10]
2.1 TORA Algorithm
TORA uses route creation, maintains and deletion base on DAG. For
every node in the network, a different coordinated non-cyclic diagram
(DAG) is kept up for every goal. At the point when a node needs a course to
a specific goal, it communicates a QUERY parcel containing the location of
the goal for which it requires a course. This bundle engenders through the
system until it comes to either the goal or a halfway node having a course
to the goal [10]. The benefit of the QUERY at that point communicates an
UPDATE bundle posting its tallness regarding the goal as shown in Fig.
2. As this parcel spreads through the network, every node that gets the
UPDATE sets its tallness to a worth more prominent than the stature of
the neighbor from which the UPDATE has been gotten. [5][10] This has the
impact of making a progression of coordinated connections from the first
sender of the QUERY to the node that at first created the UPDATE. At the
point when a node finds that a course to a goal is never again substantial, it
modifies its tallness so it is a nearby most extreme regarding its neighbors
and transmits an UPDATE parcelas shown in Fig.3. On the off chance
that the node has no neighbors of limited tallness regarding this goal, at
that point the node rather endeavors to find another course as depicted
previously. [10] When a node identifies a system segment, it produces a
CLEAR parcel that resets directing state and expels invalid courses from
the systemas shown in Fig.4.The three fundamental capacities conveyed
by TORA are route creation, maintenance, and erasure [5].

620 P. M. THAKRAR, V. SINGH AND K. KOTECHA
2.1.1 Route creation
[Source : self]
Figure 2
Route Creation
2.1.2 Route Maintenance
[Source : self]
Figure 3
Route Maintenance
2.1.3 Route Erasure
[Source : self]
Figure 4
Route Erasure

IMPROVED ROUTE SELECTION ALGORITHM 621
3. Literature review
“Improving TORA Protocol using Ant Colony Optimization
Algorithm” [1]
Merril Roshini Mathias et.al in 2018 presents a QoS empowered
Temporally Ordered Routing Algorithm utilizing Ant Colony
Optimization called AntTORA. ACO calculations have demonstrated to
be a decent technique for creating directing calculations for impromptu
arranges. ACO based directing is a productive steering plan dependent
on the conduct of scrounging ants. The aggregate conduct of ants finds
the smallest way from the home to a nourishment source, by affidavit of
a synthetic substance called pheromone on the visited nodes. It’s used in
the TORA convention to enhance numerous QoS measurements like start
to finish delay, throughput, jitter, etc.
“A Stable TORA Based for Routing in Mobile Ad Ηoc Networks” [2].
Sajjad Jahanbakhsh et.al in 2017 presents stable steering is one
technique to face directing difficulties in versatile specially appointed
systems. The goal of this examination is to balance out the TORA
convention which is a conveyed steering convention, with high
adjustment, effectiveness, and reasonableness for enormous and thick
versatile specially appointed systems and along these lines to give another
high productivity convention.
“CO-TORA On-demand Routing Protocol for Cognitive RANET” [3]
Lamia El Garoui et.al in 2014 presents a strong and proficient steering
arrangement as far as throughput. The recommendation is a receptive
directing convention (named subjective impermanent requesting steering
calculation) CO-TORA dependent on the exemplary TORA convention
proposed for non-intellectual remote specially appointed systems.
“Mechanism of IMEP on Performance of TORA under different
Mobility models”. [4]
Amardeep Kaur et.al in 2014 presents an Increment in most extreme
number of OBM (BEACON) retransmissions to improve TORA execution.
More than one portability models considered. Random course Model gave
best predictable execution.italsoIncrease in maximum number of OBM
(BEACON) retransmissions, decrease Routing Overhead, and increase
Packet Delivery Ratio and detection of link.ModTORA perform fast and
less energy consumption.
“The Application and Improvement of TORA in Swarm Network
with Unmanned Aerial Vehicle Nodes”. [5]
Zhongqiang Zhai et.al in 2013 present a TORA used reorder
mechanism and change cost value for routing. Here TORA adds cost

622 P. M. THAKRAR, V. SINGH AND K. KOTECHA
value in the routing table and base on that finds the best path. IMEP also
modified and modified hello packet for sent cost value over a neighbor
node.
“An In-depth analysis of Effects of IMEP on TORA protocol”. [6]
K.Hui Lim Et.al in 2012 presents a link/Connection statusSensing :
Connection/association status detecting gives TORA exact and current
connection status data of a hub to its neighbors and whether the
connections are bi-directional or unidirectional.
“Efficient Routing Protocols for Mobile Ad Hoc Network’s”. [7]
R. Thiagarajan et.al in 2013 presents a TORA user advertisement
message for making a neighbor relationship. For best pathfinding change
echanism and remove the IMEP process and instead use hello mechanism
for sending cost value. Delay and bandwidth use as cost function with
this TORA.
4. Modified TORA(Mod -TORA) Algorithm:
4.1 Proposed Algorithm
[1] If a node has greater residual energy than the threshold, the node
sends modify Query message with its residual energy appended to
it.
[2] After receiving multiple mod Qry packet destinations follow the
link reversal algorithm and send back upped packet with whole
path information to the source.
[3] With the help of this modified Update message source node first
stores the energy of the individual node & calculates the energy of
the whole path. Finally, calculate the cost function. [st = a [Emin/
Etotal] + (1 - a) [1/hc] ] : Where a is constant 0 to 1.
[4] Using this cost function each node creates an entry in the routing
table and maintains successor and feasible successor paths for
particular destination Successor and Feasible successor paths are
selected as the highest cost path and Next highest cost path. This
multipath mechanism used during link failure and in loadbalancing.

IMPROVED ROUTE SELECTION ALGORITHM 623
4.2 Proposed flowchartas shown in Fig. 5
[Source : Self]
Figure 5
Flow chart
5. Simulation Setup
In this study, the developed algorithm is stimulated in ns3 simulator.
5.1 Simulation setup are given in Table 1 :
Table 1
Parameter Value
Terrain area 500*500
Protocol TORA
Traffic CBR
Antenna Omnidirectional
Packet size 500 bytes
Packet Queue Size 50
Time 15 sec
No.of. nodes Varying from 7,14,21 & 28

624 P. M. THAKRAR, V. SINGH AND K. KOTECHA
6. Result Analysis
[1] Performance analysis of throughput (Kbps)are given in Table 2.
Table 2
[Source: self]
No. of node TORA M-TORA
7 2404.92 2407.56
14 2386.71 2393.64
21 2233.64 2393.64
28 2807.45 3141.39
Correct start time.
[2] Performance analysis of Good put (Kbps) are given in Table 3.
Table 3
[Source: self]
No. of node TORA M-TORA
7 1802.70 1804.51
14 1716.03 1718.95
21 1424.89 1718.95
28 1557.41 1841.51

IMPROVED ROUTE SELECTION ALGORITHM 625
Goodput= pkt_size-hdr_size (pkt_size%512)
[3] Performance analysis of Packet delivery ratio (%) are given in Table 4
Table 4
[Source: self]
No. of node TORA M-TORA
7 98.38 98.60
14 99.88 99.90
21 99.49 99.90
28 99.26 99.63
pdr=(received line/send line) *100

626 P. M. THAKRAR, V. SINGH AND K. KOTECHA
[4] Performance analysis of Residual Energy (J) are given in Table 5.
Table 5
[Source: self]
No. of node TORA M-TORA
7 84.601051 87.402903
14 87.091508 90.331697
21 87.592470 90.331697
28 87.228005 89.171248
[5] Performance analysis of Consume Energy (J) are given in Table 6.
Table 6
[Source: self]
No. of node TORA M-TORA
7 15.398948 12.597097
14 12.908492 9.668303
21 12.40753 9.668303
28 12.771995 10.828752

IMPROVED ROUTE SELECTION ALGORITHM 627
6. Conclusion & future work
Mobile Ad-Hoc Networks (MANETs) have become an important
part of wireless networking due to advantages like ease of deployment,
decentralization, self-configuring, etc. With detail study about Mobile
Ad hoc network, working of the ad hoc networks, types of protocols,
various benefits and applications of mobile ad hoc network is known with
the limitations of the network. There are mainly two kinds of protocols
reactive and proactive, by detail study of literature review and research
gap of various protocols, TORA protocol is taken, the detailed study of the
protocol and functionalities of the protocol are observed. The simulation
in ns2 of the original protocol is observed and after that energy field is
introduced. The parameters are throughput, goodput, packet delivery
ratio, residual energy and consume energy. There will be an improvement
in the results of a modified version of the protocol.
References
 [1] Mathias, Merril Roshini, Rayan Rahul D’Souza, Sanjana Bhat, Savina
Jassica Colaco, and Renuka Tantry. “Improving TORA Protocol using
Ant Colony Optimization Algorithm.” (2017).
 [2] Gudakahriz, S. Jahanbakhsh, Shahram Jamali, M. Vajed Khiavi, and
A. Soleimany. “A Stable TORA Based for Routing in Mobile Ad Ηoc
Networks.”Engineering, Technology & Applied Science Research8, no. 1
(2018): 2532-2536.

628 P. M. THAKRAR, V. SINGH AND K. KOTECHA
 [3] El Garoui, Lamia, Wessam Ajib, and Halima Elbiaze. “CO-TORA
on-demand routing protocol for cognitive radio ad-hoc networks.”
In 2014 International Wireless Communications and Mobile Com-
puting Conference (IWCMC), pp. 654-659. IEEE, 2014.
 [4] Kaur, Amandeep, and Meenakshi Mittal. “Influence of link sensing
mechanism of IMEP on the performance of TORA under different
mobility models.” In2014 International Conference on Parallel, Dis-
tributed and Grid Computing, pp. 16-21. IEEE, 2014.
 [5] Zhai, Z., J. Du, and Y. Ren. “The application and improvement of
temporally ordered routing algorithm in swarm network with un-
manned aerial vehicle nodes.” InProc. IEEE ICWMC, pp. 7-12. 2013.
 [6] Lim, Kwan Hui, and Amitava Datta. “An In-depth Analysis of the
Effects of IMEP on TORA Protocol.” In2012 IEEE Wireless Commu-
nications and Networking Conference (WCNC), pp. 3051-3056. IEEE,
2012.
 [7] Gouda, Bhabani Sankar, Ashish Kumar Dass, and K. Lakshmi Na-
rayana. “A comprehensive performance analysis of energy efficient
routing protocols in different traffic based mobile ad-hoc networks.”
In 2013 International Mutli-Conference on Automation, Comput-
ing, Communication, Control and Compressed Sensing (iMac4s), pp.
306-312. IEEE, 2013.
 [8] Kumar, Ankit, Pankaj Dadheech, Vijander Singh, Linesh Raja, and
Ramesh C. Poonia. “An enhanced quantum key distribution protocol
for security authentication.”Journal of Discrete Mathematical Sciences
and Cryptography22, no. 4 (2019): 499-507.
 [9] Jha, Govind Kumar, Neeraj Kumar, Himanshu Sharma, and K. G.
Sharma. “Improvement of QoS performance in MANET by QoS-TO-
RA: A TORA Based QoS Routing Algorithm.” InInternational Con-
ference on Network Security and Applications, pp. 89-99. Springer,
Berlin, Heidelberg, 2011.
[10] Park, Vincent. “Temporally-ordered routing algorithm (TORA) ver-
sion 1 functional specification.”Internet Draft, draft-ietf-manet-tora-
spec-04. Txt(2001).
[11] Liu, Qiang, Hua Wang, Jingming Kuang, Zheng Wang, and Zhim-
ing Bi. “WSNp1-1: M-TORA: a TORA-based multi-path routing algo-
rithm for mobile ad hoc networks.” InIEEE Globecom 2006, pp. 1-5.
IEEE, 2006.

IMPROVED ROUTE SELECTION ALGORITHM 629
[12] Panwar, Deepak, Pradeep Tomar, and Vijandra Singh. “Hybridiza-
tion of Cuckoo-ACO algorithm for test case prioritization.”Journal of
Statistics and Management Systems21, no. 4 (2018): 539-546.
[13] Gupta, Shaurya, Ramesh C. Poonia, and X. Z. Gao. “Relative study of
steering protocols in delay tolerant network.”Journal of Statistics and
Management Systems20, no. 4 (2017): 669-679.
[14] Kalra, Manish, and Ramesh C. Poonia. “Simulation of BB84 and pro-
posed protocol for quantum key distribution.”Journal of Statistics and
Management Systems21, no. 4 (2018): 661-666.