study of routing protocols in mobile ad hoc networks

8/12/2019 Study of Routing Protocols in Mobile Ad Hoc Networks

1/4

Int ernat ional Journal of Computer Trends and Technology (IJCTT) volume 9 number 2 Mar 2014

ISSN: 2231-2803 http://www.ijcttjournal.org Page 82

Study of Routing Protocols in Mobile Ad HocNetworks

Nitin Goyat#1, Mr. Anshul Anand+2

#M.Tech Student, Department of CSE, Shri Baba Mastnath Engineering College, Rohtak (INDIA)

+Assistant Professor, Department of CSE, Shri Baba Mastnath Engineering College, Rohtak (INDIA)

Abstract : Mobile ad hoc networks (MANETs) are rapidlyevolving as an important area of mobility. MANETs areinfrastructure less autonomous collection of mobile users that

communicate over relatively bandwidth constrained wirelesslinks. Due to mobile nature of nodes, the network topology may

change rapidly and unpredictably time to time. The network isdecentralized, where all network activity including discovering

the topology and delivering messages must be executed by thenodes themselves, i.e., routing functionality will be incorporatedinto mobile nodes. Many routing algorithms have been

proposed and developed for accomplishing this task.

Therefore, it is difficult to determine which protocol performsbest under different situations. Hence, this paper presentsreview of routing protocols.

Keywords: MANET, ad hoc, AODV, DSR, TORA.

I. INTRODUCTIONA mobile ad hoc network ( MANET) is a kind of

wireless network without centralized administration orfixed network infrastructure in which nodes communicateover relatively bandwidth constrained wireless links andperform routing discovery and routing maintenance in a self-organized way. Due to mobile nature of nodes, the networktopology may change rapidly and unpredictably time to time.The network is decentralized, where all network activityincluding discovering the topology and delivering messagesmust be executed by the nodes themselves, i.e. routingfunctionality will be incorporated into mobile nodes. Due tothese reasons routing in MANETs is a challenging task.Multicast plays an important role in MANET.

Nowadays the MANET enables many applications inthe areas of emergency operations, disaster relief efforts.TheMobile Ad hoc network is one of most commonly usedwireless network. As the number of user increases MANETsuffer from most common network problems like congestion,packet loss, intrusion etc.

II. ROUTING PROTOCOLS in MANETProtocol Classifications

Depending on how protocols handle data packets fromsource to destination, MANET routing protocols are broadlyclassified into three categories (Fig 1): Proactive, Reactiveand Hybrid protocols.

Fig 1 : Routing protocols in MANET

A. Proactive ProtocolsProactive protocols table driven protocols in which every

node maintains one or more tables representing the entiretopology of the network. These tables are updated regularly inorder to maintain up-to-date routing information from eachnode to every other node. Data Packets are transferred over

the predefined route specified in the routing table. Formaintenance of up to date routing information, informationneeds to be exchanges in-between nodes in topology onregular basis, leading to high overhead on network.

Example protocols: DSDV, WRP, OLSR (Optimized LinkState Routing)

B.Reactive ProtocolsThese types of protocols are also called as On Demand

Routing Protocols where the routes are not predefined forrouting table. This type of routing creates routes only whendesired by source node. When a node requires a route to adestination, it initiates a route discovery process within thenetwork. This route discovery mechanism is based on

algorithm which employs on the technique that a node justbroadcasts the packet to all of its neighbours and intermediatenodes just forward that packet to their neighbours. This is arepetitive technique until it reaches the destination. Reactivetechniques have smaller routing overheads but higher latency.

Example Protocols: DSR, AODV


2/4

Int ernat ional Journal of Comput er Trends and Technology (IJCTT) volume 9 number 2 Mar 2014


C.Hybrid ProtocolsHybrid protocols are the combinations both On Demand

and Table driven routing protocols. Hybrid protocol hasadvantages of both reactive and proactive protocols and as aresult, routes are found quickly in the routing zone.

Example Protocol: ZRP (Zone Routing Protocol)

III. AODV (The Ad hoc On Demand Distance Vector)The Ad hoc On Demand Distance Vector (AODV) routing

algorithm is a routing protocol designed for ad hoc mobilenetworks. AODV is the most efficient on demand protocolused in MANET. AODV is capable of both unicast andmulticast routing. AODV is an on demand algorithm, whichmeans that it builds routes between nodes only as desired bysource nodes and maintains these routes as long as they areneeded by the source. Additionally, AODV forms trees whichconnect multicast group members. The trees are composed ofthe group members and the nodes, needed to connect themembers. AODV uses sequence numbers to ensure thefreshness of routes.

An important feature of AODV is the maintenance of time-based states in each node: a routing entry not recently used isexpired. If a route is broken the neighbours can be notified.Route discovery is based on query and reply cycles, and routeinformation is stored in all intermediate nodes along theroute in the form of route table entries. Control packetsare used to accomplish above task are as follows : routingrequest message (RREQ) is broadcasted by a noderequiring a route to another node, routing reply message(RREP) is unicast back to the source of RREQ, and route errormessage (RERR) is sent to notify other nodes of the loss ofthe link. HELLO messages are used for detecting andmonitoring links to neighbours.

Characteristics of AODV

On- demand routing with small delay. Link breakages in active routes efficiently repaired. Sequence numbers are used to make all the routes loop-

free. Use of Sequence numbers to track accuracy of

information. Instead of the entire route it only keeps track of next

hop for a route. HELLO messages are used periodically to track

neighbours.

IV. DSR (The Dynamic Source Routing protocol )The Dynamic Source Routing protocol (DSR) is a simple

and efficient routing protocol developed at CMU in 1996,specifically for use in multi-hop wireless ad hoc networks ofmobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for anyexisting network infrastructure. DSR, a reactive unicast

protocol is based on source routing algorithm. In sourcerouting, when a source node wants to send a packet, it firstsearches for an entry in its route cache. If the route isavailable, the source node includes the routing informationinside the data packet before sending it. If entry is notavailable, the source node initiates a route discovery operationusing route request (RREQ) packets. Each RREQ packet isuniquely identified by source address and unique no known as

request id. On receipt of RREQ packet, an intermediary nodechecks its route cache. If the node doesnt have routinginformation for the requested destination, it appends its ownaddress to the route record field of the route request packet.Then, the request packet is forwarded to its neighbors. A nodeprocesses route request packets only if it has not seen thepacket before and its address is not presented in the routerecord field. If the route request packet reaches intermediatenode has routing information to the destination or thedestination node, a route reply packet is generated. Routereply packet is generated by the destination node, then itcomprises addresses of nodes that have been traversed by theroute request packet. Otherwise, if the route reply packet isgenerated by intermediate node it comprises the addresses of

nodes the route request packet has traversed the route in theintermediate nodes route cache.

A.Advantages Guaranteed loop free routing. Operation in networks containing unidirectional links. Reduction of route discovery overheads with the use of

route cache. Supports multi path routing. Does not require any periodic messages.

B.Limitations DSR is not very effective in large networks, it performs

well in static and low-mobility environments and theperformance degrades rapidly with increasing mobility.

Routing overhead is involved due to the source-routing. Packet size keeps on increasing with route length,because of source routing.

DSR suffers from high route discovery latency.V. TORA (Temporally ordered routing protocols)

The Temporally-Ordered Routing Algorithm (TORA) isan on demand highly adaptive, efficient and scalable routingprotocol. TORA is proposed for highly dynamic mobile,multi-hop wireless network that possesses the followingattributes.

Distributed execution, Loop-free routing, Multipath routing, Reactive or proactive route establishment and

maintenance,

Minimization of communication overhead vialocalization of algorithmic reaction to topologicalchanges.


3/4



TORA belong to a class of algorithms called link reversalalgorithms. TORA is distributed execution, in that routersneed only maintain information about adjacent routers (i.e.,one-hop knowledge). Like a distance-vector routing approach,TORA maintains state on a per- destination basis. Thedestination-oriented nature of the routing structure in TORAsupports a mix of reactive and proactive routing on a per-destination basis. During reactive operation, sources initiate

the establishment of routes to a given destination on- demand.This may be advantageous in dynamic networks. At the sametime, selected destinations can initiate proactive operation,matching traditional table driven routing. This allows routesto be proactively maintained to destinations for whichrouting is repeatedly required.

A. Advantages Multiple route support, i.e. failure or removal of any of

the nodes is quickly resolved without sourceintervention by switching to an alternate route.

Its on demand routing nature creates DAG only whennecessary.

Good in network with large no of nodes.B.Limitations

TORA protocol algorithm may also produce temporaryinvalid routes as in LMR.

It depends on synchronized clocks among nodes in thead hoc network. The dependence of this protocol onintermediate lower layers for certain type offunctionality presumes that the link status sensing,neighbour discovery, in order packet delivery andaddress resolution are all readily available

Table : Comparison between ad hoc routing protocols.

References[1] Michael Gerhar z, Link Stability in Mobile Wireless Ad Hoc

Networks, Proc. of the 27th I EEE Conference on Local ComputerNetworks (LCN), pp. 30-39, 2002

[2] Udayachandran Ramasamy, Classification of Self -Or ganizingHierarchical Mobile Adhoc Network Routing Protocols - ASummary, (IJACSA) International Journal of Advanced ComputerScience and Applications, . Vol. 1, No.4 October, 2010. 86

[3] Jyoti Jain, OVERVIEW AND CHALLENGES OF ROUTI NGPROTOCOL AND MAC LAYER IN MOBILE AD-HOC

NETWORK, journal of Theoret ical and Applied InformationTechnology. 2005 - 2009 JATIT.

[4] Sima, SIMULATION STUDY OF AODV&DSR, Internati onalJournal of Computing and Business Research ISSN (Online) : 2229-6166 Volume 2 Issue 3 September 2011.

[5] Perkins, C.; Royer, E.B.; Das, .S; :Ad hoc On-Demand Distance Vector(AODV) Routing - Internet Draft, RFC 3561, IETF Network WorkingGroup, July 2003.

[6] V. Bharathi, A Performance Enhancement of an Optimized PowerReactive Routing based on AODV Protocol for Mobile AD-HOC

Network, gopalax - International Journal of Technology AndEngineering System(IJTES) Jan March 2011- Vol2 .No1.

[7] Sridhar K N, Stability and Hop-Count based Approach for RouteComputation in MANET, ICCCN, October 2005

[8] Harminder S. Bindra, Performance Evaluat ion of Two ReactiveRouting Protocols of MANET using Group Mobility Model,International Journal of Computer Science 2010; 7(3): 3843, 2010

[9] Udayachandran Ramasamy, Classification of Self -OrganizingHierarchical Mobile Adhoc Network Routing Protocols - ASummary, journal of Advanced Computer Science andApplications,. Vol. 1, No.4 October, 2010.

[10] Yu-Chee Tseng, On Route Lifetime in Multihop Mobile Ad HocNetworks, IEEE TRANSACTIONS ON MOBILE COMPUTI NG1536-1233/03@ 2003 IEEE

[11] Pushpa, WEIGHTAGE FACTOR BASED SCHEME FORPERFORMANCE IMPROVEMENT IN AD HOC NETWORKS,(IJCSE) International Journal on Computer Science and Engineering.Vol. 02, No. 02, 2010, 146-148

[12] Changling Liu, A Survey of Mobile Ad Hoc network RoutingProtocols, K.E. Kannammal et. al. International Journal ofEngineering Science and Technology Vol. 2(5), 2010, 1298-1303.

[13] http://moment.cs.ucsb.edu/AODV/aodv[14] V. Park, S. Corson, Temporally-Ordered Routing Algorithm (TORA)

Version 1 Functional Specification, 20 July 2001,http://tools.ietf.org/html/draft-ietf-manet-tora-spec-04

[15] http://www.cs.ucr.edu/~krish/lec7[16] http://ijecs.in/ijecsissue/wp-content/uploads/2013/03/707-718ijecs[17] Arash Dana, A Reliable routing algorithm for Mobile Adhoc

Networks based on fuzzy logic , International Journal of ComputerScience Issues Year: 2011 Vol:8 Issue:3 , 128-133

[18] C. Venkatesh, DYNAMIC SOURCE ROUTING PROTOCOLUSING FUZZY LOGIC CONCEPTS FOR AD HOC

NETWORKS, In. Transactions of Academic Open InternetJournal, Vol.15,pp 1- 14. 2008

[19] Panagiotis, Path Set Selection in Mobile Ad Hoc Networks, ACMMobihoc 2002, Lausanne, Switzerland, June 2002.

[20]Navid Nikaein, DDR-Distributed Dynamic Routing Algorithm forMobile Ad hoc Networks, Proceedings of ACM MobiHoc, pp. 1927, 2000

[21] Kwan-Wu Chin, Implementati on Experience with MANET Rout ingProtocols, JCST VOL II ISSUE IV, 2002

[22] Uma Nagaraj, Study of Various Routing Protocols in VANET,IJCST ISSN 09788491(Online) | ISSN : 2229-4333(Print).

[23] Thomas D. Dyer, A Comparison of TCP Performance over ThreeRouting Protocol s for Mobile Ad Hoc Networks, MobiHoc '01Proceedings of the 2nd ACM international symposium on Mobilead hoc networking & computing Pages 56 66 ACM New York, NY,USA 2001 ISBN:1-58113-428-2

[24] Ashwani Kush; Phalguni Gupta ; Ram Kumar ; :PerformanceComparison of Wireless Routing Protocols, Journal of the CSI , Vol.

AODV DSR TORAMultiple routes No Yes Yes

Loop free Yes Yes No

Reactive Yes Yes Yes

Unidirectional LinkSupport

No Yes No

Distributed Yes Yes Yes

QoS Support No No No

Methood Unicast Unicast Broadcast

Security No No No

Requires reliable orSequenced data

No No Yes

Topology Full Full Reduced


4/4



35 No.2, April-June 2005[25] AnneAaron; JieWeng;: Performance Comparison of Ad-hoc

Routing Protocols for Networks with Node Energy Constraints ,available at http://ivms.stanford.edu

[26] Charles Perkins; Elizabeth Royer; Samir Das; Mahesh Marina;:Performance of two on-demand Routing Protocols for Adhoc

Networks, IEEE Personal Communications, February 2001, pp. 16-28.[27] Sridhar K N, Stability and Hop-Count based Approach for Route

Computation in MANET, Computer Communications and Networks,2005. ICCCN, 17-19 Oct. 2005.

[28] Aditya Kumar Mishra, Power -Aware Routing in Mobile Ad HocNetworks, Proceedings of the 4th annual ACM/IEEE internat ionalconference on Mobile Computing and Networking, October 1998.

[29] Anuradha Banerjee, Fuzzy-Controlled Adaptive and Intelligent Route(FAIR) Selection in Ad Hoc Networks, European Journal ofScientific Research. ISSN 1450-216X Vol.45 No.3 (2010), pp.367-382.

[30] Hasnaa Moustafa, Source Routing-based Multicast Protocol forMobile Ad hoc Networks, 10th International Conference onTelecommunication Systems Modeling and Analysis (ICTSM-10),October 2002.

[31] Anuj K. Gupta, Member, IACSIT, Dr. Harsh Sadawarti, Dr. Anil K.Verma Performance analysis of AODV, DSR & TORA RoutingProtocols.

study of routing protocols in mobile ad hoc networks

Documents