Ijctt v9p118

International Journal of Computer Trends and Technology (IJCTT) – volume 9 number 2– Mar 2014

Study of Routing Protocols in Mobile Ad Hoc Networks 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 rapidly evolving as an important area of mobility. MANETs are infrastructure less autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. Due to mobile nature of nodes, the network topology may change rapidly and unpredictably time to time. The network is decentralized, where all network activity including discovering the topology and delivering messages must be executed by the nodes themselves, i.e., routing functionality will be incorporated into mobile nodes. Many routing algorithms have been proposed and developed for accomplishing this task.

Therefore, it is difficult to determine which protocol performs best under different situations. Hence, this paper presents review of routing protocols.

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

I.

Fig 1 : Routing protocols in MANET

INTRODUCTION

A mobile ad hoc network ( MANET) is a kind of wireless network without centralized administration or fixed network infrastructure in which nodes communicate over relatively bandwidth constrained wireless links and perform routing discovery and routing maintenance in a selforganized way. Due to mobile nature of nodes, the network topology may change rapidly and unpredictably time to time.

The network is decentralized, where all network activity including discovering the topology and delivering messages must be executed by the nodes themselves, i.e. routing functionality will be incorporated into mobile nodes. Due to these reasons routing in MANETs is a challenging task.

Multicast plays an important role in MANET. Nowadays the MANET enables many applications in the areas of emergency operations, disaster relief efforts. The Mobile Ad hoc network is one of most commonly used wireless network. As the number of user increases MANET suffer from most common network problems like congestion, packet loss, intrusion etc.

II.

ROUTING PROTOCOLS in MANET

Protocol Classifications Depending on how protocols handle data packets from source to destination, MANET routing protocols are broadly classified into three categories (Fig 1): Proactive, Reactive and Hybrid protocols.

ISSN: 2231-2803

A. Proactive Protocols Proactive protocols table driven protocols in which every node maintains one or more tables representing the entire topology of the network. These tables are updated regularly in order to maintain up-to-date routing information from each node to every other node. Data Packets are transferred over the predefined route specified in the routing table. For maintenance of up to date routing information, information needs to be exchanges in-between nodes in topology on regular basis, leading to high overhead on network.

Example protocols: DSDV, WRP, OLSR (Optimized Link State Routing) B. Reactive Protocols These types of protocols are also called as On Demand Routing Protocols where the routes are not predefined for routing table. This type of routing creates routes only when desired by source node. When a node requires a route to a destination, it initiates a route discovery process within the network. This route discovery mechanism is based on algorithm which employs on the technique that a node just broadcasts the packet to all of its neighbours and intermediate nodes just forward that packet to their neighbours. This is a repetitive technique until it reaches the destination. Reactive techniques have smaller routing overheads but higher latency.

Example Protocols: DSR, AODV

http://www.ijcttjournal.org

Page 82

International Journal of Computer Trends and Technology (IJCTT) – volume 9 number 2– Mar 2014 C. Hybrid Protocols Hybrid protocols are the combinations both On Demand and Table driven routing protocols. Hybrid protocol has advantages of both reactive and proactive protocols and as a result, 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 mobile networks. AODV is the most efficient on demand protocol used in MANET. AODV is capable of both unicast and multicast routing. AODV is an on demand algorithm, which means that it builds routes between nodes only as desired by source nodes and maintains these routes as long as they are needed by the source. Additionally, AODV forms trees which connect multicast group members. The trees are composed of the group members and the nodes, needed to connect the members. AODV uses sequence numbers to ensure the freshness of routes.

An important feature of AODV is the maintenance of timebased states in each node: a routing entry not recently used is expired. If a route is broken the neighbours can be notified.

Route discovery is based on query and reply cycles, and route information is stored in all intermediate nodes along the route in the form of route table entries. Control packets are used to accomplish above task are as follows : routing request message (RREQ) is broadcasted by a node requiring a route to another node, routing reply message (RREP) is unicast back to the source of RREQ, and route error message (RERR) is sent to notify other nodes of the loss of the link. HELLO messages are used for detecting and monitoring links to neighbours.

Characteristics of AODV      

IV.

On- demand routing with small delay.

Link breakages in active routes efficiently repaired.

Sequence numbers are used to make all the routes loopfree.

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.

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 of mobile nodes. DSR allows the network to be completely selforganizing and self-configuring, without the need for any existing network infrastructure. DSR, a reactive unicast

ISSN: 2231-2803

protocol is based on source routing algorithm. In source routing, when a source node wants to send a packet, it first searches for an entry in its route cache. If the route is available, the source node includes the routing information inside the data packet before sending it. If entry is not available, the source node initiates a route discovery operation using route request (RREQ) packets. Each RREQ packet is uniquely identified by source address and unique no known as request id. On receipt of RREQ packet, an intermediary node checks its route cache. If the node doesn’t have routing information for the requested destination, it appends its own address to the route record field of the route request packet.

Then, the request packet is forwarded to its neighbors. A node processes route request packets only if it has not seen the packet before and its address is not presented in the route record field. If the route request packet reaches intermediate node has routing information to the destination or the destination node, a route reply packet is generated. Route reply packet is generated by the destination node, then it comprises addresses of nodes that have been traversed by the route request packet. Otherwise, if the route reply packet is generated by intermediate node it comprises the addresses of nodes the route request packet has traversed the route in the intermediate node’s 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 the performance 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) is an on demand highly adaptive, efficient and scalable routing protocol. TORA is proposed for highly dynamic mobile, multi-hop wireless network that possesses the following attributes.

    

Distributed execution, Loop-free routing, Multipath routing, Reactive or proactive route establishment and maintenance, Minimization of communication overhead via localization of algorithmic reaction to topological changes.

http://www.ijcttjournal.org

Page 83

International Journal of Computer Trends and Technology (IJCTT) – volume 9 number 2– Mar 2014 TORA belong to a class of algorithms called link reversal algorithms. TORA is distributed execution, in that routers need 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. The destination-oriented nature of the routing structure in TORA supports a mix of reactive and proactive routing on a perdestination 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 same time, selected destinations can initiate proactive operation, matching traditional table driven routing. This allows routes to be proactively maintained to destinations for which routing is repeatedly required.

A.

Advantages Multiple route support, i.e. failure or removal of any of the nodes is quickly resolved without source intervention by switching to an alternate route.  It’s on demand routing nature creates DAG only when necessary.  Good in network with large no of nodes.

References [1]

[2]

[3]

[4]

[5]

[6]



[7] [8]

[9]

B. Limitations  TORA protocol algorithm may also produce temporary invalid routes as in LMR.  It depends on synchronized clocks among nodes in the ad hoc network. The dependence of this protocol on intermediate lower layers for certain type of functionality presumes that the link status sensing, neighbour discovery, in order packet delivery and address resolution are all readily available

[10]

[11]

[12]

[13] [14]

AODV

DSR

TORA

Multiple routes

No

Yes

Yes

Loop – free

Yes

Yes

No

Reactive

Yes

Yes

Yes

Unidirectional Link Support Distributed

No

Yes

No

Yes

Yes

Yes

QoS Support

No

No

No

Methood

Unicast

Unicast

Broadcast

Security

No

No

No

Requires reliable or Sequenced data Topology

No

No

Yes

Full

Full

Reduced

[15] [16] [17]

[18]

[19] [20]

[21] [22] [23]

Table : Comparison between ad hoc routing protocols.

[24]

ISSN: 2231-2803

Michael Gerhar z,” Link Stability in Mobile Wireless Ad Hoc Networks”, Proc. of the 27th I EEE Conference on Local Computer Networks (LCN), pp. 30-39, 2002 Udayachandran Ramasamy,” Classification of Self -Or ganizing Hierarchical Mobile Adhoc Network Routing Protocols - A Summary”, (IJACSA) International Journal of Advanced Computer Science and Applications, . Vol. 1, No.4 October, 2010. 86 Jyoti Jain,” OVERVIEW AND CHALLENGES OF ROUTI NG PROTOCOL AND MAC LAYER IN MOBILE AD-HOC NETWORK”, journal of Theoretical and Applied Information Technology. © 2005 - 2009 JATIT. Sima,” SIMULATION STUDY OF AODV&DSR”, International Journal of Computing and Business Research ISSN (Online) : 22296166 Volume 2 Issue 3 September 2011.

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

V. Bharathi,” A Performance Enhancement of an Optimized Power Reactive Routing based on AODV Protocol for Mobile AD-HOC Network”, ©gopalax - International Journal of Technology And Engineering System(IJTES) Jan – March 2011- Vol2 .No1.

Sridhar K N,” Stability and Hop-Count based Approach for Route Computation in MANET”, ICCCN, October 2005 Harminder S. Bindra,” Performance Evaluation of Two Reactive Routing Protocols of MANET using Group Mobility Model”, International Journal of Computer Science 2010; 7(3): 38–43, 2010 Udayachandran Ramasamy,” Classification of Self -Organizing Hierarchical Mobile Adhoc Network Routing Protocols - A Summary”, journal of Advanced Computer Science and Applications,. Vol. 1, No.4 October, 2010.

Yu-Chee Tseng,” On Route Lifetime in Multihop Mobile Ad Hoc Networks”, IEEE TRANSACTIONS ON MOBILE COMPUTI NG 1536-1233/03@ 2003 IEEE Pushpa,” WEIGHTAGE FACTOR BASED SCHEME FOR PERFORMANCE IMPROVEMENT IN AD HOC NETWORKS”, (IJCSE) International Journal on Computer Science and Engineering.

Vol. 02, No. 02, 2010, 146-148 Changling Liu,” A Survey of Mobile Ad Hoc network Routing Protocols”, K.E. Kannammal et. al.

International Journal of Engineering Science and Technology Vol. 2(5), 2010, 1298-1303. http://moment.cs.ucsb.edu/AODV/aodv 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 http://www.cs.ucr.edu/~krish/lec7 http://ijecs.in/ijecsissue/wp-content/uploads/2013/03/707-718ijecs Arash Dana,” A Reliable routing algorithm for Mobile Adhoc Networks based on fuzzy logic”, International Journal of Computer Science Issues Year: 2011 Vol:8 Issue:3 , 128-133 C. Venkatesh,” DYNAMIC SOURCE ROUTING PROTOCOL USING FUZZY LOGIC CONCEPTS FOR AD HOC NETWORKS”, In. Transactions of Academic Open Internet Journal, Vol.15,pp 1- 14. 2008 Panagiotis,” Path Set Selection in Mobile Ad Hoc Networks”, ACM Mobihoc 2002, Lausanne, Switzerland, June 2002.

Navid Nikaein,” DDR-Distributed Dynamic Routing Algorithm for Mobile Ad hoc Networks”, Proceedings of ACM MobiHoc, pp. 19– 27, 2000 Kwan-Wu Chin,” Implementation Experience with MANET Routing Protocols”, JCST VOL II ISSUE IV, 2002 Uma Nagaraj,” Study of Various Routing Protocols in VANET”, IJCST ISSN 09788491(Online) | ISSN : 2229-4333(Print).

Thomas D. Dyer,” A Comparison of TCP Performance over Three Routing Protocols for Mobile Ad Hoc Networks”, MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing Pages 56 – 66 ACM New York, NY, USA ©2001 ISBN:1-58113-428-2 Ashwani Kush; Phalguni Gupta ; Ram Kumar ; :Performance Comparison of Wireless Routing Protocols, Journal of the CSI , Vol.

http://www.ijcttjournal.org

Page 84

International Journal of Computer Trends and Technology (IJCTT) – volume 9 number 2– Mar 2014 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 Hoc Networks”, Proceedings of the 4th annual ACM/IEEE international conference on Mobile Computing and Networking, October 1998.

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

[30] Hasnaa Moustafa,” Source Routing-based Multicast Protocol for Mobile Ad hoc Networks”, 10th International Conference on Telecommunication 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 Routing Protocols.

ISSN: 2231-2803

http://www.ijcttjournal.org

Page 85