2013
Juan Antonio Cordero; Jiazi Yi; Thomas Clausen
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.
@inproceedings{Clausen2013cb,
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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
2012
Jiazi Yi; Thomas Clausen; Antonin Bas
Smart Route Request for On-demand Route Discovery in Constrained Environments Proceedings Article
In: 2012 IEEE International Conference on Wireless Information Technology and Systems, 2012.
@inproceedings{Clause2012f,
title = {Smart Route Request for On-demand Route Discovery in Constrained Environments},
author = {Jiazi Yi and Thomas Clausen and Antonin Bas},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2012-IEEE-ICWITS-Smart-Route-Request-for-On-demand-Route-Discovery-in-Constrained-Environments.pdf},
doi = {10.1109/ICWITS.2012.6417755},
year = {2012},
date = {2012-11-01},
publisher = {2012 IEEE International Conference on Wireless Information Technology and Systems},
abstract = {A derivative of AODV , denoted LOADng, is proposed for use in very constrained environment, sacrificing a number of features from AODV for the benefit of smaller control messages and simpler processing logic. Among these sacrifices is intermediate route replies. This paper presents an alternative to intermediate router replies, denoted Smart Route Request, which provides an optimization similar to that attainable by intermediate route requests, but without imposing additional processing complexity or additional signaling. A performance study is presented, showing that the use of Smart Route Requests can effectively reduce the control traffic overhead from Route Requests, while retaining the simplicity of LOADng. LOADng with Smart Route Requests effectively reduces control traffic overhead and on-link traffic collisions, and this especially for multipoint-to-point traffic.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
A derivative of AODV , denoted LOADng, is proposed for use in very constrained environment, sacrificing a number of features from AODV for the benefit of smaller control messages and simpler processing logic. Among these sacrifices is intermediate route replies. This paper presents an alternative to intermediate router replies, denoted Smart Route Request, which provides an optimization similar to that attainable by intermediate route requests, but without imposing additional processing complexity or additional signaling. A performance study is presented, showing that the use of Smart Route Requests can effectively reduce the control traffic overhead from Route Requests, while retaining the simplicity of LOADng. LOADng with Smart Route Requests effectively reduces control traffic overhead and on-link traffic collisions, and this especially for multipoint-to-point traffic.
Antonin Bas; Jiazi Yi; Thomas Clausen
Expanding Ring Search for Route Discovery in LOADng Routing Protocol Proceedings Article
In: The 1st International Workshop on Smart Technologies for Energy, Information and Communication, 2012.
@inproceedings{Bas2012,
title = {Expanding Ring Search for Route Discovery in LOADng Routing Protocol},
author = {Antonin Bas and Jiazi Yi and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2012-STEIC-Expanding-Ring-Search-for-Route-Discovery-in-LOADng-Routing-Protocol.pdf},
year = {2012},
date = {2012-10-01},
publisher = {The 1st International Workshop on Smart Technologies for Energy, Information and Communication},
abstract = {LOADng is an on-demand routing protocol, derived from AODV, simplified for use in lossy, low-power and constrained environments, where the ability for devices to communicate is a commodity to their primary function, and where therefore not only the communications channel offers limited capacity, but also the resources available to the device’s communica- tions subsystem are limted.
LOADng simplifies AODV in a number of ways, notably the route discovery process by removing intermediate/gratuitous Route Replies – sacrificing that functionality in order to attain smaller control messages and less router state and processing. Alas, this comes at an expense: in some situations, LOADng produces increased control traffic overhead (as com- pared to AODV), and more control messages transmissions means tapping into the device’s limited resources.
This paper presents a simple mechanism by which to integrate Expanding Ring flooding into LOADng. The mechanism is described, and the result of simulation studies are presented, showing that both in scenarios with “point-to-point” (any-to-any) traffic and in scenarios with “multipoint-to-point” (all traffic sent to the same destination, as in a data acquisition sensor network) traffic, considerable savings in control traffic overhead can be achieved – without loss in data delivery ratios.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
LOADng is an on-demand routing protocol, derived from AODV, simplified for use in lossy, low-power and constrained environments, where the ability for devices to communicate is a commodity to their primary function, and where therefore not only the communications channel offers limited capacity, but also the resources available to the device’s communica- tions subsystem are limted.
LOADng simplifies AODV in a number of ways, notably the route discovery process by removing intermediate/gratuitous Route Replies – sacrificing that functionality in order to attain smaller control messages and less router state and processing. Alas, this comes at an expense: in some situations, LOADng produces increased control traffic overhead (as com- pared to AODV), and more control messages transmissions means tapping into the device’s limited resources.
This paper presents a simple mechanism by which to integrate Expanding Ring flooding into LOADng. The mechanism is described, and the result of simulation studies are presented, showing that both in scenarios with “point-to-point” (any-to-any) traffic and in scenarios with “multipoint-to-point” (all traffic sent to the same destination, as in a data acquisition sensor network) traffic, considerable savings in control traffic overhead can be achieved – without loss in data delivery ratios.
LOADng simplifies AODV in a number of ways, notably the route discovery process by removing intermediate/gratuitous Route Replies – sacrificing that functionality in order to attain smaller control messages and less router state and processing. Alas, this comes at an expense: in some situations, LOADng produces increased control traffic overhead (as com- pared to AODV), and more control messages transmissions means tapping into the device’s limited resources.
This paper presents a simple mechanism by which to integrate Expanding Ring flooding into LOADng. The mechanism is described, and the result of simulation studies are presented, showing that both in scenarios with “point-to-point” (any-to-any) traffic and in scenarios with “multipoint-to-point” (all traffic sent to the same destination, as in a data acquisition sensor network) traffic, considerable savings in control traffic overhead can be achieved – without loss in data delivery ratios.
Thomas Clausen; Jiazi Yi; Axel Colin Verdiere
LOADng: Towards AODV Version 2 Proceedings Article
In: 2012 IEEE 76th Vehicular Technology Conference, 2012.
@inproceedings{Clausen2012,
title = {LOADng: Towards AODV Version 2},
author = {Thomas Clausen and Jiazi Yi and Axel Colin Verdiere},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2012-IEEE-VTC-LOADng-Towards-AODVv2.pdf},
doi = {10.1109/VTCFall.2012.6399334},
year = {2012},
date = {2012-09-01},
publisher = {2012 IEEE 76th Vehicular Technology Conference},
abstract = {The Ad hoc On-demand Distance-Vector routing protocol (AODV) was published in 2003 by the IETF, as ex- perimental RFC 3561. This routing protocol was one of four routing protocols, developed by the IETF for use in mobile ad hoc networks (MANETs) – with the other being DSR, TBRPF and OLSR. As operational experiences with these protocols accumulated, the IETF set forth on standardization of OLSRv2, a successor to OLSR, and DYMO – with DYMO being the intended successor to DSR and AODV. Alas, while there was traction for and standardization of OLSRv2, interest in, development, standardization, and use of DYMO in MANETs slowly withered.
AODV did, however, attract interest for routing in Low-power Lossy Networks (LLNs) due to its limited state requirements. Since 2005, several proposals for simplifying and adapting AODV specifically for LLNs emerged, in 2011 and 2012 with the use of one such adaptation of AODV in the G3-PLC standard for power line communications in smart grids, and with efforts within the IETF emerging towards a single LOADng specification, as next version of AODV.
This paper presents this development – from AODV, as specified in RFC3561 – to LOADng. While the basic operation remains unchanged, LOADng presents simplifications, and additional features and flexibilities are introduced. This paper studies the impact of these changes “from AODV to LOADng”, and observes that LOADng unites simplification, flexibility and performance improvements.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The Ad hoc On-demand Distance-Vector routing protocol (AODV) was published in 2003 by the IETF, as ex- perimental RFC 3561. This routing protocol was one of four routing protocols, developed by the IETF for use in mobile ad hoc networks (MANETs) – with the other being DSR, TBRPF and OLSR. As operational experiences with these protocols accumulated, the IETF set forth on standardization of OLSRv2, a successor to OLSR, and DYMO – with DYMO being the intended successor to DSR and AODV. Alas, while there was traction for and standardization of OLSRv2, interest in, development, standardization, and use of DYMO in MANETs slowly withered.
AODV did, however, attract interest for routing in Low-power Lossy Networks (LLNs) due to its limited state requirements. Since 2005, several proposals for simplifying and adapting AODV specifically for LLNs emerged, in 2011 and 2012 with the use of one such adaptation of AODV in the G3-PLC standard for power line communications in smart grids, and with efforts within the IETF emerging towards a single LOADng specification, as next version of AODV.
This paper presents this development – from AODV, as specified in RFC3561 – to LOADng. While the basic operation remains unchanged, LOADng presents simplifications, and additional features and flexibilities are introduced. This paper studies the impact of these changes “from AODV to LOADng”, and observes that LOADng unites simplification, flexibility and performance improvements.
AODV did, however, attract interest for routing in Low-power Lossy Networks (LLNs) due to its limited state requirements. Since 2005, several proposals for simplifying and adapting AODV specifically for LLNs emerged, in 2011 and 2012 with the use of one such adaptation of AODV in the G3-PLC standard for power line communications in smart grids, and with efforts within the IETF emerging towards a single LOADng specification, as next version of AODV.
This paper presents this development – from AODV, as specified in RFC3561 – to LOADng. While the basic operation remains unchanged, LOADng presents simplifications, and additional features and flexibilities are introduced. This paper studies the impact of these changes “from AODV to LOADng”, and observes that LOADng unites simplification, flexibility and performance improvements.
Jiazi Yi; Thomas Clausen; Axel Colin Verdiere
Efficient Data Acquisition in Sensor Networks:Introducing (the) LOADng Collection Tree Protocol Proceedings Article
In: IEEE WiCom 2012, The 8th IEEE International Conference on Wireless Communications, Networking and Mobile Computing., 2012.
@inproceedings{Clausen2012b,
title = {Efficient Data Acquisition in Sensor Networks:Introducing (the) LOADng Collection Tree Protocol},
author = {Jiazi Yi and Thomas Clausen and Axel Colin Verdiere},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2012-IEEE-WiCOM-Efficient-Data-Acquisition-in-Sensor-NetworksIntroducing-the-LOADng-Collection-Tree-Protocol.pdf},
doi = {10.1109/WiCOM.2012.6478508},
year = {2012},
date = {2012-09-01},
publisher = {IEEE WiCom 2012, The 8th IEEE International Conference on Wireless Communications, Networking and Mobile Computing.},
abstract = {This paper proposes an extension to the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), for efficient construction of a collection tree for data acquisition in sensor networks. The extension uses the mechanisms from LOADng, imposes minimal overhead and complexity, and enables a deployment to efficiently support both “point-to-point” and “multipoint-to-point” traffic, avoiding complications of uni-directional links in the collection tree. This paper further compares the performance of proposed pro-tocol extension to that of basic LOADng and to the protocol RPL (“IPv6 Routing Protocol for Low power and Lossy Networks”).},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper proposes an extension to the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), for efficient construction of a collection tree for data acquisition in sensor networks. The extension uses the mechanisms from LOADng, imposes minimal overhead and complexity, and enables a deployment to efficiently support both “point-to-point” and “multipoint-to-point” traffic, avoiding complications of uni-directional links in the collection tree. This paper further compares the performance of proposed pro-tocol extension to that of basic LOADng and to the protocol RPL (“IPv6 Routing Protocol for Low power and Lossy Networks”).
Jiazi Yi; Thomas Clausen
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Thomas Clausen; Ulrich Herberg
RFC6622: Integrity Check Value and Timestamp TLV Definitions for Mobile Ad Hoc Networks (MANETs) Miscellaneous
2012, (http://tools.ietf.org/html/rfc6622).
@misc{Clausen2012c,
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.
2011
Ulrich Herberg; Thomas Clausen
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.
Ulrich Herberg; Thomas Clausen
A Comparative Performance Study of the Routing Protocols LOAD and RPL with Bi-Directional Traffic in Low-power and Lossy Networks (LLN) Proceedings Article
In: Proceedings of the Eighth ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN), 2011.
@inproceedings{Clausen2011a,
title = {A Comparative Performance Study of the Routing Protocols LOAD and RPL with Bi-Directional Traffic in Low-power and Lossy Networks (LLN)},
author = {Ulrich Herberg and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-PE-WASUN-A-Comparative-Performance-Study-of-the-Routing-Protocols-LOAD-and-RPL-with-Bi-Directional-Traffic-in-Low-power-and-Lossy-Networks-LLN.pdf},
doi = {10.1145/2069063.2069076},
year = {2011},
date = {2011-10-01},
publisher = {Proceedings of the Eighth ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN)},
abstract = {Routing protocols for sensor networks are often designed with explicit assumptions, serving to simplify design and re-duce the necessary energy, processing and communications requirements. Different protocols make different assump-tions – and this paper considers those made by the designers of RPL – an IPv6 routing protocol for such networks, de-veloped within the IETF. Specific attention is given to the predominance of bi-directional traffic flows in a large class of sensor networks, and this paper therefore studies the per-formance of RPL for such flows. As a point of comparison, a different protocol, called LOAD, is also studied. LOAD is derived from AODV and supports more general kinds of traffic flows. The results of this investigation reveal that for scenarios where bi-directional traffic flows are predomi-nant, LOAD provides similar data delivery ratios as RPL, while incurring less overhead and being simultaneously less constrained in the types of topologies supported.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Routing protocols for sensor networks are often designed with explicit assumptions, serving to simplify design and re-duce the necessary energy, processing and communications requirements. Different protocols make different assump-tions – and this paper considers those made by the designers of RPL – an IPv6 routing protocol for such networks, de-veloped within the IETF. Specific attention is given to the predominance of bi-directional traffic flows in a large class of sensor networks, and this paper therefore studies the per-formance of RPL for such flows. As a point of comparison, a different protocol, called LOAD, is also studied. LOAD is derived from AODV and supports more general kinds of traffic flows. The results of this investigation reveal that for scenarios where bi-directional traffic flows are predomi-nant, LOAD provides similar data delivery ratios as RPL, while incurring less overhead and being simultaneously less constrained in the types of topologies supported.
Thomas Clausen; Ulrich Herberg; Matias Philipp
A Critical Evaluation of the “IPv6 Routing Protocol for Low Power and Lossy Networks” (RPL) Proceedings Article
In: Proceedings of the 5th IEEE International Conference on Wireless & Mobile Computing, Networking & Communication (WiMob), 2011.
@inproceedings{Clausen2011b,
title = {A Critical Evaluation of the “IPv6 Routing Protocol for Low Power and Lossy Networks” (RPL)},
author = {Thomas Clausen and Ulrich Herberg and Matias Philipp},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-WiMOB-A-Critical-Evaluation-of-the-IPv6-Routing-Protocol-for-Low-Power-and-Lossy-Networks-RPL.pdf},
doi = {10.1109/WiMOB.2011.6085374},
year = {2011},
date = {2011-10-01},
publisher = {Proceedings of the 5th IEEE International Conference on Wireless & Mobile Computing, Networking & Communication (WiMob)},
abstract = {With RPL – the “IPv6 Routing Protocol for Low-power Lossy Networks” – emerging as a Proposed Standard “Request For Comment” (RFC) in the Internet Engineering Task Force (IETF) after a ∼2-year development cycle, this paper presents a critical evaluation of the resulting protocol and its applicability and limits. The paper presents a selection of observations of the protocol characteristics, exposes experiences acquired when producing a prototype implementation of RPL, and presents results obtained from testing this protocol – both in a network simulator, and in real-world experiments on a wireless sensor network testbed. The paper aims at providing a better understanding of possible weaknesses and limits of RPL, notably the possible directions that further protocol developments should explore, in order to address these.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
With RPL – the “IPv6 Routing Protocol for Low-power Lossy Networks” – emerging as a Proposed Standard “Request For Comment” (RFC) in the Internet Engineering Task Force (IETF) after a ∼2-year development cycle, this paper presents a critical evaluation of the resulting protocol and its applicability and limits. The paper presents a selection of observations of the protocol characteristics, exposes experiences acquired when producing a prototype implementation of RPL, and presents results obtained from testing this protocol – both in a network simulator, and in real-world experiments on a wireless sensor network testbed. The paper aims at providing a better understanding of possible weaknesses and limits of RPL, notably the possible directions that further protocol developments should explore, in order to address these.
Ulrich Herberg; Thomas Clausen
Study of Multipoint-to-Point and Broadcast Traffic Performance in the 'IPv6 Routing Protocol for Low Power and Lossy Networks' (RPL) Journal Article
In: Journal of Ambient Intelligence and Humanized Computing, Springer, ISSN 1868-5137, Volume 2, Number 4, 2011, (http://link.springer.com/article/10.1007/s12652-011-0046-2).
@article{LIX-NET-journal-119,
title = {Study of Multipoint-to-Point and Broadcast Traffic Performance in the 'IPv6 Routing Protocol for Low Power and Lossy Networks' (RPL)},
author = {Ulrich Herberg and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-Journal-of-Ambient-Intelligence-and-Humanized-Computing-Study-of-Multipoint-to-Point-and-Broadcast-Traffic-Performance-in-the-IPv6-Routing-Protocol-for-Low-Power-and-Lossy-Networks-RPL.pdf},
year = {2011},
date = {2011-10-01},
journal = {Journal of Ambient Intelligence and Humanized Computing, Springer, ISSN 1868-5137, Volume 2, Number 4},
abstract = {Recent trends in Wireless Sensor Networks (WSNs) have suggested converging to such being IPv6-based. To this effect, the Internet Engineering Task Force has chartered a Working Group to develop a routing protocol specification, enabling IPv6-based multi-hop Wireless Sensor Networks. This routing protocol, denoted “IPv6 Routing Protocol for Low Power and Lossy Networks” (RPL), has been under development for approximately a year, and this paper takes a critical look at the state of advancement hereof: it provides a brief algorithmic description of the protocol, and discusses areas where—in the authors view—further efforts are required in order for the protocol to become a viable candidate for general use in WSNs. Among these areas is the lack of a proper broadcast mechanism. This paper suggests several such broadcast mechanisms, all aiming at (1) exploiting the existing routing state of RPL, while (2) requiring no additional state maintenance, and studies the performance of RPL and of these suggested mechanisms.},
note = {http://link.springer.com/article/10.1007/s12652-011-0046-2},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Recent trends in Wireless Sensor Networks (WSNs) have suggested converging to such being IPv6-based. To this effect, the Internet Engineering Task Force has chartered a Working Group to develop a routing protocol specification, enabling IPv6-based multi-hop Wireless Sensor Networks. This routing protocol, denoted “IPv6 Routing Protocol for Low Power and Lossy Networks” (RPL), has been under development for approximately a year, and this paper takes a critical look at the state of advancement hereof: it provides a brief algorithmic description of the protocol, and discusses areas where—in the authors view—further efforts are required in order for the protocol to become a viable candidate for general use in WSNs. Among these areas is the lack of a proper broadcast mechanism. This paper suggests several such broadcast mechanisms, all aiming at (1) exploiting the existing routing state of RPL, while (2) requiring no additional state maintenance, and studies the performance of RPL and of these suggested mechanisms.
Jiazi Yi; Thomas Clausen; Ulrich Herberg
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).
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Thomas Clausen; Axel Colin Verdiere
The LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation (LOADng) Technical Report
2011.
@techreport{Clausen2011,
title = {The LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation (LOADng)},
author = {Thomas Clausen and Axel Colin Verdiere},
year = {2011},
date = {2011-07-01},
publisher = {INRIA Research Report 7692},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Emmanuel Baccelli
Introduction à la science informatique Book Section
In: http://crdp.ac-paris.fr/Introduction-a-la-science,27388, 2011.
@incollection{Clausen2011bb,
title = {Introduction à la science informatique},
author = {Thomas Clausen and Emmanuel Baccelli},
year = {2011},
date = {2011-07-01},
booktitle = {http://crdp.ac-paris.fr/Introduction-a-la-science,27388},
keywords = {},
pubstate = {published},
tppubtype = {incollection}
}
Jiazi Yi; Thomas Clausen; Ulrich Herberg
Vulnerability Analysis of the Simple Multicast Forwarding (SMF) Protocol for Mobile Ad Hoc Networks Technical Report
2011.
@techreport{LIX-NET-RR-106,
title = {Vulnerability Analysis of the Simple Multicast Forwarding (SMF) Protocol for Mobile Ad Hoc Networks},
author = {Jiazi Yi and Thomas Clausen and Ulrich Herberg},
year = {2011},
date = {2011-06-01},
publisher = {INRIA Research Report 7638},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Ulrich Herberg
A Comparative Performance Study of the Routing Protocols LOAD and RPL with Bi-Directional Traffic in Low-power and Lossy Networks (LLN) Technical Report
2011.
@techreport{Clausen2011bbb,
title = {A Comparative Performance Study of the Routing Protocols LOAD and RPL with Bi-Directional Traffic in Low-power and Lossy Networks (LLN)},
author = {Thomas Clausen and Ulrich Herberg},
year = {2011},
date = {2011-06-01},
publisher = {INRIA Research Report 7637},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Ulrich Herberg; Thomas Clausen
Delay Tolerant Routing with OLSRv2 Technical Report
2011.
@techreport{Herberg2011b,
title = {Delay Tolerant Routing with OLSRv2},
author = {Ulrich Herberg and Thomas Clausen},
year = {2011},
date = {2011-06-01},
publisher = {INRIA Research Report 7662},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Ulrich Herberg; Matias Philipp
A Critical Evaluation of the "IPv6 Routing Protocol for Low Power and Lossy Networks" (RPL) Technical Report
2011.
@techreport{LIX-NET-RR-107,
title = {A Critical Evaluation of the "IPv6 Routing Protocol for Low Power and Lossy Networks" (RPL)},
author = {Thomas Clausen and Ulrich Herberg and Matias Philipp},
year = {2011},
date = {2011-05-01},
publisher = {INRIA Research Report 7633},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Ulrich Herberg
Some Considerations on Routing in Particular and Lossy Environments Proceedings Article
In: Proceedings of the 1st Interconnecting Smart Objects with the Internet Workshop, 2011.
@inproceedings{Clausen2011d,
title = {Some Considerations on Routing in Particular and Lossy Environments},
author = {Thomas Clausen and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-IAB-Some-Considerations-on-Routing-In-Particular-and-Lossy-Environments.pdf},
year = {2011},
date = {2011-03-01},
publisher = {Proceedings of the 1st Interconnecting Smart Objects with the Internet Workshop},
abstract = {RPL – the “Routing Protocol for Low Power and Lossy Networks” (RPL) [1] – is a proposal for an IPv6 routing pro-tocol for Low-power Lossy Networks (LLNs), by the ROLL Working Group in the Internet Engineering Task Force (IETF). The basic construct in RPL is a DODAG – a destination oriented directed acyclic graph, rooted in a “controller”. Traffic inside the LLN flows along this DODAG, either up-ward (towards the “controller”) or downward. In RPL, upward routes, having the controller as destination (either by way of explicitly addressing the destination, or by using the controller as “gateway”), are provided by the DODAG construction mechanism: each LLN router selects a set of parents, on a path towards the controller, as well as a preferred parent. Once a router is part of a DODAG (i.e. has selected parents) will emit DODAG Information Object (DIO) messages, using link-local multicasting, indicating its respective rank in the DODAG (i.e. its position – distance according to some metric(s), in the simplest form hop-count – with respect to the root). Routes for any destination inside the LLN, other than the controller, are provided by these destinations generating Destination Advertisement Objects (DAOs).},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
RPL – the “Routing Protocol for Low Power and Lossy Networks” (RPL) [1] – is a proposal for an IPv6 routing pro-tocol for Low-power Lossy Networks (LLNs), by the ROLL Working Group in the Internet Engineering Task Force (IETF). The basic construct in RPL is a DODAG – a destination oriented directed acyclic graph, rooted in a “controller”. Traffic inside the LLN flows along this DODAG, either up-ward (towards the “controller”) or downward. In RPL, upward routes, having the controller as destination (either by way of explicitly addressing the destination, or by using the controller as “gateway”), are provided by the DODAG construction mechanism: each LLN router selects a set of parents, on a path towards the controller, as well as a preferred parent. Once a router is part of a DODAG (i.e. has selected parents) will emit DODAG Information Object (DIO) messages, using link-local multicasting, indicating its respective rank in the DODAG (i.e. its position – distance according to some metric(s), in the simplest form hop-count – with respect to the root). Routes for any destination inside the LLN, other than the controller, are provided by these destinations generating Destination Advertisement Objects (DAOs).
Phil Levis; Thomas Clausen; Jonatan Hui; Omprakash Gnawali; JeongGil Ko
RFC6206: The Trickle Algorithm Miscellaneous
2011, (http://tools.ietf.org/html/rfc6206).
@misc{Levis2011,
title = {RFC6206: The Trickle Algorithm},
author = {Phil Levis and Thomas Clausen and Jonatan Hui and Omprakash Gnawali and JeongGil Ko},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc6206.txt.pdf},
doi = {10.17487/RFC6206},
year = {2011},
date = {2011-03-01},
publisher = {IETF - Std. Track RFC 6206},
organization = {The Internet Engineering Task Force},
abstract = {The Trickle algorithm allows nodes in a lossy shared medium (e.g., low-power and lossy networks) to exchange information in a highly robust, energy efficient, simple, and scalable manner. Dynamically adjusting transmission windows allows Trickle to spread new information on the scale of link-layer transmission times while sending only a few messages per hour when information does not change. A simple suppression mechanism and transmission point selection allow Trickle's communication rate to scale logarithmically with density. This document describes the Trickle algorithm and considerations in its use.},
note = {http://tools.ietf.org/html/rfc6206},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
The Trickle algorithm allows nodes in a lossy shared medium (e.g., low-power and lossy networks) to exchange information in a highly robust, energy efficient, simple, and scalable manner. Dynamically adjusting transmission windows allows Trickle to spread new information on the scale of link-layer transmission times while sending only a few messages per hour when information does not change. A simple suppression mechanism and transmission point selection allow Trickle's communication rate to scale logarithmically with density. This document describes the Trickle algorithm and considerations in its use.
Thomas Clausen; Christopher Dearlove; Justin Dean
RFC6130: Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP) Miscellaneous
2011, (http://tools.ietf.org/html/rfc6130).
@misc{Clausen2011bbc,
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).
Thomas Clausen; Ulrich Herberg
Some Considerations on Routing In Particular and Lossy Environments Technical Report
2011.
@techreport{LIX-NET-RR-99,
title = {Some Considerations on Routing In Particular and Lossy Environments},
author = {Thomas Clausen and Ulrich Herberg},
year = {2011},
date = {2011-02-01},
publisher = {INRIA Research Report 7540},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Juan Antonio Cordero; Thomas Clausen; Emmanuel Baccelli
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF Proceedings Article
In: Hawaii International Conference on System Sciences, 2011.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Juan Antonio Cordero; Emmanuel Baccelli; Philippe Jacquet; Thomas Clausen
Wired/Wireless Compound Networking Book Section
In: "Mobile Ad-Hoc Networks: Applications", Book edited by: Xin Wang, ISBN: 978-953-307-416-0, Publisher: InTech., 2011.
@incollection{LIX-NET-book-chapter-98,
title = {Wired/Wireless Compound Networking},
author = {Juan Antonio Cordero and Emmanuel Baccelli and Philippe Jacquet and Thomas Clausen},
year = {2011},
date = {2011-01-01},
booktitle = {"Mobile Ad-Hoc Networks: Applications", Book edited by: Xin Wang, ISBN: 978-953-307-416-0, Publisher: InTech.},
keywords = {},
pubstate = {published},
tppubtype = {incollection}
}
2010
Thomas Clausen; Ulrich Herberg
Comparative Study of RPL-Enabled Optimized Broadcast in Wireless Sensor Networks Proceedings Article
In: Proceedings of the 6th International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP), 2010.
@inproceedings{Clausen2010e,
title = {Comparative Study of RPL-Enabled Optimized Broadcast in Wireless Sensor Networks},
author = {Thomas Clausen and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-ISSNIP-Comparative-Study-of-RPL-Enabled-Optimized-Broadcast-in-Wireless-Sensor-Networks.pdf},
doi = {10.1109/ISSNIP.2010.5706795},
year = {2010},
date = {2010-12-01},
publisher = {Proceedings of the 6th International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP)},
abstract = {Recent trends have suggested convergence to Wire-less Sensor Networks (WSNs) becoming IPv6-based. To this effect, the Internet Engineering Task Force has chartered a Work-ing Group to develop a routing protocol specification, enabling IPv6-based multi-hop Wireless Sensor Networks. The current effort of this working group is development of a uni-cast routing protocol denoted RPL. RPL constructs a “DAG-like” logical structure with a single root, at which the majority of the traffic flows terminate, and assumes restrictions on network dynamics and traffic generality, in order to satisfy strict constraints on router state and processing. This paper investigates the possibility for providing (effi-cient) network-wide broadcast mechanisms in WSNs, using the logical structure already provided by RPL. The aim hereof is to not impose any additional state requirements on WSN routers already running RPL. This paper presents two such broadcast mechanisms for RPL routed WSNs, and evaluates their performances. As part of this evaluation, the paper compares with MPR Flooding – an established efficient flooding optimization, widely used in MANETs.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Recent trends have suggested convergence to Wire-less Sensor Networks (WSNs) becoming IPv6-based. To this effect, the Internet Engineering Task Force has chartered a Work-ing Group to develop a routing protocol specification, enabling IPv6-based multi-hop Wireless Sensor Networks. The current effort of this working group is development of a uni-cast routing protocol denoted RPL. RPL constructs a “DAG-like” logical structure with a single root, at which the majority of the traffic flows terminate, and assumes restrictions on network dynamics and traffic generality, in order to satisfy strict constraints on router state and processing. This paper investigates the possibility for providing (effi-cient) network-wide broadcast mechanisms in WSNs, using the logical structure already provided by RPL. The aim hereof is to not impose any additional state requirements on WSN routers already running RPL. This paper presents two such broadcast mechanisms for RPL routed WSNs, and evaluates their performances. As part of this evaluation, the paper compares with MPR Flooding – an established efficient flooding optimization, widely used in MANETs.
Emmanuel Baccelli; Thomas Clausen; Ryuji Wakikawa
IPv6 Operation for WAVE - Wireless Access in Vehicular Environments Proceedings Article
In: Proceedings of IEEE VNC 2010, Jersey City, USA, 2010.
@inproceedings{Clausen2010f,
title = {IPv6 Operation for WAVE - Wireless Access in Vehicular Environments},
author = {Emmanuel Baccelli and Thomas Clausen and Ryuji Wakikawa},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-VNC-IPv6-Operation-for-WAVE-Wireless-Access-in-Vehicular-Environments.pdf},
doi = {10.1109/VNC.2010.5698260},
year = {2010},
date = {2010-12-01},
publisher = {Proceedings of IEEE VNC 2010, Jersey City, USA},
abstract = {The IEEE WAVE protocol suite is providing commu- nications services to applications in vehicular networks, by way of promising support for two protocol stacks: the Wave Short Message Protocol (WSMP) and IPv6. While WSMP is developed within the IEEE 1609 family of standards, the authors of this paper assert, that considerations for IPv6 operation for WAVE are less developed, and several issues are left unaddressed by the current IEEE 1609 specifications. This paper reviews these issues and analyzes the main challenges in providing proper IPv6 operation for WAVE networks.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The IEEE WAVE protocol suite is providing commu- nications services to applications in vehicular networks, by way of promising support for two protocol stacks: the Wave Short Message Protocol (WSMP) and IPv6. While WSMP is developed within the IEEE 1609 family of standards, the authors of this paper assert, that considerations for IPv6 operation for WAVE are less developed, and several issues are left unaddressed by the current IEEE 1609 specifications. This paper reviews these issues and analyzes the main challenges in providing proper IPv6 operation for WAVE networks.
Ulrich Herberg; Thomas Clausen
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Ulrich Herberg; Thomas Clausen; Robert G. Cole
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.
Thomas Clausen; Ulrich Herberg
Multipoint-to-Point and Broadcast in RPL Proceedings Article
In: Proceedings of the First International Symposium on Frontiers in Ubiquitous Computing, Networking and Applications (NeoFUSION 2010), 2010.
@inproceedings{Clausen2010h,
title = {Multipoint-to-Point and Broadcast in RPL},
author = {Thomas Clausen and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-NeoFUSION-Multipoint-to-Point-and-Broadcast-in-RPL.pdf},
doi = {10.1109/NBiS.2010.38},
year = {2010},
date = {2010-09-01},
publisher = {Proceedings of the First International Symposium on Frontiers in Ubiquitous Computing, Networking and Applications (NeoFUSION 2010)},
abstract = {Recent trends in Wireless Sensor Networks (WSNs) have suggested converging to such being IPv6-based. To this effect, the Internet Engineering Task Force has chartered a Working Group to develop a routing protocol specification, enabling IPv6-based multi-hop Wireless Sensor Networks. This routing protocol, denoted RPL, has been under development for approximately a year, and this paper takes a critical look at the state of advancement hereof: it provides a brief algorithmic description of the protocol, and discusses areas where – in the authors view – further efforts are required in order for the protocol to become a viable candidate for general use in WSNs. Among these areas is the lack of a proper broadcast mechanism. This paper suggests two such broadcast mechanisms, both aiming at (i) exploiting the existing routing state of RPL, while (ii) requiring no additional state maintenance, and studies the performance of RPL and of these suggested mechanisms.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Recent trends in Wireless Sensor Networks (WSNs) have suggested converging to such being IPv6-based. To this effect, the Internet Engineering Task Force has chartered a Working Group to develop a routing protocol specification, enabling IPv6-based multi-hop Wireless Sensor Networks. This routing protocol, denoted RPL, has been under development for approximately a year, and this paper takes a critical look at the state of advancement hereof: it provides a brief algorithmic description of the protocol, and discusses areas where – in the authors view – further efforts are required in order for the protocol to become a viable candidate for general use in WSNs. Among these areas is the lack of a proper broadcast mechanism. This paper suggests two such broadcast mechanisms, both aiming at (i) exploiting the existing routing state of RPL, while (ii) requiring no additional state maintenance, and studies the performance of RPL and of these suggested mechanisms.
Thomas Clausen; Ulrich Herberg
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
Thomas Clausen; Ulrich Herberg
Study of Multipoint-to-Point and Broadcast Traffic Performance in RPL Technical Report
2010.
@techreport{Clausen2010bb,
title = {Study of Multipoint-to-Point and Broadcast Traffic Performance in RPL},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-09-01},
publisher = {INRIA Research Report RR-7384},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Emmanuel Baccelli; Ryuji Wakikawa
IPv6 Operation for WAVE - Wireless Access in Vehicular Environments Technical Report
2010.
@techreport{Clausen2010bbb,
title = {IPv6 Operation for WAVE - Wireless Access in Vehicular Environments},
author = {Thomas Clausen and Emmanuel Baccelli and Ryuji Wakikawa},
year = {2010},
date = {2010-09-01},
publisher = {INRIA Research Report RR-7383},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Ulrich Herberg; Thomas Clausen; Jerome Milan
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.
Thomas Clausen; Ulrich Herberg
Yet Another Autoconf Proposal (YAAP) for Mobile Ad hoc NETworks Technical Report
2010.
@techreport{Clausen2010bbc,
title = {Yet Another Autoconf Proposal (YAAP) for Mobile Ad hoc NETworks},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-07-01},
publisher = {INRIA Research Report 7341},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Ulrich Herberg
MANET Network Management and Performance Monitoring for NHDP and OLSRv2 Technical Report
2010.
@techreport{Clausen2010bbd,
title = {MANET Network Management and Performance Monitoring for NHDP and OLSRv2},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-06-01},
publisher = {INRIA Research Report 7311},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Ulrich Herberg
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.
Thomas Clausen; Ulrich Herberg
Comparative Study of RPL-Enabled Optimized Broadcast in Wireless Sensor Networks Technical Report
2010.
@techreport{Clausen2010bbe,
title = {Comparative Study of RPL-Enabled Optimized Broadcast in Wireless Sensor Networks},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-05-01},
publisher = {INRIA Research Report 7296},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Ulrich Herberg; Thomas Clausen
Security Issues in the Optimized Link State Routing Protocol Version 2 (OLSRV2) Journal Article
In: International Journal of Network Security & Its Applications (IJNSA), 2010.
@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.
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.
Thomas Clausen; Ulrich Herberg
Multipoint-to-Point and Broadcast in RPL Technical Report
2010.
@techreport{Clausen2010bbf,
title = {Multipoint-to-Point and Broadcast in RPL},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-04-01},
publisher = {INRIA Research Report 7244},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Ulrich Herberg
Router and Link Admittance Control in the Optimized Link State Routing Protocol version 2 (OLSRv2) Technical Report
2010.
@techreport{Clausen2010bbg,
title = {Router and Link Admittance Control in the Optimized Link State Routing Protocol version 2 (OLSRv2)},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-04-01},
publisher = {INRIA Research Report 7248},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Ulrich Herberg
Vulnerability Analysis of the Optimized Link State Routing Protocol version 2 (OLSRv2) Technical Report
2010.
@techreport{Clausen2010bbh,
title = {Vulnerability Analysis of the Optimized Link State Routing Protocol version 2 (OLSRv2)},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-02-01},
publisher = {INRIA Research Report 7203},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Ulrich Herberg; Jerome Milan
Digital Signatures for Admittance Control in the Optimized Link State Routing Protocol version 2 Technical Report
2010.
@techreport{Clausen2010bbi,
title = {Digital Signatures for Admittance Control in the Optimized Link State Routing Protocol version 2},
author = {Thomas Clausen and Ulrich Herberg and Jerome Milan},
year = {2010},
date = {2010-02-01},
publisher = {INRIA Research Report 7216},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Ulrich Herberg
Security Issues in the Optimized Link State Routing Protocol version 2 (OLSRv2)) Technical Report
2010.
@techreport{Clausen2010bbj,
title = {Security Issues in the Optimized Link State Routing Protocol version 2 (OLSRv2))},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-02-01},
publisher = {INRIA Research Report 7218},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Ulrich Herberg; Nestor Mariyasagayam; Thomas Clausen
Comparison of NHDP and MHVB for Neighbor Discovery in Multi-hop Ad Hoc Networks Technical Report
2010.
@techreport{LIX-NET-RR-25,
title = {Comparison of NHDP and MHVB for Neighbor Discovery in Multi-hop Ad Hoc Networks},
author = {Ulrich Herberg and Nestor Mariyasagayam and Thomas Clausen},
year = {2010},
date = {2010-01-01},
publisher = {INRIA Research Report RR-7173},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
2009
Emmanuel Baccelli; Thomas Clausen; Ulrich Herberg; Charles E. Perkins
IP Links in Multihop Ad Hoc Wireless Networks? Proceedings Article
In: Proceedings of SoftCom, 2009.
@inproceedings{Clausen2009,
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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Emmanuel Baccelli; Thomas Clausen; Philippe Jacquet
The Internet Engineering Task Force and the Future of the Internet Book Section
In: ERCIM News, no. 77, pp. 20-21, European Research Consortium for Informatics and Mathematics, 2009.
@incollection{Clausen2009b,
title = {The Internet Engineering Task Force and the Future of the Internet},
author = {Emmanuel Baccelli and Thomas Clausen and Philippe Jacquet},
year = {2009},
date = {2009-04-21},
booktitle = {ERCIM News},
journal = {European Research Consortium for Informatics and Mathematics, ERCIM News issue n°77, p. 20-21},
number = {77},
pages = {20-21},
publisher = {European Research Consortium for Informatics and Mathematics},
keywords = {},
pubstate = {published},
tppubtype = {incollection}
}
Thomas Clausen; Christopher Dearlove
RFC5497: Representing Multi-Value Time in MANETs Miscellaneous
2009, (http://www.rfc-editor.org/rfc/rfc5497.txt).
@misc{Clausen2009c,
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.
Thomas Clausen; Christopher Dearlove; Justin Dean; Cedric Adjih
RFC5444 - Generalized Mobile Ad Hoc Network (MANET) Packet/Message Format Miscellaneous
2009, (http://www.ietf.org/rfc/rfc5444.txt).
@misc{Clausen2009d,
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.
Emmanuel Baccelli; Thomas Clausen; Philippe Jacquet; Dang Nguyen
RFC5449 - OSPF Multipoint Relay (MPR) Extension for Ad Hoc Networks Miscellaneous
2009, (http://tools.ietf.org/html/rfc5449).
@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 = {},
pubstate = {published},
tppubtype = {misc}
}
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.
Thomas Clausen
MANET Router Configuration Recommendations Technical Report
2009.
@techreport{Clausen2009bb,
title = {MANET Router Configuration Recommendations},
author = {Thomas Clausen},
year = {2009},
date = {2009-02-01},
publisher = {Inria Research Report RR-6852},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}