A Study of Table-Driven and On-Demand Routing Protocols in MANET

Transcription

1 A Study of Table-Driven On-Dem Routing Protocols in MANET V. SAMESWARI DR.E.RAMARAJ Research Scholar Professor Dept. of Computer Science Engg. Dept. of Computer Science Engg. Alagappa University Alagappa University Karaikudi-3. Karaikudi-3. Abstract Mobile Ad Hoc Network (MANET) is a collection of mobile nodes communicating with each other. Manets are working in distributed environment dynamically changing the topology. It is self organizing infrastructure less s without any central coordinators. In recent research environment, routing is immensely producing the services for Manet. Routing is used for select finds the best route from source to destination through intermediate mobile nodes for communication. This research paper analysis of the various Table-Driven On-Dem routing protocols. The aim of this research paper is focuses a Table-Driven On-Dem routing protocol functionalities, characteristics current routing protocols comparing with them. Keywords: MANET, Routing protocol, Table-Driven, On-Dem routing protocols. 1. Introduction A Mobile Ad-Hoc Network is a collection of mobile hosts interconnected by a router using wireless radio links forming in dynamic environment. Mobile hosts are communicating with each other without any fixed base stations or without any central coordinators it can dynamically change the locations of the at every time. Manet s are working in distributed environment. Routing is most important concept in Manet. It is used to finding the route selecting the best route between communicating nodes. In communicating s, the source node sends the request for destination node through intermediate nodes. Similarly, the destination node receiving the route request, then create the route reply sends the route reply to source node through intermediate node. The intermediate nodes act as a router. Because in communicating mobile nodes, the best node act as router others are normally called communicating nodes. That has, 1.1. Characteristics of Routing Protocol [8] It must be fully distributed in dynamic environment. It must be adaptive to frequent topology changes caused by the mobility of nodes. It has intelligent route discovery process it has uses loop-free routing. It produces reliable end-to-end transmission using scarce bwidth, memory, battery computing power. It keeps the particular level of quality of service fully time-sensitive based process Classifications of routing protocols[8] Updating the routing information It is use of temporal information. That having past history prediction for selecting of paths. It can hold the topological information for finding the structure. There are two types of structure is available. They are, 1) Flat routing 2) Hierarchical routing 522

2 It uses specific resources. It can holds geographical information, flooding power resources for routing. There are three types of routing protocols in Mobile Adhoc Network. They are, 1) Table-driven or Pro-Active Routing Protocol. 2) On-Dem or Re-Active Routing Protocol. 3) Hybrid Routing Protocol Two types of routings are available in topologies. Static- each node is fixed within infrastructures. Dynamic- Nodes are free to move arbitrarily; it is a multi-hop which may change romly rapidly at unpredic times, may consists of both bidirectional unidirectional links. There are two types of Network Routing Algorithm is available based on dynamic ing topology. 1. Link-State algorithm- Each node maintains a view of the topology. Based on shortest computation. 2. Distance-Vector algorithm- Each node maintains the distance of each destination 2. Table-Driven Routing Protocol Every node continuously maintains the topological information about the. It is basically working on the basis of Link-State routing distance-vector routing protocol using Open First (OSPF) Destination Sequenced Distance Vector (DSDV) Destination sequenced distance vector routing protocol is a distance based -driven routing protocol for Ad-hoc. [2] It is based on distributed Bellman-Ford algorithm. Each node proactively maintains the routing. The contains up-to-date information about communicating mobile nodes routing paths within. The consists of the first entry of the node, shortest distance, hop count, destination sequence number next hop (Table I). The mobile nodes are exchanges the routing updates within the neighbors. It incorporates to avoid the counter-to-infinity problem in faster convergence. Only the duplicate redundant information can be avoided, if the same requests are sending multiple times. Two types of require to updates the routing : Incremental Updates- it denotes particular changes in local topology. Full Dump- it denotes significant changes of the entire local topology. Multiple incremental updates is called full dump. Whenever the connection is created source to destination using destination sequence number, it will checks the routing for the connection is exist whether it is not. If the connection is exist, the protocol using the same connection (existing entry, new entry) then it will checks the two nodes are using same sequence number; it would choose the best metric whether, it can reinitiate the path. Each every entry is stored at the route like shortest path of first node, distance link break etc. Fig.1. DSDV Routing Protocol. Table 1. Destination Next-Hop Number of Hops Sequence Number A A 0 25 B B 1 38 C B 2 47 D C 3 58 Fig.2. Break in DSDV Protocol 523

3 Table 2. Destination Next-Hop Number of Hops Sequence Number C B 2 52 During an ongoing transmission, node C node B are getting path break; the routing assigned the value ( ) for link weight of broken path (Fig.2.). The broken path value their sequence number are stored at the route, then broken link information propagates throughout the. Now, all nodes are receiving the new sequence number distance for broken link. Then the updating information is stored at the routing (Table II) Wireless Routing Protocol (WRP) Wireless routing protocol [9] is distance based distributed Bellman-Ford algorithms. It is similar to DSDV. The WRP protocols are proactively maintained the set of routing s update procedures. Each entry is stored in routing denoted by its node. It can hold the routing information about all communicating nodes in the. This protocol thoroughly maintained the precise up-to-date information about the. In each node four routing s namely Distance Table (DT), Routing Table (RT), Link Cost Table (LCT), Message Transmission List (MST) are maintained. The Distance Table (DT) consists of distance of the destination node predecessor node maintained by neighboring nodes for a particular destination. The Routing Table (RT) maintains up-to-date information for all known destination. It also keeps the number of hops, shortest distance from source to destination, predecessor & successor node flag (Table III). The flag is indicated the status of the path. These are simple path (correct), or a loop (error), or the destination node not marked (Null, invalid route). The WRP protocol is avoiding counting-to-infinity problem. The Link Cost Table consist of cost, update periods Number of hops. The broken link cost is denoted ( ). The Message Transmission List (MSL) contains the sequence Number, retransmission of counter, list of updates for updating of messages. Each update message maintains the list of updates. Each every transmission, the counter value is decreased. Each node entry is stored in Routing Table (RT). Each Node propagates the update messages (other link changes) within the. Nodes sends update messages after processing updates from their neighbors or after detecting the changes of links. If a node is not send the messages, it must send anyone message within the time for continuing the connectivity. Similarly a new entry is stored in routing. If, each node receives a message from new node, the new node entry is stored in the route for the purpose of avoiding count-to-infinity problem Optimized Link State Routing Protocol (OLSR) Node Fig.3. WRP Routing Protocol Nextnode Table 3. Predecessor node Sequence Number D D D 25 0 C D C 38 3 B C C 47 2 A B C 58 8 Cost Optimized Link State Routing Protocol [6] is a proactive or -driven routing protocol. Not only that, it is a pure link state routing protocol. It includes hello messages (Request) Topology Control (TC) Messages to discover the link messages throughout the. So, the protocol manages neighbor sensing, MPR selectors (Multipoint Relay), MPR information. Each nodes are using MPR selectors for selecting one-hop & two-hop neighbors its periodically broadcasts the messages over the. The neighbor sensing hello messages contains list of the address of neighbors with bi-directional link or twohop neighbors. The neighbor node is selected the basis on MPR selectors. Each node selects own set of Multi Point Relay. MPR information is contains TC messages topology. 524

4 hence route maintenance is done. maintenance is processed the use of topology update messages (acknowledgement) Ad-Hoc on-dem Distance Vector Routing Protocol (AODV) Fig.4. OLSR Routing Protocol- Selection Based on MPR Node. The TC messages send their updates throughout the by using MPR selector sequence number. The topology maintains the TC messages routing s. Each node maintains routing, it consist of Destination address, Next-hop-address, Distance for all known destination in the. Routing is calculated from the topology recalculated, after every change in the neighboring route. Each node broadcast the periodic message over the, then, gets the response using TC messages. That is, if the entry is in the topology for the same destination with higher sequence number, the TC message is discarded or same destination with low sequence number. The TC message is discarded the new entry is recorded. The entry is same, within the time the entry is refreshed in the. Ad-Hoc On-Dem Distance Vector Routing Protocol [3], [4] is using a multi-hop technology based on distance vector routing protocol. The routes are created when needed for communication between source destination through intermediate mobile hosts. Every transmission using ID, Destination ID, Address, Destination Address, Sequence Number, Time To Live(TTL) Destination Sequence Number. Two processes are available in AODV: Discovery Maintenance. Whenever the source initiates the routes for destination, the source node keeps the Destination Sequence Number. The source node intermediate node is kept at the next hop information. It is determine an up-to-date path about the destination. The source initiates the route request (RREQ) flooded the RREQ messages in over all intermediate nodes then, the intermediate nodes received send the RREQ to destination using next-hop address broadcast ID. 3. On-Dem Routing Protocols An on-dem routing strategy creates maintains routes between a pair of source-destination only when necessary it does not maintain a permanent routing entry to each destination. It includes two processes: i) discovery: When the source wants to send a packet to the destination node, it first checks its routing or cache to find the route to the destination, if it is there, the same route are used otherwise, it initiates route discovery process containing through a packet having the destination address the address of intermediate nodes to the destination. ii) maintenance: Due to mobility of nodes or routing overhead, the nodes changed their topology Fig.5. AODV Routing Protocol When the RREQ are send from the source to destination RREP are send from the destination to source, the timer will starts based on a Time-To-Live concepts. Time to live is used the life time of the process. All messages are reached within the timeline. When the destination is received the 525

5 RREQ by intermediate nodes, It is creates the RREP for source node. more time for route discovery process, the s become idle. Otherwise, they are going to perform another task. Fig.6. Break in AODV Suppose, the requests are received multiple times, the duplicates are removed by using Broadcast ID source ID then, The RREP message is received within the time. When the time is starts, the RREP is sending to source through next-hop. If the nodes links are broken the intermediate node informs that messages to source node. Then the broken links are removed in the by source node. The source node reinitiates the path for new discovery using new Broadcast ID same DestSeqNum. For example (in fig 6), the F E links are broken, the F node inform the broken messages to node A. Then, broken links are removed from the. Finally, the routes are recreated Dynamically Routing Protocol (DSR) Dynamically source routing protocol [3], [4] is a reactive link-state routing protocol. It is also called self organizing, source initiated protocol. It does not maintain a routing. It is designed for hop-by-hop, multi-hop wireless s. It can hold two basic concepts: Discovery Maintenance. The source node initiates the route request propagates to all intermediate nodes for route creation from source to destination by using address. The timer will be started, during this process. All the path information is stored at the cache maintained by nodes. Whenever, the route is created, the node checks out in route cache. If the node is available in the route cache, same route is used otherwise; the new route has been created. If it will take Fig.7. DSR Routing Protocol The destination node receive the RREQ ( Request) from the source node,then the destination node create send the RREP ( Reply) for target source node through same route using cache. Suppose the link break occur in transmission, the RERR ( Error) message is generated that node sending broken path message to the source. Then the broken paths are removed from the route cache. Since, route information is being only maintained by nodes. The source reinitiates the new route for communication. The new route entry also inserted in the route cache Temporally Ordered Routing Algorithm (TORA) Temporally Ordered Routing Protocol [8], [9] is agile, efficient, adaptive source initiated on-dem routing protocol based on link reversal algorithm. Basically it is a multi-hop wireless. Each node maintains the routing information about nearby nodes. The source initiates the multiple routes to destination, based on the distance i.e. height of the path from source to destination node. It has three main functions: Creation, Maintenance, Erasure. The route establishment function is done Direct Acyclic Graph (DAG) using QRY (Query) UPD (Update) packets. 526

6 messages are send to source node. If link partition is detected in the, the clear packet messages are propagated throughout the. Then the partition is erased in the. Fig.8. TORA Routing Protocol The QRY packets contain address of the destination ID the update packet contains the height of the destination. The source sends the QRY data packets using destination address. The QRY packets are propagated in the it s travelled through all other nodes in the. Finally, the data packets are reaches the destination. If height of the destination is zero (set to null), then all other nodes height is zero. It can generate the new UPD packet for another transmission after, receiving the UPD packets QRY packet by the destination node. Fig.9. Break in TORA Every process maintained by a top-down approach (i.e. higher height is denoted up-stream lower height is denoted down-stream). Suppose, link break is denoted in intermediate nodes, the intermediate node paths are reversed itself its previous hop node. After that, the broken Fig.10. Remove the Broken using Clear Message TORA For example: in figure9 10, if the link break is detecting the nodes D F, the Node D is reverse the path to node E A. A is create the clear message propagate throughout the. Hence, the node is discovered the broken link that the link is erased from the. 4. Comparison Between Table-Driven Routing Protocols On-Dem Routing Protocols in Manet: The Table-Driven routing protocol is called proactive routing protocol. These routes are always needed. The DSDV, WRP, OLSR routing protocols are driven routing protocols. The route discovery process is always needed. There are periodically floods the messages throughout the. All protocols are used loop free routing. The DSDV WRP routing protocols are working on the basis of distance. Each distance maintained by the cost. The OLSR routing protocol is working on the basis of link shortest path computation. These are proactively maintained the routing. Routing overhead is big in driven routing protocols. These protocols are using distributed link stated routing. Number of mobility increases in the hence the performance is degrading. In DSDV, it requires new sequence number for every change in the 527

7 . In -driven routing protocols, whenever the topologies changes, the update packets are propagate throughout the stored the routing. Large memory used for routing storage. If the numbers of nodes are increased in the, the size of the routing s the bwidth also increased. So, the Routing Overhead is increased in the than On-Dem Routing Protocols because the availability of resources are used when required time also the On-Dem routing protocols are using distance source routing. On-dem routing protocol is called Re-active routing protocols. These routes are created, when needed. The AODV, DSR TORA routing protocols are on-dem routing protocol. search overhead is big during the route discovery process. But, routing overhead is smaller than -driven routing protocols. The routing messages are broadcasting throughout the. These protocols are used loop free routing. It keeps the distance, source local creation of routing. In AODV, each node maintains the routing. Each node maintains the route cache in DSR. The on-dem routing protocols are using distributed source routing. Number of mobility increases in the the on-dem protocols are given better result than the proactive. The research work with depicts the comparative study of various routing protocols based on the metrics are defined. They are Distance, Hops, Speed, Delay, Cost Time. [2], [3], [5]. Table 4. Metrics DSDV WRP OLSR DSR AODV TORA Routing Structure Protocol Type Protocol suite Routing method creation Flat Flat Flat Flat Flat Flat Distance Distance Link based Small By Small By Large dense using by MPR selection Dynamic source routing Network By Distance source Dynamic source routing By Link reversal Large dense Linkstate Local Routing metric Utilizes Sequence number storage Yes Yes No No Yes No cache Loop free Yes Yes Yes Yes Yes Yes Hello messages Frequen - cy of updates Mobility support Yes Yes Yes No Yes No Periodic updates Periodic -cal support Periodic Periodic Periodic Periodic Periodic Periodic -cal support Periodic -cal support Maintenance Maintenance Latency Small Small Small Big Big Big Routing overhead 5. Conclusion Maintenance High High Low Low Low Low Ad-Hoc Networks are rapidly changing the topology. It has provided the routing scheme its functionalities &characteristics. This research paper focuses on various Table-Driven On-Dem routing protocols in MANET such as DSDV, WRP, OLSR, DSR, AODV TORA. The comparison of the study is given the based on the performance metrics. In future, the performance metrics of route discovery route overhead may be improved by hybridization of protocols discussed earlier. References: 1. Alex Hinds, Michael Ngulube, Shaoying Zhu, Hussain Al- Aqrabi A Review of Routing Protocols for Mobile Ad-Hoc Network (MANET), International Journal of Education Technology Vol.3, No.1, Feb Anju Gill, Cher Diwaker Comparative Analysis of Routing in MANET, International Journal of Advanced Research in Computer Science Software Engineering, Vol. 2, Issue. 7, July ISSN: X. 3. Basu Dev Shivahare, Charu Wahi, shalini shivhare Comparison of Proactive Reactive Routing Protocols in Mobile Adhoc Network Using Routing Protocol Property, International Journal of Emerging Technology Advanced Engineering. ISSN: , vol.2 Issue-3, March G. Vijaya Kumar, Y. Vasudeva Reddyr, Dr.M. Nagendra Current Research Work on Routing Protocols for MANET: 528

8 A Literature Survey, International Journal on Computer Science Engineering. Vol. 02, No. 3, Ipsita Ba A Survey on Routing Protocols of Manet by Using QoS Metrics, international Journal of Advanced Research in Computer Science Software Engineering. Vol. 2, Issue. 3, October ISSN: x. 6. S. Mohapatra, P. Kanungo Performance Analysis of AODV, DSR, OLSR, DSDV Routing Protocols Using NS2 Simulator, Sciverse ScienceDirect, International Conference on Communication Technology System Design Procedia Engineering 30 (2012) Hrituparna Paul, Dr.Prodipto Das, Performance Evaluation of Manet Routing Protocols, International Journal of Computer Science issues, Vol. 9 Issue. 2, No. 4, July ISSN (Online): C.Siva Ram Moorthy, B.S.Manoj Ad-Hoc Wireless Networks- Architecture Protocols, Prentice Hall Communications Engineering Emerging Technologies series Theodore S.Rappaport, Series Editor. 9. Mr.Chethan Chra, S. Basavaraddi, Smt. Geetha, N.B.M.Tech, Current Project Work on Routing protocols for MANET: Literature Survey, International Journal of Scientific & Engineering Vol.3, Issue-5 May ISSN: Anit Kumar, Pardeep Mittal, A Comparative study of AODV DSR Routing Protocols in Mobile Adhoc Network, International Journal of Advanced Research Engineering Technology in Computer Science software Engineering. Vol-3, Issue-5, May ISSN: x. 11. S.Nithya, S.k.Deepika, G.Sindhu, A Review of Energy Aware Routing Protocols in MANET, International Journal of Engineering Advanced Technology (IJEAT), ISSN: , Volume-2, Issue-2, December Patil.V.P, On-Dem Table-Driven Routing Protocol Energy Efficiency Performance Evaluation in Mobile Ad Hoc Networks, International Journal of Computer Science Management Research, Vol. 1, Issue-2, September 2012, ISSN: X. 13. Robinpreet Kaur Mritunjay Kumar Rai, A Novel Review on Routing Protocols in MANETs, Under Graduate Academic Research Journal (UARJ), ISSN: , Volume 1, Issue 1, Vidya Sree.P Sophia Reena.G, A Survey of Various Routing Protocols for Mobile Ad hoc Network (MANET), Vidya sree. Et.al. / International Journal of Computer Science Engineering Technology (IJCSET), Vol. 3, No. 7, 2012, ISSN: Mohammad Ali Mostafavi, Ayyoub Akbari MoghanJoughi hamid Mousavi, A Review of performance Analysis of Reactive Proactive Routing Protocols on MANET, Network Communication Technologies: Vol. 1, No. 2, 2012, ISSN: x, E- ISSN: published by Canadian Centre of Science Education. 16. Boukerche, B. Turgut, N. Aydin, M. Z. Ahmad, L. Bölöni, D.Turgut, Routing Protocols in Ad Hoc Networks: A Survey, Elsevier Computer Networks, 55 (2011) Parma N Dr.S.C. Sharma, Performance Study of Broadcast Based Mobile Ad Hoc Routing Protocols AODV, DSR, DYMO, International Journal of Security its Applications, Vol.5, No.1, January, B.Soujanya, T.Sitamahalakshmi CH.Divakar, A Study of Routing Protocols in Mobile Ad Hoc Network, B.Soujanya et.al./ International Journal of Engineering Science Technology (IJEST), Vol.3 No.4, April 2011, ISSN: Sunil Taneja Ashwani Kush, A Survey of Routing Protocols in Mobile Ad Hoc Networks, International Journal of Innovation, Management Technology, Vol. 1, No.3, August 2010, ISSN: Asma Tuteja, Rajneesh Gujral Sunil Thalia, Comparative Performance Analysis of DSDV, AODV, DSR Protocols in MANET using NS2, 2010 International Conference on Advances in Computer Engineering. 21. Mohammed Bouhorma, H.Bentaouit & A. Boudhir, Performance Comparison of Ad Hoc Routing Protocols AODV & DSR, IEEE Kwan-Wu Chin, The Behavior of MANET Routing Protocol in Realistic Environments, 2005 Asia- Pacific conference on communications, Perth, Western Australia, 3-5 October Dr. Nidhi Goyal Naveen Hemrajani, Comparative Study of AODV DSR Routing Protocols for MANET: Performance Analysis, International Journal of Communication Computer Technologies, Vol-01-No.57, Issue. 6, Aug 2013, ISSN: Kwan-Wu Chin, John Judge, Aidan Williams Roger Kermode, Implementation Experience with MANET Routing Protocols, ACMSIGCOMM Computer Communications Review, Vol.32, No. 5, November Elizabeth M. Royer A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks, University of California, Santa Barbara Chai-Keong Toh, Georgia Institute of Technology, IEEE Personal Communications, pp , April