scispace - formally typeset

Optimized Link State Routing Protocol

About: Optimized Link State Routing Protocol is a(n) research topic. Over the lifetime, 26258 publication(s) have been published within this topic receiving 641506 citation(s). The topic is also known as: OSLR & OLSR. more


Open access
01 Jul 2003-
Abstract: The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the face of anomalous delivery of routing control messages), avoiding problems (such as "counting to infinity") associated with classical distance vector protocols. more

11,293 Citations

Open accessProceedings ArticleDOI: 10.1109/MCSA.1999.749281
C.E. Perkins, E.M. Royer1Institutions (1)
25 Feb 1999-
Abstract: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm. more

11,180 Citations

Open accessBook ChapterDOI: 10.1007/978-0-585-29603-6_5
David B. Johnson1, David A. Maltz1Institutions (1)
01 Jan 1996-
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal. more

  • Figure 7 Average route length used relative to optimal (20 runs)
    Figure 7 Average route length used relative to optimal (20 runs)
  • Figure 2 An example ad hoc network illustrating use of the route cache
    Figure 2 An example ad hoc network illustrating use of the route cache
  • Figure 4 Mobile host B is returning a route error packet to A
    Figure 4 Mobile host B is returning a route error packet to A
  • Figure 6 Example of disconnected clusters with 24 hosts
    Figure 6 Example of disconnected clusters with 24 hosts
  • Figure 1 A simple ad hoc network of three wireless mobile hosts
    Figure 1 A simple ad hoc network of three wireless mobile hosts
  • + 3

8,185 Citations

Open accessProceedings ArticleDOI: 10.1145/190809.190336
Charles E. Perkins1, Pravin Bhagwat2Institutions (2)
01 Oct 1994-
Abstract: An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks. more

6,770 Citations

Open access
01 Oct 2003-
Abstract: 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. more

5,306 Citations

No. of papers in the topic in previous years

Top Attributes

Show by:

Topic's top 5 most impactful authors

Mario Gerla

126 papers, 15.8K citations

Leonard Barolli

123 papers, 1.3K citations

J.J. Garcia-Luna-Aceves

97 papers, 2.7K citations

Makoto Ikeda

57 papers, 643 citations

Thomas Clausen

50 papers, 10K citations

Network Information
Related Topics (5)
Ad hoc wireless distribution service

17.7K papers, 488.2K citations

96% related
Wireless ad hoc network

49K papers, 1.1M citations

96% related
Dynamic Source Routing

32.2K papers, 695.7K citations

96% related
Adaptive quality of service multi-hop routing

12.1K papers, 331.9K citations

96% related
Wireless Routing Protocol

28.9K papers, 689.5K citations

96% related