Comparison between aodv and olsr protocol

10,334 views
10,041 views

Published on

Published in: Education
3 Comments
10 Likes
Statistics
Notes
  • Hello everyone, My name is Thinh. I come from Vietnam . I am an IT student, now i have a project about blackhole attack in manet using AODV protocol simulation by NS2. help me . if you have code or documents. thanks to all . I can send to me follow my email : tranthinh08@gmail.com
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here
  • good
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here
  • nice one
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here
No Downloads
Views
Total views
10,334
On SlideShare
0
From Embeds
0
Number of Embeds
4
Actions
Shares
0
Downloads
557
Comments
3
Likes
10
Embeds 0
No embeds

No notes for slide

Comparison between aodv and olsr protocol

  1. 1. Comparison Between AODV and OLSR
  2. 2. <ul><li>Prepared By </li></ul><ul><li> </li></ul><ul><li>Md. Al-Amin-Al-Mehedi Sr.System Engineer </li></ul><ul><li>Contact: [email_address] </li></ul><ul><li> +8801718161615 </li></ul>
  3. 3. Content <ul><li>What is AODV ? </li></ul><ul><ul><ul><li>Advantage </li></ul></ul></ul><ul><ul><ul><li>Disadvantage </li></ul></ul></ul><ul><li>What is OLSR ? </li></ul><ul><ul><ul><li>Advantage </li></ul></ul></ul><ul><ul><ul><li>Disadvantage </li></ul></ul></ul><ul><li>Comparison </li></ul><ul><ul><ul><li>Performance and scalability </li></ul></ul></ul><ul><ul><ul><li>Resource usage </li></ul></ul></ul><ul><ul><ul><li>Security consideration </li></ul></ul></ul><ul><li>Conclusion </li></ul>
  4. 4. What is AODV ? <ul><li>Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc networks (MANETs) and other wireless ad-hoc networks . AODV is capable of both unicast and multicast routing. It is a reactive routing protocol, meaning that it establishes a route to a destination only on demand. AODV is, as the name indicates, a distance-vector routing protocol. AODV avoids the counting to infinity problem of other distance-vector protocols by using sequence numbers on route updates . </li></ul>
  5. 5. Advantages of AODV <ul><li>AODV protocol is a flat routing protocol it does not need any central administrative system to handle the routing process. </li></ul><ul><li>The AODV protocol is a loop free and avoids the counting to infinity problem. </li></ul><ul><li>AODV has higher bandwidth share. </li></ul>
  6. 6. Advantages of AODV (Cont..) <ul><li>AODV tries to keep the overhead of the messages small. If host has the route information in the Routing Table about active routes in the network, then the overhead of the routing process will be minimal. </li></ul><ul><li>The AODV has great advantage in overhead over simple protocols which need to keep the entire route from the source host to the destination host in their messages. </li></ul>
  7. 7. Disadvantage of AODV <ul><li>AODV has higher processing demand. </li></ul><ul><li>AODV consumes more share of the bandwidth. </li></ul><ul><li>AODV takes more time to build the routing table. </li></ul>
  8. 8. What is OLSR ? <ul><li>The Optimized Link State Routing protocol ( OLSR ) is a routing protocol that is optimised for mobile ad-hoc networks but can also be used on other wireless ad-hoc networks. It is a proactive link-state routing protocol that floods a topology table of it's neighbors to all nodes in the network which then compute optimal forwarding paths locally. </li></ul>
  9. 9. Advantage of OLSR <ul><li>OLSR has less average end to end delay. </li></ul><ul><li>The OLSR implementation is more user-friendly and worked with less headaches </li></ul><ul><li>OLSR is also a flat routing protocol, it does not need central administrative system to handle its routing process. </li></ul><ul><li>It increases the protocols suitability for ad hoc network with the rapid changes of the source and destinations pairs. </li></ul>
  10. 10. Advantage of OLSR (Cont..) <ul><li>OLSR protocol does not require that the link is reliable for the control messages, since the messages are sent periodically and the delivery does not have to be sequential. </li></ul><ul><li>The OLSR routing protocol simplicity in using interfaces, it is easy to integrate the routing protocol in the existing operating systems, without changing the format of the header of the IP messages. The protocol only interacts with the host’s Routing Table. </li></ul><ul><li>OLSR protocol is well suited for the application which does not allow the long delays in the transmission of the data packets. </li></ul>
  11. 11. Disadvantage of OLSR <ul><li>OLSR needs more time re-discovering a broken link. </li></ul><ul><li>wider delay distribution. </li></ul><ul><li>OLSR requires more processing power when </li></ul><ul><li>discovering an alternate route. </li></ul>
  12. 12. Comparison between AODV and OLSR <ul><li>Performance and scalability: </li></ul><ul><li> As proactive protocol, OLSR reduces the control overhead forcing the MPR to propagate the updates of the link state, also the efficiency is gained compared to classical link state protocol when the selected MPR set is as small as possible. But the drawback of this is that it must maintain the routing table for all the possible routes, so there is no difference in small networks, but when the number of the mobile hosts increase, then the overhead from the control messages is also increasing. This constrains the scalability of the OLSR protocol. The OLSR protocol work most efficiently in the dense networks. </li></ul>
  13. 13. <ul><li>The overhead of reactive protocols like AODV is related mostly to the discovery of the new route and from the updates of the usable routes. So in the network with light traffic and low mobility the reactive protocols scales perfectly to the larger networks with low bandwidth and storage overhead. As the undesirable environment for reactive protocols is the network with heavy traffic with large number of destinations with high mobility. This situation will result that a big number of routes will break resulting repeated route discoveries and error reports in the network . </li></ul>Comparison between AODV and OLSR (cont..)
  14. 14. Comparison between AODV and OLSR (cont..) <ul><li>From the information above it is obvious that proactive protocols produce higher routing efficiency than reactive protocols in the network with scattered traffic. Because the updates come from periodic updates and no additional overhead occurs for finding new routes, but then the proactive protocols use more bandwidth and resources than reactive protocols. </li></ul>
  15. 15. Comparison between AODV and OLSR (cont..) <ul><li>The AODV protocol need to discover the route first in order to send the actual data , so the search latency affects of the AODV protocol , OLSR does not need to do the extra work for the discovery of the route so it provides low single packet transmission latency. The reactivity of the detecting topological changes in OLSR can be improved by shortening the time interval of periodic control messages. The OLSR drawback is that it use constantly the bandwidth but AODV is trying to keep the bandwidth usage low for the maintaining of the routes. </li></ul>
  16. 16. Comparison between AODV and OLSR (cont..) <ul><li>Resource Usage: </li></ul><ul><li>The storage complexity of the OLSR protocols is related on how much hosts are in the network, but the storage complexity of AODV is related to the number of the communication pairs. It is because the OLSR has to have all possible routes in Routing Table, while for AODV active routes are necessary. In the addition, the OLSR must keep the topology information in the topology set, MPR information in MPR selector set and also update the state information about the links and neighbors . So the OLSR must maintain the information about the hosts that it does not need. </li></ul>
  17. 17. Comparison between AODV and OLSR (cont..) <ul><li>Security Considerations : </li></ul><ul><li>The main points in the AODV and OLSR protocols is that the control messages must be protected, that the malicious information sent by some attacking host could not affect the routing processes in the network. Both protocols should use the IPsec authentication headers for the authentication of the hosts. The AODV needs less protection of the control messages it is enough to protect the RREP and RRER messages in order for the protocol to be secured, but in the case of OLSR all the control messages are needed to be secured. </li></ul>
  18. 18. Comparison between AODV and OLSR (cont..) <ul><li>If the OLSR includes gateways hosts, then they have to be statically configured in order to advertise the routes to the valid addresses into the ad hoc network. Based on this information it is obvious that the AODV is more flexible to security solutions, because not all the AODV control messages are in need of the protection, so it can save the resource usage of the AODV protocol compared to OLSR. </li></ul>
  19. 19. Operation of AODV Route Discovery: Whenever a source node has to send information to a destination, but doesn’t have a valid route to it, it initiates a route discovery process. The source creates an AODV RREQ (Route Request) packet. This packet contains the source node’s IP address, current (source) sequence number, destination IP address, last known destination sequence number (set to zero if no prior route exists), a broadcast ID , which is incremented with each RREQ and a Hop Count field set to zero.
  20. 20. Operation of AODV (cont..) <ul><li>This RREQ packet is broadcasted by the source to its neighbors. The neighboring nodes first check to see if they have already seen the RREQ. If it has already seen the RREQ then it’s discarded, otherwise it checks to see if it has a fresher route to the destination in question . If yes, then it sends a RREP (Route Reply) back to the source and a gratuitous reply to the destination informing it about the source node details. </li></ul>
  21. 21. Operation of AODV (cont..) <ul><li>If no, then it forms a reverse route entry, for the source node in its route table noting the source node’s IP address and sequence number as well as the number of hops to the source node and the IP address of the neighbor from which the RREQ was received. This is used to forward the RREP back to the source node. </li></ul>
  22. 22. Operation of AODV (cont..) <ul><li>The node then increments the hop count and broadcasts it to its neighbors. This goes on until either the destination is reached or a node with a valid route to the destination is reached. In case the RREQ is lost or the destination is unreachable where Node Traversal Time is the time taken to travel the distance between two neighboring nodes and the Timeout buffer is used to account for congestion delays the source node reinitiates the route discovery process as specified by the RREQ retries parameter. </li></ul>
  23. 23. Operation of AODV (cont..) <ul><li>The RREP from the destination contains the destination IP address, its current sequence number, the source IP address and a lifetime field in addition to the hop count field which is set to zero. If an intermediate node sends the RREP, it contains the destination sequence number, hop count value equal to its distance from the destination and the lifetime value set to the amount of time for which its route table entry for the destination will still be valid. </li></ul>
  24. 24. Operation of AODV (cont..) <ul><li>The RREP is unicasted back to the source node. Any intermediate node receiving the RREP, sets up a forward route having the IP address of the destination and the neighbor from which the RREP arrived, the hop count value is incremented and then added and the lifetime of this entry is set to the lifetime in the RREP. Each time the route is used it lifetime is extended. There is also a delete period before actually deleting the route information to prevent any routing loops. </li></ul>
  25. 25. Operation of AODV (cont..) <ul><li>When the source node receives the RREP, it also performs similar actions to update it route table. In case of multiple RREPs, the one with the highest sequence number or the minimum hop count is selected. Fig.2 shows the route discovery process. Here S is the source and D is the destination. The figure illustrates the reverse path formed during route discovery and consequent forward path to the destination. </li></ul>
  26. 26. Operation of AODV (cont..) Reverse Path Setup Forward Path Setup Fig. 2 Paths formed during the route discovery
  27. 27. Operation of AODV (cont..) Fig. 4.2.1 Propagation of RREQ Fig. 4.3.1 Route Maintenance and route determination
  28. 28. Operation of AODV (cont..) <ul><li>When the RERR message is received by a neighbor it also marks its route table entry for the destination as invalid and sends again RERR messages to its precursors. In figure 4.3.1.I, the node N4 moves to N4’ and so node N3 can not communicate with it anymore, connectivity is lost. N3 creates a RERR message to N2, there the route is marked invalid and unicasts the message to N1. The message is unicast since we have only route passing through each node. </li></ul>
  29. 29. Operation of AODV (cont..) <ul><li>N1 does the same thing and unicasts the message to the source node. When the RERR is received at the source node and it still needs the route to the destination it reinitiates a route discovery. Figure 4.3.1 shows the new route from the source to the destination through node N5. Also if a node receives a data packet for a node which it does not have an active route to, it creates a RERR message and broadcasts it as described above. </li></ul>
  30. 30. Operation of AODV (cont..) <ul><li>If no broadcast has been send within, by default, </li></ul><ul><li>one second, each node broadcasts Hell message </li></ul><ul><li>to its neighbors in order to keep connectivity up to </li></ul><ul><li>date. These messages contain the node’s IP </li></ul><ul><li>address and its current sequence number. So that </li></ul><ul><li>these messages are not forwarded from the node’s </li></ul><ul><li>neighbors to third parties the Hello message has a </li></ul><ul><li>TTL value of one. </li></ul>
  31. 31. Operation of AODV (cont..) <ul><li>Route Maintenance: If any destination or intermediate node moves outside of an active communication path, the node upstream of the break initiates, a RERR (Route ERRor) message listing the unreachable destinations. The RERR is broadcast so as to reach all precursor nodes as maintained by the individual nodes. Once it reaches the source node it may initiate a new route discovery process if required. </li></ul>
  32. 32. Operation of AODV (cont..) <ul><li>Local Connectivity Management: Neighborhood information is obtained by having the nodes send HELLO packets to each other. A hello message is an unsolicited RREP. If a node does not receive any hello message from its neighbor during a specific hello interval then it assumes its neighbor is either inactive or out of range and updates it connectivity information with regards to this particular node. </li></ul>
  33. 33. Operation of OLSR <ul><li>In OLSR protocol, there are four main steps </li></ul><ul><li>to creating a route table: neighbor sensing, </li></ul><ul><li>MPR selection, MPR information declaration </li></ul><ul><li>and route table calculation. During the </li></ul><ul><li>neighbor sensing, each node periodically </li></ul><ul><li>broadcasts the HELLO message containing </li></ul><ul><li>information about its one-hop neighbors and </li></ul><ul><li>their link status. The HELLO messages are </li></ul><ul><li>received by all the one-hop neighbors, but </li></ul><ul><li>they are not retransmitted tofurther nodes. </li></ul>
  34. 34. Operation of OLSR (cont..) <ul><li>Upon receipt of the HELLO messages, each </li></ul><ul><li>Node can update its knowledge of its one </li></ul><ul><li>hop neighbors and two-hop neighbors. This </li></ul><ul><li>information about One hop and two-hop </li></ul><ul><li>neighbors is recorded in a neighbor table. </li></ul><ul><li>On the basis of this information, each node </li></ul><ul><li>performs the selection of its MPR set .During </li></ul><ul><li>the MPR selection, each node independently </li></ul><ul><li>selects its MPR set according to the MPR </li></ul><ul><li>selection scheme. </li></ul>
  35. 35. Operation of OLSR (cont..) <ul><li>As a result, all of the two-hop neighbors of </li></ul><ul><li>each node are contained in the union of the </li></ul><ul><li>neighbor sets of its MPRs. Then, each node </li></ul><ul><li>declares its MPRs in the subsequent HELLO </li></ul><ul><li>messages. From the HELLO messages,which </li></ul><ul><li>Contain the MPRs, each node can inform its </li></ul><ul><li>MPR Selectors and construct its MPR Selector </li></ul><ul><li>table. </li></ul>
  36. 36. Operation of OLSR (cont..) <ul><li>During the MPR information declaration, each node broadcasts specific control messages called Topology Control messages to declare its MPR Selector set. The TC messages are forwarded through MPR nodes and transmitted to all nodes in the MANET. According to the MPR selectors </li></ul><ul><li>and the information in TC messages, a node </li></ul><ul><li>maintains a network topology table to record the MPRs of other nodes. The topology table is a base of calculating the route table. </li></ul>
  37. 37. Operation of OLSR (cont..) <ul><li>During the route table calculation, a node calculates the route table based on the information contained in the neighbor table and the topology table. To find a path from a source (S) to a destination (D), an intermediate node (I1) one hop away to D has to be found and the connection pair [I1, D] obtained; then, a node (I2) one hop away to I1 has to be found and the connection pair [I2, I1] obtained; and so forth, until a node In is found in the MPR sets of S. Based on this process, the route table is built by tracking the connection pairs included in the topology entries in a topology table. </li></ul>
  38. 38. Operation of OLSR (cont..) <ul><li>To attain the optimal routing path, the connection pairs on the minimal path are selected. In OLSR draft version 5 [9], associated networks and host support are added. A node may act as a gateway between the MANET and a subnet not running OLSR. In order to inject the routing information describing the associated subnets into a MANET, a gateway periodically broadcasts its existence and its associated subnet address in the MANET using Network Association (HNA) messages. </li></ul>
  39. 39. Operation of OLSR (cont..) <ul><li>The HNA messages indicate which network is reachable through this gateway. The HNA messages are propagated in an optimal way so that only MPR nodes retransmit the broadcast messages. Each node in the MANET maintains information concerning which node acts as a gateway and its associated network address. When a packet is destined for an address in a </li></ul><ul><li>subnet indicated by a gateway and there is not a host entry in the route table, a MANET node will forward it according to the gateway entry in its route table. </li></ul>
  40. 40. Operation of OLSR (cont..) <ul><li>To achieve the integration of a MANET with the Internet based IPv6, three main tasks need to be accomplished: gateway discovery, address auto configuration, and routing and addressing in a heterogeneous environment. The first step is the gateway discovery. To achieve the hybrid network connection, the installation of gateways that understand the protocols of MANET and the IP suite is needed. From the point of view of MANET, these gateways act as ARs to the Internet. </li></ul>
  41. 41. Operation of OLSR (cont..) <ul><li>An MN should discover the existence of gateways and then select one gateway as an AR to the Internet. The basic IP-based mechanism for access router discovery only supports those systems with one-hop connection between MNs and access routers. The MANET in the multi-hop environment makes the discovery mechanism more complex. The second step is address auto configuration. In order to be able to communicate with Internet hosts, each MN must configure an IP address with the prefix of a gateway. </li></ul>
  42. 42. Operation of OLSR (cont..) <ul><li>With this address, the MN can send packets to and receive packets from hosts in the Internet. The third step is routing and addressing in the heterogeneous environment. In a heterogeneous environment, when an MN arriving in a MANET sends packets to a host on the Internet, the packets are first transferred to a MANET gateway by MANET routing and then sent to the destination by IPv6 routing; when a host on the Internet sends packets to an MN arriving in a MANET, the packets are first transferred to a MANET gateway by IPv6 routing and then sent to the MN by MANET routing. </li></ul>
  43. 43. Conclusion <ul><li>The AODV protocol will perform better in the networks with static traffic with the number of source and destination pairs is relatively small for each host. It uses fewer resources than OLSR, because the control messages size is kept small requiring less bandwidth for maintaining the routes and the route table is kept small reducing the computational power. The AODV protocol can be used in resource critical environments. </li></ul>
  44. 44. Conclusion (Cont..) <ul><li>The OLSR protocol is more efficient in networks with high density and highly sporadic traffic. But the best situation is when the between a large number of hosts. The quality metrics are easy to expand to the current protocol. OLSR requires that it continuously have some bandwidth in order to receive the topology updates messages. </li></ul>

×