Your SlideShare is downloading. ×
0
Optimized Link State Routing Protocol for Ad Hoc Networks
Optimized Link State Routing Protocol for Ad Hoc Networks
Optimized Link State Routing Protocol for Ad Hoc Networks
Optimized Link State Routing Protocol for Ad Hoc Networks
Optimized Link State Routing Protocol for Ad Hoc Networks
Optimized Link State Routing Protocol for Ad Hoc Networks
Optimized Link State Routing Protocol for Ad Hoc Networks
Optimized Link State Routing Protocol for Ad Hoc Networks
Optimized Link State Routing Protocol for Ad Hoc Networks
Optimized Link State Routing Protocol for Ad Hoc Networks
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Optimized Link State Routing Protocol for Ad Hoc Networks

1,444

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
1,444
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
92
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Optimized Link State Routing Protocol for Ad Hoc Networks Presented by Yuyan Xue
  • 2. Overview <ul><li>The Optimized Link State Routing Protocol (OLSR) is a table driven, proactive protocol, i.e., exchanges topology information with other nodes of the network regularly. </li></ul><ul><li>Each node selects a set of its neighbor nodes as &amp;quot;multipoint relays&amp;quot; (MPR). </li></ul><ul><li>Only nodes, selected as such MPRs, are responsible for forwarding control traffic, intended for diffusion into the entire network. </li></ul>
  • 3. Feature <ul><li>Inherit Stability of Link-state protocol </li></ul><ul><li>Multipoint Relays (MPR) employed for selective flooding </li></ul><ul><li>Control traffic by reducing the number of transmissions required. </li></ul>
  • 4. Protocol Operation <ul><li>Neighbor Sensing </li></ul><ul><li>MPR Selection </li></ul><ul><li>MPR Information Declaration </li></ul><ul><li>Routing Table Construction </li></ul>
  • 5. Neighbor Sensing – Hello Message <ul><li>Each node periodically broadcasts Hello message: </li></ul><ul><ul><li>List of neighbors with bi-directional link </li></ul></ul><ul><ul><li>List of other known neighbors. </li></ul></ul><ul><li>Hello messages permit each node </li></ul><ul><li>to learn topology up to 2 hops </li></ul><ul><li>Based on Hello messages each </li></ul><ul><li>node selects its set of MPR’s </li></ul>
  • 6. MPR Selection <ul><li>Each node select a set </li></ul><ul><li>of MPR Selectors </li></ul><ul><li>Who can be a MPR Selectors </li></ul><ul><li>of node N ? </li></ul><ul><ul><li>- one-hop neighbors of N </li></ul></ul><ul><li>MPR set of Node N (Rules) </li></ul><ul><li>(1) Set of MPR’s is able to </li></ul><ul><li>transmit to all two-hop neighbors </li></ul><ul><li>(2) Link between node and it’s MPR is </li></ul><ul><li>bidirectional. </li></ul>D S M X Y Z A B
  • 7. MPR Selection – Con. Node 1 Hop Neighbors 2 Hop Neighbors MPR(s) B A,C,F,G D,E C <ul><ul><li>Node B will select C as its </li></ul></ul><ul><li>MPR So all the other nodes know </li></ul><ul><li>that they can reach B via C </li></ul>30 100 50 110 25 60 10 40 5 10 <ul><ul><li>D-&gt;B route is D-C-B, whose </li></ul></ul><ul><li>bottleneck BW is 3 ( Not BW </li></ul><ul><li>optimal) </li></ul>3
  • 8. MPR Information Declaration <ul><li>Topology Control Message (TC) </li></ul><ul><ul><li>Send if there are updates </li></ul></ul><ul><ul><li>Contains: </li></ul></ul><ul><ul><ul><li>MPR Selector Table </li></ul></ul></ul><ul><ul><ul><li>Sequence number </li></ul></ul></ul><ul><li>Topology Table </li></ul><ul><ul><li>Each node maintains a Topology Table based on TC messages </li></ul></ul><ul><ul><li>Routing Tables are calculated based on Topology tables </li></ul></ul>
  • 9. Routing Table Construction <ul><li>Each node maintains a routing table to all known </li></ul><ul><li>destinations in the network </li></ul><ul><li>Routing table: </li></ul><ul><ul><li>Destination address </li></ul></ul><ul><ul><li>Next Hop address </li></ul></ul><ul><ul><li>Distance </li></ul></ul><ul><li>Routing Table is calculated from Topology Table and </li></ul><ul><li>recalculated after every change in neighborhood table </li></ul><ul><li>or in topological table </li></ul>
  • 10. References <ul><li>G. Pei, M. Gerla, and X. Hong, &amp;quot; LANMAR: Landmark Routing for Large Scale Wireless Ad Hoc Networks with Group Mobility ,&amp;quot; In Proceedings of IEEE/ACM MobiHOC 2000, Boston, MA, Aug. 2000. </li></ul><ul><li>Thomas Clausen, Philippe Jacquet, &amp;quot; Optimized Link State Routing Protocol (OLSR) ,&amp;quot; IETF Internet Draft , July 3 2003. </li></ul><ul><li>X. Hong, K. Xu, and M. Gerla, &amp;quot; Scalable Routing Protocols for Mobile Ad Hoc Networks &amp;quot; IEEE Network Magazine, July-Aug, 2002, pp. 11-21 </li></ul>

×