International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org

Volume 4, Issue 6, November - December 2015
ISSN 2278-6856

Comparative Analysis of Routing Protocols Used

for Improving Performance of TCP over Mobile
Ad-HocNetworks
Aniket Deshpande1 and Dr. Ashok Kaushal2
1

Research Scholar, Faculty of Engineering and Technology, Mewar University,

NH 79, Gangrar, Chittorgarh, Rajasthan 312901, India

Research Guide - Faculty of Engineering and Technology, Mewar University,

NH 79, Gangrar, Chittorgarh, Rajasthan 312901, India

Abstract
TCP/IP is the main networking protocol on the web and is
additionally the most broadly utilized. Because of these
reasons, its utilization over Mobile Ad-Hoc networks is a
conviction. Impromptu networks are inclined to Link
disappointments because of versatility. TCP is not able to
recognize failures because of route drops and congestion.
Thus, throughput lowers essentially when hubs move. It is
along these lines fundamental to study how TCP performs
over specially appointed networks. We have utilized
reproductions as a part of the CMU expansion to NS to break
down the execution of TCP Tahoe over a set of routing
protocols including the Signal Stability Adaptive routing
protocol that we have simulated in NS-2. We recognize
qualities in each of these routing protocols that focus the
conduct of TCP over them.

Keywords:Routing Protocol, Ad-Hoc Networks, Pause

Time, Throughput, Mean Speed

1. INTRODUCTION
With the perpetually expanding interest for network, the
requirement for portable remote correspondence is
inexorable.
The utilization of convenient laptops and hand held
gadgets are expanding quickly. Large portions of the
versatile specialized gadgets have the backing of a settled
base station or access indicates that relates the last-bounce
remote model. This pattern can be seen in wide-zone
remote cell frameworks. In any case, such a backing is not
accessible in settings where access to a wired framework
is unrealistic. Circumstances like common debacles,
meetings, and military settings are foremost in this
respect. This has prompted the improvement of Mobile
Ad-hoc Networks [l].
An Ad hoc system is an alterably changing system of cell
phones that impart without the backing of an altered
structure. There is an immediate correspondence among
neighboring gadgets however correspondence between
non-neighboring gadgets obliges a routing calculation. A
ton of work has been carried out on routing protocols
since they are basic to the working of impromptu
networks. Different routing protocols have been proposed

Volume 4, Issue 6, November December 2015

in the writing, for example, the Destination Sequenced

Distance Vector (DSDV) [2], Ad-hoc On-interest Distance
Vector (AODV) [3], Dynamic Source Routing (DSR) [4]
and Signal Stability based Adaptive (SSA) Routing [5].
TCP/IP is the standard networking protocol on the web.It
is the most generally utilized transport protocol for
information transfer like document exchange, email and
WWW program. Because of these reasons, its utilization
over portable Ad-Hoc networks is imperative. TCP,
basically intended for wire line networks, confronts
execution debasement when connected to the specially
appointed situation. Furthermore, variations of TCP act
diversely over different routing protocols. It is key to see
how TCP performs over impromptu networks. In this
paper, we have done an execution examination of TCP
over a set of Ad-Hoc routing protocols, i.e., DSR, DSDV,
AODV and SSA.
This paper is sorted out as takes after. Section2 presents
an outline of the specially appointed routing protocols that
we have dissected. Section 3 portrays the reproduction
approach. In Section 4, a dissection of the reenactment
results is introduced. Section5 closes the paper lastly
Section 6 proposes route for future work.

2. OUTLINE OF AD-HOC ROUTING PROTOCOLS

We now talk about the different routing protocols in a
word.
Dynamic Source Routing utilizes [4], source muttering
wherein the source decides the complete grouping of hubs
through which a bundle is to be routed. At whatever point
a source has a bundle to transmit, it checks its routing
table for a route to the end of the line. In the event that a
route is not discovered then a route demand telecast is
started. On getting this demand, every hub again shows
this solicitation by affixing its deliver to the appeal parcel
until this bundle achieves the destination. The end of the
line answers to the first demand that achieves it. It sends a
route answer to the source containing the route from the
source to the objective. At the point when this bundle
achieves the source an association is built and all resulting
bundles contain the complete route in the parcel header.
Page 202

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 4, Issue 6, November - December 2015
ISSN 2278-6856
No routing data is kept up at the halfway hubs. At the
point when the information connection layer at a specific
hub experiences a transmission disappointment, it issues a
blunder notice to the source and another route hunt is
launched.
In Destination Sequenced Distance Vector routing [2],
every hub keeps up a routing table wherein the following
bounce data for every reachable goal is kept up. Each hub
in the system occasionally telecasts its routing table with
monotonically expanding grouping numbers. An upgrade
is carried out utilizing the Bellman-Ford calculation. A
broken connection can be located if no shows have been
gotten from the hub for some time. On identification of a
broken connection, all courses passing through that
bounce are doled out infinity metric.
Specially appointed On-interest Distance Vector routing
[3] calculation obtains its remarkable gimmicks from DSR
and DSDV. At the point when a source needs a way to the
end, it telecasts a route demand message encasing a
monotonically expanding telecast id and the last known
succession number to that terminus. The route demand is
show until it achieves a hub that has a route to the end of
the line with the objective arrangement number higher
than that encased in the solicitation. A route demand
spreading through the system makes the following bounce
data for the opposite route to the source. A route answer
produced by the objective spreads along the opposite route
and creates the forward route data at the halfway hubs.
Every hub records just the following bounce for a goal and
not the whole route as done in source directing. Routing
table data in AODV is confined to the dynamic hubs. A
neighbor is viewed as dynamic in the event that it starts or
transfers no less than one parcel for the objective inside
the latest dynamic timeout period.
Disappointment of a connection can be recognized by
means of hi messages or connection layer discovery. At
the point when a connection goes down, the upstream
hubs are informed of the disappointment that terminus is
checked as inaccessible in the routing tables of these hubs.
In Signal Stability based Adaptive routing [5], each hub
keeps up a Routing Table wherein the terminus and the
following jump data is put away. Alongside this, a Signal
Table is likewise kept up where a record of the neighbors
is kept and they are delegated unequivocallyalternately
feebly joined. This is clone on the premise of occasional
connection layer guides got by a hub from its neighbors.
The SSA protocol utilizes the strength of connections as a
route determination paradigm. At the point when a source
has information to send to a terminus, for which there is
no entrance in the route cache, it telecasts route seek
bundles to its neighbors. The hubs getting these parcels
telecast the route seek on the off chance that it is gotten
from a strongly associated neighbor and the appeal has not
been spread awhile ago. At the point when a host moves
out of the scope of its neighbors or close down, the
neighbors perceive that the host is inaccessible.

Volume 4, Issue 6, November December 2015

The routing table and the sign table are in like manner
adjusted and a route slip bundle is sent to the source. On
getting this blunder warning the source launches another
route look / search.

3 EXPERIMENTAL SETUP
In this paper, we have recreated the scenario to study the
execution of TCP over specially appointed routing
protocols. We have done the reenactments in Network
Simulator (NS-2) from Lawrence Berkeley National
Laboratory (LBNL) with augmentations from the
MONARCH Project at Carnegie Mellon University [9].
At the physical layer, the broadened ns utilize a radio
proliferation model supporting engendering deferral,
Omni-directional receiving wires / antennas, and an
imparted media system interface. The IEEE 802.11
Medium Access Protocol is utilized at the Link Layer
level. We have broadened ns-2 for displaying the SSA
protocol. The inspiration driving this is that SSA is the
main protocol among these that considers the security of a
course. .
For the execution dissection of the routing protocols we
have reenacted a situation of 25 hubs moving in a
rectangular topology of 150om x 300m, with every hub
having a transmission scope of 250m. All hubs speak with
indistinguishable remote radios, which have a data
transmission of 2mbps. The reproductions are run for a
time of 200 seconds. Every reproduction is run in excess
of 50 diverse versatility situations. We have utilized a
solitary TCP activity source in every reproduction. The
rendition of TCP utilized is TCP Tahoe with quick
retransmit [1,2]. The hubs in the simulation move as
indicated by the 'arbitrary waypoint' model.
Every situation is portrayed by a stop time that fluctuates
arbitrarily between 0. 9 ~- 1. 1w~h ere "p" is the mean
stop time quality indicated at the time of the situation
record era. Toward the beginning of the recreation, every
hub sits tight for a stop time. It then arbitrarily chooses its
objective and moves towards this end with a velocity
haphazardly lying between 0. 9 ~- 1. 1~ where "v" is the
detailed mean velocity. On arriving at this objective it
stops again and rehashes the above system till the end of
the recreation. The reproductions are run for mean paces
of 2, 6, IO, 15 and 20 m/s and stop times of 0 and 10
seconds (50 situations for each one mean speed and stop
time particular).
The measure of information transmitted by a TCP source
for every unit time has been picked as our execution
metric. Hub versatility is portrayed by the normal hub rate
and the normal stop time of the hubs. We screen the above
metric as a capacity of mean hub speed and stop time to
survey the capacity of a routing protocol to conform to
changing hub versatility.

4 REENACTMENT RESULTS
In Figure 1, 2 and 3, we demonstrate the variety of TCP
Tahoe Throughput versus mean rate of hubs for a stop
Page 203

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 4, Issue 6, November - December 2015
ISSN 2278-6856
time of 0, 10 and 20 seconds separately. As can be seen,
the throughput diminishes with expanding mean velocity
of hubs. Expanding mean rate brings about higher
versatility and thus the recurrence of route
disappointments
increments.
Because
of
route
disappointments TCP movement endures bundle
misfortunes that are deciphered as indications of clogging
and subsequently TCP psychologists its transmission
window. In addition, a postponement must be acquired to
scan for another course. This results in debasement of the
TCP throughput.

on-interest protocols outflank DSDV regardless of the

portability rate. DSR has basically no overheads at low
speeds on the grounds that it is an on-interest protocol and
there are no occasional trades between the hubs.

Figure. 3. TCP Tahoe [Throughput versus Mean Speed];

Pause Time = 20 sec.

Figure. 1. TCP Tahoe [Throughput versus Mean Speed];

Pause Time = 0 sec

Figure. 2. TCP Tahoe [Throughput versus Mean Speed];

Pause Time = 10 sec
DSDV performs the worst among all the protocols. Since
DSDV is a table driven protocol, the routing table at every
host maintains exhaustive information about the network
topology. The adaptation to the dynamically changing
network is associated with large routing overheads. An
on-demand protocol, on the other hand, searches for a
route whenever a need arises for it. Accordingly, all the

Volume 4, Issue 6, November December 2015

Consequently, at low speeds, DSR beats different

protocols (see Figure 1, 2 and 3). DSR keeps up all
entrances (dynamic and inert) in its route store. At high
mean speeds, the courses in the route cache can run stale
with a genuinely high recurrence and incorrect courses
may get framed by means of route quests started by the
source [8].
Additionally, DSR has no understanding of arrangement
numbers and subsequently the staleness of the route store
may prompt routing circle structuring. These can prompt
debasement of TCP throughput particularly at high mean
quick.
In AODV, adequate route cache administration is carried
out by means of a store entrance timeout that guarantees
that just dynamic courses are kept up in the route cache.
This keeps the issue of a stale route passage in the route
cache. Additionally, the utilization of arrangement
numbers keeps the shaping of routing circles. Henceforth
the throughput debasement with expanding mean speed in
AODV is genuinely little (see Figure 1, 2 and 3).
The route foundation in SSA is carried out through
emphatically associated hosts. SSA picks a route focused
around its security.
Consequently,
the route
disappointments at high portability are less regular than
some other protocol. Because of this, SSA outflanks DSR,
DSDV and AODV (which have no thought for
dependability of a course) at high mean velocities. The
connection quality appraisal and the utilization of hi
messages constitute extra overheads because of which
SSA does not perform well at low speeds.
From the results got, we gather that recurrence of route
disappointments, routing overhead and defer in route
foundation are the key peculiarities that influence TCP
Page 204

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 4, Issue 6, November - December 2015
ISSN 2278-6856
throughput in a specially appointed system. A past work
[9] highlighted the vitality of route length in deciding the
execution of TCP. Subsequently, a routing protocol that
scans for shorter and stable courses would perform well.
DSR, AODV and DSDV incline toward shorter courses
while SSA picks stable courses. The dependability of the
courses gets to be significantly more pivotal at high
portability as can be seen from SSA's execution at high
mean paces.

In SSA, each hub arranges its neighbors as "firmly" or

"pitifully" associated. This arrangement is carried out on
the premise of sign quality data of the bundles got from
the neighbors. A click for a neighbor is recorded if in a
period quantum a guide has been gotten with a solid sign
from the neighboring host. In the event that the quantity
of clicks surpasses click-limit esteem then the neighbor is
perceived as a firmly associated neighbor. In Figure 5, the
TCP throughput is plotted as a capacity of shifting clickedge values with settled mean speed and stop time of the
hubs. We find that SSA with area strength performs more
awful than without area security. This is on account of
area strength puts a much stronger condition on the
decision of a route as unequivocally associated. In the
event that SSA is not able to discover a solid course, route
disclosure takes longer time and thus TCP throughput
debases. So area soundness ought to be mindfully utilized
as a part of conjunction with SSA protocol.

5 CONCLUSION

Figure. 4. TCP Tahoe [Throughput v/s Mean Speed over

DSR with / without cache replies]
There are a few peculiarities of routing protocols that
assume a significant part in deciding their execution. The
conspicuous one among these is the utilization of route
cache in DSR and area security in SSA. We have shifted
these gimmicks and dissected the impacts of these on the
execution of TCP. In Figure 4, TCP throughput is
measured as a capacity of mean velocity of the hubs with
DSR as the underlying routing protocol. A correlation of
DSR with route answers from cache and without route
answers from store is carried out. There is a huge change
in the TCP throughput when the route answers from store
are crippled (see Figure 4). As noted in the recent past,
this is because of the issue of stale sections in the route
cache at the transitional hubs. A point-by-point
examination of this perception has been exhibited in [8].

Figure. 5. TCP Tahoe [Throughput versus click threshold

over SSA], [Mean Speed = 6 d s], [Pause Time = 0 sec]

Volume 4, Issue 6, November December 2015

Over the recent years, assortments of routing protocols

have been proposed for Mobile Ad-Hoc Networks.
In any case, little work has been carried out to study the
execution of TCP activity over these protocols. We have
dissected the execution of TCP over these protocols
utilizing recreations as a part of ns. We have changed the
ns system test system to incorporate the SSA routing
protocol. We recreated every protocol in impromptu
networks comprising of 25 portable hubs and displayed
the results for a scope of hub versatility rates and
development speeds.
We have recognized a few gimmicks of routing protocols
that influence the TCP performance. We have additionally
examined the performance of TCP by fluctuating
particular key parameters of some routing protocols. We
accept that this is one of the first works that shows an
execution-based correlation of TCP over diverse Ad-Hoc
routing protocols.

6 SCOPE FOR FUTURE WORK

We have reenacted an Ad Hoc system for a solitary TCP
activity source. We accept that it would be intriguing to
see the execution of the routing protocols with numerous
activity sources. Since TCP execution is nearly coupled
with the steadiness and length of the courses in
impromptu networks, more work needs to be carried out to
create a routing protocol that mulls over these when
picking a course. We expect to do a broad study that
consolidates new routing protocols and variations of TCP.
REFERENCES
[1]. C. E. Perkins and E. M. Royer. Unrehearsed OnDemandDistance Vector Routing, Proceedings of the
second IEEE Workshop on Mobile Computing
Networks and Applications, New Orleans, LA,
February 1999, pp. 90-100.
[2]. Charles Perkins and Pravin Bhagwat. Extremely
Dynamic Destination- Sequenced Distance Vector
Page 205

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 4, Issue 6, November - December 2015
ISSN 2278-6856

[3].

[4].

[5].

[6].

[7].
[8].

[9].

Routing for Mobile Computers. ACM SIGCOMM,

1994.
David B. Johnson and David A. Maltz. Dynamic
Source Routing in Ad Hoc Wireless Networks, In
Mobile Computing, adjusted by Tomasz Imielinski
and Hank Korth, Chapter 5, pages 153.181,
Kluweracademic Publishers, 1996.
Elizabeth M. Royer and C.-K. Toh. A Review of
Current Routing Protocols for Ad-Hoc Mobile
Wireless Networks, IEEE Personal Communicate
particles Magazine, April 1999, pp. 46.55.
G. Holland and N. H. Vaidya. Analysis of TCP
Performance over Mobile Ad-Hoc Networks, Fifth
Annual International Conference on Mobile
Computing and Networking (MOBICOM), Seattle,
August 1999.
Josh Broch, David A. Maltz, David B. Johnson, YihChun Hu, and Jojeta Jetcheva. A Performance
Comparison of Multi-Hop Wireless Ad Hoc Network
Routing Protocols, In Proceedings of the Fourth
Annual ACMIEEE International Conference on
Mobile Computing and Network ng, ACM, Dallas,
TX, October 1998.
K. Chandran, International Conference on Distributed
Computing Networks, US, May 26-29, 1998.
M. Gerla, K. Tang and R. Bagrodia. TCP
Performance in Wireless Multi-hop Networks, In
Proceedings of IEEE Wmcsa99, Feb. 1999.
David B. Johnson and David A. Maltz.Protocols for
Adaptive Wireless and Mobile Networking. IEEE
Personal Communications, 3(1):34-42, February
1996.

including recent advances in ICT, Electronics & GIS

including Cloud Computing, Crowdsourcing, Big Data,
Smart Phones, Digital Wallet, RFID, Mobile Computing
ecosystem with Applications in eGovernance and
Surveillance including Smart Cities.

AUTHORS
1

Aniket Deshpande is pursuing his

PhD in Computer Networking at
Mewar
University,
Chittorgarh,
Rajasthan, India under the guidance of
Dr. Ashok Kaushal. He received his
Master of Technology in Computer
Science and Engineering from Dr. MGR Educational and
Research Institute, Chennai, Tamil Nadu, India in 2004.
Prior to that he completed his Bachelor of Engineering in
Computer Technology from Nagpur University in 2000.
Network Infrastructure Optimization has been his key area
of interest for last many years and is currently working
with Riverbed Technology as a Solution Consultant.
1

Dr. Ashok Kaushal completed his

Master of Technology in 1983 from Lviv
Polytechnic
National
University,
Ukrainefollowed by Ph.D. in 1987 from
National Technical University of
Ukraine (formerly Kyiv Polytechnic
Institute) in Computer Technology.He has extensive
Industry experience and is also presently working as a
Research Guide and Visiting Faculty at Mewar University.
Additionally, he is also working as a Freelance consultant
with special interests in Geospatial Technologies (GIS)

Volume 4, Issue 6, November December 2015

Page 206