2003
Thomas Clausen; Philippe Jacquet
RFC3626: The Optimized Link State Routing Protocol Miscellaneous
2003, (http://tools.ietf.org/html/rfc3626).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, OLSR, RFC, Standard
@misc{Clausen2003,
title = {RFC3626: The Optimized Link State Routing Protocol},
author = {Thomas Clausen and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc3626.txt.pdf},
doi = {10.17487/RFC3626},
year = {2003},
date = {2003-10-01},
publisher = {The Internet Engineering Task Force (IETF) - MANET Working Group},
organization = {The Internet Engineering Task Force},
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.},
note = {http://tools.ietf.org/html/rfc3626},
keywords = {Ad-Hoc, IETF, MANET, MESH, OLSR, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
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.
Thomas Clausen
Combining Temporal and Spartial Partial Topolgy for MANET Routing - Merging OLSR and FSR Proceedings Article
In: Proceedings of the IEEE conference on Wireless Personal Multimedia Communications (WPMC), 2003.
Abstract | Links | BibTeX | Tags: FSR, MANET, OLSR, Scalability
@inproceedings{Clausen2003b,
title = {Combining Temporal and Spartial Partial Topolgy for MANET Routing - Merging OLSR and FSR},
author = {Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2003-WPMC-Combining-Temporal-and-Spartial-Partial-Topolgy-for-MANET-Routing-Merging-OLSR-and-FSR.pdf},
year = {2003},
date = {2003-10-01},
booktitle = {Proceedings of the IEEE conference on Wireless Personal Multimedia Communications (WPMC)},
abstract = {In this paper, we propose an extension to the Optimized Link State Routing (OLSR) protocol, a proactive link-state routing protocol optimized for mobile ad-hoc networks, in-troducing temporal partial topology as a mechanism for re-ducing control traffic overhead. The extension is inspired from Fisheye State Routing (FSR), and complements the spatial partial topology of OLSR in extending scalability of manet routing protocols to large, dense networks. Through simulations, the paper justifies that through in-troducing temporal partial topology information in OLSR, the control traffic overhead in some manet configurations can be reduced.},
keywords = {FSR, MANET, OLSR, Scalability},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we propose an extension to the Optimized Link State Routing (OLSR) protocol, a proactive link-state routing protocol optimized for mobile ad-hoc networks, in-troducing temporal partial topology as a mechanism for re-ducing control traffic overhead. The extension is inspired from Fisheye State Routing (FSR), and complements the spatial partial topology of OLSR in extending scalability of manet routing protocols to large, dense networks. Through simulations, the paper justifies that through in-troducing temporal partial topology information in OLSR, the control traffic overhead in some manet configurations can be reduced.
Thomas Clausen; Anis Laouiti; Philippe Jacquet; Pascale Minet; Laurent Viennot; Cedric Adjih
Multicast Optimized Link State Routing Technical Report
2003.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, Multicast, OLSR
@techreport{LIX-NET-RR-10,
title = {Multicast Optimized Link State Routing},
author = {Thomas Clausen and Anis Laouiti and Philippe Jacquet and Pascale Minet and Laurent Viennot and Cedric Adjih},
url = {https://www.thomasclausen.net/wp-content/uploads/2022/05/RR-4721.pdf},
year = {2003},
date = {2003-02-01},
urldate = {2003-02-01},
publisher = {INRIA Research Report RR-4721},
abstract = {This document describes the Multicast extension for the Optimized Link State
Routing protocol (MOLSR). MOLSR is in charge of building a multicast structure in order to route multicast traffic in an ad-hoc network. MOLSR is designed for mobile multicast routers, and works in a heterogenous network composed of simple unicast OLSR routers, MOLSR routers and hosts. In the last part of this document we introduce also a Wireless Internet Group Management Protocol (WIGMP). It offers the possibility for OLSR nodes (without multicast capabilities) to join multicast groups and receive multicast data.},
keywords = {Ad-Hoc, MANET, MESH, Multicast, OLSR},
pubstate = {published},
tppubtype = {techreport}
}
This document describes the Multicast extension for the Optimized Link State
Routing protocol (MOLSR). MOLSR is in charge of building a multicast structure in order to route multicast traffic in an ad-hoc network. MOLSR is designed for mobile multicast routers, and works in a heterogenous network composed of simple unicast OLSR routers, MOLSR routers and hosts. In the last part of this document we introduce also a Wireless Internet Group Management Protocol (WIGMP). It offers the possibility for OLSR nodes (without multicast capabilities) to join multicast groups and receive multicast data.
Routing protocol (MOLSR). MOLSR is in charge of building a multicast structure in order to route multicast traffic in an ad-hoc network. MOLSR is designed for mobile multicast routers, and works in a heterogenous network composed of simple unicast OLSR routers, MOLSR routers and hosts. In the last part of this document we introduce also a Wireless Internet Group Management Protocol (WIGMP). It offers the possibility for OLSR nodes (without multicast capabilities) to join multicast groups and receive multicast data.
Cedric Adjih; Thomas Clausen; Anis Laouiti; Paul Mühlethaler; Daniele Raffo
Securing the OLSR protocol Proceedings Article
In: In 2nd IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2003), Mahdia, pp. 25–27, 2003.
Abstract | Links | BibTeX | Tags: MANET, OLSR, OLSR Security, Security
@inproceedings{Clausen2003e,
title = {Securing the OLSR protocol},
author = {Cedric Adjih and Thomas Clausen and Anis Laouiti and Paul Mühlethaler and Daniele Raffo},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/securing-olsr.pdf},
year = {2003},
date = {2003-01-01},
booktitle = {In 2nd IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2003), Mahdia},
pages = {25–27},
abstract = {In this paper, we examine security issues related to proactive routing protocols for MANETs. Specifically, we investigate security properties of the Optimized Link-State Routing Protocol- one example of a proactive routing protocol for MANETs. We investigate the possible attacks against the integrity of the network routing infrastructure, and present techniques for countering a variety of such attacks. Our main approach is based on authentication checks of information injected into the network. However even with perfect authentication check, replay attacks are still possible. Hence, we develop a distributed timestamp-based approach for verifying if a message is “old ” or “current”. We finally present two different, simple algorithms for distributing public keys in a MANET, in order to provide a mechanism permitting authentication checks to be conducted. While we use OLSR as an example protocol for our studies, we argue that the presented techniques apply equally to any proactive routing protocol for MANETs.},
keywords = {MANET, OLSR, OLSR Security, Security},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we examine security issues related to proactive routing protocols for MANETs. Specifically, we investigate security properties of the Optimized Link-State Routing Protocol- one example of a proactive routing protocol for MANETs. We investigate the possible attacks against the integrity of the network routing infrastructure, and present techniques for countering a variety of such attacks. Our main approach is based on authentication checks of information injected into the network. However even with perfect authentication check, replay attacks are still possible. Hence, we develop a distributed timestamp-based approach for verifying if a message is “old ” or “current”. We finally present two different, simple algorithms for distributing public keys in a MANET, in order to provide a mechanism permitting authentication checks to be conducted. While we use OLSR as an example protocol for our studies, we argue that the presented techniques apply equally to any proactive routing protocol for MANETs.
2002
Thomas Clausen; Amir Qayyum; Philippe Jacquet; Y. Toor; Paul Muhlethaler
Sleep mode operation of a routing protocol in mobile ad hoc networks Proceedings Article
In: The proceedings of the joint International Conference on Wireless LANs and Home Networks (ICWLHN 2002) and Networking (ICN 2002), 2002, ISBN: 9812381279.
Links | BibTeX | Tags: MANET, OLSR
@inproceedings{Clausen2002b,
title = {Sleep mode operation of a routing protocol in mobile ad hoc networks},
author = {Thomas Clausen and Amir Qayyum and Philippe Jacquet and Y. Toor and Paul Muhlethaler},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-NETWORK-Sleep-Mode-Operation-of-a-Routing-Protocol-in-Mobile-Ad-hoc-Networks.pdf},
isbn = {9812381279},
year = {2002},
date = {2002-11-01},
booktitle = {The proceedings of the joint International Conference on Wireless LANs and Home Networks (ICWLHN 2002) and Networking (ICN 2002)},
keywords = {MANET, OLSR},
pubstate = {published},
tppubtype = {inproceedings}
}
Thomas Clausen; Laurent Viennot; Tue Olesen; Nikolai Larsen
Investigating data broadcast performance in mobile ad-hoc networks Proceedings Article
In: Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on, pp. 786-790 vol.2, 2002, ISSN: 1347-6890.
Abstract | Links | BibTeX | Tags: Broadcast, Performance Evaluation
@inproceedings{Clausen2002a,
title = {Investigating data broadcast performance in mobile ad-hoc networks},
author = {Thomas Clausen and Laurent Viennot and Tue Olesen and Nikolai Larsen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-WPMC-Investigating-data-broadcast-performance-in-mobile-ad-hoc-networks.pdf},
doi = {10.1109/WPMC.2002.1088283},
issn = {1347-6890},
year = {2002},
date = {2002-10-01},
booktitle = {Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on},
volume = {2},
pages = {786-790 vol.2},
abstract = {We investigate broadcasting in mobile ad-hoc networks (MANETs). We define broadcasting as being the process of delivering one packet, originated at one node, to (ideally) all other nodes in the MANET. We present specific problems related to broadcasting in MANETs, as well as four broadcast protocols aimed at providing MANET-wide broadcast. Further, three protocol-independent modifications are presented. One aimed at ensuring that a broadcast packet traverses at least the "shortest path" to its destinations, and two aimed at increasing the fraction of nodes which receive a broadcast packet. Through simulation studies, we evaluate the performance characteristics of the broadcast protocols and generic modifications under different conditions.},
keywords = {Broadcast, Performance Evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}
We investigate broadcasting in mobile ad-hoc networks (MANETs). We define broadcasting as being the process of delivering one packet, originated at one node, to (ideally) all other nodes in the MANET. We present specific problems related to broadcasting in MANETs, as well as four broadcast protocols aimed at providing MANET-wide broadcast. Further, three protocol-independent modifications are presented. One aimed at ensuring that a broadcast packet traverses at least the "shortest path" to its destinations, and two aimed at increasing the fraction of nodes which receive a broadcast packet. Through simulation studies, we evaluate the performance characteristics of the broadcast protocols and generic modifications under different conditions.
Thomas Clausen; Philippe Jacquet; Laurent Viennot
Investigating the impact of partial topology in proactive MANET routing protocols Proceedings Article
In: Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on, pp. 1374-1378 vol.3, 2002, ISSN: 1347-6890.
Abstract | Links | BibTeX | Tags: OLSR, Performance Evaluation
@inproceedings{Clausen2002,
title = {Investigating the impact of partial topology in proactive MANET routing protocols},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-WPMC-Investigating-the-impact-of-partial-topology-in-proactive-MANET-routing-protocols.pdf},
doi = {10.1109/WPMC.2002.1088405},
issn = {1347-6890},
year = {2002},
date = {2002-10-01},
booktitle = {Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on},
volume = {3},
pages = {1374-1378 vol.3},
abstract = {We study the impact of using partial versus full topology in the OLSR (optimized link state routing) protocol for MANETs (mobile ad hoc networks). The core of OLSR is the notion of multi-point relays (MPRs), serving the purpose of reducing the amount of link-state information flooded to nodes in the network, as well as reducing the redundancy in the flooding process. The OLSR protocol specification contains a tunable parameter, MPR coverage, which adjusts the degree of redundancy in both the advertised link-state information, and the links over which the link-state information is advertised. We investigate the impact of assigning various values to this parameter. We further investigate two options for advertising additional link-state information: the "MPR full link-state" option implies that whenever a node is selected to declare any link-state information, it declares all its local link state information; the "full link-state" option states, that all nodes must declare all their local link-state information. Through simulations, we investigate the performance characteristics of OLSR with and without these options.},
keywords = {OLSR, Performance Evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}
We study the impact of using partial versus full topology in the OLSR (optimized link state routing) protocol for MANETs (mobile ad hoc networks). The core of OLSR is the notion of multi-point relays (MPRs), serving the purpose of reducing the amount of link-state information flooded to nodes in the network, as well as reducing the redundancy in the flooding process. The OLSR protocol specification contains a tunable parameter, MPR coverage, which adjusts the degree of redundancy in both the advertised link-state information, and the links over which the link-state information is advertised. We investigate the impact of assigning various values to this parameter. We further investigate two options for advertising additional link-state information: the "MPR full link-state" option implies that whenever a node is selected to declare any link-state information, it declares all its local link state information; the "full link-state" option states, that all nodes must declare all their local link-state information. Through simulations, we investigate the performance characteristics of OLSR with and without these options.
Thomas Clausen; Philippe Jacquet; Laurent Viennot
Optimizing Route Length in Reactive Protocols for Ad Hoc Networks Proceedings Article
In: In Proceeding of The First Annual Mediterranean Ad Hoc Networking Workshop., 2002.
Abstract | Links | BibTeX | Tags: MANET, Reactive
@inproceedings{Clausen2002e,
title = {Optimizing Route Length in Reactive Protocols for Ad Hoc Networks},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-MedHocNets-Optimizing-Route-Length-in-Reactive-Protocols-for-Ad-Hoc-Networks.pdf},
year = {2002},
date = {2002-09-01},
booktitle = {In Proceeding of The First Annual Mediterranean Ad Hoc Networking Workshop.},
abstract = {Many protocols for Mobile Ad-hoc Networks propose construction of routes reactively using flooding. The advantage hereof is that no prior assumption of the network topology is required in order to provide routing between any pair of nodes in the network. In mobile networks, where the topology may be subject to frequent changes, this is a particularly attractive property. In this paper, we investigate the effect of using flooding for acquiring routes. We show that flooding may lead to non-optimal routes in terms of number of hops. This implies that more retransmissions are needed to send a packet along a route. We proceed by providing a qualitative analysis of the route lengths. Finally, we propose alternative flooding schemes and evaluate these schemes through simulations. We find that using these schemes, it is indeed possible to provide shorter routes.},
keywords = {MANET, Reactive},
pubstate = {published},
tppubtype = {inproceedings}
}
Many protocols for Mobile Ad-hoc Networks propose construction of routes reactively using flooding. The advantage hereof is that no prior assumption of the network topology is required in order to provide routing between any pair of nodes in the network. In mobile networks, where the topology may be subject to frequent changes, this is a particularly attractive property. In this paper, we investigate the effect of using flooding for acquiring routes. We show that flooding may lead to non-optimal routes in terms of number of hops. This implies that more retransmissions are needed to send a packet along a route. We proceed by providing a qualitative analysis of the route lengths. Finally, we propose alternative flooding schemes and evaluate these schemes through simulations. We find that using these schemes, it is indeed possible to provide shorter routes.
Thomas Clausen; Philippe Jacquet; Laurent Viennot
Comparative Study of Routing Protocols for Mobile Ad-hoc NETworks Proceedings Article
In: Proceedings of the IFIP MedHocNet, September 2002, Sardinia, Italy, 2002.
Abstract | Links | BibTeX | Tags: MANET, Performance Evaluation, Routing
@inproceedings{Clausen2002c,
title = {Comparative Study of Routing Protocols for Mobile Ad-hoc NETworks},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-MedHocNets-Comparative-Study-of-Routing-Protocols-for-Mobile-Ad-hoc-NETwork.pdf},
year = {2002},
date = {2002-09-01},
booktitle = {Proceedings of the IFIP MedHocNet, September 2002, Sardinia, Italy},
abstract = {In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [19],[20], a proactive routing protocol for Mobile Ad-hoc NETworks (MANETs). We eval- uate its performance through exhaustive simulations using the Network Simulator 2 (ns2) [1], and compare with other ad-hoc protocols, specifically the Ad-hoc On-Demand Dis- tance Vector (AODV) [4] routing protocol and the Dynamic Source Routing (DSR) [5] protocol. We study the protocols under varying conditions (node mobility, network density) and with varying traffic (TCP, UDP, different number of connections/streams) to provide a qualitative assessment of the applicability of the protocols in different scenarios.},
keywords = {MANET, Performance Evaluation, Routing},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [19],[20], a proactive routing protocol for Mobile Ad-hoc NETworks (MANETs). We eval- uate its performance through exhaustive simulations using the Network Simulator 2 (ns2) [1], and compare with other ad-hoc protocols, specifically the Ad-hoc On-Demand Dis- tance Vector (AODV) [4] routing protocol and the Dynamic Source Routing (DSR) [5] protocol. We study the protocols under varying conditions (node mobility, network density) and with varying traffic (TCP, UDP, different number of connections/streams) to provide a qualitative assessment of the applicability of the protocols in different scenarios.
Thomas Clausen; Philippe Jacquet; Laurent Viennot
Comparative study of CBR and TCP performance of MANET routing protocols Proceedings Article
In: Workshop on Broadband Wireless Ad-Hoc Networks and Services, Sep 2002, Sophia-Antipolis, France. 2002, 2002.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, OLSR, Performance Evaluation
@inproceedings{Clausen2002f,
title = {Comparative study of CBR and TCP performance of MANET routing protocols},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2018/05/2003-MESA-TCPPerformanceComparisoninMANETs.pdf},
year = {2002},
date = {2002-05-01},
booktitle = {Workshop on Broadband Wireless Ad-Hoc Networks and Services, Sep 2002, Sophia-Antipolis, France. 2002},
abstract = {In this paper, we evaluate the performance of two MANET routing protocols under varying
traffic, density and mobility conditions. We observe, that a rather large fraction of the traffic being carried on the Internet today carries TCP. Thus, Internet traffic has inheritly different characteristics than that of CBR traffic, which is the commonly used traffic type for evaluating MANET routing protocol performance. Hence, in this paper, we extend our evaluations of the two protocols to include the performance of both TCP and CBR traffic. We find, that testing a protocol using CBR traffic is not a good indicator for the same protocols performance when subject to TCP traffic.},
keywords = {Ad-Hoc, MANET, OLSR, Performance Evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we evaluate the performance of two MANET routing protocols under varying
traffic, density and mobility conditions. We observe, that a rather large fraction of the traffic being carried on the Internet today carries TCP. Thus, Internet traffic has inheritly different characteristics than that of CBR traffic, which is the commonly used traffic type for evaluating MANET routing protocol performance. Hence, in this paper, we extend our evaluations of the two protocols to include the performance of both TCP and CBR traffic. We find, that testing a protocol using CBR traffic is not a good indicator for the same protocols performance when subject to TCP traffic.
traffic, density and mobility conditions. We observe, that a rather large fraction of the traffic being carried on the Internet today carries TCP. Thus, Internet traffic has inheritly different characteristics than that of CBR traffic, which is the commonly used traffic type for evaluating MANET routing protocol performance. Hence, in this paper, we extend our evaluations of the two protocols to include the performance of both TCP and CBR traffic. We find, that testing a protocol using CBR traffic is not a good indicator for the same protocols performance when subject to TCP traffic.
Laurent Viennot; Philippe Jacquet; Thomas Clausen
Analyzing Control Traffic Overhead in Mobile Ad-hoc Network Protocols versus Mobility and Data Traffic Activity Proceedings Article
In: In Proceedings of the 1st IFIP Annual Mediterranean Ad Hoc Networking Workshop (MedHocNet’02, 2002.
Abstract | Links | BibTeX | Tags: MANET, Modeling, OLSR, Reactive
@inproceedings{Viennot2002,
title = {Analyzing Control Traffic Overhead in Mobile Ad-hoc Network Protocols versus Mobility and Data Traffic Activity},
author = {Laurent Viennot and Philippe Jacquet and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-MedHocNet-Analyzing-Control-Traffic-Overhead-versus-Mobility-and-Data-Traffic-Activity-in-Mobile-Ad-hoc-Network-Protocols.pdf},
year = {2002},
date = {2002-01-01},
booktitle = {In Proceedings of the 1st IFIP Annual Mediterranean Ad Hoc Networking Workshop (MedHocNet’02},
abstract = {This paper proposes a general, parameterized model for analyzing protocol control overheads in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols.},
keywords = {MANET, Modeling, OLSR, Reactive},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper proposes a general, parameterized model for analyzing protocol control overheads in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols.
2001
Thomas Clausen; Gitte Hansen; Lars Christensen; Gerd Behrmann
The Optimized Link State Routing Protocol Evaluation through Experiments and Simulation Proceedings Article
In: IN PROCEEDING OF WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS, IEEE, 2001.
Abstract | Links | BibTeX | Tags: MANET, OLSR
@inproceedings{Clausen2001,
title = {The Optimized Link State Routing Protocol Evaluation through Experiments and Simulation},
author = {Thomas Clausen and Gitte Hansen and Lars Christensen and Gerd Behrmann},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2001-WPMC-The-Optimized-Link-State-Routing-Protocol-Evaluation-through-Experiments-and-Simulation.pdf},
year = {2001},
date = {2001-01-01},
booktitle = {IN PROCEEDING OF WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS},
publisher = {IEEE},
abstract = {In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [1] for Mobile Ad-hoc NETworks (MANETs) and the evaluation of this protocol through experiments and simulations. In particular, we emphasize the practical tests and intensive simulations, which have been used in guiding and evaluating the design of the protocol, and which have been a key to identifying both problems and solutions. OLSR is a proactive link-state routing protocol, employing periodic message exchange for updating topological information in each node in the network. I.e. topological information is flooded to all nodes in the network. Conceptually, OLSR contains three elements: Mechanisms for neighbor sensing based on periodic exchange of HELLO messages within a node’s neighborhood. Generic mechanisms for efficient flooding of control traffic into the network employing the concept of multipoint relays (MPRs) [5] for a significant reduction of duplicate retransmissions during the flooding process. And a specification of a set of control-messages providing each node with sufficient topological information to be able to compute an optimal route to each destination in the network using any shortest-path algorithm. Experimental work, running a test-network of laptops with IEEE 802.11 wireless cards, revealed interesting properties. While the protocol, as originally specified, works quite well, it was found, that enforcing “jitter” on the interval between the periodic exchange of control messages in OLSR and piggybacking said control messages into a single packet, significantly reduced the number of messages lost due to collisions. It was also observed, that under certain conditions a “naive” neighbor sensing mechanism was insufficient: a bad link between two nodes (e.g. when two nodes are on the edge of radio range) might on occasion transmit a HELLO message in both directions (hence enabling the link for routing), while not being able to sustain continuous traffic. This would result in “route-flapping” and temporary loss of connectivity. With the experimental results as basis, we have been deploying simulations to reveal the impact of the various algorithmic improvements, described above.},
keywords = {MANET, OLSR},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [1] for Mobile Ad-hoc NETworks (MANETs) and the evaluation of this protocol through experiments and simulations. In particular, we emphasize the practical tests and intensive simulations, which have been used in guiding and evaluating the design of the protocol, and which have been a key to identifying both problems and solutions. OLSR is a proactive link-state routing protocol, employing periodic message exchange for updating topological information in each node in the network. I.e. topological information is flooded to all nodes in the network. Conceptually, OLSR contains three elements: Mechanisms for neighbor sensing based on periodic exchange of HELLO messages within a node’s neighborhood. Generic mechanisms for efficient flooding of control traffic into the network employing the concept of multipoint relays (MPRs) [5] for a significant reduction of duplicate retransmissions during the flooding process. And a specification of a set of control-messages providing each node with sufficient topological information to be able to compute an optimal route to each destination in the network using any shortest-path algorithm. Experimental work, running a test-network of laptops with IEEE 802.11 wireless cards, revealed interesting properties. While the protocol, as originally specified, works quite well, it was found, that enforcing “jitter” on the interval between the periodic exchange of control messages in OLSR and piggybacking said control messages into a single packet, significantly reduced the number of messages lost due to collisions. It was also observed, that under certain conditions a “naive” neighbor sensing mechanism was insufficient: a bad link between two nodes (e.g. when two nodes are on the edge of radio range) might on occasion transmit a HELLO message in both directions (hence enabling the link for routing), while not being able to sustain continuous traffic. This would result in “route-flapping” and temporary loss of connectivity. With the experimental results as basis, we have been deploying simulations to reveal the impact of the various algorithmic improvements, described above.
Phiippe Jacquet; Paul Muhlethaler; Thomas Clausen; Anis Laouiti; Amir Qayyum; Laurent Viennot
Optimized link state routing protocol for ad hoc networks Proceedings Article
In: Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century. Proceedings. IEEE International, pp. 62-68, 2001.
Abstract | Links | BibTeX | Tags: MANET, OLSR
@inproceedings{Jacquet2001,
title = {Optimized link state routing protocol for ad hoc networks},
author = {Phiippe Jacquet and Paul Muhlethaler and Thomas Clausen and Anis Laouiti and Amir Qayyum and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2001-INMIC-Optimized-link-state-routing-protocol-for-ad-hoc-networks.pdf},
doi = {10.1109/INMIC.2001.995315},
year = {2001},
date = {2001-01-01},
booktitle = {Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century. Proceedings. IEEE International},
pages = {62-68},
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 = {MANET, OLSR},
pubstate = {published},
tppubtype = {inproceedings}
}
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.