Optimized Link State Routing Protocol (OLSR)

By T. Clausen, P. Jacquet. Request for Comments, 2003

5,821 citations recorded by the source corpus.

This document describes the Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks. The protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN. The key concept used in the protocol is that of multipoint relays (MPRs). MPRs are selected nodes which forward broadcast messages during the flooding process. This technique substantially reduces the message overhead as compared to a classical flooding mechanism, where every node retransmits each message when it receives the first copy of the message. In OLSR, link state information is generated only by nodes elected as MPRs. Thus, a second optimization is achieved by minimizing the number of control messages flooded in the network. As a third optimization, an MPR node may chose to report only links between itself and its MPR selectors. Hence, as contrary to the classic link state algorithm, partial link state information is distributed in the network. This information is then used for route calculation. OLSR provides optimal routes (in terms of number of hops). The protocol is particularly suitable for large and dense networks as the technique of MPRs works well in this context.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/9edac38218b2853ff73df73b00ed81708c4d4cba

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

IP is dead, long live IP for wireless sensor networks (2008, background): “MANET protocols are designed for ad-hoc networks with high and uncorrelated mobility, relying on floods to discover routes and recover from link failures [8, 36].”
Security and Cooperation in Wireless Networks (2007, background): “Its full description can be found in [103]; here we summarize only its main characteristics.”
Application of reinforcement learning to routing in distributed wireless networks: a review (2013, background): “Furthermore, in link-state routing schemes, such as Optimized Link State Routing (OLSR) (Clausen and Jacquet 2003), each node maintains a route to every other nodes in the network.”
A Stable Routing Protocol to Support ITS Services in VANET Networks (2007, background): “category include Optimized Link State Routing (OLSR) [9], Hazy Sighted Link State Routing (HSLSR) [10], Topology Broadcast based on Reverse Path Forwarding (TBRPF) [11], and Destination-Sequenced Distance Vector (DSDV) [12].”
Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges (2006, methodology): “To accommodate the dynamic topology of mobile ad hoc networks, an abundance of routing protocols have recently been proposed, such as OLSR [ 1 ], AODV [2], DSR [3], LAR [4], EASE [5, 6], ODMRP [7], and many others [8, 9]. For all these routing protocols, it is implicitly assumed that the network is ”
Comparative Study of Reactive and Proactive Routing Protocols Performance in Mobile Ad Hoc Networks (2007, background): “Proactive protocols like OLSR [3] and DSDV, on the other hand, find paths in advance for all source and destination pairs and periodically exchange topology information to maintain them.”
Prioritized epidemic routing for opportunistic networks (2007, methodology): “This is done using a HELLO protocol similar to that in [17].”
A Survey of Attacks and Countermeasures in Mobile Ad Hoc Networks (2007, methodology): “Proactive routing algorithms, such as DSDV [22] and OLSR [ 45 ], attempt to discover routing information before it is need, while reactive algorithms, such as DSR [22] and AODV [22], create routes only when they are needed.”
CitySense: An Urban-Scale Wireless Sensor Network and Testbed (2008, positive): “Rather, we intend to leverage previous work on robust urban mesh routing [18, 16, 12, 17] as much as possible to build the testbed.”
A survey on routing algorithms for wireless Ad-Hoc and mesh networks (2012, neutral): “In Section 2, we discuss the different dimensions of the available routingalgorithm categories associated with the advantages and Table 1 (continued) MOLSR [70] Multi-cast Optimized Link State Routing MP-DSR [75] Multi-Path Dynamic Source Routing MPRDV [6] Multi-point Relay Distance Vector protocol ”
VANET Routing on City Roads Using Real-Time Vehicular Traffic Information (2009, methodology): “GPSR implementation code is taken from [39] and OLSR implementation code is taken from [40].”
Mobile Video Transmission Using Scalable Video Coding (2007, methodology): “routing algorithms like Ad-Hoc On-Demand Distance Vector Routing (AODV) [43] and Optimized Link State Routing (OLSR) [44] are used, the network separation problem, as”