A Review Paper of Routing Protocol: AODV, DSR, DSDV & OLSR

Transcription

1 University, Lahore, PK, March, 215. A Review Paper of Routing Protocol: AODV, DSR, DSDV & OLSR ABSTRACT: Mobile ad hoc network is getting popularity day by day. A collection of mobiles nodes sharing a wireless channel without interfere of centralised communication is called MANET [29]. Routing protocols have central role in any mobile ad hoc network (MANET) to send and receive packets. There are many routing protocol available to establish and maintain the adhoc network. This paper review AODV, DSR, DSDV and OLSR, performance comparisons with the metrics such as throughput, packet delivery ratio, routing overhead and average end-to-end delay under different mobility models using NS-2 simulator [46]. 1. Introduction: A mobile ad hoc network [9][26][44][47] as an emerging technology for different applications specially for military usage. Its nodes are free to move without any restrictions to join or leave the network [44]. However it has limited bandwidth because mode of communication is wireless [49] Adhoc networks life cycle can be classified into three generations [1] [49]. First generation started from 1972 with the introduction of Packet Radio Networks. In 198 is its 2 nd generation when enhancement and implementation was a part of the SURAN (Survivable Adaptive Radio Networks) program. In this era its performance increased by making them smaller, cheaper, and resilient to electronic attacks. In 3 rd generation, which was started in 199 when commercially ad-hoc networks were available. In this periods idea of a collection of mobile nodes was proposed by researchers and to deploy in other areas [12]. Farzan Javed Farzanjavedsheikh@gmail.com It is based on dynamic topology but has limited resources such as battery, processing power and on-board memory [9] [38]. A multi-hop is used to communicate in MANET. In this way, each node act as an end system and router as nodes sends a packet to destination via intermediate nodes [7] [29]. In MANETs mobile nodes communicate with each other in a multihop fashion [6] [19]. That means a mobile node sends a packet to a destination through intermediate nodes and each node can act as an end system and also can act as a router. Therefore routing is a big challenge to MANET [1]. The reminder of the paper is organized as follows: section 2 describes four routing Protocols AODV, DSDV, DSR and OLSR of MANETs. Section 3 describes performance metrics. The simulations and results of simulations present in section 4. Finally section 5 concludes the paper Related Work: Previous work in performance evaluation of routing protocols is reported in following sections. Researcher [8][1][13][27][31][4] compared routing protocols using NS-2 simulator [46]. Their study found the impact of mobility models performance. This review paper revels their results. 2. MANET ROUTING PROTCOLS: There are two types of MANETs routing protocols; Proactive and Reactive [48] Proactive Routing Protocols: In this protocol, the routing information exchange periodically to Page 1 of 11

2 University, Lahore, PK, March, 215. update mobile nodes. The route information keeps in different tables [2], these tables updated whenever need. Therefore large number of control messages generate by it in the network. DSDV is its example [34]. Consequently, proactive is not a suitable for MANETs. In this context, AODV & [32] [35] DSR [18] reactive protocols have been proposed Reactive: Reactive protocols or On-demand routing protocols use the passive approach to send data to its destinations [1,2,3] route request into the network [1] [2]. It has two mechanisms: route discovery and (b) route maintenance [4]. The route discovery uses to discover a destination by a global search procedure and the route maintenance is to detect any topology. Here is chance to emerge an issue if links fail due to high mobility [2]. A reactive routing algorithm for multi-irate adhoc wireless networks developed by [53] to enhance the AODV [6] [11] protocol results in compared to traditional adhoc routing protocols. It helps to identify congestion spot and measure the link interference in an adhoc network. One of its significance is to find with least cost path from source to destination [53] Routing Protocols: In this section we briefly review the studied routing protocols Ad Hoc on Demand Distance Vector (AODV): The Ad hoc On-Demand Distance Vector [1] [2] [6] [18] routing protocol uses mobile nodes to identify fast route. Its algorithm enables autonomous, dynamic, multi hop routing between nodes [12] it routing can be divided into both unicast and multicast routing. Further, its protocols are divided into two functions: Route discovery and [4] [11] Route maintenance: Route discovery uses to get destination, at the first place route while discovery send message to its neighbors to get destination information. If neighbor node has destination information, than node reply to initiator node. The protocol starts route discovery, to get destination, Then the source node sends route request message to its neighbors, there are two conditions, if those nodes do not have any information about the destination node, they will send the message to all its neighbors and so on & if have, then node sends route reply message to the route request message initiator [19] [22]. This process/path is recorded in the intermediate nodes, which identifies the route and is called the reverse path. Since each node broadcast route request message, more than one copy of the original route request message can arrive at a node. Its assigned unique id, when a route request message is created [6] [2]. When a node received, it will check this id and the address of the initiator and discarded the message if it had already processed that request & sends route reply message to the neighbor from which it has received route request message. These neighbors perform the same process, and then the route reply message travels back using reverse path. When a route reply message reaches the initiator the route is ready and the initiator can start sending data packets [21] [24] Destination-Sequenced Vector Distance (DSDV): DSDV[29] [45] is a table-driven routing scheme for mobile ad hoc networks which maintains a routing table in which the number of hops & its each destination are recorded. Each entry used a sequence number to avoid the formation of loops. For large network of mobile nodes, adjustments will be requiring for the time between broadcasts of the routing information packets [36] [45]. Therefore, two types of route packets are used. A Packet which is transmitted in frequently manner in the beginning called full dump packet, which carries all available routing Page 2 of 11

3 University, Lahore, PK, March, 215. information. The second packet is the incremental packets which are used to carry the information that has changed since the last full dump Dynamic Source Routing (DSR): DSR Dynamic source routing protocol [1][2][18] is an on-demand routing protocol that is based on source routing to use in multi hop ad hoc networks. it has the characteristics like AODV[43] [5]. Table 2.1: Comparisons of AODV, DSR and Routing Protocols PROTOCOL ADVANTAGE DISADVANTAGE AODV DSR Adaptable to high Dynamic topology Multiple Routes. Promiscuous Over heading Scalability Problem, Large Delay, Hello Message Scalability Problem due to source routing & flooding, Large delay Table 2.2: Basic Characteristics and Comparisons of AODV, DSR and Routing Protocols Routing Protocols PROT OCOL AODV R S MUL TIPL E ROU TES F NO BEA CON S Yes, Hello Mess age DSR F YES NO ROUTE METRIC METHO D Freshest & SP SP Or Next Availabl e In RC ROUTE MAINTA INED IN RT RC It is self-organise and self-configure protocol which does not need network infrastructure. It reduces bandwidth overhead; conserves battery power or need routing updates as it does not have periodic routing messages like AODV. To identify link failure it needs support from the MAC layer. DSR maintains source routes to destination by composition of Route Discovery and Route Maintenance. Therefore it has a variety of useful optimizations Optimized Link State Routing (OLSR): It is a proactive protocol where the routes are available as needed. OLSR can optimize the reactivity for periodic control message transmission by reducing the maximum time interval. It is more suited for the applications that do not have long delays in transmission of packets. Dense network is ideal environment where communication is between a large numbers of nodes. One of the disadvantage is increase of overhead if increase of control message. This constrains the its scalability. A comparison of the characteristics of DSDV, DSR, AODV, and OLSR is given in Table 2.3. Protocol DSDV DSR AODV OLSR Property Multicast No Yes No Yes Routes Distributed Yes Yes Yes Yes Unidirectional Link Support Multicast Periodic Broadcast No Yes No Yes No No Yes Yes Yes No Yes Yes QoS Support No No No Yes Routes Maintained Route Route Route Route in Table Cache Table Table Reactive No Yes Yes No 3. COMPARISON THROUGH MOBILITY MODELS: A mobility model which represents movement behaviour of considered application scenarios should incorporate and is an important feature that may change characteristics of mobile nodes. It describes how speed, acceleration and direction of the node changes over time. In Page 3 of 11

4 University, Lahore, PK, March, 215. order to check the performance of various mobility model the result of a protocol for an ad hoc 3.1. Performance Metrics: Researchers use many performance metrics For MANET to analysis the various proposals [14]. This paper reviews five performance metrics that evaluate routing protocols Network Life Time: It is the time when first time a node finished its own battery however when network life time is high performance increases [5][6] System Life Time: It is when 2% of nodes finish their own battery. The performance will increase if the system life time is higher [5] [6]. 4. SIMULATION ANALYSIS AND RESULT: Researchers used NS simulator for simulating different routing protocols. Its Tcl/TK based animation visual tool called NAM. Researchers also used the topology of 7x7 m2 with 25, 5, 75,1 nodes we are increasing only total number of nodes with keeping the total area constant i.e 7x7 m2, speed 2 ± 3 m/s, pause time 15 ± 3 s, packet size 512 B, simulation time is 3s and Traffic Node 1, 2, 4, 6 respectively with 25, 5, 75,1 nodes in the simulation [1] [17] [21] [47] [48] 4.1. N-Demand Routing Protocols AODV and DSR: The performance analysis done by Charles E. Perkins [23] [36] found that AODV and DSR reduces the routing load and compared the same. He also found that AODV outperforms DSR in more stressful but on the other side DSR outperforms AODV in less stressful situations. The improvement can be seen in Table 4.1. Table 4.1: Simulation Parameters of AODV, DSR Simulation Parameters DSR AODV Packet Delivery Fraction Average Delay Fig 4.1 Packet Delivery Ration for RPGM PDR PACKET DELIVERY RATIO IN RPGM AODV DSDV OLSR DSR a) Simulation Analysis of AODV: Karthikeyan Bhagavan and Carl A Gunter [23] [37] [5] demonstrated the simulation analysis of AODV routing protocols are for packet radio networks and to show there flexibility to improve the turn-around time in debugging. Srdjankrco, marjna dupcinor [42] tried to improve neighbour detection algorithm such as decrease delays data throughput, and overall user performance. The performance of Load Balancing (LB) AODV protocol was compared AODV and gossip based routing protocols by [17] [36] and found that AODV delivers more packets and decreases the delay of packets. He [17] [51] considered a mobile adhoc network to access the internet to controlled the ondemand overhead. Page 4 of 11

5 University, Lahore, PK, March, 215. Fig 4.2 Packet Delivery Ration for CMM PDR Fig 4.3 Packet Delivery Ration for RWP PDR PACKET DELIVERY RATIO IN CMM AODV DSDV OLSR DSR PACKET DELIVERY RATIO IN RWP AODV DSDV OLSR DSR Network Simulator 2 (Ns-2) ( was used for simulations and Random Way point Model ( used for mobility model whereas CBR (continuous bit rate) for traffic sources [46]. Packet delivery Ratio (PDR): It is the ratio of number of packet to send from source nodes to destinations nodes [4] [52]. The performance increases if ratio is high. Fig 4.4 Average End-to-End Delay for RPGM DELAY(SEC) AVERAGE DELAY IN RPGM AODV DSDV OLSR DSR Fig 4.5 Average End-to-End Delay for CMM DELAY(SEC) AVERAGE DELAY IN CMM AODV DSDV OLSR DSR Page 5 of 11

6 University, Lahore, PK, March, 215. b) Average End-to-End delay (AED): Date packet takes average delay from source node to the destination code [4] [37]. If we store the difference of packed send and received than need to divide the total time difference to find average End-to-End Delay. If delay is low performance would be better [3]. Fig 4.6 Average End-to-End Delay for RWP DELAY(SEC) AVERAGE DELAY IN RWP AODV DSDV OLSR DSR c) Normalized Routing Load: It is a ratio between transmitted and delivered at the destination. It does not count if packet drops. is calculated by NRL = Routing Packet/Received Packets [33]. Fig 4.7 Normalized Routing Load for RPGM NRL NORMALIZED ROUTING LOAD IN RPGM AODV DSDV OLSR DSR Fig 4.8 Normalized Routing Load for CMM NRL NORMALIZED ROUTING LOAD IN CMM AODV DSDV OLSR DSR Page 6 of 11

7 University, Lahore, PK, March, 215. Fig 4.9 Normalized Routing Load for RWP NRL NORMALIZED ROUTING LOAD IN RWP AODV DSDV OLSR DSR Fig 4.1 Throughput for RPGM The result is found as per KB/Sec. It is calculated by [6] [11] Throughput= (number of delivered packet * packet size)/total duration of simulation Fig 4.11 Throughput for CMM THROUGHPUT THROUGHPUT IN CMM AODV DSDV OLSR DSR THROUGHPUT THROUGHPUT IN RPGM Fig 4.12 Throughput for RWP THROUGHPUT THROUGHPUT IN RWP AODV DSDV OLSR DSR d) Throughput: This is the average rate of delivered data packet over a communication network AODV DSDV OLSR DSR Page 7 of 11

8 University, Lahore, PK, March, CONCLUSION: This review paper analysed four MANETs routing protocols i.e. AODV, DSDV, DSR and OLSR. The researcher used three mobility models RPGM, CMM, RWP and compared their performance by NS-2 simulator [46] in the area of 7 x 7 m2. The results indicated the significant performance impact on mobility pattern. These routing protocols were compared in the manner of Packet delivery ratio (PDR), Average End to End delay (delay), Normalized routing load (NRL) and Throughput. The studies by [ ] shown that reactive protocols is far better than proactive for packet delivery with reference to increase the number of nodes. Their result also tell us that In this research our results is made into how well AODV, DSDV, DSR and OLSR work in MANET. The delay of OLSR is less and in the DSR is worst [5] [17]. Throughput is high in case the of AODV whereas DSR is worst in respect to OLSR. On the other side DSR delay is > the AODV and OLSR. These researchers also found that DSDV is better than AODV if nodes increase. Further DSR performance is improve if we reduce the number of nodes. As it is a review paper it was not possible for quantitative comparison. Further researchers used different metrics and using different simulators. However this paper gives the clear picture of routing protocols DSDV, AODV and DSR from literature. The researchers are agreed on their simulation result based on their theoretical analysis. They found AODV performance is better than others routing protocol. It delivers packet at low node mobility. Other side DSR has good mobility rates but still requires many routing overhead packets. References: 1. Abolhasan M, Wysocki T, Dutkiewicz E, 24. A review of routing protocols for mobile ad hoc networks. Ad Hoc Networks 2: Banoj KumarPanda, Bibhudatta Dash, Rupanita Das, Ajit Sarangi Mobility and its impact on Performance of AODV and DSR in Mobile Ad hoc Network,IEEE Boukerche A, Turgut B, Aydin N, Ahmad MZ, B (' l( ' ni L, Turgut D, 211. Routing protocols in ad hoc networks: A survey. Computer Networks: ). 4. B. Shivahare,C. Wahi, and S. Shivhare. (March 212). Comparison Of Proactive And Reactive Routing Protocols In Mobile Ad hoc Network Using Routing Protocol Property. International Journal of Emerging Technology and Advanced Engineering. [Online]. 2(3). pp Available: 5. Charles E. Perkins, Elizabeth M. Royer., Performance Comparison of Two On-Demand Routing Protocols for Adhoc Networks, IEEE Personal Communications, Chao L. and Ping'an L., An efficient routing approach as an extension of the AODV protocol, IEEE, (21) 7. DSDV and AODV [online] ~jgao/cse37- spring6/lecture1.pdf, February 26 (Accessed: March 214) 8. Ejiro.E.Igbesoko, Thaddeus Onyinye Eze, Mona Ghassemian Performance Analysis of MANET Routing Protocols over Different Mobility Models, In proceedings of London Communications Symposium (LCS), University College London, Sept E.M. Royer, C.-K. Toh, A review of current routing protocols for ad Page 8 of 11

9 University, Lahore, PK, March, 215. hoc mobile wireless networks, IEEE Personal Communications 6 (2) (1999) Fahim Maan Nauman Mazhar MANET Routing Protocols vs. Mobility Models: A Performance Evaluation, in Proceedings of IEEE Conf., ICUFN 211, pp G. Amandeep, Performance analysis of AODV routing protocol in MANETs, International Journal of Engineering Science and Tech.,, vol. 4, no. 8, August G. Rajkumar, Dr. K. Duraisamy, A Review Of Ad Hoc On-Demand Distance Vector Routing Protocol For Mobile Ad Hoc Networks,Journal of Theoretical and Applied Information Technology 15th February 212. Vol. 36 No G. Jayakumar, G. Ganapathy, Performance Comparison of Mobile Ad-hoc Network Routing Protocol, Int. J. of Comp. Sc.& Network Security, Vol.7, No.11, Nov Gupta AK, Sadawarti H, Verma AK, 21. Performance analysis of AODV, DSR & TORA Routing Protocols. IACSIT: Jahanbakhsh S, Jamali Sh, Zeinali E, 211. NISR: A Nature Inspired Scalable Routing Protocol for Mobile Ad Hoc Networks. IJCSET: Jamali Sh, Jahanbakhsh S, 211. BA-TORA: a Multipath Routing Protocol for MANETs by Inspiration from Bee and Ant Colonies. Electrical Review: Joo-Han Song,Vincent W.S.Wong,Victor C.M.Leung, Efficient On-Demand Routing For Mobile Ad Hoc Wireless Access Networks, IEEE Journal on Selected Areas in Communications, vol. 22 no. 7, Johnson DB, Maltz DA, Dynamic Source Routing in Ad- Hoc Ad hoc Networks. Mobile Computing: Jaya Jacob, V.Seethalakshmi Performance Evaluation of Various Routing Protocols in MANET 211 Journal Anu Books, Research Cell: An International Journal of Engineering Sciences ISSN: Issue Dec. 211, Vol K. Amjad and A.J. Stocker, Impact of slow and fast channel fading and mobility on the performance of AODV in ad-hoc networks, 21 Loughborough Antennas & Propagation Conference, 8-9 November 21, Loughborough, UK. 21. K. Amjad and A.J. Stocker, Impact of node density and mobility on the performance of AODV and DSR in MANETS, IEEE (21). 22. Krunal Ptel and Krunal Ptel, Performance Evaluation of Stable AODV Routing Protocol under Different Mobility Models, International Journal of Computer Applications ( ) 43(8): (212). 23. Karthikeyan Bhargavan, Carl A. Gunter, Moonjoo Kim, VERISIM: Formal Analysis Of Network Simulations, IEEE Trans.,on Software Engineering,vol.28, no.2, Kiess W and Mauve M, 27. A survey on real-world implementations of mobile ad-hoc networks. Ad Hoc Networks: ). 25. Li B., Liu Y. and Chu G., Improved AODV routing protocol for vehicular ad hoc networks, IEEE, (21) Page 9 of 11

10 University, Lahore, PK, March, M. Abolhasan, T. Wysocki, A review of routing protocols for mobile ad hoc networks, Ad Hoc Networks, Vol. 2, Issue 1, pp 1-22, 1 January Li Layuan, Li Chunlin, Yaun Peiyan, Performance evaluation and simulations of routing protocols in ad hoc networks, Computer Communications, Vol. 3, pp Maqbool B, Peer MA, Quadri SM, 211. Towards the Benchmarking of Routing Protocols for Ad hoc Wireless Networks. IJCST: [ 29. Mina Vajed Khiavi, Shahram Jamali, Sajjad Jahanbakhsh Gudakahriz, Performance comparison of AODV, DSDV, DSR, TORA routing protocols in MANETs, International Research Journal of Applied and Basic Sciences, Vol. 3(7), 212. ) 3. Neha Rani, Preeti Sharma and Pankaj Sharma, Performance comparison of various routing protocols indifferent mobility models, International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) 3(4): (212). 31. Parma Nand, S.C.Sharma, Comparative Study and Performance Analysis of FSR,ZRP and AODV Routing Protocols for MANET, IJCA Proceedings on International Conference and workshop on Emerging Trends in Technology (ICWET) (2):14-19, Perkins CE, Ad hoc On demand Distance Vector (AODV) routing. IETF Internet draft, Park VD, Corson MS, A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. INFOCOM: Perkins CE, Bhagwat P, (994. Highly dynamic Destination- Sequenced Distance-Vector routing (DSDV) for mobile computers. Paper presented at the Proceedings of the SIGCOMM 94 Conference on Communications Architectures, Protocols and Applications, Perkins CE, Royer EM, Ad Hoc On-demand Distance Vector Routing. Paper presented at the proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, P.Periyasamy and Dr.E.Karthikeyan, Performance evaluation of aomdv protocol based on various scenario and traffic patterns, International Journal of Computer Science, Engineering and Applications (IJCSEA) 1(6): (211). 37. Prajakta M. Dhamanskar and Dr. Nupur Giri Performance evaluation of On Demand MANET protocols for different mobility models, International Journal of Emerging Technology and Advanced Engineering, ISSN , 2(9): (212). 38. Ramanathan R and Redi J, 22. A Brief Overview of Ad Hoc Networks: Challenges and Directions. IEEE Communications Magazine: R. Manoharan and E. Ilavarasan, impact of mobility on the performance of multicast routing protocols in manet, International Journal of Wireless & Mobile Networks(IJWMN), 2(2): (21). 4. R. Misra, C. R. Mandal, Performance comparison of AODV/DSR on-demand routing protocols for ad hoc networks in constrained situation, IEEE Int. Conf. on Personal Wireless Communications, pp , Jan. 25. Page 1 of 11

11 University, Lahore, PK, March, Santosh Kumar, S C sharma, Bhupendra Suman, Simulation Based Performance Analysis of routing {rptpcp;s Isomg Ramdp, Waypoint Mobility Model in Mobile Ad Hoc Network, Global Journals inc. (USA),Vol. 11,Issue 1.Version 1. Feb.211, ISSN: Srdjan Krco and Marina Dupcinov, Improved Neighbor Detection Algorithm For AODV Routing Protocol, IEEE Communications Letters,vol. 7, no. 12, Sri Chusri Haryanti and Riri Fitri Sari, Effect of RPGM and Gauss Markov Node Mobility for Resource Allocation Performance in Mobile Ad Hoc Computational Grid, Inter l Journal of Computer Science & Network Security, 11(6): (211) 44. Sunil Kumar Kaushik et al., 212] Sunil Kumar Kaushik and Sukhbir Singh, Performance Evaluation of Mobile Ad Hoc Networks with Reactive and Proactive Routing Protocols and Mobility Models,International Journal of Computer Applications ( ), 54(17): (212). 45. Singh A, Tiwari H, Vajpayee A, Prakash Sh, 211. A Survey of Energy Efficient Routing Protocols for Mobile Adhoc Networks. International Journal on Computer Science and Engineering: Sung Park, [online] Ns2 simulator(accessed: March212) 47. Tanu Preet Singh, Dr. R K Singh and Jayant Vats. Article: Routing Protocols in Ad Hoc Networks: A Review. International Journal of Computer Applications 25(4):3-35, July Tarique M, Tepe KE, Adibic S, Erfani Sh, 29. Survey of multipath routing protocols for mobile ad hoc networks, Journal of Network and Computer Applications 32: Tracy Camp, Jeff Boleng and Vanessa Davies A Survey of Mobility Models for Ad Hoc Network Research, Wireless Communication & Mobile Computing (WCMC): 2(5): (22). 5. Valentina timcenko, mirjana stojanovic and slavica bostjancic rakas, proceedings of the 9 th Wseas International Conference on Applied Informatics and Communications (aic 9), (21). 51. V. Kanakaris*, D. Ndzi and D. Azzi., Ad-hoc Networks Energy Consumption: A review of the Ad- Hoc Routing Protocols, Journal of Engineering Science and Technology Review 3 (1) (July 21) 52. V. Patil, Reactive and proactive routing protocol performance evaluation for qualitative and quantitative analysis in mobile ad hoc network, International Journal of Scientific and Research Publications, vol. 2, no. 9, Z.Fan, High Throughput Reactive Routing In Multi-rate Ad Hoc Networks, Electronic Letters, vol. 4, no.25.,24. Page 11 of 11