2010
Ulrich Herberg; Thomas Clausen
Security Issues in the Optimized Link State Routing Protocol Version 2 (OLSRV2) Journal Article
In: International Journal of Network Security & Its Applications (IJNSA), 2010.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OLSR, OLSR Security, OLSRv2
@article{LIX-NET-journal-70,
title = {Security Issues in the Optimized Link State Routing Protocol Version 2 (OLSRV2)},
author = {Ulrich Herberg and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-IJNSA-Security-Issues-in-the-Optimized-Link-State-Routing-Protocol-version-2-OLSRv2-1.pdf},
year = {2010},
date = {2010-04-01},
journal = {International Journal of Network Security & Its Applications (IJNSA)},
abstract = {Mobile Ad hoc NETworks (MANETs) are leaving the confines of research laboratories, to find place in real-world deployments. Outside specialized domains (military, vehicular, etc.), city-wide community- networks are emerging, connecting regular Internet users with each other, and with the Internet, via MANETs. Growing to encompass more than a handful of “trusted participants”, the question of preserving the MANET network connectivity, even when faced with careless or malicious participants, arises, and must be addressed.
A first step towards protecting a MANET is to analyze the vulnerabilities of the routing protocol, managing the connectivity. By understanding how the algorithms of the routing protocol operate, and how these can be exploited by those with ill intent, countermeasures can be developed, readying MANETs for wider deployment and use.
This paper takes an abstract look at the algorithms that constitute the Optimized Link State Routing Protocol version 2 (OLSRv2), and identifies for each protocol element the possible vulnerabilities and attacks – in a certain way, provides a “cookbook” for how to best attack an operational OLSRv2 network, or for how to proceed with developing protective countermeasures against these attacks.},
keywords = {Ad-Hoc, MANET, MESH, OLSR, OLSR Security, OLSRv2},
pubstate = {published},
tppubtype = {article}
}
A first step towards protecting a MANET is to analyze the vulnerabilities of the routing protocol, managing the connectivity. By understanding how the algorithms of the routing protocol operate, and how these can be exploited by those with ill intent, countermeasures can be developed, readying MANETs for wider deployment and use.
This paper takes an abstract look at the algorithms that constitute the Optimized Link State Routing Protocol version 2 (OLSRv2), and identifies for each protocol element the possible vulnerabilities and attacks – in a certain way, provides a “cookbook” for how to best attack an operational OLSRv2 network, or for how to proceed with developing protective countermeasures against these attacks.
2004
Thomas Clausen; Emmanuel Baccelli; Georgios Rodolakis; Cedric Adjih; Philippe Jacquet
Fish-Eye OLSR Scaling Properties Journal Article
In: IEEE Journal on Communications Networks (JCN), Special Issue on Ad Hoc Networking, Dec 2004, 2004.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH
@article{LIX-NET-journal-2,
title = {Fish-Eye OLSR Scaling Properties},
author = {Thomas Clausen and Emmanuel Baccelli and Georgios Rodolakis and Cedric Adjih and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2004-JCN-Fish-Eye-OLSR-Scaling-Properties.pdf},
year = {2004},
date = {2004-12-01},
journal = {IEEE Journal on Communications Networks (JCN), Special Issue on Ad Hoc Networking, Dec 2004},
abstract = {Scalability is one of the toughest challenges in ad hoc networking. Recent work outlines theoretical bounds on how well routing protocols could scale in this environment. However, none of the popular routing solutions really scales to large networks, by coming close enough to these bounds. In this paper, we study the case of link state routing and OLSR, one of the strongest candidate for standardization. We analyze how these bounds are not reached in this case, and we study how much the scalability is enhanced with the use of Fish Eye techniques in addition to the link state routing framework. We show that with this enhancement, the theoretical scalability bounds are reached.},
keywords = {Ad-Hoc, MANET, MESH},
pubstate = {published},
tppubtype = {article}
}
Thomas Clausen; Philippe Jacquet; Laurent Viennot
Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad Hoc Network Protocols Journal Article
In: ACM Journal on Wireless Networks (Winet) July 2004, volume 10 no. 4, 2004.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH
@article{Clausen2004,
title = {Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad Hoc Network Protocols},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2004-ACM-WINET-Analyzing-Control-Traffic-Overhead-versus-Mobility-and-Data-Traffic-Activity-in-Mobile-Ad-hoc-Network-Protoc.pdf},
year = {2004},
date = {2004-07-01},
journal = {ACM Journal on Wireless Networks (Winet) July 2004, volume 10 no. 4},
abstract = {This paper proposes a general, parameterized model for analyzing protocol control overhead 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. Our analytical model is validated by comparisons with simulations, both taken from literature and made specifically for this paper. For example, our model predicts linearity of control overhead with regard to mobility as observed in existing simulations results. We identify the model parameters for protocols like AODV, DSR and OLSR. Our model then allows accurate predictions of which protocol will yield the lowest overhead depending on the node mobility and traffic activity pattern.},
keywords = {Ad-Hoc, MANET, MESH},
pubstate = {published},
tppubtype = {article}
}