Optimized link state routing protocol for ad hoc networks
Top Cited Papers
- 1 January 2001
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this paper we propose and discuss an optimized link state routing protocol, named OLSR, for mobile wireless networks. The protocol is based on the link state algorithm and it is proactive (or table-driven) in nature. It employs periodic exchange of messages to maintain topology information of the network at each node. OLSR is an optimization over a pure link state protocol as it compacts the size of information sent in the messages, and furthermore, reduces the number of retransmissions to flood these messages in an entire network. For this purpose, the protocol uses the multipoint relaying technique to efficiently and economically flood its control messages. It provides optimal routes in terms of number of hops, which are immediately available when needed. The proposed protocol is best suitable for large and dense ad hoc networks.Keywords
This publication has 7 references indexed in Scilit:
- Dynamic Source Routing in Ad Hoc Wireless NetworksPublished by Springer Nature ,2007
- Source-tree routing in wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Efficient routing protocols for packet-radio networks based on tree sharingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A highly adaptive distributed routing algorithm for mobile wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Ad-hoc on-demand distance vector routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Priority and Collision Detection with Active Signaling - The Channel Access Mechanism of HIPERLANWireless Personal Communications, 1997
- Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computersPublished by Association for Computing Machinery (ACM) ,1994