2018
Cordero, Juan Antonio; Lou, Wei
Take your time, get it closer: content dissemination within mobile pedestrian crowds Journal Article
In: Wireless Networks, 2018, ISSN: 1572-8196.
Abstract | Links | BibTeX | Tags: Ad-Hoc, Chaire Cisco, MESH
@article{Cordero2018,
title = {Take your time, get it closer: content dissemination within mobile pedestrian crowds},
author = {Juan Antonio Cordero and Wei Lou},
url = {https://doi.org/10.1007/s11276-018-1731-2},
doi = {10.1007/s11276-018-1731-2},
issn = {1572-8196},
year = {2018},
date = {2018-05-05},
journal = {Wireless Networks},
abstract = {The explosion of traffic demands in the edge of the Internet, mostly by mobile users, is putting under pressure current networking infrastructures. This is particularly acute when huge amounts of users and active wireless devices gather in reduced geographical spaces, increasing the risk of exceeding planned capacity of deployed infrastructure. This trend motivates research on edge computing, and in particular, on mechanisms to offload or address locally part of the user injected traffic at the access infrastructure, thus reducing the need of Internet requests and retrievals. This paper concentrates on the ability of mobile crowds --and corresponding access networks---to fulfill content requests originated within the mesh, with minimal intervention of the Internet infrastructure. Simple heuristics are revisited, proposed, discussed and evaluated to improve autonomous content discovery and dissemination within high-density, low-mobility crowds, by combining notions already explored for MANET routing: deliberate jittering and autonomous distance-based overlay pruning. Results over synthetic networks and real mobility traces indicate that these mechanisms improve efficiency and quality of content request discoveries, by reducing significantly collisions and increasing stability of discovered paths in dense pedestrian crowds.},
keywords = {Ad-Hoc, Chaire Cisco, MESH},
pubstate = {published},
tppubtype = {article}
}
Clausen, Thomas; YI, Jiazi; Cordero, Juan Antonio; Igarashi, Yuichi
Use 'em or Lose 'em: On Unidirectional Links in Reactive Routing Protocols Journal Article
In: Elsevier Ad Hoc Networks, vol. 73, pp. 51-64, 2018.
Abstract | Links | BibTeX | Tags: Ad-Hoc, LLN, LOADng, MANET, Reactive, Routing
@article{Clausen2018unidirectional,
title = {Use 'em or Lose 'em: On Unidirectional Links in Reactive Routing Protocols},
author = {Thomas Clausen and Jiazi YI and Juan Antonio Cordero and Yuichi Igarashi},
url = {https://ac.els-cdn.com/S1570870518300325/1-s2.0-S1570870518300325-main.pdf?_tid=0b7f4a7e-b489-4317-b96c-f18cec2af56f&acdnat=1520779362_84dbf04f92cfc3c7ef2448f3b4c3ebf7},
doi = {10.1016/j.adhoc.2018.02.004},
year = {2018},
date = {2018-05-01},
journal = {Elsevier Ad Hoc Networks},
volume = {73},
pages = {51-64},
abstract = {In reactive unicast routing protocols, Route Discovery aims to include only bidirectional links in discovered routing paths. This is typically accomplished by having routers maintain a “blacklist” of links recently confirmed (through Route Reply processing) to be unidirectional – which is then used for excluding subsequent Route Discovery control messages received over these links from being processed and forwarded.
This paper first presents an analytical model, which allows to study the impact of unidirectional links being present in a network, on the performance of reactive routing protocols. Next, this paper identifies that despite the use of a “blacklist”, the Route Discovery process may result in discovery of false forward routes, i.e., routes containing unidirec- tional links – and proposes a counter-measure denoted Forward Bidirectionality Check. This paper further proposes a Loop Exploration mechanism, allowing to properly include unidirectional links in a discovered routing topology – with the goal of providing bidirectional connectivity even in absence of bidirectional paths in the network.
Finally, each of these proposed mechanisms are subjected to extensive network simulations in static scenarios. When the fraction of unidirectional links is moderate (15 50%), simulations find Forward Bidirectionality Check to significantly increase the probability that bidirectional routing paths can be discovered by a reactive routing protocol, while incurring only an insignificant additional overhead. Further, in networks with a significant fraction of unidirectional links ( 50%), simulations reveal that Loop Exploration preserves the ability of a reactive routing protocol to establish bidirectional communication (possibly through non-bidirectional paths), but at the expense of a substantial additional overhead.},
keywords = {Ad-Hoc, LLN, LOADng, MANET, Reactive, Routing},
pubstate = {published},
tppubtype = {article}
}
This paper first presents an analytical model, which allows to study the impact of unidirectional links being present in a network, on the performance of reactive routing protocols. Next, this paper identifies that despite the use of a “blacklist”, the Route Discovery process may result in discovery of false forward routes, i.e., routes containing unidirec- tional links – and proposes a counter-measure denoted Forward Bidirectionality Check. This paper further proposes a Loop Exploration mechanism, allowing to properly include unidirectional links in a discovered routing topology – with the goal of providing bidirectional connectivity even in absence of bidirectional paths in the network.
Finally, each of these proposed mechanisms are subjected to extensive network simulations in static scenarios. When the fraction of unidirectional links is moderate (15 50%), simulations find Forward Bidirectionality Check to significantly increase the probability that bidirectional routing paths can be discovered by a reactive routing protocol, while incurring only an insignificant additional overhead. Further, in networks with a significant fraction of unidirectional links ( 50%), simulations reveal that Loop Exploration preserves the ability of a reactive routing protocol to establish bidirectional communication (possibly through non-bidirectional paths), but at the expense of a substantial additional overhead.
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MP-OLSR, Multipath, OLSR
@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 = {Ad-Hoc, MP-OLSR, Multipath, OLSR},
pubstate = {published},
tppubtype = {inproceedings}
}
2017
Clausen, Thomas; Yi, Jiazi; Herberg, Ulrich
Lightweight On-demand Ad hoc Distance-vector Routing-Next Generation (LOADng): Protocol, Extension, and Applicability Journal Article
In: Computer Networks, vol. 126, pp. 125-140, 2017.
Abstract | Links | BibTeX | Tags: Ad-Hoc, LLN, LOADng
@article{clausen2017lightweight,
title = {Lightweight On-demand Ad hoc Distance-vector Routing-Next Generation (LOADng): Protocol, Extension, and Applicability},
author = {Thomas Clausen and Jiazi Yi and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2017/08/2017-Computer-Networks-Lightweight-On-demand-Ad-hoc-Distance-vector-Routing-Next-Generation-LOADng.pdf},
doi = {10.1016/j.comnet.2017.06.025},
year = {2017},
date = {2017-10-24},
journal = {Computer Networks},
volume = {126},
pages = {125-140},
publisher = {Elsevier},
abstract = {This paper studies the routing protocol “Lightweight On-demand Ad hoc Distance-vector Routing Protocol – Next Generation (LOADng)”, designed to enable efficient, scalable and secure routing in low power and lossy networks. As a reactive protocol, it does not maintain a routing table for all destinations in the network, but initiates a route discovery to a destination only when there is data to be sent to that destination to reduce routing overhead and memory consumption. Designed with a modular approach, LOADng can be extended with additional components for adapting the protocol to different topologies, traffic, and data-link layer characteristics. This paper studies several such additional components for extending LOADng: support for smart route requests and expanding ring search, an extension permitting maintaining collection trees, a fast rerouting extension. All those extensions are examined from the aspects of specification, interoperability with other mechanisms, security vulnerabilities, performance and applicability. A general framework is also proposed to secure the routing protocol.},
keywords = {Ad-Hoc, LLN, LOADng},
pubstate = {published},
tppubtype = {article}
}
Clausen, Thomas; Herberg, Ulrich; Yi, Jiazi
RFC8116: Security Threats to the Optimized Link State Routing Protocol Version 2 (OLSRv2) Miscellaneous
RFC 8116, 2017.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OLSR Security, OLSRv2, RFC, Security
@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 = {Ad-Hoc, MANET, MESH, OLSR Security, OLSRv2, RFC, Security},
pubstate = {published},
tppubtype = {misc}
}
Yi, Jiazi; Parrein, Benoit
RFC8218: Multipath Extension for the Optimized Link State Routing Protocol Version 2 (OLSRv2) Miscellaneous
RFC 8218, 2017.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MP-OLSR, OLSRv2, RFC
@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 = {Ad-Hoc, MANET, MP-OLSR, OLSRv2, RFC},
pubstate = {published},
tppubtype = {misc}
}
2016
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, MIB, Network Management, NHDP, OLSRv2, RFC
@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 = {Ad-Hoc, MANET, MESH, MIB, Network Management, NHDP, OLSRv2, RFC},
pubstate = {published},
tppubtype = {misc}
}
2015
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).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, OLSRv2, RFC
@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 = {Ad-Hoc, IETF, MANET, MESH, OLSRv2, RFC},
pubstate = {published},
tppubtype = {misc}
}
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).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, OLSRv2, RFC, Standard
@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 = {Ad-Hoc, IETF, MANET, MESH, OLSRv2, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
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).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, NHDP, OLSRv2, RFC, Standard
@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 = {Ad-Hoc, IETF, MANET, MESH, NHDP, OLSRv2, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
2014
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).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, OLSRv2, RFC, Standard
@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 = {Ad-Hoc, IETF, MANET, OLSRv2, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
Herberg, Ulrich; Dearlove, Christopher; Clausen, Thomas
IETF - Proposed Standard RFC 7183, 2014, ISSN: 2070-1721, (http://tools.ietf.org/html/rfc7183).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, NHDP, OLSR Security, OLSRv2, RFC, Security
@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 = {Ad-Hoc, IETF, MANET, NHDP, OLSR Security, OLSRv2, RFC, Security},
pubstate = {published},
tppubtype = {misc}
}
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).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, Network Management, OLSRv2, RFC, Standard
@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 = {Ad-Hoc, IETF, MANET, MESH, Network Management, OLSRv2, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
2013
Yi, Jiazi; Cordero, Juan Antonio; Clausen, Thomas
Jitter Considerations in On-demand Route Discovery for Mobile Ad Hoc Networks Proceedings Article
In: The 16th International Conference on Network-Based Information Systems (NBiS-2013), 2013.
Abstract | Links | BibTeX | Tags: Ad-Hoc, Jitter, LOADng, MANET, MESH, Sensor Networks, Smart Grid, SOGRID
@inproceedings{Clausen2013g,
title = {Jitter Considerations in On-demand Route Discovery for Mobile Ad Hoc Networks},
author = {Jiazi Yi and Juan Antonio Cordero and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-NBIS-Jitter-Considerations-in-On-demand-Route-Discovery-for-Mobile-Ad-Hoc-Networks.pdf},
doi = {10.1109/NBiS.2013.28},
year = {2013},
date = {2013-09-01},
publisher = {The 16th International Conference on Network-Based Information Systems (NBiS-2013)},
abstract = {Jittering (a small, random variation in timing of control message emission) is widely used in protocols for wireless communication, in order to avoid simultaneous packet transmis- sions over the same channel by adjacent nodes in the network. Used for both regularly scheduled packets, for event-triggered packets, and for scheduled resets in the network, jittering is a particularly important mechanism when a network event may cause multiple adjacent nodes to react concurrently. Introduced in the proactive MANET routing protocol OLSR, the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), a derivative of AODV, is specified so as to also use jitter for flooding Route Request (RREQ) messages during route discovery. This use of jitter in RREQ flooding is, however, not without drawbacks, which are identified and addressed in this paper within the framework of a more general study of jitter mechanisms used for route discovery in reactive routing protocols. The paper studies the behavior of route discovery when using “naive” jitter (simply, delaying RREQ retransmission by a small uniformly distributed random delay), in order to identify and analyze the problems hereof, mostly related to route sub-optimality and excessive control traffic overhead. A Window Jitter mechanism is then proposed to address these issues – with the performance hereof, when compared to “naive” jitter being evaluated by way of modeling, theoretical analysis and experiments. The paper shows that the use of Window Jitter improves indeed the efficiency of route discovery in AODV and overcome the drawbacks identified for “naive” jitter.},
keywords = {Ad-Hoc, Jitter, LOADng, MANET, MESH, Sensor Networks, Smart Grid, SOGRID},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Links | BibTeX | Tags: Ad-Hoc, LLN, LOADng, MANET, MPR, OLSR, OSPF
@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 = {Ad-Hoc, LLN, LOADng, MANET, MPR, OLSR, OSPF},
pubstate = {published},
tppubtype = {inbook}
}
Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas
Optimization of jitter configuration for reactive route discovery in wireless mesh networks Proceedings Article
In: Modeling & Optimization in Mobile, Ad Hoc & Wireless Networks (WiOpt), 2013 11th International Symposium on, 2013, ISBN: 978-1-61284-824-2.
Abstract | Links | BibTeX | Tags: Ad-Hoc, Jitter, LLN, LOADng, MANET, MESH, Sensor Networks, Smart Grid
@inproceedings{Clausen2013c,
title = {Optimization of jitter configuration for reactive route discovery in wireless mesh networks},
author = {Juan Antonio Cordero and Jiazi Yi and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-WiOpt-Optimization-of-Jitter-Configuration-for-Reactive-Route-Discovery-in-Wireless-Mesh-Networks.pdf},
isbn = {978-1-61284-824-2},
year = {2013},
date = {2013-05-01},
publisher = {Modeling & Optimization in Mobile, Ad Hoc & Wireless Networks (WiOpt), 2013 11th International Symposium on},
abstract = {Jitter is a small, random variation of timing before message emission that is widely used in non-synchronized wireless communication. It is employed to avoid collisions caused by simultaneous transmissions by adjacent nodes over the same channel. In reactive (on-demand) routing protocols, such as AODV and LOADng, it is recommended to use jitter during the flooding of Route Request messages. This paper analyzes the cost of jitter mechanisms in route discovery of on-demand routing protocols, and examines the drawbacks of the standard and commonly used uniformly distributed jitter. The main studied drawback is denominated delay inversion effect. Two variations on the jitter mechanism --window jitter and adaptive jitter-- are proposed to address this effect, which take the presence and the quality of traversed links into consideration to determine the per-hop forwarding delay. These variations allow to effectively reduce the routing overhead, and increase the quality of the computed paths with respect to the standard uniform jitter mechanism. Simulations are also performed to compare the performance of different jitter settings in various network scenarios.},
keywords = {Ad-Hoc, Jitter, LLN, LOADng, MANET, MESH, Sensor Networks, Smart Grid},
pubstate = {published},
tppubtype = {inproceedings}
}
2012
Yi, Jiazi; Clausen, Thomas
Vulnerability Analysis of Relay Set Selection Algorithms for the Simplified Multicast Forwarding (SMF) Protocol for Mobile Ad Hoc Networks Proceedings Article
In: The 15th International Conference on Network-Based Information Systems (NBiS-2012), 2012.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, Security, SMF, SMF Security
@inproceedings{Yi2012,
title = {Vulnerability Analysis of Relay Set Selection Algorithms for the Simplified Multicast Forwarding (SMF) Protocol for Mobile Ad Hoc Networks},
author = {Jiazi Yi and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2012-NBIS-Vulnerability-Analysis-of-Relay-Set-Selection-Algorithms-for-the-Simplified-Multicast-Forwarding-SMF-Protocol-for-Mobile-Ad-Hoc-Networks.pdf},
doi = {10.1109/NBiS.2012.48},
year = {2012},
date = {2012-09-01},
publisher = {The 15th International Conference on Network-Based Information Systems (NBiS-2012)},
abstract = {After more than a decade of research and stan-dardization, Mobile Ad Hoc NETworks (MANET) are finding their place in real-world deployments, such as in community, tactical and vehicular networks. Becoming so present in “the real world” also means that MANETs, and the protocols operating them, are affronted with a more hostile environment, where misconfiguration, eavesdropping, and attacks must be addressed. A first step in addressing MANET security is understanding the vulnerabilities of MANET protocols, and how an attacker can exploit these. This paper studies the Relay Set Selection (RSS) algorithms that are commonly used in multicast routing protocol for MANETs, and which are undergoing standardization as part of the Simplified Multicast Forwarding (SMF) protocol, developed within the Internet Engineering Task Force (IETF). Attack vectors for these different RSS algorithms are described, with the purpose of enabling future development of security solutions.},
keywords = {Ad-Hoc, MANET, MESH, Security, SMF, SMF Security},
pubstate = {published},
tppubtype = {inproceedings}
}
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).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, OLSR Security, OLSRv2, RFC, Security, Standard
@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 = {Ad-Hoc, IETF, MANET, MESH, OLSR Security, OLSRv2, RFC, Security, Standard},
pubstate = {published},
tppubtype = {misc}
}
2011
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, DTN, MANET, MESH, OLSRv2
@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 = {Ad-Hoc, DTN, MANET, MESH, OLSRv2},
pubstate = {published},
tppubtype = {inproceedings}
}
Yi, Jiazi; Clausen, Thomas; Herberg, Ulrich
Vulnerability Analysis of the SMF Protocol for Mobile Ad Hoc Networks Proceedings Article
In: IEEE CPSCom 2011, 2011, (http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6142260).
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, Security, SMF, SMF Security
@inproceedings{Yi2011c,
title = {Vulnerability Analysis of the SMF Protocol for Mobile Ad Hoc Networks},
author = {Jiazi Yi and Thomas Clausen and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-CPScom-Vulnerability-Analysis-of-the-Simple-Multicast-Forwarding-SMF-Protocol-for-Mobile-Ad-Hoc-Networks.pdf},
doi = {10.1109/iThings/CPSCom.2011.63},
year = {2011},
date = {2011-10-01},
publisher = {IEEE CPSCom 2011},
abstract = {If deployments of Mobile Ad Hoc Networks (MANETs) are to become common outside of purely experimental settings, protocols operating such MANETs must be able to preserve network integrity, even when faced with careless or malicious participants. A first step towards protecting a MANET is to analyze the vulnerabilities of the routing protocol(s), managing the connectivity. Understanding how these routing protocols can be exploited by those with ill intent, countermeasures can be developed, readying MANETs for wider deployment and use. One routing protocol for MANETs, developed by the Internet Engineering Task Force (IETF) as a multicast routing protocol for efficient data dissemination, is denoted "Simplified Multicast Forwarding'' (SMF). This protocol is analyzed, and its vulnerabilities described, in this paper. SMF consists of two independent components: (i) duplicate packet detection and (ii) relay set selection, each of which presents its own set of vulnerabilities that an attacker may exploit to compromise network integrity. This paper explores vulnerabilities in each of these, with the aim of identifying attack vectors and thus enabling development of countermeasures.},
note = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6142260},
keywords = {Ad-Hoc, MANET, MESH, Security, SMF, SMF Security},
pubstate = {published},
tppubtype = {inproceedings}
}
Cordero, Juan Antonio
Link-State Routing Optimization for Compound Autonomous Systems in the Internet PhD Thesis
École polytechnique, 2011.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MPR, Performance Evaluation, Thesis
@phdthesis{Cordero2011b,
title = {Link-State Routing Optimization for Compound Autonomous Systems in the Internet},
author = {Juan Antonio Cordero},
url = {https://www.researchgate.net/publication/262343881_Link-State_Routing_Optimization_for_Compound_Autonomous_Systems_in_the_Internet},
year = {2011},
date = {2011-09-15},
address = {Palaiseau, France},
school = {École polytechnique},
abstract = {This manuscript addresses the coexistence of planned and spontaneous interconnected networks in the Internet core. In this realm, the focus is on routing within a specific type of Autonomous System (AS) called compound AS, which contains both wireless ad hoc networks and wired fixed networks. The approach studied in this manuscript is to enhance existing Interior Gateway Protocols (IGPs), typically based on the link-state algorithm, in order to enable them to operate both in ad hoc networks and in wired networks. The manuscript thus analyzes the use of link-state routing in ad hoc networks. Based on this analysis, different techniques are proposed and theoretically evaluated, aiming at optimizing the performance of link state routing in a compound AS. The manuscript then investigates the impact of these techniques when applied to OSPF, one of the main IGPs used in the Internet. The performance of OSPF extensions on MANETs using the studied techniques are compared via simulations. Finally, OSPF operation over compound internetworks is evaluated via experiments on a testbed.},
keywords = {Ad-Hoc, MANET, MPR, Performance Evaluation, Thesis},
pubstate = {published},
tppubtype = {phdthesis}
}
Clausen, Thomas; Dearlove, Christopher; Dean, Justin
RFC6130: Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP) Miscellaneous
2011, (http://tools.ietf.org/html/rfc6130).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, NHDP, OLSRv2, RFC, Standard
@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 = {Ad-Hoc, IETF, MANET, MESH, NHDP, OLSRv2, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
Cordero, Juan Antonio; Baccelli, Emmanuel; Jacquet, Philippe; Clausen, Thomas
Wired / Wireless Compound Networking Book Chapter
In: Wang, Xin (Ed.): Mobile Ad-Hoc Networks: Applications, Chapter 16, InTech, 2011, ISBN: 978-953-307-416-0.
Links | BibTeX | Tags: Ad-Hoc, MANET, OSPF, OSPF4MANET
@inbook{Cordero2011,
title = {Wired / Wireless Compound Networking},
author = {Juan Antonio Cordero and Emmanuel Baccelli and Philippe Jacquet and Thomas Clausen},
editor = {Xin Wang},
url = {www.intechopen.com/download/pdf/12891},
doi = {10.5772/882},
isbn = {978-953-307-416-0},
year = {2011},
date = {2011-01-30},
booktitle = {Mobile Ad-Hoc Networks: Applications},
publisher = {InTech},
chapter = {16},
keywords = {Ad-Hoc, MANET, OSPF, OSPF4MANET},
pubstate = {published},
tppubtype = {inbook}
}
Cordero, Juan Antonio; Clausen, Thomas; Baccelli, Emmanuel
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF Proceedings Article
In: Hawaii International Conference on System Sciences, 2011.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, MPR, OSPF, OSPF4MANET
@inproceedings{Fuertes2011,
title = {MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF},
author = {Juan Antonio Cordero and Thomas Clausen and Emmanuel Baccelli},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-HICSS-MPRSP-Towards-a-Unified-MPR-based-MANET-Extension-for-OSPF.pdf},
doi = {10.1109/HICSS.2011.313},
year = {2011},
date = {2011-01-01},
publisher = {Hawaii International Conference on System Sciences},
abstract = {Heterogeneous networks combining both wired and wireless components – fixed routers as well as mobile routers – emerge as wireless mesh networks are being deployed. Such heterogeneity is bound to become more and more present in the near future as mobile ad hoc networking becomes a reality. While it is possible to cope with heterogeneity by employing different routing protocols for the fixed / wired part and for the wireless / ad hoc part of the network, this may lead to sub-optimal performance, e.g. by way of longer routing paths due to these routing protocols sharing prefixes and ”connecting” the network only at distinct gateways between the two routing domains. Thus, the establishment of a single unified routing domain, and the use of a single routing protocol, for such heterogeneous networks is desired. OSPF is a natural candidate for this task, due to its wide deployment, its modularity and its similarity with the popular ad hoc routing protocol OLSR. Multiple OSPF extensions for MANETs have therefore been specified by the IETF. This paper introduces a novel OSPF extension for operation on ad hoc networks, MPRSP, and compares it with the existing OSPF extensions via simulations, which show that MPR+SP outperforms prior art.},
keywords = {Ad-Hoc, MANET, MESH, MPR, OSPF, OSPF4MANET},
pubstate = {published},
tppubtype = {inproceedings}
}
2010
Herberg, Ulrich; Clausen, Thomas
Yet Another Autoconf Proposal (YAAP) for Mobile Ad hoc NETworks Proceedings Article
In: Proceedings of the 6th International Conference on Mobile Ad-hoc and Sensor Networks (MSN'10), 2010.
Abstract | Links | BibTeX | Tags: Ad-Hoc, Autoconfiguration, MANET, MANET-Autoconf, MESH
@inproceedings{Clausen2010g,
title = {Yet Another Autoconf Proposal (YAAP) for Mobile Ad hoc NETworks},
author = {Ulrich Herberg and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-MSN-Yet-Another-Autoconf-Proposal.pdf},
doi = {10.1109/MSN.2010.48},
year = {2010},
date = {2010-12-01},
publisher = {Proceedings of the 6th International Conference on Mobile Ad-hoc and Sensor Networks (MSN'10)},
abstract = {This paper addresses the issues of automatic address and prefix configuration of MANET routers. Specifically, the paper analyzes the differences between “classic IP networks” and MANETs, emphasizing the interface, link, topology, and addressing assumptions present in “classic IP networks”. The paper presents a model for how this can be matched to the specific constraints and conditions of a MANET – i.e., how MANETs can be configured to adhere to the Internet addressing architecture. This sets the stage for development of a MANET autoconfiguration protocol, enabling automatic configuration of MANET interfaces and prefix delegation. This autoconfiguration protocol is characterized by (i) adhering strictly to the Internet addressing architecture, (ii) being able to configure both MANET interface addresses and handle prefix delegation, and (iii) being able to configure both stand-alone MANETs, as well as MANETs connected to an infrastructure providing, e.g., globally scoped addresses/prefixes for use within the MANET. The protocol is specified through timed automatons which, by way of model checking, enable verification of certain protocol properties. Fur-thermore, a performance study of the basic protocol, as well as an optimization hereto, is conducted based on network simulations.},
keywords = {Ad-Hoc, Autoconfiguration, MANET, MANET-Autoconf, MESH},
pubstate = {published},
tppubtype = {inproceedings}
}
Baccelli, Emmanuel; Cordero, Juan Antonio; Jacquet, Philippe
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad Hoc Networks Proceedings Article
In: pp. 402-411, IEEE Proceedings of the 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS’2010)., San Francisco, CA, United States., 2010, ISSN: 2155-6806.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, OSPF, OSPF4MANET
@inproceedings{Baccelli2010b,
title = {Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad Hoc Networks},
author = {Emmanuel Baccelli and Juan Antonio Cordero and Philippe Jacquet},
url = {https://www.researchgate.net/publication/224204276_Optimization_of_Critical_Data_Synchronization_via_Link_Overlay_RNG_in_Mobile_Ad_Hoc_Networks},
doi = {10.1109/MASS.2010.5663945},
issn = {2155-6806},
year = {2010},
date = {2010-11-01},
pages = {402-411},
publisher = {Proceedings of the 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS’2010).},
address = {San Francisco, CA, United States.},
organization = {IEEE},
abstract = {In practice, ad hoc networks are still too unreliable for standard mobile and vehicular communications. It is thus important to complement current protocols in this context, with schemes guaranteeing the exchange of critical data when needed. A promising approach in this realm is to use an overlay subgraph, over which critical messages are exchanged and acknowledged in a peer to peer fashion. Overlay nodes' local databases remain thus synchronized over time, at least concerning critical data. This paper elaborates on the problem of performance, related to the discovery and maintenance of such overlay networks in a mobile ad hoc context. We analyze SLOT, an overlay selected based on a Relative Neighbour Graph (RNG) scheme. We then apply SLOT to a standard IP protocol: OSPF, a popular routing protocol which has recently been extended, with RFC 5449 and RFC 5614, to work also on mobile ad hoc networks, and which makes use of a similar overlay synchronization subgraph. This paper compares the performance of these existing OSPF mechanisms with that of SLOT-OSPF, a novel OSPF extension for mobile ad hoc networks using SLOT. Simulations show that SLOT-OSPF produces drastically less control traffic than RFC 5449 or RFC 5614, allowing SLOT-OSPF to function correctly while the other existing approaches stall, when the number of routers in the domain is large.},
keywords = {Ad-Hoc, MANET, OSPF, OSPF4MANET},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, Network Management, Network Monitoring, OLSRv2
@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 = {Ad-Hoc, MANET, MESH, Network Management, Network Monitoring, OLSRv2},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OLSR Security, OLSRv2, Security
@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 = {Ad-Hoc, MANET, MESH, OLSR Security, OLSRv2, Security},
pubstate = {published},
tppubtype = {inproceedings}
}
Cordero, Juan Antonio; Baccelli, Emmanuel; Jacquet, Philippe
OSPF over Multi-Hop Ad Hoc Wireless Communications Journal Article
In: International Journal of Computer Networks and Communications , vol. 2, no. 5, pp. 38-56, 2010, ISSN: 0975-2293.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, OSPF, OSPF4MANET
@article{Fuertes2010-IJCNC,
title = {OSPF over Multi-Hop Ad Hoc Wireless Communications},
author = {Juan Antonio Cordero and Emmanuel Baccelli and Philippe Jacquet},
url = {http://airccse.org/journal/cnc/0910ijcnc03.pdf},
issn = {0975-2293},
year = {2010},
date = {2010-09-01},
journal = {International Journal of Computer Networks and Communications },
volume = {2},
number = {5},
pages = {38-56},
abstract = {Efficient OSPF (Open Shortest Path First) operation on multi-hop ad hoc wireless networks has become desirable, as wireless community mesh networks and vehicular networks emerge using OLSR (Optimized Link State Routing), a link state MANET routing protocol similar to OSPF in many aspects. OSPF is already extensively deployed and well known in wired IP networks, and could provide simple, seamless unification of wired and wireless IP networking routing-wise, if extended to operate efficiently on ad hoc networks. The IETF has thus proposed three different MANET extensions to the OSPF protocol, allowing heterogeneous networks encompassing both wired and wireless routers, which may self-organize as multi-hop wireless subnetworks, and be mobile. Two of these extensions are based on techniques derived from multi-point relaying (MPR). In the following, we compare and analyze these two extensions and we propose a unique, merged approach which out-performs the existing extensions.
},
keywords = {Ad-Hoc, MANET, OSPF, OSPF4MANET},
pubstate = {published},
tppubtype = {article}
}
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OLSR Security, OLSRv2, Security
@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 = {Ad-Hoc, MANET, MESH, OLSR Security, OLSRv2, Security},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OLSR Security, OLSRv2, Security
@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 = {Ad-Hoc, MANET, MESH, OLSR Security, OLSRv2, Security},
pubstate = {published},
tppubtype = {inproceedings}
}
Baccelli, Emmanuel; Cordero, Juan Antonio; Jacquet, Philippe
Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs Proceedings Article
In: pp. 1-6, Proceedings of the 5th IEEE SECON Workshop on Wireless Mesh Networks (WiMesh 2010)., Boston, MA, United States., 2010.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, OSPF, OSPF4MANET
@inproceedings{Baccelli2010,
title = {Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs},
author = {Emmanuel Baccelli and Juan Antonio Cordero and Philippe Jacquet},
url = {https://www.researchgate.net/publication/224155213_Using_Relative_Neighborhood_Graphs_for_Reliable_Database_Synchronization_in_MANETs},
doi = {10.1109/WIMESH.2010.5507907},
year = {2010},
date = {2010-06-01},
pages = {1-6},
publisher = {Proceedings of the 5th IEEE SECON Workshop on Wireless Mesh Networks (WiMesh 2010).},
address = {Boston, MA, United States.},
abstract = {Achieving reliable communication of critical data on mobile ad hoc networks is a must before MANETs can be considered practical for standard mobile and vehicular communications. This paper thus focuses on schemes that complement existing ad hoc broadcast mechanisms (inherently unreliable), which can guarantee the full diffusion of critical messages, when necessary. An interesting approach in this domain is the use of an overlay network, over which critical messages are acknowledged peer to peer, in order to verify the actual dissemination. This paper elaborates on the problem of performance, related to the discovery and the maintenance of such an overlay network, in a mobile ad hoc context. We present an analysis of a novel algorithm, SLOT (Synchronized Link Overlay - Triangular), an overlay selected based on a Relative Neighborhood Graph (RNG) scheme, and we compare its performance with that of other existing algorithms, in the context of the industry-standard IP routing protocol OSPF, which uses alternative overlay algorithms to synchronize link state databases of routers. The results presented in this paper show that SLOT outperforms other existing overlays by necessitating drastically less control traffic in order to function, enabling OSPF to scale to larger mobile ad hoc topologies.},
keywords = {Ad-Hoc, MANET, OSPF, OSPF4MANET},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OLSR Security, OLSRv2, Security
@article{LIX-NET-journal-70,
title = {Security Issues in the Optimized Link State Routing Protocol Version 2 (OLSRV2)},
author = {Ulrich Herberg and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-IJNSA-Security-Issues-in-the-Optimized-Link-State-Routing-Protocol-version-2-OLSRv2-1.pdf},
year = {2010},
date = {2010-04-01},
journal = {International Journal of Network Security & Its Applications (IJNSA)},
abstract = {Mobile Ad hoc NETworks (MANETs) are leaving the confines of research laboratories, to find place in real-world deployments. Outside specialized domains (military, vehicular, etc.), city-wide community- networks are emerging, connecting regular Internet users with each other, and with the Internet, via MANETs. Growing to encompass more than a handful of “trusted participants”, the question of preserving the MANET network connectivity, even when faced with careless or malicious participants, arises, and must be addressed. A first step towards protecting a MANET is to analyze the vulnerabilities of the routing protocol, managing the connectivity. By understanding how the algorithms of the routing protocol operate, and how these can be exploited by those with ill intent, countermeasures can be developed, readying MANETs for wider deployment and use. This paper takes an abstract look at the algorithms that constitute the Optimized Link State Routing Protocol version 2 (OLSRv2), and identifies for each protocol element the possible vulnerabilities and attacks – in a certain way, provides a “cookbook” for how to best attack an operational OLSRv2 network, or for how to proceed with developing protective countermeasures against these attacks.},
keywords = {Ad-Hoc, MANET, MESH, OLSR Security, OLSRv2, Security},
pubstate = {published},
tppubtype = {article}
}
2009
Baccelli, Emmanuel; Clausen, Thomas; Herberg, Ulrich; Perkins, Charles E.
IP Links in Multihop Ad Hoc Wireless Networks? Proceedings Article
In: Proceedings of SoftCom, 2009.
Abstract | Links | BibTeX | Tags: Ad-Hoc, Cross-Layer Design, MANET, MESH, Wireless
@inproceedings{Clausen2009b,
title = {IP Links in Multihop Ad Hoc Wireless Networks?},
author = {Emmanuel Baccelli and Thomas Clausen and Ulrich Herberg and Charles E. Perkins},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2009-SOFTCOM-IP-Links-in-Multihop-Ad-Hoc-Wireless-Networks.pdf},
year = {2009},
date = {2009-09-01},
publisher = {Proceedings of SoftCom},
abstract = {A number of efforts currently aim at scalable and efficient mobile ad hoc routing, an essential piece concerning the integration of such networks in the Internet. However, there is another independent and important issue, namely, how can existing Internet networks and ad hoc networks co- exist coherently within the same protocol architecture. A fundamental concept in the IP protocol suite is that of a link. The link concept has so far been key to the scalability of IP networking. This paper identifies and discusses issues regarding the formalisation of a similar concept in the multi- hop ad hoc networking context – one of the first steps that must be taken in the near future, in order to be able to accomodate ad hoc networks in the Internet.},
keywords = {Ad-Hoc, Cross-Layer Design, MANET, MESH, Wireless},
pubstate = {published},
tppubtype = {inproceedings}
}
Baccelli, Emmanuel; Cordero, Juan Antonio; Jacquet, Philippe
Multi-Hop Relaying Techniques with OSPF on Ad Hoc Networks Proceedings Article
In: Proceedings of the 4th IEEE International Conference on Systems and Networks Communications (ICSNC – SoftNet 2009), 2009.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, MPR, OSPF, OSPF4MANET
@inproceedings{Baccelli2009b,
title = {Multi-Hop Relaying Techniques with OSPF on Ad Hoc Networks},
author = {Emmanuel Baccelli and Juan Antonio Cordero and Philippe Jacquet},
url = {https://www.researchgate.net/publication/232640050_Multi-point_Relaying_Techniques_with_OSPF_on_Ad_Hoc_Networks},
year = {2009},
date = {2009-09-01},
publisher = {Proceedings of the 4th IEEE International Conference on Systems and Networks Communications (ICSNC – SoftNet 2009)},
abstract = {Incorporating multi-hop ad hoc wireless networks in the IP infrastructure is an effort to which a growing community participates. One instance of such activity is the extension of the most widely deployed interior gateway routing protocol on the Internet, OSPF (Open Shortest Path First), for operation on Mobile Ad hoc Networks (MANETs).Such extension allows OSPF to work on heterogeneous networks encompassing both wired and wireless routers,which may self-organize as multi-hop wireless subnetworks, and be mobile. Three solutions have been proposed for this extension, among which two based on techniques derived from multi-point relaying (MPR). This paper analyzes these two approaches and identifies some fundamental discussion items that pertain to adapting OSPF mechanisms to multi hop wireless networking, before concluding with a proposal for a unique, merged solution based on this analysis.},
keywords = {Ad-Hoc, MANET, MESH, MPR, OSPF, OSPF4MANET},
pubstate = {published},
tppubtype = {inproceedings}
}
Clausen, Thomas; Dearlove, Christopher
RFC5497: Representing Multi-Value Time in MANETs Miscellaneous
2009, (http://www.rfc-editor.org/rfc/rfc5497.txt).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, OLSRv2, RFC, Standard
@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 = {Ad-Hoc, IETF, MANET, MESH, OLSRv2, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
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).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, OLSRv2, RFC, Standard
@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 = {Ad-Hoc, IETF, MANET, MESH, OLSRv2, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
Baccelli, Emmanuel; Clausen, Thomas; Jacquet, Philippe; Nguyen, Dang
RFC5449 - OSPF Multipoint Relay (MPR) Extension for Ad Hoc Networks Miscellaneous
2009, (http://tools.ietf.org/html/rfc5449).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, OSPF, OSPF4MANET, RFC, Standard
@misc{Baccelli2009,
title = {RFC5449 - OSPF Multipoint Relay (MPR) Extension for Ad Hoc Networks},
author = {Emmanuel Baccelli and Thomas Clausen and Philippe Jacquet and Dang Nguyen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc5449.txt.pdf},
doi = {10.17487/RFC5449},
year = {2009},
date = {2009-02-01},
publisher = {IETF - Exp. RFC},
organization = {The Internet Engineering Task Force},
abstract = {This document specifies an OSPFv3 interface type tailored for mobile ad hoc networks. This interface type is derived from the broadcast interface type, and is denoted the "OSPFv3 MANET interface type". This memo defines an Experimental Protocol for the Internet community.},
note = {http://tools.ietf.org/html/rfc5449},
keywords = {Ad-Hoc, IETF, MANET, MESH, OSPF, OSPF4MANET, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
Cordero, Juan Antonio
On MPR-OSPF Specification and Implementation in Quagga/GTNetS Technical Report
INRIA Research Report, no. 6827, 2009.
Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OSPF, Standard
@techreport{Cordero2009,
title = {On MPR-OSPF Specification and Implementation in Quagga/GTNetS},
author = {Juan Antonio Cordero},
url = {https://hal.archives-ouvertes.fr/inria-00359138/document},
year = {2009},
date = {2009-02-01},
number = {6827},
institution = {INRIA},
type = {Research Report},
keywords = {Ad-Hoc, MANET, MESH, OSPF, Standard},
pubstate = {published},
tppubtype = {techreport}
}
2008
Clausen, Thomas; Dearlove, Christopher; Adamson, Brian
RFC5148: Jitter Considerations in Mobile Ad Hoc Networks (MANETs) Miscellaneous
2008, (http://tools.ietf.org/html/rfc5148).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, OLSRv2, RFC, Standard
@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 = {Ad-Hoc, IETF, MANET, MESH, OLSRv2, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
2005
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, Autoconfiguration, MANET, MANET-Autoconf, MESH, OLSR
@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 = {Ad-Hoc, Autoconfiguration, MANET, MANET-Autoconf, MESH, OLSR},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, Autoconfiguration, MANET, MANET-Autoconf, MESH, OLSR
@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 = {Ad-Hoc, Autoconfiguration, MANET, MANET-Autoconf, MESH, OLSR},
pubstate = {published},
tppubtype = {inproceedings}
}
2004
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MANET Broadcast, MESH, OLSR
@article{LIX-NET-journal-2,
title = {Fish-Eye OLSR Scaling Properties},
author = {Thomas Clausen and Emmanuel Baccelli and Georgios Rodolakis and Cedric Adjih and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2004-JCN-Fish-Eye-OLSR-Scaling-Properties.pdf},
year = {2004},
date = {2004-12-01},
journal = {IEEE Journal on Communications Networks (JCN), Special Issue on Ad Hoc Networking, Dec 2004},
abstract = {Scalability is one of the toughest challenges in ad hoc networking. Recent work outlines theoretical bounds on how well routing protocols could scale in this environment. However, none of the popular routing solutions really scales to large networks, by coming close enough to these bounds. In this paper, we study the case of link state routing and OLSR, one of the strongest candidate for standardization. We analyze how these bounds are not reached in this case, and we study how much the scalability is enhanced with the use of Fish Eye techniques in addition to the link state routing framework. We show that with this enhancement, the theoretical scalability bounds are reached.},
keywords = {Ad-Hoc, MANET, MANET Broadcast, MESH, OLSR},
pubstate = {published},
tppubtype = {article}
}
Baccelli, Emmanuel; Clausen, Thomas; Jacquet, Philippe
Ad-hoc and Internet Convergence: Adapting OSPF-style Database Exchanges for Ad-hoc Networks, Proceedings Article
In: Proceedings of the Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), London, UK., Proceedings of the Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), London, UK., 2004.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OSPF, OSPF4MANET
@inproceedings{Clausen2004b,
title = {Ad-hoc and Internet Convergence: Adapting OSPF-style Database Exchanges for Ad-hoc Networks,},
author = {Emmanuel Baccelli and Thomas Clausen and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2004-HetNets-Ad-hoc-and-Internet-Convergence-Adapting-OSPF-style-Database-Exchanges-for-Ad-hoc-Networks.pdf},
year = {2004},
date = {2004-10-01},
booktitle = {Proceedings of the Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), London, UK.},
publisher = {Proceedings of the Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), London, UK.},
abstract = {The OSPF routing protocol is, currently, the predominant IGP in use on the fixed Internet of today. This routing protocol scales (in principle) ”world wide”, under the assumptions of links being relatively stable, network density being low (relatively few adjacencies per router) and mobility being present at the edges of the networks only. Recently, work has begun towards extending the domain of OSPF to also include ad-hoc networks – i.e. dense networks, in which links are short-lived and all nodes are mobile. In this paper, we focus on the convergence of the Internet and ad-hoc networks, through extensions to the OSPF routing protocol. Based on WOSPF, a merger of the ad- hoc routing protocol OLSR and OSPF, we examine the feature of OSPF database exchange and reliable synchro- nisation in the context of ad-hoc networking. We find that the mechanisms, in the form present in OSPF, are not suitable for the ad-hoc domain. We propose an alternative mechanism for link-state database exchanges in wireless ad-hoc networks, aiming at furthering an adaptation of OSPF to be useful also on ad-hoc networks, and evaluate our alternative against the mechanism found in OSPF. Our proposed mechanism is specified with the following applications in mind: (i) Reliable diffusion of link-state information replacing OSPF acknowledgements with a mechanism suitable for mobile wireless networks; (ii) Reduced overhead for performing OSPF style database exchanges in a mobile wireless network; (iii) Reduced initialisation time when new nodes are emerging in the network; (iv) Reduced overhead and reduced convergence time when several wireless OSPF ad hoc network clouds merge.},
keywords = {Ad-Hoc, MANET, MESH, OSPF, OSPF4MANET},
pubstate = {published},
tppubtype = {inproceedings}
}
Baccelli, Emmanuel; Clausen, Thomas; Jacquet, Philippe
OSPF-style Database Exchange and Reliable Synchronization in the Optimized Link State Routing Protocol Proceedings Article
In: IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON), San Jose, USA, Oct. 2004, 2004.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OSPF, OSPF4MANET
@inproceedings{Clausen2004bb,
title = {OSPF-style Database Exchange and Reliable Synchronization in the Optimized Link State Routing Protocol},
author = {Emmanuel Baccelli and Thomas Clausen and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2004-IEEE-SECON-OSPF-style-Database-Exchange-and-Reliable-Synchronization-in-the-Optimized-Link-State-Routing-Protocol.pdf},
doi = {10.1109/SAHCN.2004.1381921},
year = {2004},
date = {2004-10-01},
publisher = {IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON), San Jose, USA, Oct. 2004},
abstract = {The Optimized Link-State Routing protocol (OLSR) is a proactive link-state routing protocol. While similar to the well-known Internet routing protocol OSPF, OLSR is designed to be simple, and to maintain connec- tivity in face of highly dense and dynamic networks, while being ressource-economic (battery, bandwidth etc.) These characteristics make OLSR suitable as an underlaying routing protocol in a wide range of ad-hoc sensor networks. In this paper, we introduce an extension to OLSR: OSPF-style database exchange and reliable synchroniza- tion. The goal of this extension is to provide a mechanism, through which nodes in an ad-hoc sensor network can de- tect and correct discrepancies in their link-state databases. We qualify why the mechanism, found in OSPF, is not directly applicable for ad-hoc sensor networks, describe an adopted mechanism, accomplishing the same goal, and evaluate the performance of this mechanism in comparison to the database exchange mechanism found in OSPF. We finally discuss some applications of database exchange and reliable synchronization in ad-hoc sensor networks.},
keywords = {Ad-Hoc, MANET, MESH, OSPF, OSPF4MANET},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OLSR
@article{Clausen2004,
title = {Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad Hoc Network Protocols},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2004-ACM-WINET-Analyzing-Control-Traffic-Overhead-versus-Mobility-and-Data-Traffic-Activity-in-Mobile-Ad-hoc-Network-Protoc.pdf},
year = {2004},
date = {2004-07-01},
journal = {ACM Journal on Wireless Networks (Winet) July 2004, volume 10 no. 4},
abstract = {This paper proposes a general, parameterized model for analyzing protocol control overhead in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols. Our analytical model is validated by comparisons with simulations, both taken from literature and made specifically for this paper. For example, our model predicts linearity of control overhead with regard to mobility as observed in existing simulations results. We identify the model parameters for protocols like AODV, DSR and OLSR. Our model then allows accurate predictions of which protocol will yield the lowest overhead depending on the node mobility and traffic activity pattern.},
keywords = {Ad-Hoc, MANET, MESH, OLSR},
pubstate = {published},
tppubtype = {article}
}
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, MANET, MESH, OLSR, OLSR Security, Security
@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 = {Ad-Hoc, MANET, MESH, OLSR, OLSR Security, Security},
pubstate = {published},
tppubtype = {inproceedings}
}
2003
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.
Abstract | Links | BibTeX | Tags: Ad-Hoc, FSR, MANET, MESH, OLSR, Scalability
@inproceedings{Clausen2003b,
title = {Combining Temporal and Spartial Partial Topolgy for MANET Routing - Merging OLSR and FSR},
author = {Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2003-WPMC-Combining-Temporal-and-Spartial-Partial-Topolgy-for-MANET-Routing-Merging-OLSR-and-FSR.pdf},
year = {2003},
date = {2003-10-01},
booktitle = {Proceedings of the IEEE conference on Wireless Personal Multimedia Communications (WPMC)},
abstract = {In this paper, we propose an extension to the Optimized Link State Routing (OLSR) protocol, a proactive link-state routing protocol optimized for mobile ad-hoc networks, in-troducing temporal partial topology as a mechanism for re-ducing control traffic overhead. The extension is inspired from Fisheye State Routing (FSR), and complements the spatial partial topology of OLSR in extending scalability of manet routing protocols to large, dense networks. Through simulations, the paper justifies that through in-troducing temporal partial topology information in OLSR, the control traffic overhead in some manet configurations can be reduced.},
keywords = {Ad-Hoc, FSR, MANET, MESH, OLSR, Scalability},
pubstate = {published},
tppubtype = {inproceedings}
}
Clausen, Thomas; Jacquet, Philippe
RFC3626: The Optimized Link State Routing Protocol Miscellaneous
2003, (http://tools.ietf.org/html/rfc3626).
Abstract | Links | BibTeX | Tags: Ad-Hoc, IETF, MANET, MESH, OLSR, RFC, Standard
@misc{Clausen2003,
title = {RFC3626: The Optimized Link State Routing Protocol},
author = {Thomas Clausen and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc3626.txt.pdf},
doi = {10.17487/RFC3626},
year = {2003},
date = {2003-10-01},
publisher = {The Internet Engineering Task Force (IETF) - MANET Working Group},
organization = {The Internet Engineering Task Force},
abstract = {This document describes the Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks. The protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN. The key concept used in the protocol is that of multipoint relays (MPRs). MPRs are selected nodes which forward broadcast messages during the flooding process. This technique substantially reduces the message overhead as compared to a classical flooding mechanism, where every node retransmits each message when it receives the first copy of the message. In OLSR, link state information is generated only by nodes elected as MPRs. Thus, a second optimization is achieved by minimizing the number of control messages flooded in the network. As a third optimization, an MPR node may chose to report only links between itself and its MPR selectors. Hence, as contrary to the classic link state algorithm, partial link state information is distributed in the network. This information is then used for route calculation. OLSR provides optimal routes (in terms of number of hops). The protocol is particularly suitable for large and dense networks as the technique of MPRs works well in this context.},
note = {http://tools.ietf.org/html/rfc3626},
keywords = {Ad-Hoc, IETF, MANET, MESH, OLSR, RFC, Standard},
pubstate = {published},
tppubtype = {misc}
}
2002
Clausen, Thomas; Viennot, Laurent; Olesen, Tue; Larsen, Nikolai
Investigating data broadcast performance in mobile ad-hoc networks Proceedings Article
In: Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on, pp. 786-790 vol.2, 2002, ISSN: 1347-6890.
Abstract | Links | BibTeX | Tags: Ad-Hoc, Broadcast, MANET, MANET Broadcast, MESH, Performance Evaluation
@inproceedings{Clausen2002a,
title = {Investigating data broadcast performance in mobile ad-hoc networks},
author = {Thomas Clausen and Laurent Viennot and Tue Olesen and Nikolai Larsen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-WPMC-Investigating-data-broadcast-performance-in-mobile-ad-hoc-networks.pdf},
doi = {10.1109/WPMC.2002.1088283},
issn = {1347-6890},
year = {2002},
date = {2002-10-01},
booktitle = {Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on},
volume = {2},
pages = {786-790 vol.2},
abstract = {We investigate broadcasting in mobile ad-hoc networks (MANETs). We define broadcasting as being the process of delivering one packet, originated at one node, to (ideally) all other nodes in the MANET. We present specific problems related to broadcasting in MANETs, as well as four broadcast protocols aimed at providing MANET-wide broadcast. Further, three protocol-independent modifications are presented. One aimed at ensuring that a broadcast packet traverses at least the "shortest path" to its destinations, and two aimed at increasing the fraction of nodes which receive a broadcast packet. Through simulation studies, we evaluate the performance characteristics of the broadcast protocols and generic modifications under different conditions.},
keywords = {Ad-Hoc, Broadcast, MANET, MANET Broadcast, MESH, Performance Evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}