THE Routing Standard for Dynamic, Wireless, Ad hoc, MESH networks
The Optimized Link-State Routing Protocol (OLSR, and its successor OLSRv2) is the IETF standardized routing protocol for Mobile Ad hoc NETworks (MANET).
A link state protocol, OLSR (RFC3626) prototyped several innovative techniques and principles, including the concept of Multi-Point Relays (MPRs) for Flooding Reduction and Topology Reduction, an advanced neighborhood discovery mechanism for detecting and tracking link-bi-directionality in wireless environments and across multiple wireless interfaces. Some of these techniques were later revised, adapted for OSPF and included in the OSPF extension for MANETs (see OSPF for MANETs).
OLSRv2 (RFC7181) and its constituent parts (RFC5148, RFC5444, RFC5497, RFC6130 RFC7181, RFC7182, RFC7183, RFC7184, RFC7185, RFC7186, RFC7187, RFC7188) were built on the 10+ years of experience with OLSR, and offer:
- High scalability in dense networks by way of Flooding Reduction and Topology Reduction
- A modular plug-in security architecture
- Flexible, multi-metric routing
- Compressed (aggregated) addresses for significantly smaller control messages
- Built-in extensibility mechanisms, preserving forward and backwards compatibility
- Native and efficient IPv6 support
- Flexible and extensive gateway support, for attached networks as well as for global Internet connectivity.
As such, OLSRv2 is more than just a routing protocol – OLSRv2 is the platform for Dynamic, Wireless, Ad hoc, MESH network innovation and experimentation.
A Protocol of World-Firsts
OLSR and OLSRv2 have given rise to, numerous “world-firsts”, including:
- OLSR was the first IETF routing protocol to introduce topology reduction and flooding reduction – proving their viability and immense benefit, and being the impulse for introducing these concepts to OSPFv3 by way of OSPF4MANET.
- OLSRv2 was the first IETF routing protocol supporting multi-topology routing, before even OSPF, by way of “Multi-Topology Extension for the Optimized Link State Routing Protocol Version 2 (OLSRv2)” (RFC7722).
- OLSRv2 was the first IETF routing protocol specifying and experimenting the use of Identity-Based Signatures for authenticating routing messages (RFC7859).
MPRs: Flooding Reduction & Topology Reduction
MPR Flooding Reduction
OLSR being a link state protocol, the basic concept is that Link State Advertisements (LSAs – in OLSR & OLSRv2 called TC Messages) are flooded through the network, allowing each router to compute a topology map – on which a shortest path algorithm (such as Dijkstra’s algorithm) is run so as to calculate shortest paths to each destination in the network
The “Optimized” in “Optimized Link State Routing” stems, in no small part, from the protocol’s use of MultiPoint Relays, MPRs.
By way of the Neighborhood Discovery Protocol (NHDP – RFC6130), each router will, by way of a periodic and per-interface HELLO message exchange, have learned its local topology: bidirectional links to its immediate neighbors (1-hop neighbors), as well as bi-directional links from its 1-hop neighbors and to their neighbors (2-hop neighbors). For a given router, the 1-hop and 2-hop neighbors form the routers “neighborhood”.
Each router can then, autonomously and without any coordination, select a subset from among its 1-hop neighbors, which forms a dominating set over its neighborhood – that dominating set is the MPR set of that router.
Or, more colloquially, each router selects its MPR set from among its 1-hop neighbors such that a packet transmitted by it, and repeated by only the members of its MPR set, will be received by all 2-hop neighbors. This is signaled in next HELLO message exchange, allowing each router to know for which other routers it is, or is not, an MPR – to construct its “MPR Selector Set” (the set of routers, which have selected it as MPR).
This information is, then, used in two ways:
- MPR Based Flooding Reduction:
- When receiving a TC message, forward it if and only if it was received from a MPR Selector
- (And, of course, don’t forward a TC message more than once)
- MPR Based Topology Reduction:
- Only routers which have a non-empty MPR Selector Set generate TC messages.
- And, when generating a TC message, a router only includes links to destinations listed in the MPR Selector Set
The advantages of this use of MultiPoint Relays, MPRs, is thus fourfold:
- The cost of a flooding operation is considerably reduced: The number of retransmissions of a single flooded message, especially in a dense network, is considerably lower when using MPR based Flooding Reduction, than when using classic flooding. On the figure above, the top example depicts “classic flooding”, with the bottom example MPR flooding, and the blue nodes” the relays (and thus, retransmissions) involved in a flooding operation.
- The packet loss of a flooding operation is considerably reduced: On the figure above, the top example depicts classic flooding, with the bottom example depicting MPR flooding, and the “red nodes” depicting those nodes which receive more than a single copy of a transmission. In a wireless environment, given that all 1-hop neighbors receive the same transmission at the same time, they potentially do the same carrier sense operation and detect at the same time that the channel is idle – and transmit at the same time. Concurrent transmissions entail collisions, which entails packet loss. Thus, MPR flooding limiting the number of relays also limits the number of colissions.
- The number of flooding operations is considerably reduced: Only routers with non-empty MPR Selector Sets generate TC messages. As illustrated in the figure above, all the “blue routers” would generate and flood “I have a link to the router in the center” – with the top example being that of a classic link state routing protocol, and the bottom example that of OLSR and OLSRv2.
- The size of each flooded message is considerably reduced: Only the subset of destinations listed in a routers MPR Selector Set (i.e., only the destinations on routers that have selected it as MPR) are included in the flooded TC messages, rather than all destinations on all neighboring routers.
The resulting topology graph in each router is a partial graph, including all destinations (of course) and a subset of all links – a subset which contains the links on all shortest paths.
A World-Wide Community
In addition to being “a routing protocol for MANET”, OLSR and OLSRv2 is a world-wide community, actively contributing to the protocol specification development, to proposing, developing, and specifying protocol extensions, to implementing the protocol specifications on various platforms — and, of course, to deployments of OLSR & OLSRv2. The map below depicts known deployments of OLSR & OLSRv2.
Known OLSR and OLSRv2 Deployments, world-wide.
Among the experiments, uses, and deployments of OLSR and OLSRv2 are as diverse scenarios as tactical networking, emergency networking, and community networks.
BAE Systems Tactical Networking Experiments |
FunkFeuer.at Community Network Deployment |
Several open-source (and, of course, many many proprietary), independent, implementations of OLSR and OLSRv2 exist, a (very partial) list of public implementations includes:
International Interoperability Events
During the development of the core OLSR and OLSRv2 specifications, semi-regular interoperability tests & workshops have occurred, the most structured of which have been:
- 2004 – San Diego
- 2005 – Paris, France (Ecole Polytechnique)
- 2006 – Tokyo & Narita, Japan (KEIO University & Niigata University)
- 2008 – Ottawa, Canada (CRC)
- 2009 – Vienna (FunkFeuer.at)
The technical output of these events have been retained in the OLSR and OLSRv2 (& constituent parts) specifications.
A Flexible, Modular Platform for Experimentation
The OLSRv2 protocol architecture is built around a flexible, modular, platform, intended to facilitate easy development, implementation, and testing of (forward and backwards compatible) routing protocol extensions. This is obtained, in part, by way of OLSRv2 defining and exposing a comprehensive protocol information base, as well as comprehensive constraints enabling and scoping protocol extensions‘ use (consultation, updating) thereof. An other important component of the flexible, modular platform is the use of “The Generalized Mobile Ad hoc NETwork (MANET) Packet/Message Format” RFC5444.
This has given rise to, numerous extensions, experiments, and even world-firsts around OLSRv2:
- OLSRv2 was the first IETF routing protocol supporting multi-topology routing, before even OSPF, by way of “Multi-Topology Extension for the Optimized Link State Routing Protocol Version 2 (OLSRv2)” (RFC7722).
- OLSRv2 was the first IETF routing protocol specifying and experimenting the use of Identity-Based Signatures for authenticating routing messages (RFC7859).
Other extensions and experiments, enabled by OLSRv2, include:
Related Publications
Radu, Dan; Cretu, Adrian; Parrein, Benoit; Yi, Jiazi; Avram, Camelia; Astilean, Adina
Flying Ad Hoc Network for Emergency Applications Connected to a Fog System Proceedings Article
In: Barolli, Leonard; Xhafa, Fatos; Javaid, Nadeem; Spaho, Evjola; Kolici, Vladi (Ed.): pp. 675–686, Springer International Publishing, Cham, 2018, ISBN: 978-3-319-75928-9.
@inproceedings{10.1007/978-3-319-75928-9_60,
title = {Flying Ad Hoc Network for Emergency Applications Connected to a Fog System},
author = {Dan Radu and Adrian Cretu and Benoit Parrein and Jiazi Yi and Camelia Avram and Adina Astilean},
editor = {Leonard Barolli and Fatos Xhafa and Nadeem Javaid and Evjola Spaho and Vladi Kolici},
url = {https://www.researchgate.net/publication/323361307_Flying_Ad_Hoc_Network_for_Emergency_Applications_Connected_to_a_Fog_System},
doi = {10.1007/978-3-319-75928-9_60},
isbn = {978-3-319-75928-9},
year = {2018},
date = {2018-01-01},
pages = {675--686},
publisher = {Springer International Publishing},
address = {Cham},
abstract = {The main objective of this paper is to improve the efficiency of vegetation fire emergency interventions by using MP-OLSR routing protocol for data transmission in Flying Ad Hoc NETwork (FANET) applications. The presented conceptual system design could potentially increase the rescuing chances of people caught up in natural disaster environments, the final goal being to provide public safety services to interested parties. The proposed system architecture model relies on emerging technologies (Internet of Things & Fog, Smart Cities, Mobile Ad Hoc Networks) and actual concepts available in the scientific literature. The two main components of the system consist in a FANET, capable of collecting fire detection data from GPS and video enabled drones, and a Fog/Edge node that allows data collection and analysis, but also provides public safety services for interested parties. The sensing nodes forward data packets through multiple mobile hops until they reach the central management system. A proof of concept based on MP-OLSR routing protocol for efficient data transmission in FANET scenarios and possible public safety rescuing services is given.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The main objective of this paper is to improve the efficiency of vegetation fire emergency interventions by using MP-OLSR routing protocol for data transmission in Flying Ad Hoc NETwork (FANET) applications. The presented conceptual system design could potentially increase the rescuing chances of people caught up in natural disaster environments, the final goal being to provide public safety services to interested parties. The proposed system architecture model relies on emerging technologies (Internet of Things & Fog, Smart Cities, Mobile Ad Hoc Networks) and actual concepts available in the scientific literature. The two main components of the system consist in a FANET, capable of collecting fire detection data from GPS and video enabled drones, and a Fog/Edge node that allows data collection and analysis, but also provides public safety services for interested parties. The sensing nodes forward data packets through multiple mobile hops until they reach the central management system. A proof of concept based on MP-OLSR routing protocol for efficient data transmission in FANET scenarios and possible public safety rescuing services is given.
Clausen, Thomas; Herberg, Ulrich; Yi, Jiazi
RFC8116: Security Threats to the Optimized Link State Routing Protocol Version 2 (OLSRv2) Miscellaneous
RFC 8116, 2017.
@misc{rfc8116,
title = {RFC8116: Security Threats to the Optimized Link State Routing Protocol Version 2 (OLSRv2)},
author = {Thomas Clausen and Ulrich Herberg and Jiazi Yi},
url = {http://www.thomasclausen.net/wp-content/uploads/2017/05/rfc8116.pdf},
doi = {10.17487/rfc8116},
year = {2017},
date = {2017-01-01},
number = {8116},
publisher = {RFC Editor},
series = {Request for Comments},
abstract = {This document analyzes common security threats to the Optimized Link State Routing Protocol version 2 (OLSRv2) and describes their potential impacts on Mobile Ad Hoc Network (MANET) operations. It also analyzes which of these security vulnerabilities can be mitigated when using the mandatory-to-implement security mechanisms for OLSRv2 and how the vulnerabilities are mitigated.},
howpublished = {RFC 8116},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document analyzes common security threats to the Optimized Link State Routing Protocol version 2 (OLSRv2) and describes their potential impacts on Mobile Ad Hoc Network (MANET) operations. It also analyzes which of these security vulnerabilities can be mitigated when using the mandatory-to-implement security mechanisms for OLSRv2 and how the vulnerabilities are mitigated.
Yi, Jiazi; Parrein, Benoit
RFC8218: Multipath Extension for the Optimized Link State Routing Protocol Version 2 (OLSRv2) Miscellaneous
RFC 8218, 2017.
@misc{rfc8218,
title = {RFC8218: Multipath Extension for the Optimized Link State Routing Protocol Version 2 (OLSRv2)},
author = {Jiazi Yi and Benoit Parrein},
url = {https://rfc-editor.org/rfc/rfc8218.txt},
doi = {10.17487/RFC8218},
year = {2017},
date = {2017-01-01},
number = {8218},
publisher = {RFC Editor},
series = {Request for Comments},
abstract = {This document specifies a multipath extension for the Optimized Link State Routing Protocol version 2 (OLSRv2) to discover multiple disjoint paths for Mobile Ad Hoc Networks (MANETs). Considering the characteristics of MANETs, especially the dynamic network topology, using multiple paths can increase aggregated throughput and improve the reliability by avoiding single route failures. The interoperability with OLSRv2 is retained.},
howpublished = {RFC 8218},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document specifies a multipath extension for the Optimized Link State Routing Protocol version 2 (OLSRv2) to discover multiple disjoint paths for Mobile Ad Hoc Networks (MANETs). Considering the characteristics of MANETs, especially the dynamic network topology, using multiple paths can increase aggregated throughput and improve the reliability by avoiding single route failures. The interoperability with OLSRv2 is retained.
Herberg, Ulrich; Cole, Robert G.; Chakeres, Ian; Clausen, Thomas
RFC7939: Definition of Managed Objects for the Neighborhood Discovery Protocol Miscellaneous
IETF - Proposed Standard RFC 7939, 2016, ISSN: 2070-1721.
@misc{RFC7939,
title = {RFC7939: Definition of Managed Objects for the Neighborhood Discovery Protocol},
author = {Ulrich Herberg and Robert G. Cole and Ian Chakeres and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2016/09/RFC7939.pdf},
doi = {10.17487/rfc7939},
issn = {2070-1721},
year = {2016},
date = {2016-01-01},
number = {7939},
publisher = {RFC Editor},
series = {Request for Comments},
abstract = {This document replaces RFC 6779; it contains revisions and extensions to the original document. It defines a portion of the Management Information Base (MIB) for use with network management protocols in the Internet community. In particular, it describes objects for configuring parameters of the Neighborhood Discovery Protocol (NHDP) process on a router. The extensions described in this document add objects and values to support the NHDP optimization specified in RFC 7466. The MIB module defined in this document, denoted NHDP-MIB, also reports state, performance information, and notifications about NHDP. This additional state and performance information is useful to troubleshoot problems and performance issues during neighbor discovery.},
howpublished = {IETF - Proposed Standard RFC 7939},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document replaces RFC 6779; it contains revisions and extensions to the original document. It defines a portion of the Management Information Base (MIB) for use with network management protocols in the Internet community. In particular, it describes objects for configuring parameters of the Neighborhood Discovery Protocol (NHDP) process on a router. The extensions described in this document add objects and values to support the NHDP optimization specified in RFC 7466. The MIB module defined in this document, denoted NHDP-MIB, also reports state, performance information, and notifications about NHDP. This additional state and performance information is useful to troubleshoot problems and performance issues during neighbor discovery.
Dearlove, Christopher; Clausen, Thomas
RFC7722: Multi-Topology Extension for the Optimized Link State Routing Protocol Version 2 (OLSRv2) Miscellaneous
IETF - Experimental RFC 7722, 2015, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7722).
@misc{RFC7722,
title = {RFC7722: Multi-Topology Extension for the Optimized Link State Routing Protocol Version 2 (OLSRv2)},
author = {Christopher Dearlove and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc7722.txt.pdf},
doi = {10.17487/RFC7722},
issn = {2070-1721},
year = {2015},
date = {2015-12-31},
abstract = {This specification describes an extension to the Optimized Link State Routing Protocol version 2 (OLSRv2) to support multiple routing topologies, while retaining interoperability with OLSRv2 routers that do not implement this extension. This specification updates RFCs 7188 and 7631 by modifying and extending TLV registries and descriptions.},
howpublished = {IETF - Experimental RFC 7722},
note = {http://tools.ietf.org/html/rfc7722},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This specification describes an extension to the Optimized Link State Routing Protocol version 2 (OLSRv2) to support multiple routing topologies, while retaining interoperability with OLSRv2 routers that do not implement this extension. This specification updates RFCs 7188 and 7631 by modifying and extending TLV registries and descriptions.
Clausen, Thomas; Dearlove, Christopher
RFC7631 – TLV Naming in the Mobile Ad Hoc Network (MANET) Generalized Packet/Message Format Miscellaneous
IETF - Proposed Standard RFC 7631, 2015, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7631).
@misc{RFC7631,
title = {RFC7631 – TLV Naming in the Mobile Ad Hoc Network (MANET) Generalized Packet/Message Format},
author = {Thomas Clausen and Christopher Dearlove},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc7631.txt.pdf},
doi = {10.17487/RFC7631},
issn = {2070-1721},
year = {2015},
date = {2015-09-01},
abstract = {This document reorganizes the naming of already-allocated TLV (type-length-value) types and type extensions in the "Mobile Ad hoc NETwork (MANET) Parameters" registries defined by RFC 5444 to use names appropriately. It has no consequences in terms of any protocol implementation. This document also updates the Expert Review guidelines in RFC 5444, so as to establish a policy for consistent naming of future TLV type and type extension allocations. It makes no other changes to RFC 5444.},
howpublished = {IETF - Proposed Standard RFC 7631},
note = {http://tools.ietf.org/html/rfc7631},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document reorganizes the naming of already-allocated TLV (type-length-value) types and type extensions in the "Mobile Ad hoc NETwork (MANET) Parameters" registries defined by RFC 5444 to use names appropriately. It has no consequences in terms of any protocol implementation. This document also updates the Expert Review guidelines in RFC 5444, so as to establish a policy for consistent naming of future TLV type and type extension allocations. It makes no other changes to RFC 5444.
Dearlove, Christopher; Clausen, Thomas
RFC7466: An Optimization for the Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP) Miscellaneous
IETF - Proposed Standard RFC 7466, 2015, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7466).
@misc{RFC7466,
title = {RFC7466: An Optimization for the Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP)},
author = {Christopher Dearlove and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc7466.pdf},
doi = {10.17487/RFC7466},
issn = {2070-1721},
year = {2015},
date = {2015-03-01},
abstract = {The link quality mechanism of the Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP) enables "ignoring" some 1-hop neighbors if the measured link quality from that 1-hop neighbor is below an acceptable threshold while still retaining the corresponding link information as acquired from the HELLO message exchange. This allows immediate reinstatement of the 1-hop neighbor if the link quality later improves sufficiently. NHDP also collects information about symmetric 2-hop neighbors. However, it specifies that if a link from a symmetric 1-hop neighbor ceases being symmetric, including while "ignored" (as described above), then corresponding symmetric 2-hop neighbors are removed. This may lead to symmetric 2-hop neighborhood information being permanently removed (until further HELLO messages are received) if the link quality of a symmetric 1-hop neighbor drops below the acceptable threshold, even if only for a moment. This specification updates RFC 6130 "Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP)" and RFC 7181 "The Optimized Link State Routing Protocol Version 2 (OLSRv2)" to permit, as an option, retaining, but ignoring, symmetric 2-hop information when the link quality from the corresponding 1-hop neighbor drops below the acceptable threshold. This allows immediate reinstatement of the symmetric 2-hop neighbor if the link quality later improves sufficiently, thus making the symmetric 2-hop neighborhood more "robust".},
howpublished = {IETF - Proposed Standard RFC 7466},
note = {http://tools.ietf.org/html/rfc7466},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
The link quality mechanism of the Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP) enables "ignoring" some 1-hop neighbors if the measured link quality from that 1-hop neighbor is below an acceptable threshold while still retaining the corresponding link information as acquired from the HELLO message exchange. This allows immediate reinstatement of the 1-hop neighbor if the link quality later improves sufficiently. NHDP also collects information about symmetric 2-hop neighbors. However, it specifies that if a link from a symmetric 1-hop neighbor ceases being symmetric, including while "ignored" (as described above), then corresponding symmetric 2-hop neighbors are removed. This may lead to symmetric 2-hop neighborhood information being permanently removed (until further HELLO messages are received) if the link quality of a symmetric 1-hop neighbor drops below the acceptable threshold, even if only for a moment. This specification updates RFC 6130 "Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP)" and RFC 7181 "The Optimized Link State Routing Protocol Version 2 (OLSRv2)" to permit, as an option, retaining, but ignoring, symmetric 2-hop information when the link quality from the corresponding 1-hop neighbor drops below the acceptable threshold. This allows immediate reinstatement of the symmetric 2-hop neighbor if the link quality later improves sufficiently, thus making the symmetric 2-hop neighborhood more "robust".
Clausen, Thomas; Dearlove, Christopher; Jacquet, Philippe; Herberg, Ulrich
RFC7181: The Optimized Link State Routing Protocol Version 2 Miscellaneous
IETF - Proposed Standard RFC 7681, 2014, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7181).
@misc{RFC7181,
title = {RFC7181: The Optimized Link State Routing Protocol Version 2},
author = {Thomas Clausen and Christopher Dearlove and Philippe Jacquet and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc7181.pdf},
doi = {10.17487/RFC7181},
issn = {2070-1721},
year = {2014},
date = {2014-04-01},
abstract = {This specification describes version 2 of the Optimized Link State Routing Protocol (OLSRv2) for Mobile Ad Hoc Networks (MANETs).},
howpublished = {IETF - Proposed Standard RFC 7681},
note = {http://tools.ietf.org/html/rfc7181},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This specification describes version 2 of the Optimized Link State Routing Protocol (OLSRv2) for Mobile Ad Hoc Networks (MANETs).
Herberg, Ulrich; Clausen, Thomas; Dearlove, Christopher
RFC7182: Integrity Check Value and Timestamp TLV Definitions for Mobile Ad Hoc Networks (MANETs) Miscellaneous
IETF - Proposed Standard RFC 7182, 2014, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7182).
@misc{RFC7182,
title = {RFC7182: Integrity Check Value and Timestamp TLV Definitions for Mobile Ad Hoc Networks (MANETs)},
author = {Ulrich Herberg and Thomas Clausen and Christopher Dearlove},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc7182.pdf},
doi = {10.17487/RFC7182},
issn = {2070-1721},
year = {2014},
date = {2014-04-01},
abstract = {This document revises, extends, and replaces RFC 6622. It describes general and flexible TLVs for representing cryptographic Integrity Check Values (ICVs) and timestamps, using the generalized Mobile Ad Hoc Network (MANET) packet/message format defined in RFC 5444. It defines two Packet TLVs, two Message TLVs, and two Address Block TLVs for affixing ICVs and timestamps to a packet, a message, and one or more addresses, respectively.},
howpublished = {IETF - Proposed Standard RFC 7182},
note = {http://tools.ietf.org/html/rfc7182},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document revises, extends, and replaces RFC 6622. It describes general and flexible TLVs for representing cryptographic Integrity Check Values (ICVs) and timestamps, using the generalized Mobile Ad Hoc Network (MANET) packet/message format defined in RFC 5444. It defines two Packet TLVs, two Message TLVs, and two Address Block TLVs for affixing ICVs and timestamps to a packet, a message, and one or more addresses, respectively.
Herberg, Ulrich; Dearlove, Christopher; Clausen, Thomas
RFC7183: Integrity Protection for the Neighborhood Discovery Protocol (NHDP) and Optimized Link State Routing Protocol Version 2 (OLSRv2) Miscellaneous
IETF - Proposed Standard RFC 7183, 2014, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7183).
@misc{RFC7183,
title = {RFC7183: Integrity Protection for the Neighborhood Discovery Protocol (NHDP) and Optimized Link State Routing Protocol Version 2 (OLSRv2)},
author = {Ulrich Herberg and Christopher Dearlove and Thomas Clausen},
url = {https://epizeuxis.net/site/wp-content/uploads/2015/12/rfc7183.pdf},
doi = {10.17487/RFC7183},
issn = {2070-1721},
year = {2014},
date = {2014-04-01},
abstract = {This document specifies integrity and replay protection for the Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP) and the Optimized Link State Routing Protocol version 2 (OLSRv2). This protection is achieved by using an HMAC-SHA-256 Integrity Check Value (ICV) TLV and a Timestamp TLV based on Portable Operating System Interface (POSIX) time. The mechanism in this specification can also be used for other protocols that use the generalized packet/message format described in RFC 5444. This document updates RFC 6130 and RFC 7181 by mandating the implementation of this integrity and replay protection in NHDP and OLSRv2.},
howpublished = {IETF - Proposed Standard RFC 7183},
note = {http://tools.ietf.org/html/rfc7183},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document specifies integrity and replay protection for the Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP) and the Optimized Link State Routing Protocol version 2 (OLSRv2). This protection is achieved by using an HMAC-SHA-256 Integrity Check Value (ICV) TLV and a Timestamp TLV based on Portable Operating System Interface (POSIX) time. The mechanism in this specification can also be used for other protocols that use the generalized packet/message format described in RFC 5444. This document updates RFC 6130 and RFC 7181 by mandating the implementation of this integrity and replay protection in NHDP and OLSRv2.
Herberg, Ulrich; Cole, Robert G.; Clausen, Thomas
RFC7184: Definition of Managed Objects for the Optimized Link State Routing Protocol Version 2 Miscellaneous
IETF - Proposed Standard RFC 7184, 2014, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7184).
@misc{RFC7184,
title = {RFC7184: Definition of Managed Objects for the Optimized Link State Routing Protocol Version 2},
author = {Ulrich Herberg and Robert G. Cole and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc7184.pdf},
doi = {10.17487/RFC7184},
issn = {2070-1721},
year = {2014},
date = {2014-04-01},
abstract = {This document defines the Management Information Base (MIB) module for configuring and managing the Optimized Link State Routing Protocol version 2 (OLSRv2). The OLSRv2-MIB module is structured into configuration information, state information, performance information, and notifications. This additional state and performance information is useful for troubleshooting problems and performance issues of the routing protocol. Two levels of compliance allow this MIB module to be deployed on constrained routers.},
howpublished = {IETF - Proposed Standard RFC 7184},
note = {http://tools.ietf.org/html/rfc7184},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document defines the Management Information Base (MIB) module for configuring and managing the Optimized Link State Routing Protocol version 2 (OLSRv2). The OLSRv2-MIB module is structured into configuration information, state information, performance information, and notifications. This additional state and performance information is useful for troubleshooting problems and performance issues of the routing protocol. Two levels of compliance allow this MIB module to be deployed on constrained routers.
Dearlove, Christopher; Clausen, Thomas; Jacquet, Philippe
RFC7185: Rationale for the Use of Link Metrics in the Optimized Link State Routing Protocol Version 2 (OLSRv2) Miscellaneous
IETF - Informational RFC 7185, 2014, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7185).
@misc{RFC7185,
title = {RFC7185: Rationale for the Use of Link Metrics in the Optimized Link State Routing Protocol Version 2 (OLSRv2)},
author = {Christopher Dearlove and Thomas Clausen and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc7185.pdf},
doi = {10.17487/RFC7185},
issn = {2070-1721},
year = {2014},
date = {2014-04-01},
abstract = {The Optimized Link State Routing Protocol version 2 (OLSRv2) includes the ability to assign metrics to links and to use those metrics to allow routing by other than minimum hop count routes. This document provides a historic record of the rationale for, and design considerations behind, how link metrics were included in OLSRv2.},
howpublished = {IETF - Informational RFC 7185},
note = {http://tools.ietf.org/html/rfc7185},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
The Optimized Link State Routing Protocol version 2 (OLSRv2) includes the ability to assign metrics to links and to use those metrics to allow routing by other than minimum hop count routes. This document provides a historic record of the rationale for, and design considerations behind, how link metrics were included in OLSRv2.
Yi, Jiazi; Herberg, Ulrich; Clausen, Thomas
RFC7186: Security Threats for the Neighborhood Discovery Protocol (NHDP) Miscellaneous
IETF - Informational RFC 7186, 2014, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7186).
@misc{RFC7186,
title = {RFC7186: Security Threats for the Neighborhood Discovery Protocol (NHDP)},
author = {Jiazi Yi and Ulrich Herberg and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc7186.pdf},
doi = {10.17487/RFC7186},
issn = {2070-1721},
year = {2014},
date = {2014-04-01},
abstract = {This document analyzes common security threats of the Neighborhood Discovery Protocol (NHDP) and describes their potential impacts on Mobile Ad Hoc Network (MANET) routing protocols using NHDP. This document is not intended to propose solutions to the threats described.},
howpublished = {IETF - Informational RFC 7186},
note = {http://tools.ietf.org/html/rfc7186},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document analyzes common security threats of the Neighborhood Discovery Protocol (NHDP) and describes their potential impacts on Mobile Ad Hoc Network (MANET) routing protocols using NHDP. This document is not intended to propose solutions to the threats described.
Dearlove, Christopher; Clausen, Thomas
RFC7187: Routing Multipoint Relay Optimization for the Optimized Link State Routing Protocol Version 2 (OLSRv2) Miscellaneous
IETF - Proposed Standard RFC 7187, 2014, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7187).
@misc{RFC7187,
title = {RFC7187: Routing Multipoint Relay Optimization for the Optimized Link State Routing Protocol Version 2 (OLSRv2)},
author = {Christopher Dearlove and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc7187.pdf},
doi = {10.17487/RFC7187},
issn = {2070-1721},
year = {2014},
date = {2014-04-01},
abstract = {This specification updates the Optimized Link State Routing Protocol version 2 (OLSRv2) with an optimization to improve the selection of routing multipoint relays. The optimization retains full interoperability between implementations of OLSRv2 with and without this optimization.},
howpublished = {IETF - Proposed Standard RFC 7187},
note = {http://tools.ietf.org/html/rfc7187},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This specification updates the Optimized Link State Routing Protocol version 2 (OLSRv2) with an optimization to improve the selection of routing multipoint relays. The optimization retains full interoperability between implementations of OLSRv2 with and without this optimization.
Dearlove, Christopher; Clausen, Thomas
RFC7188: Optimized Link State Routing Protocol Version 2 (OLSRv2) and MANET Neighborhood Discovery Protocol (NHDP) Extension TLVs Miscellaneous
IETF - Proposed Standard RFC 7188, 2014, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7188).
@misc{Clausen2014b,
title = {RFC7188: Optimized Link State Routing Protocol Version 2 (OLSRv2) and MANET Neighborhood Discovery Protocol (NHDP) Extension TLVs},
author = {Christopher Dearlove and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc7188.pdf},
doi = {10.17487/RFC7188},
issn = {2070-1721},
year = {2014},
date = {2014-04-01},
abstract = {This specification describes extensions to definitions of TLVs used by the Optimized Link State Routing Protocol version 2 (OLSRv2) and the MANET Neighborhood Discovery Protocol (NHDP) to increase their abilities to accommodate protocol extensions. This document updates RFC 7181 (OLSRv2) and RFC 6130 (NHDP).},
howpublished = {IETF - Proposed Standard RFC 7188},
note = {http://tools.ietf.org/html/rfc7188},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This specification describes extensions to definitions of TLVs used by the Optimized Link State Routing Protocol version 2 (OLSRv2) and the MANET Neighborhood Discovery Protocol (NHDP) to increase their abilities to accommodate protocol extensions. This document updates RFC 7181 (OLSRv2) and RFC 6130 (NHDP).
Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas; Baccelli, Emmanuel
Enabling Multihop Communication in Spontaneous Wireless Networks Book Chapter
In: Haddadi, Hamed; Bonaventure, Olivier (Ed.): Recent Advances in Networking, Chapter 9, pp. 413-457, ACM SIGCOMM, 2013.
@inbook{Cordero2013,
title = {Enabling Multihop Communication in Spontaneous Wireless Networks},
author = {Juan Antonio Cordero and Jiazi Yi and Thomas Clausen and Emmanuel Baccelli},
editor = {Hamed Haddadi and Olivier Bonaventure},
url = {http://sigcomm.org/education/ebook/SIGCOMMeBook2013v1_chapter9.pdf},
year = {2013},
date = {2013-08-01},
booktitle = {Recent Advances in Networking},
pages = {413-457},
publisher = {ACM SIGCOMM},
chapter = {9},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Clausen, Thomas; Herberg, Ulrich
RFC6622: Integrity Check Value and Timestamp TLV Definitions for Mobile Ad Hoc Networks (MANETs) Miscellaneous
2012, (http://tools.ietf.org/html/rfc6622).
@misc{Clausen2012b,
title = {RFC6622: Integrity Check Value and Timestamp TLV Definitions for Mobile Ad Hoc Networks (MANETs)},
author = {Thomas Clausen and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc6622.txt.pdf},
doi = {10.17487/RFC6622},
year = {2012},
date = {2012-05-01},
publisher = {IETF - Std. Track RFC 6622},
organization = {The Internet Engineering Task Force},
abstract = {This document describes general and flexible TLVs for representing cryptographic Integrity Check Values (ICVs) (i.e., digital signatures or Message Authentication Codes (MACs)) as well as timestamps, using the generalized Mobile Ad Hoc Network (MANET) packet/message format defined in RFC 5444. It defines two Packet TLVs, two Message TLVs, and two Address Block TLVs for affixing ICVs and timestamps to a packet, a message, and an address, respectively.},
note = {http://tools.ietf.org/html/rfc6622},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document describes general and flexible TLVs for representing cryptographic Integrity Check Values (ICVs) (i.e., digital signatures or Message Authentication Codes (MACs)) as well as timestamps, using the generalized Mobile Ad Hoc Network (MANET) packet/message format defined in RFC 5444. It defines two Packet TLVs, two Message TLVs, and two Address Block TLVs for affixing ICVs and timestamps to a packet, a message, and an address, respectively.
Cordero, Juan Antonio; Jacquet, Philippe; Baccelli, Emmanuel
Impact of Jitter-based Techniques on Flooding over Wireless Ad hoc Networks: Model and Analysis Proceedings Article
In: pp. 2059-2067, IEEE Proceedings of the 31st Annual IEEE International Conference on Computer Communications (INFOCOM 2012)., Orlando, FI, United States., 2012, ISSN: 0743-166X.
@inproceedings{Cordero2012,
title = {Impact of Jitter-based Techniques on Flooding over Wireless Ad hoc Networks: Model and Analysis},
author = {Juan Antonio Cordero and Philippe Jacquet and Emmanuel Baccelli},
url = {https://www.researchgate.net/publication/236883781_Impact_of_Jitter-based_Techniques_on_Flooding_over_Wireless_Ad_hoc_Networks_Model_and_Analysis},
doi = {10.1109/INFCOM.2012.6195587},
issn = {0743-166X},
year = {2012},
date = {2012-03-25},
pages = {2059-2067},
publisher = {Proceedings of the 31st Annual IEEE International Conference on Computer Communications (INFOCOM 2012).},
address = {Orlando, FI, United States.},
organization = {IEEE},
abstract = {Jitter is used in wireless ad hoc networks to reduce the number of packet collisions and the number of transmissions. This is done by scheduling random back-off for each packet to be transmitted and by piggybacking multiple packets in a single transmission. This technique has been standardized by the IETF in RFC 5148. This paper investigates on the impact of the standardized jitter mechanism on network-wide packet dissemination – i.e. flooding, an important component for many protocols used today. A novel analytical model is introduced, capturing standard jitter traits. From this model is derived accurate characterization of the effects of jittering on flooding performance, including the additional delay for flooded packets on each traversed network interface, the reduction of the number of transmissions over each network interface, and the increased length of transmissions, depending on jitter parameters. This paper also presents an analysis of the use of jitter in practice, over an 802.11 wireless link layer based on CSMA. The analytical results are then validated via statistical discrete event simulations. The paper thus provides a comprehensive overview of the impact of jittering in wireless ad hoc networks.
},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Jitter is used in wireless ad hoc networks to reduce the number of packet collisions and the number of transmissions. This is done by scheduling random back-off for each packet to be transmitted and by piggybacking multiple packets in a single transmission. This technique has been standardized by the IETF in RFC 5148. This paper investigates on the impact of the standardized jitter mechanism on network-wide packet dissemination – i.e. flooding, an important component for many protocols used today. A novel analytical model is introduced, capturing standard jitter traits. From this model is derived accurate characterization of the effects of jittering on flooding performance, including the additional delay for flooded packets on each traversed network interface, the reduction of the number of transmissions over each network interface, and the increased length of transmissions, depending on jitter parameters. This paper also presents an analysis of the use of jitter in practice, over an 802.11 wireless link layer based on CSMA. The analytical results are then validated via statistical discrete event simulations. The paper thus provides a comprehensive overview of the impact of jittering in wireless ad hoc networks.
Herberg, Ulrich; Clausen, Thomas
Delay Tolerant Routing with OLSRv2 Proceedings Article
In: Proceedings of the The 9th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC), 2011.
@inproceedings{Herberg2011,
title = {Delay Tolerant Routing with OLSRv2},
author = {Ulrich Herberg and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-EUC-Delay-Tolerant-Networking-with-OLSRv2.pdf},
doi = {10.1109/EUC.2011.27},
year = {2011},
date = {2011-10-01},
publisher = {Proceedings of the The 9th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)},
abstract = {This paper proposes a simple mechanism for en-abling basic delay tolerant networking with off-the-shelf MANET routing protocols – with the objective being to enable trading off slightly longer data delivery delays against resilience to a temporary lack of connectivity between a router and the ultimate destination of an IP datagram. As part of testing the benefit of said mechanism, an extreme network mobility model is proposed, entitled the “PopUp model”: a router appears in the network, and operates normally – then may disable and disappear from the network to appear later elsewhere. Observed to cause severely degraded performance for MANET routing protocols, this model is used for testing the proposed mechanism in OLSRv2-routed MANETs. The proposed mechanism shows to vastly increase the data delivery ration, with reasonably low increases in delays and control traffic overhead incurred.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper proposes a simple mechanism for en-abling basic delay tolerant networking with off-the-shelf MANET routing protocols – with the objective being to enable trading off slightly longer data delivery delays against resilience to a temporary lack of connectivity between a router and the ultimate destination of an IP datagram. As part of testing the benefit of said mechanism, an extreme network mobility model is proposed, entitled the “PopUp model”: a router appears in the network, and operates normally – then may disable and disappear from the network to appear later elsewhere. Observed to cause severely degraded performance for MANET routing protocols, this model is used for testing the proposed mechanism in OLSRv2-routed MANETs. The proposed mechanism shows to vastly increase the data delivery ration, with reasonably low increases in delays and control traffic overhead incurred.
Clausen, Thomas; Dearlove, Christopher; Dean, Justin
RFC6130: Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP) Miscellaneous
2011, (http://tools.ietf.org/html/rfc6130).
@misc{Clausen2011bb,
title = {RFC6130: Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP)},
author = {Thomas Clausen and Christopher Dearlove and Justin Dean},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc6130.txt.pdf},
doi = {10.17487/RFC6130},
year = {2011},
date = {2011-03-01},
publisher = {IETF - Std. Track RFC 6130},
organization = {The Internet Engineering Task Force},
abstract = {This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).},
note = {http://tools.ietf.org/html/rfc6130},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Herberg, Ulrich; Clausen, Thomas; Cole, Robert G.
MANET Network Management and Performance Monitoring for NHDP and OLSRv2 Proceedings Article
In: Proceedings of the 6th International Conference on Network and Services Management, 2010.
@inproceedings{Herberg2010,
title = {MANET Network Management and Performance Monitoring for NHDP and OLSRv2},
author = {Ulrich Herberg and Thomas Clausen and Robert G. Cole},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-CNSM-MANET-Network-Management-and-Performance-Monitoring-for-NHDP-and-OLSRv2.pdf},
doi = {10.1109/CNSM.2010.5691209},
year = {2010},
date = {2010-10-01},
publisher = {Proceedings of the 6th International Conference on Network and Services Management},
abstract = {Mobile Ad Hoc NETworks (MANETs) are gener-ally thought of as infrastructureless and largely “un-managed” network deployments, capable of accommodating highly dynamic network topologies. Yet, while the network infrastructure may be “un-managed”, monitoring the network performance and setting configuration parameters once deployed, remains important in order to ensure proper “tuning” and maintenance of a MANET. This paper describes a management framework for the MANET routing protocol OLSRv2, and its constituent protocol NHDP. It does so by presenting considerations for “what to monitor and manage” in an OLSRv2 network, and how. The approach developed is based on the Simple Network Management Protocol (SNMP), and thus this paper details the various Management Information Bases (MIBs) for router status monitoring and control – as well as a novel approach to history-based perfor-mance monitoring. While SNMP may not be optimally designed for MANETs, it is chosen due to it being the predominant protocol for IP network management – and thus, efforts are made in this paper to “adapt” the management tools within the SNMP framework for reasonable behavior also in a MANET environment.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Mobile Ad Hoc NETworks (MANETs) are gener-ally thought of as infrastructureless and largely “un-managed” network deployments, capable of accommodating highly dynamic network topologies. Yet, while the network infrastructure may be “un-managed”, monitoring the network performance and setting configuration parameters once deployed, remains important in order to ensure proper “tuning” and maintenance of a MANET. This paper describes a management framework for the MANET routing protocol OLSRv2, and its constituent protocol NHDP. It does so by presenting considerations for “what to monitor and manage” in an OLSRv2 network, and how. The approach developed is based on the Simple Network Management Protocol (SNMP), and thus this paper details the various Management Information Bases (MIBs) for router status monitoring and control – as well as a novel approach to history-based perfor-mance monitoring. While SNMP may not be optimally designed for MANETs, it is chosen due to it being the predominant protocol for IP network management – and thus, efforts are made in this paper to “adapt” the management tools within the SNMP framework for reasonable behavior also in a MANET environment.
Clausen, Thomas; Herberg, Ulrich
Router and Link Admittance Control in the Optimized Link State Routing Protocol version 2 (OLSRv2) Proceedings Article
In: Proceedings of the 4th International Conference on Network and System Security (NSS 2010), 2010, ISBN: 978-1-4244-8484-3.
@inproceedings{Clausen2010i,
title = {Router and Link Admittance Control in the Optimized Link State Routing Protocol version 2 (OLSRv2)},
author = {Thomas Clausen and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-NSS-Router-and-Link-Admittance-Control-in-the-Optimized-Link-State-Routing-Protocol-version-2-OLSRv2.pdf},
doi = {10.1109/NSS.2010.20},
isbn = {978-1-4244-8484-3},
year = {2010},
date = {2010-09-01},
publisher = {Proceedings of the 4th International Conference on Network and System Security (NSS 2010)},
abstract = {This paper presents security mechanisms for router and link admittance control in OLSRv2. Digitally signing OLSRv2 control messages allows recipient routers to – individually – choose to admit or exclude the originating router for when populating link-state databases, calculating MPR sets etc. By additionally embedding signatures for each advertised link, recipient routers can also control admittance of each advertised link in the message, rendering an OLSRv2 network resilient to both identity-spoofing and link-spoofing attacks. The flip-side of the coin when using such a link-admittance mechanism is, that the number of signatures to include in each OLSRv2 control message is a function of the number of links advertised. For HELLO messages, this is essentially the number of neighbor routers, for TC messages, this is the number of MPR Selectors of the originator of the message. Also, upon receipt of a control message, these signatures are to be verified. This paper studies the impact of adding a link-admittance control mechanism to OLSRv2, both in terms of additional control-traffic overhead and additional in-router processing resources, using several cryptographic algorithms, such as RSA and Elliptic Curve Cryptography for very short signatures. Index Terms—OLSRv2, MANET, security, router, link admit-tance control, digital signatures},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper presents security mechanisms for router and link admittance control in OLSRv2. Digitally signing OLSRv2 control messages allows recipient routers to – individually – choose to admit or exclude the originating router for when populating link-state databases, calculating MPR sets etc. By additionally embedding signatures for each advertised link, recipient routers can also control admittance of each advertised link in the message, rendering an OLSRv2 network resilient to both identity-spoofing and link-spoofing attacks. The flip-side of the coin when using such a link-admittance mechanism is, that the number of signatures to include in each OLSRv2 control message is a function of the number of links advertised. For HELLO messages, this is essentially the number of neighbor routers, for TC messages, this is the number of MPR Selectors of the originator of the message. Also, upon receipt of a control message, these signatures are to be verified. This paper studies the impact of adding a link-admittance control mechanism to OLSRv2, both in terms of additional control-traffic overhead and additional in-router processing resources, using several cryptographic algorithms, such as RSA and Elliptic Curve Cryptography for very short signatures. Index Terms—OLSRv2, MANET, security, router, link admit-tance control, digital signatures
Herberg, Ulrich; Clausen, Thomas; Milan, Jerome
Digital Signatures for Admittance Control in the Optimized Link State Routing Protocol version 2 Proceedings Article
In: Proceedings of the International Conference on Internet Technology and Applications (iTAP 2010), 2010, ISBN: 978-1-4244-5142-5.
@inproceedings{Clausen2010j,
title = {Digital Signatures for Admittance Control in the Optimized Link State Routing Protocol version 2},
author = {Ulrich Herberg and Thomas Clausen and Jerome Milan},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-ITAP-Digital-Signatures-for-Admittance-Control-in-OLSRv2.pdf},
doi = {10.1109/ITAPP.2010.5566285},
isbn = {978-1-4244-5142-5},
year = {2010},
date = {2010-08-01},
publisher = {Proceedings of the International Conference on Internet Technology and Applications (iTAP 2010)},
abstract = {Public community Mobile Ad Hoc NETworks (MANETs), such as the “Funkfeuer” or “Freifunk” networks, scale up to several hundreds of routers, connecting users with each other, and with the Internet. As MANETs are typically operated over wireless channels (e.g. WiFi), access to these networks is granted to anyone in the radio range of another router in the MANET, and running the same MANET routing protocol. In order to protect the stability of the networks from malicious intruders, it is important to ensure that only trusted peers are admitted to participate in the control message exchange, and to provide means for logically “disconnecting” a non-trustworthy peer. This paper presents the concept of admittance control for the Optimized Link State Routing Protocol version 2 (OLSRv2), and suggests a security extension based on digital signatures. Due to the flexible message format of OLSRv2, this extension keeps compatibility with the core OLSRv2 specification. Several standard digital signature algorithms (RSA, DSA, ECDSA), as well as HMAC, are compared in terms of message overhead and CPU time for generating and processing signatures.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Public community Mobile Ad Hoc NETworks (MANETs), such as the “Funkfeuer” or “Freifunk” networks, scale up to several hundreds of routers, connecting users with each other, and with the Internet. As MANETs are typically operated over wireless channels (e.g. WiFi), access to these networks is granted to anyone in the radio range of another router in the MANET, and running the same MANET routing protocol. In order to protect the stability of the networks from malicious intruders, it is important to ensure that only trusted peers are admitted to participate in the control message exchange, and to provide means for logically “disconnecting” a non-trustworthy peer. This paper presents the concept of admittance control for the Optimized Link State Routing Protocol version 2 (OLSRv2), and suggests a security extension based on digital signatures. Due to the flexible message format of OLSRv2, this extension keeps compatibility with the core OLSRv2 specification. Several standard digital signature algorithms (RSA, DSA, ECDSA), as well as HMAC, are compared in terms of message overhead and CPU time for generating and processing signatures.
Clausen, Thomas; Herberg, Ulrich
Vulnerability Analysis of the Optimized Link State Routing Protocol version 2 (OLSRv2) Proceedings Article
In: Proceedings of the IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS2010), 2010, ISBN: 978-1-4244-5850-9.
@inproceedings{Clausen2010k,
title = {Vulnerability Analysis of the Optimized Link State Routing Protocol version 2 (OLSRv2)},
author = {Thomas Clausen and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-WCNIS-Vulnerability-Analysis-of-the-Optimized-Link-State-Routing-Protocol-version-2-OLSRv2.pdf},
doi = {10.1109/WCINS.2010.5544732},
isbn = {978-1-4244-5850-9},
year = {2010},
date = {2010-06-01},
publisher = {Proceedings of the IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS2010)},
abstract = {Mobile Ad hoc NETworks (MANETs) are leaving the confines of research laboratories, to find place in real-world deploy-ments. 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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Mobile Ad hoc NETworks (MANETs) are leaving the confines of research laboratories, to find place in real-world deploy-ments. 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.
Herberg, Ulrich; Clausen, Thomas
Security Issues in the Optimized Link State Routing Protocol Version 2 (OLSRV2) Journal Article
In: International Journal of Network Security & Its Applications (IJNSA), 2010.
@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 = {},
pubstate = {published},
tppubtype = {article}
}
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.
Clausen, Thomas; Dearlove, Christopher
RFC5497: Representing Multi-Value Time in MANETs Miscellaneous
2009, (http://www.rfc-editor.org/rfc/rfc5497.txt).
@misc{Clausen2009,
title = {RFC5497: Representing Multi-Value Time in MANETs},
author = {Thomas Clausen and Christopher Dearlove},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc5497.txt.pdf},
doi = {10.17487/RFC5497},
year = {2009},
date = {2009-03-01},
publisher = {IETF - Std. Track RFC},
organization = {The Internet Engineering Task Force},
abstract = {This document describes a general and flexible TLV (type-length-value structure) for representing time-values, such as an interval or a duration, using the generalized Mobile Ad hoc NETwork (MANET) packet/ message format. It defines two Message TLVs and two Address Block TLVs for representing validity and interval times for MANET routing protocols.},
note = {http://www.rfc-editor.org/rfc/rfc5497.txt},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document describes a general and flexible TLV (type-length-value structure) for representing time-values, such as an interval or a duration, using the generalized Mobile Ad hoc NETwork (MANET) packet/ message format. It defines two Message TLVs and two Address Block TLVs for representing validity and interval times for MANET routing protocols.
Clausen, Thomas; Dearlove, Christopher; Dean, Justin; Adjih, Cedric
RFC5444 - Generalized Mobile Ad Hoc Network (MANET) Packet/Message Format Miscellaneous
2009, (http://www.ietf.org/rfc/rfc5444.txt).
@misc{Clausen2009b,
title = {RFC5444 - Generalized Mobile Ad Hoc Network (MANET) Packet/Message Format},
author = {Thomas Clausen and Christopher Dearlove and Justin Dean and Cedric Adjih},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc5444.txt.pdf},
doi = {10.17487/RFC5444},
year = {2009},
date = {2009-02-01},
publisher = {IETF - Std. Track RFC},
organization = {The Internet Engineering Task Force},
abstract = {This document specifies a packet format capable of carrying multiple messages that may be used by mobile ad hoc network routing protocols.},
note = {http://www.ietf.org/rfc/rfc5444.txt},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document specifies a packet format capable of carrying multiple messages that may be used by mobile ad hoc network routing protocols.
Clausen, Thomas; Dearlove, Christopher; Adamson, Brian
RFC5148: Jitter Considerations in Mobile Ad Hoc Networks (MANETs) Miscellaneous
2008, (http://tools.ietf.org/html/rfc5148).
@misc{Clausen2008,
title = {RFC5148: Jitter Considerations in Mobile Ad Hoc Networks (MANETs)},
author = {Thomas Clausen and Christopher Dearlove and Brian Adamson},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc5148.txt.pdf},
doi = {10.17487/RFC5148},
year = {2008},
date = {2008-02-01},
publisher = {RFC},
organization = {The Internet Engineering Task Force},
abstract = {This document provides recommendations for jittering (randomly modifying timing) of control traffic transmissions in Mobile Ad hoc NETwork (MANET) routing protocols to reduce the probability of transmission collisions,},
note = {http://tools.ietf.org/html/rfc5148},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document provides recommendations for jittering (randomly modifying timing) of control traffic transmissions in Mobile Ad hoc NETwork (MANET) routing protocols to reduce the probability of transmission collisions,
Baccelli, Emmanuel; Clausen, Thomas; Garnier, Julien
Duplicate Address Detection in OLSR Networks Proceedings Article
In: IEEE Conference on Wireless Personal Multimedia Communications (WPMC), Aalborg, Denmark, Sept. 2005, 2005.
@inproceedings{Clausen2005,
title = {Duplicate Address Detection in OLSR Networks},
author = {Emmanuel Baccelli and Thomas Clausen and Julien Garnier},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2005-WPMC-Duplicate-Address-Detection-in-OLSR-Networks.pdf},
year = {2005},
date = {2005-09-01},
publisher = {IEEE Conference on Wireless Personal Multimedia Communications (WPMC), Aalborg, Denmark, Sept. 2005},
abstract = {Commonly, duplicate address detection is performed when configuring network interfaces in order to ensure that unique addresses are assigned to each interface in the network. Such mechanisms commonly operate with the premises that a node ”intelligently” selects an address which it supposes to be unique, followed by a duplicate ad- dress detection cycle, through which it verifies that no other active interfaces on the same network has been or is in the process of being configured with the same address. Even as- suming that such a mechanism is present in a MANET, al- lowing MANET nodes to initially configure their interfaces with addresses unique within the network, additional com- plications arise: two or more MANETs may merge to form a single network, and a formerly connected MANET may partition. Thus, unless it is ensured that all MANET in- terfaces are assigned globally unique addresses, addressing conflicts may at any point – not just during initial network configuration. In this paper, we investigate the task of performing dupli- cate address detection when otherwise independent OLSR networks merge. We benefit from the information already exchanged by OLSR, and identify a number of mechanisms through which a node may detect a conflict between the ad- dress assigned to one of its interfaces, and an address as- signed to an interface on another node. The mechanisms proposed are, thus, entirely passive, creating no additional information exchange on the network.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Commonly, duplicate address detection is performed when configuring network interfaces in order to ensure that unique addresses are assigned to each interface in the network. Such mechanisms commonly operate with the premises that a node ”intelligently” selects an address which it supposes to be unique, followed by a duplicate ad- dress detection cycle, through which it verifies that no other active interfaces on the same network has been or is in the process of being configured with the same address. Even as- suming that such a mechanism is present in a MANET, al- lowing MANET nodes to initially configure their interfaces with addresses unique within the network, additional com- plications arise: two or more MANETs may merge to form a single network, and a formerly connected MANET may partition. Thus, unless it is ensured that all MANET in- terfaces are assigned globally unique addresses, addressing conflicts may at any point – not just during initial network configuration. In this paper, we investigate the task of performing dupli- cate address detection when otherwise independent OLSR networks merge. We benefit from the information already exchanged by OLSR, and identify a number of mechanisms through which a node may detect a conflict between the ad- dress assigned to one of its interfaces, and an address as- signed to an interface on another node. The mechanisms proposed are, thus, entirely passive, creating no additional information exchange on the network.
Baccelli, Emmanuel; Clausen, Thomas
A Simple Address Autoconfiguration Mechanism for OLSR Proceedings Article
In: IEEE International Symposium on Circuits and Systems (ISCAS), Kobe, Japan, May 2005, 2005.
@inproceedings{Clausen2005b,
title = {A Simple Address Autoconfiguration Mechanism for OLSR},
author = {Emmanuel Baccelli and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2005-ISCAS-A-Simple-Address-Autoconfiguration-Mechanism-for-OLSR.pdf},
doi = {10.1109/ISCAS.2005.1465251},
year = {2005},
date = {2005-05-01},
publisher = {IEEE International Symposium on Circuits and Systems (ISCAS), Kobe, Japan, May 2005},
abstract = {In this paper, we develop a simple autoconfiguration mechanism for OLSR networks. The mechanism aims at solving the simple, but common, probem of one or more new nodes emerging in an ex- isting network. We propose a simple solution, which allows these new nodes to acquire an address and participate in the network. Our method is simple, both algorithmically and in the require- ments to the network. While we recognize that this is a partial so- lution to the general autoconfiguration problem, we argue that the mechanism described in this paper will satisfy the requirements from a great number of real-world situations.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we develop a simple autoconfiguration mechanism for OLSR networks. The mechanism aims at solving the simple, but common, probem of one or more new nodes emerging in an ex- isting network. We propose a simple solution, which allows these new nodes to acquire an address and participate in the network. Our method is simple, both algorithmically and in the require- ments to the network. While we recognize that this is a partial so- lution to the general autoconfiguration problem, we argue that the mechanism described in this paper will satisfy the requirements from a great number of real-world situations.
Baccelli, Emmanuel; Clausen, Thomas; Wakikawa, Ryuji
Route Optimization in Nested Mobile Networks (NEMO) using OLSR Proceedings Article
In: International Conference on Networks and Communication Systems (NCS), Krabi, Thailand, April 2005, 2005.
@inproceedings{Clausen2005c,
title = {Route Optimization in Nested Mobile Networks (NEMO) using OLSR},
author = {Emmanuel Baccelli and Thomas Clausen and Ryuji Wakikawa},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2005-NCS-Route-Optimization-in-Nested-Mobile-Networks-NEMO-using-OLSR.pdf},
year = {2005},
date = {2005-04-01},
publisher = {International Conference on Networks and Communication Systems (NCS), Krabi, Thailand, April 2005},
abstract = {Internet edge mobility has been possible for a number of years: mobile IP[8], allows a host to change its point of at- tachment to the Internet and NEMO [6] allows the same functionality for a group of hosts along with a mobile router. The virtue of NEMO and mobile IP is transparency: a host remains identifiable through the same IP address, and traffic sent to that IP address will be tunneled to arrive at the intended node. NEMO allows “nested networks”: a mobile network which attaches to another mobile network to arbitrary depth. However for each level of nesting, traffic is encap- sulated and tunneled to reach the destination. This leads to increased overhead (encapsulation) and to sub-optimal paths (tunneling without consideration for the actual net- work topology). In this paper, we investigate route-optimization in nested NEMO networks. We employ an ad-hoc routing protocol between mobile routers to ensure shortest routes when both source and destination for traffic is within the nested NEMO network. The mechanism also simplifies the requirements for route optimization when the source node is located outside of the nested NEMO network.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Internet edge mobility has been possible for a number of years: mobile IP[8], allows a host to change its point of at- tachment to the Internet and NEMO [6] allows the same functionality for a group of hosts along with a mobile router. The virtue of NEMO and mobile IP is transparency: a host remains identifiable through the same IP address, and traffic sent to that IP address will be tunneled to arrive at the intended node. NEMO allows “nested networks”: a mobile network which attaches to another mobile network to arbitrary depth. However for each level of nesting, traffic is encap- sulated and tunneled to reach the destination. This leads to increased overhead (encapsulation) and to sub-optimal paths (tunneling without consideration for the actual net- work topology). In this paper, we investigate route-optimization in nested NEMO networks. We employ an ad-hoc routing protocol between mobile routers to ensure shortest routes when both source and destination for traffic is within the nested NEMO network. The mechanism also simplifies the requirements for route optimization when the source node is located outside of the nested NEMO network.
Clausen, Thomas; Baccelli, Emmanuel; Rodolakis, Georgios; Adjih, Cedric; Jacquet, Philippe
Fish-Eye OLSR Scaling Properties Journal Article
In: IEEE Journal on Communications Networks (JCN), Special Issue on Ad Hoc Networking, Dec 2004, 2004.
@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 = {},
pubstate = {published},
tppubtype = {article}
}
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.
Clausen, Thomas; Jacquet, Philippe; Viennot, Laurent
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.
@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 = {},
pubstate = {published},
tppubtype = {article}
}
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.
Raffo, Daniele; Adjih, Cédric; Clausen, Thomas; Mühlethaler, Paul
An advanced signature system for OLSR Proceedings Article
In: workshop on security of ad hoc and sensor networks, pp. 10–16, 2004.
@inproceedings{Clausen2004d,
title = {An advanced signature system for OLSR},
author = {Daniele Raffo and Cédric Adjih and Thomas Clausen and Paul Mühlethaler},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2003-SASN-An-advanced-signature-system-for-OLSR..pdf},
doi = {10.1145/1029102.1029106},
year = {2004},
date = {2004-01-01},
booktitle = {workshop on security of ad hoc and sensor networks},
pages = {10--16},
abstract = {In this paper we investigate security issues related to the Optimized Link State Routing Protocol -- one example of a proactive routing protocol for MANETs. We inventory the possible attacks against the integrity of the OLSR network routing infrastructure, and present a technique for securing the network. In particular, assuming that a mechanism for routing message authentication (digital signatures) has been deployed, we concentrate on the problem where otherwise "trusted" nodes have been compromised by attackers, which could then inject false (however correctly signed) routing messages. Our main approach is based on authentication checks of information injected into the network, and reuse of this information by a node to prove its link state at a later time. We finally synthetize the overhead and the remaining vulnerabilities of the proposed solution.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper we investigate security issues related to the Optimized Link State Routing Protocol -- one example of a proactive routing protocol for MANETs. We inventory the possible attacks against the integrity of the OLSR network routing infrastructure, and present a technique for securing the network. In particular, assuming that a mechanism for routing message authentication (digital signatures) has been deployed, we concentrate on the problem where otherwise "trusted" nodes have been compromised by attackers, which could then inject false (however correctly signed) routing messages. Our main approach is based on authentication checks of information injected into the network, and reuse of this information by a node to prove its link state at a later time. We finally synthetize the overhead and the remaining vulnerabilities of the proposed solution.
Clausen, Thomas
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.
@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 = {},
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.
Clausen, Thomas; Jacquet, Philippe
RFC3626: The Optimized Link State Routing Protocol Miscellaneous
2003, (http://tools.ietf.org/html/rfc3626).
@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 = {},
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.
Adjih, Cedric; Clausen, Thomas; Laouiti, Anis; Mühlethaler, Paul; Raffo, Daniele
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.
@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 = {},
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.
Clausen, Thomas; Qayyum, Amir; Jacquet, Philippe; Toor, Y.; Muhlethaler, Paul
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Clausen, Thomas; Jacquet, Philippe; Viennot, Laurent
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.
@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 = {},
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.
Clausen, Thomas; Jacquet, Philippe; Viennot, Laurent
Comparative Study of Routing Protocols for Mobile Ad-hoc NETworks Proceedings Article
In: Proceedings of the IFIP MedHocNet, September 2002, Sardinia, Italy, 2002.
@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 = {},
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.
Viennot, Laurent; Jacquet, Philippe; Clausen, Thomas
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.
@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 = {},
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.
Jacquet, Philippe; Muhlethaler, Paul; Clausen, Thomas; Laouiti, Anis; Qayyum, Amir; Viennot, Laurent
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.
@inproceedings{Jacquet2001,
title = {Optimized link state routing protocol for ad hoc networks},
author = {Philippe 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 = {},
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.
Clausen, Thomas; Hansen, Gitte; Christensen, Lars; Behrmann, Gerd
The Optimized Link State Routing Protocol Evaluation through Experiments and Simulation Proceedings Article
In: IN PROCEEDING OF WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS, IEEE, 2001.
@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 = {},
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.