Multipath On Demand Routing Protocols Computer Science Essay


Mobile Ad-hoc Network ( MANET ) is decidedly an attractive engineering which has enticed a batch of research enterprise within the last old ages. Even though the theory of radio, structure-less, dynamic webs is attractive, there are still several chief imperfectnesss which avoid industrial growing. Security is merely one of these primary obstructions ; MANETs is known as specifically at hazard of security work stoppage. One solution offered to better security strength is by utilizing multipath routing algorithms. Nevertheless multipath routing besides presents new issues when it comes to security and security operating expense. In this paper we look at the trouble of protected routing and expose the Trust Route Spatially Disjoint Paths ( TRSDMP ) routing protocol.TRSDMP selects one of the most The larger trust degrees for that node through spatially disjoint paths. The results reveal that TRSDMP raises the web throughput and minimizes each the measure of find operating expense and besides end-to-end hold.

1. Introduction

Wireless webs have a batch of attending these old ages ; this is due to the additions in its use and applications, such as nomadic phones, laptops or personal digital aids ( PDAs ) . Infrastructure-less radio webs or MANETs one of the Wireless webs class that does non dwell of a Base Station ( BS ) to link a wired Local Area Network ( LAN ) , so in MANET each node has the duty to pull off the path each in its scope.

Routing is a cardinal issue of webs. One of these challenges that create the propose of nomadic ad hoc web routing protocols a complicated undertaking. The deficiency of substructures in wireless web makes it vulnerable to many types of onslaughts ( Mavropodi and Douligeris, 2006 ) , Because the most hard to procure due to the fact that transmittal medium is unfastened to anyone within the geographical scope of a sender.

We Will Write a Custom Essay Specifically
For You For Only $13.90/page!

order now

There are specific types of onslaught that can look in MANET ‘s such as: Denial of service onslaughts aim at the complete break of the routing map and hence the whole operation of the ad hoc web. ( Argyroudis and O’Mahony, 2004 ) , and Lack of cooperation onslaughts that happens when the node does non supply its services to other nodes to salvage its ain resources like, calculation power and energy ( Berton et al, 2006 ) .

While encoding of radio traffic can be achieved, it is normally at the disbursal of increased cost and reduced public presentation. Many routing protocols have been proposed to work out the security jobs emerged in MANET.

The remainder of the paper is structured as follows. In subdivision 2 we review related work. Section 3 explains the TRSDMP protocol. Section 4 shows and analysis protocol public presentation based on simulations with Glomosim simulation. Finally, in Section 5 we sum up our decisions and discourse some future work.


Many researches have focused on multipath routing protocols Multipath on-demand routing protocols try to detect multiple waies at both the traffic beginnings and at intermediate nodes in a individual path find effort, and supply a unafraid way for multipath routing protocols.

In this subdivision we will supply a related work of the Multipath Routing in MANET ‘s and Secure Routing Protocols for MANET ‘s.

2.1 Multipath Routing in MANET ‘s

Multipath routing protocols try to detect multiple waies at both the traffic beginnings and at intermediate nodes in a individual path find effort. Multipath routing besides provides a higher bandwidth and effectual burden equilibrating since the burden of informations send oning can be distributed over the bing waies ( Meghanathan, 2007 ) . Besides the multiple waies are utilised as a backup or subsidiary method in most of multipath routing protocols ( Wu and Harms, 2001 ) .

The Ad Hoc On-demand Distance Vector Routing ( AODV ) protocol is a reactive routing protocol that maintains information when paths needed merely. And builds a individual cringle free way to each other node on the web, merely one way is saved although excess packages are sufficient to build more than one way. On the other manus, Ad hoc On-demand Multipath Distance Vector Routing ( AOMDV ) is a multipath extension of AODV that computes multiple loop-free link-disjoint paths. Each node has a routing table keeps routing information for the finish. Periodic hullo messages are used to observe and supervise links to neighbors and to update the routing tabular array. ( Marina and Das, 2001 ) .

When a traffic beginning needs a path to a finish in AOMDV, it starts the path find procedure. A route find procedure initiated by deluging Route Request ( RREQ ) package across the web and waiting for a Route Reply ( RREP ) message. Any intermediate node having a RREQ sets up a rearward way to the beginning, and if it has a valid path to the finish it will bring forth a RREP, otherwise it will rerun the RREQ package. As the finish node receives a RREQ, it besides generates a RREP. The generated RREP will be sent straight to the beginning utilizing the rearward way.

Alteration of the ad-hoc On-Demand Multipath Distance Victor routing protocol ( AOMDV ) to detect a set of node-disjoint waies, which are spatially separated this alteration present new protocol called Maximally spatially Disjoint Multipath Routing Protocol ( MSDMP ) . MSDMP design is based on AOMDV, When a traffic beginning needs a path to a specific finish, it starts the path find procedure. The path find procedure is initiated by deluging a RREQ package across the web and waiting for a RREP ( Almobaideen et al, 2008 ) .

The MSDMP modifies the AOMDV RREQ message to include the list of nodes take parting in the way between a specific beginning and finish. The list of waies included in the RREQ message helps in make up one’s minding whether a specific path satisfies the disjointness belongings or non. The new RREQ message of MSDMP show new filed added to the RREQ message is the Route List field, which shops the references of the nodes that are take parting in the way.

2.2 Secure Routing Protocols for MANET ‘s

Since security is an indispensable issue in ad hoc webs, many secure routing protocols have been proposed to advert the security challenges and issues related to routing in ad hoc web.

In ( Han et al, 2006 ) , Multipath Security Aware Routing ( MP-SAR ) is suggested as an betterment of the existed Security Aware Routing ( SAR ) protocol. MP-SAR supports informations confidentially offered by SAR and increases public presentation of informations transmittal velocity.

The being of multiple waies between nodes in an ad hoc web introduce a solution for procuring informations transmittal. The new solution which focuses on informations security transmission facets is called Secured Data based Multipath routing protocol ( SDMP ) . This protocol uses the advantage of the fact that even if an aggressor succeeds to hold one or tonss of familial parts, the chance of original message Reconstruction is low ( Bouam and Benothman, 2003 ) .

In ( Talipov et al, 2006 ) , the writers propose a way skiping method based on R-AODV ( Kim et al, 2006 ) . Path Hopping Reverse AODV ( PHR-AODV ) provides an analytic method to anticipate invasion rate. In add-on, the writers present a way skiping routing mechanism to construct complete or partial node-disjoint multipath depending on the web topology.

Secure Ad hoc On-demand Distance Vector ( SAODV ) is an offer for security extension to the AODV protocol ( Zapata and Asokan, 2002 ) . In SAODV, every path find that is initiated by a node corresponds to a new one-way hash concatenation.


TRSDMP is proposed as alteration of both protocol MSDMP and AOMDV. TRSDMP chooses the most spatially disjoint waies, which could fall in partly via nodes that specify a certain security threshold. Using TRSDMP, taking parted disjoint waies that are more secure, could be better than taking other maximally spatially disjoint waies that are less secure.

TRSDMP insert in RREQ message the trust degree of the node participated in the path way, and the path list in the AOMDV RREQ message.Figure 3.3 shows the new RREQ message used in TRSDMP. The Trust-Level List carries the trust value of each node participated in the Route-List.

Figure 3.1: TRSDMP RREQ Message Format.

In TRSDMP adjust the maximally node disjoint algorithm to do the way go partly disjoint via nodes that specify a certain trust threshold. When an intermediate node checks the disjointness of a certain way and there is a common node in this way, a cheque of trust degree of this common node is made. If the trust degree of the common node exceeds a certain threshold value, this way will be considered in the choice procedure of multipath.

Through TRSDMP the trust value must be added to the Trust-Level List in the RREQ package. Any node cheques the disjointness of the way and before bring forthing a RREP package on a specific way it must look into the Trust degree of all the nodes take parting in the way. If the way has a node with trust value less than a certain trust threshold this way will non be used and the RREQ will be discarded.


In this paper the Global Mobile Information System Simulation Library web simulator ( GloMoSim ) was used to measure the public presentation of the TRSDMP.

In the experiments we have conducted in this paper the simulation modelled a web of 100 nomadic hosts located at random in a 2000X2000 metres country. We used Distributed Coordination Function ( DCF ) of IEEE 802.11 for radio LANs as the MAC bed protocol. In the scenarios of experimentation, the nomadic nodes have been traveling indiscriminately for 400 seconds simulation clip. Each node moves independently harmonizing to the random waypoint mobility theoretical account with a 25 ( Meter/Second ) as maximal mobility velocity and 25 S as intermission clip.

We use the undermentioned public presentation prosodies to compare the public presentation of TRSDMP and MSDMP protocols: Network Throughput, Average end-to-end Delay, Packet delivered successfully from the beginnings to the finishs, and Routing Overhead.

To demo the sweetening obtained by TRSDMP sing the selected public presentation prosodies and parametric quantities we present the betterment ratio to assist in the comparing between TRSDMP and S-MSDMP. Enhancement Ratio ( IR ) of both protocols can be computed harmonizing to Formula 1.

ER = ( T – MS ) / T aˆ¦ … … … … … … … … … … … … … ..aˆ¦ … … … … … … … … … … … … … .. ( 1 )

Where Thymine: value of TRSDMP

Multiple sclerosis: value of MSDMP.

4.3 Consequences and Analysis

In this subdivision, we present the consequences and their analysis of the TRSDMP protocol sing the mentioned public presentation parametric quantities and prosodies. We compare the consequences of the proposed TRSDMP with MSDMP.

4.3.1 Traffic Load

Increasing the figure of packages the traffic beginning has to direct runing from 20,40,60,80 to 100 packages to alter the traffic burden of the web. Figure 4.1 compares between the mean end-to-end hold of TRSDMPand MSDMP while altering the traffic burden.

Figure 4.1: Average End-to-end hold Vs. Number of Packets.E: O?O?U… O§U„U„U‡ O§U„O±O­U…U† O§U„O±O­USU…MY PAPERchpter 44.1.png

TRSDMPchooses the set of multipath with less figure of restraints than in S-MSDMP that make a decrease in hold. This in bend reduces the hold needed by the beginning to detect a new way if the bing way becomes invalid or broken. Harmonizing to this experiment, the betterment ratio of hold decrease gained by TRSDMP is 19 % .

In Figure 4.2, the find operating expense of the two protocols as the traffic burden additions. TRSDMPhas lower find operating expense than S-MSDMP and this is because by utilizing TRSDMPthere is a greater figure of the ascertained waies than with S-MSDMP. The betterment ratio of find overhead decrease gained by TRSDMPin this experiment is 4 % . Tocopherol: O?O?U… O§U„U„U‡ O§U„O±O­U…U† O§U„O±O­USU…MY PAPERchpter 44.2.png

Figure 4.2: Discovery Overhead Vs. Number of Packets.

The comparing of throughput for the two protocols that shown in figure 4.3. The betterment ratio of throughput gained by TRSDMPis 3 % . The throughput of both TRSDMPand S-MSDMP decreases as the traffic burden additions and this happen due to the fact that when the traffic burden additions, nodes in the web will be overloaded which oblige them to drop packages.

Figure 4.3: Throughput V. Number of Packets.

4.3.2 Changing Node Density

Node denseness is considered as the public presentation parametric quantity in the rating of the two protocols, In order to alter the denseness of nodes in the fake terrain a gradual increase of the terrain country was done in order to travel to a sparser manner. The consecutive experimental scenarios assume a terrain with a side length runing 500 to 2500 metres. In Figure 4.4, compare the end-to-end hold of TRSDMPand S-MSDMP while altering the node denseness expressed by utilizing the length of the terrain side. In contrast with S-MSDMP, TRSDMPchooses partly disjoint waies based on trust degree of the nodes. Choosing partly disjoint waies increases the figure of selected multipath and as a consequence decreases the hold ensuing from the excess clip needed to detect a new way when the existed way becomes broken or invalid. The betterment ratio of hold decrease gained by TRSDMP in this experiment is 10 % .

Figure 4.4: Average End-to-end Delay vs. Terrain Dimension.

In Figure 4.6, present a comparing of throughput between TRSDMPand S-MSDMP as the denseness of node lessenings. We can detect from the figure that TRSDMPgains higher throughput than S-MSDMP as the nodes become sparser with an betterment ratio of 3 % .

4.3.3 Number of Maximum Allowed Path

Increasing the upper limit allowed figure of multiple waies that can be stored in a beginning to a specific finish. We started from two waies since we are interested in multipath routing. The figure of waies increased to six waies. In figure 4.5. We can detect from the figure that TRSDMP incurs less end-to-end hold than MSDMP with an betterment ratio of 4.5 % . This is because in contrast with MSDMP, TRSDMPchooses non merely the maximally spatially disjoint multipath, but besides the waies that could fall in partly at trusted node. Choosing multipath based on these standards increases the figure of selected waies which could be used to direct informations package. Sending packages over a greater figure of waies reduces the mean end-to-end hold in instance of way breakage.

Figure 4.5: Average End-to-end Delay V. Maximal Number of Allowed PathE: O?O?U… O§U„U„U‡ O§U„O±O­U…U† O§U„O±O­USU…MY PAPERchpter 44.8.png

The consequence of increasing the maximal figure of allowed way on the throughput is shown in Figure 4.6. One can detect from the figure that TRSDMPgives the greatest throughput difference with maximal figure of allowed way peers three. It is clear that TRSDMPobtains higher throughput than S-MDMP as the figure of maximally allowed way increased with an betterment ratio of 3.2 % . TRSDMPchooses a greater figure of waies to direct informations package which reduces the hold and as a consequence increases the throughput.E: O?O?U… O§U„U„U‡ O§U„O±O­U…U† O§U„O±O­USU…MY PAPERchpter 44.10.png

Figure 4.6: Throughput V. Maximal Number of Allowed Path


In this paper we have proposed the TRSDMP routing protocol. Chooses the most spatially disjoint waies which could fall in partly sure degree via nodes that specify a certain security threshold. TRSDMP exploits a sure node to take part in the selected set of path between a beginning and finish.

The simulation consequences have shown that the TRSDMP obtain higher throughput than MSDMP under different web conditions. In add-on TRSDMP incurs less mean end-to-end hold and find operating expense than that of S-MSDMP.

As future work, we propose to calculate the trust degree of each node based on the belongingss of the set of detecting multipath and statistical information about how each of these waies behaves on the web.


Almobaideen, W. , Sleit, A. , Qatawneh, M. , and Al-Soub, R. ( 2008 ) . MSDMP: Maximally Spatial Disjoint Multipath Routing Protocol over MANETs. submitted to computing machine communications journal Jordan university, ( 2 ) .

Argyroudis, P. G. , and O’Mahony, D. ( 2004 ) . Secure Routing for Mobile Ad hoc Networks. Communications Surveys & A ; Tutorials IEEE, 7 ( 3 ) , 2- 21.

Berton, S. , Yin, H. , Lin, C.. and Min, G. ( 2006 ) . Secure, Disjoint, Multipath Source Routing Protocol ( SDMSR ) for Mobile Ad-Hoc Networks, Proceedings of the Fifth International Conference on Grid and Cooperative Computing ( GCC’06 ) , IEEE Computer Society, Washington, DC, USA, 387 – 394.

Bouam, S. , and Ben Othman, J. ( 2003 ) . Data Security in Ad hoc Networks Using MultiPath Routing. Personal, Indoor and Mobile Radio Communications, PIMRC ( 2 ) , 1331-1335.

Han, I. S. , Ryou, H. B. , and Kang S. J. ( 2006 ) . Multi-Path Security-Aware Routing Protocol Mechanism for Ad Hoc Network. International Conference on Hybrid Information Technology ( ICHIT’O6 ) , IEEE Computer Society, 620-626.

Kim, C. , Talipov, E. , and Ahn, B. ( 2006 ) . A Rearward AODV Routing Protocol in Ad Hoc Mobile Networks. Directions in Embedded and Ubiquitous Computing, LNCS ( 4097 ) , 522 – 531.

Marina, M. K. , and Das, S. R. ( 2001 ) . On-demand Multipath Distance Vector Routing in Ad Hoc Networks. in Proceedings of IEEE International conference on Network Protocols ( ICNP ) , 14-23.

Mavropodi, R. , and Douligeris, C. ( 2006 ) . Multipath Routing Protocols for Mobile Ad Hoc Networks: Security Issues and public presentation Evaluation, in Autonomic Communication, LNCS ( 3854 ) , 165 -176.

Meghanathan, N. ( 2007 ) . Stability and Hop Count of Node-Disjoint and Link-Disjoint Multi-Path Routes in Ad Hoc Networks. In Proceedings of the Third IEEE international Conference on Wireless and Mobile Computing, Networking and Communications.

Talipov, E. , Jin, D. , Jung, J. , Ha, I. , Choi, Y. , and Kim, C. ( 2006 ) . Path Hopping Based on Reverse AODV for Security. in Management of Convergence Networks and Services LNCS ( 4238 ) , 574 – 577.

Zapata, M.G. , and Asokan, N. ( 2002 ) . Secure Ad hoc On-Demand Distance Vector Routing. ACM Mobile Computing and Communications Review, 6 ( 3 ) , 106-107.