They will present the paper "Vulnerability Analysis of the Optimized Link State Routing Protocol version 2 (OLSRv2)". Part of the OLSRv2 Security series of publications documenting efforts on providing secure, OLSRv2-based networks, this paper analyses various attack vectors on an OLSRv2-based network.

Here's some more OLSRv2-security-related information on the Hipercom@LIX website:
Securing OLSRv2
+ More]]> Juan Antonio will present the paper "Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs", joint work with Emmanuel Baccelli and Philippe Jacquet in which it is described and analysed an RNG-based algorithm to construct a reduced network overlay, the Synchronized Link Overlay (SLO-T), useful for reliable exchange of critical information in mobile ad hoc networks.
+ More]]> On June 23, 2010 at 14h30, Emmanuel Baccelli participates in a round-table on the subject "Les citoyens acteurs de la ville participative : de nouveaux outils pour de nouveaux usages" (roughly translated: "Inhabitant-participation in city-life: new tools for new uses"). This round-table is part of the workshop "Les sciences numérique au service de la ville durable" (roughly translated: "Digital sciences in the service of sustainable cities").

Other than Emmanuel Baccelli, this round-table consists of Wendy MacKay, Peter Tolmie, Daniel Kaplan, Mikael Kais and Jean-Michel Flamant.

Free entry to the event, check the link for details.
+ More]]>
The Hipercom Team
Hipercom federates three groups of researchers, located at INRIA, LRI and at Ecole Polytechnique, forming a broad team on research in computer networks and telecommunications, in particular wireless and ad hoc networking. The combined size of the team is about 30 people, including staff researchers and students.
For details of the activities within Hipercom @LIX, as well as information on our team members, please explore the menu on the left.]]>

Publication date:	2010-04-01
Authors:	U. Herberg, T. Clausen
Published in:	International Journal of Network Security & Its Applications (IJNSA)
URL:	http://airccse.org/journal/jnsa10_cur...

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.
Download File ]]>

Publication date:	2009-03-13
Authors:	T. Clausen, C. Dearlove
Published in:	IETF - Std. Track RFC
URL:	http://www.rfc-editor.org/rfc/rfc5497...

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.
Download File ]]>

Publication date:	2009-02-09
Authors:	E. Baccelli, T. Clausen, P. Jacquet. D. Nguyen
Published in:	IETF - Exp. RFC
URL:	http://www.rfc-editor.org/rfc/rfc5449...

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".
Download File ]]>

Publication date:	2009-02-05
Authors:	T. Clausen, C. Dearlove, J. Dean, C. Adjih
Published in:	IETF - Std. Track RFC
URL:	http://www.ietf.org/rfc/rfc5444.txt

This document specifies a packet format capable of carrying multiple messages that may be used by mobile ad hoc network routing protocols.
Download File ]]>

Publication date:	2008-02-27
Authors:	T. Clausen, C. Dearlove, B. Adamson
Published in:	RFC
URL:	http://www.rfc-editor.org/rfc/rfc5148...

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. This memo provides information for the Internet community.
Download File ]]>

Publication date:	2003-10-01
Authors:	T. Clausen, P. Jacquet
Published in:	The Internet Engineering Task Force (IETF) - MANET Working Group
URL:	http://www.ietf.org/html.charters/man...

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.
Download File ]]> A routing protocol for Mobile Ad hoc NETworks (MANETs) developed integrally by the Hipercom project team, OLSR has become standardised and widely adopted: Google references OLSR with more than 450,000 hits, DARPA uses it as its reference protocol for its tactical networks, there are many urban deployments of OLSR based MESH WiFi networks, and industrial adoption of OLSR is significant.

Indeed, the OLSR protocol is a rare example of IETF standardisation of a protocol driven from the very beginning (development of algorithms and ideas) to the very end (formal publication of a protocol specification as an RFC - an official document sanctioning the protocol as adopted by the IETF) by a single academic actor - the Hipercom project team.

+ More]]> A Simple, Modular and Standardized Ad Hoc Routing Protocol
The year is 2003, and the IETF has published OLSR as RFC3626....and you'd think that'd be the end of it.

Alas, in 2005, the IETF decided that time had come to advance OLSR from Experimental RFC onto Standards Track, and so, th Hipercom team once again swung into action and OLSRv2 saw the light of day. Based on the same algorithms and ideas as OLSR contained in RFC3626, OLSRv2 builds on the experience gained by a wide community from tests and deployments over the years since RFC3626, and features a more modular and extensible architecture, while being simpler and more efficient than its predecessor.

Hipercom@LIX is at the heart of OLSRv2, and more specific information on OLSRv2 research and development in Hipercom@LIX can be found here:

[*] OLSRv2 Standardization
[*] OLSRv2 Interops
[*] Securing OLSRv2
[*] OLSRv2 Protocol Suite Interop Tools
[*] Simulation of Java Routing Protocols with Ns2

As with OLSR (RFC3626), the OLSRv2 efforts are lead by Thomas Clausen (Hipercom@LIX)
+ More]]> Getting the First Step Right
One of the assumptions, often brought forward when discussing MANETs is, that they're self-organizing and that a pre-determined infrastructure can not be assumed present to ensure correct operation.

For this to hold true, routers in a MANET must be able to self-configure with their necessary interface parameters -- notably, they must be able to acquire suitable and unique prefixes for assigning addresses to hosts, associated to a MANET router. In the dynamic environment of a MANET, this presents a quite unique challenge.

The IETF AUTOCONF working group, chartered in the fall of 2005 with the task of developing MANET autoconfiguration protocols for IPv6. The working group is co-chaired by Thomas Clausen (Hipercom @LIX).

+ More]]> Extending the Internet beyond fixed routers
OSPF does not work 'as is' on mobile ad hoc networks. OSPF's trademark as a generic Internet routing solution is thus somewhat endangered by the emergence of MANETs.

Since 2005, the IETF is addressing this novelty and working on the standardization of an extension of OSPF for mobile ad hoc networks. Hipercom of course actively participates in this process, since it builds up on MANET experience with proactive routing, and thus OLSR-derived techniques.

We consider a wireless extension for OSPF based on OLSR (RFC3626), the MANET proactive protocol that has emerged as the simplest and most robust solution for mobile ad hoc routing.

This extension has been published as RFC5449 - OSPF MPR Extension for Ad Hoc Networks and defines an OSPFv3 MANET interface type, allowing OSPFv3 deployments including also areas with MANET characteristics.

Hipercom's OSPF standardization effort is being lead by Emmanuel Baccelli.

The implementation and experimental efforts are being lead by Juan Antonio Cordero Fuertes (Hipercom@LIX).
]]> Towards light weight ubiquitous networking
Self-organization is considered as a key element in tomorrow's Internet architecture. A major challenge concerning the integration of self-organized networks in the Internet is the accomplishment of light weight network protocols in large ad hoc environments.

In this domain, Hipercom's activity with wireless sensor nodes in collaboration with the Freie Universitaet in Berlin explores various solutions, including extensions of OLSR (for example DHT-OLSR) using programmable sensor nodes co-designed by the Freie Universitaet, and provides one of the largest testbeds of this kind, to date.

Additionally, we're happy to make available a muOLSR for Scatterweb implementation.
]]> Efficient and Simple Multicasting
In traditional communication systems, nodes exchange data in packets, through relaying by intermediate nodes without modification of their content (routing). Seminal work from Ahlswede, Cai, Li and Yeung in has introduced the idea of network coding, whereby intermediate nodes are mixing information from different flows (different bits or different packets), for instance performing "exclusive or" between packets, before retransmitting them.

Since the introduction of the concept, many results have blossomed including methods for coding, evaluation of its performance, algorithms, mecanisms, proof of concept implementations, ...

The Hipercom team is studying network coding specifically for MANET networks. It is mostly used as an efficient multicast/broadcast method (limiting the number of transmissions), and also as a reliable flooding mecanism. Hipercom has proven some theoretical results: the optimality of network coding for asymptotically large and dense wireless networks, and also its advantage over non-coding.

Work is ongoing to adjust this theoretic asymptotic result to practice: we are developing dynamic adaptative algorithms, that are resilient to loss and mobility, while they attempt to approach the optimality. The theoretic capacity of network coding in smaller instances of wireless networks is also explored.]]> Intermittent Connectivity
A network may be continuously partitioned due to high mobility, and the traditional approach to allow a mobile node to wait for the network to be fully connected (i.e. form a unique component) or to wait to be in range of the destination may lead to unacceptable delays. Furthermore, concrete applications, such as Defence and Disaster-Relief, cannot always rely on such assumptions.

Nevertheless, even if the communicating nodes may never be within the same connected component, it is important to observe that a ``communication path'' may be available over time using intermediate nodes that are temporarily within reach of each other while moving, hence making such networks viable for critical applications.

Depending on the nature of the environment, these networks are now commonly referred as Intermittently Connected MANET and Delay Tolerant Networks.
]]> Preserving OLSR Network Integrity
A significant issue in the ad-hoc domain is that of the integrity of the network itself. Routing protocols allow, according to their specifications, any node to participate in the network - the assumption being that all nodes are behaving well and welcome. If that assumption fails - then the network may be subject to malicious nodes, and the integrity of the network fails.

An important security service over mobile networks is to ensure that the integrity of the network is preserved even when attacks are launched against the integrity of the network.

Hipercom@LIX has allied with TANC@LIX - a research group specialised in cryptography and security, which has developed strong security mechanisms yielding short cryptographic signatures which can be rapidly verified.

The goal of this Hipercom/TANC alliance is to develop secure OLSR networks, suitable for real-world deployments where network integrity is paramount.

More information on the "Securing OLSRv2" pages]]>

Publication date:	2010-07-21
Authors:	T. Clausen, U. Herberg
Published in:	INRIA Research Report 7341
URL:	http://hal.inria.fr/inria-00504820/en/

This memorandum 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. Furthermore, a performance study of the basic protocol, as well as of various optimization and extensions hereto, is conducted based on network simulations.
Download File ]]>

Publication date:	2010-07-12
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-14
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2010-07-12
Authors:	Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-13
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2010-07-12
Authors:	U. Herberg, R. Cole, T. Clausen
Published in:	draft-ietf-manet-olsrv2-mib-02
URL:	http://tools.ietf.org/html/draft-ietf...

This memo defines the Management Information Base (MIB) for configuring and managing the Optimized Link State Routing protocol version 2 (OLSRv2). The Optimized Link State Routing MIB is structured into state information, performance metrics, and notifications. This additional state and performance information is useful to troubleshoot problems and performance issues of the routing protocol. Different levels of compliances allow implementors to use smaller subsets of all defined objects, allowing for this MIB to be deployed on more constrained routers.
Download File ]]>

Publication date:	2010-07-08
Authors:	U. Herberg, R. Cole, I. Chakeres
Published in:	draft-ietf-manet-nhdp-mib-04
URL:	http://tools.ietf.org/html/draft-ietf...

This memo 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 MIB defined in this memo, denoted NHDP-MIB, also reports state, performance information and notifications. This additional state and performance information is useful to troubleshoot problems and performance issues during neighbor discovery.
Download File ]]>

Publication date:	2010-07-05
Authors:	U. Herberg, T. Clausen
Published in:	draft-herberg-autoconf-yaap-00
URL:	http://tools.ietf.org/html/draft-herb...

This document describes automatic configuration of MANET router interfaces, as well as prefix delegation to MANET routers. 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.
Download File ]]>

Publication date:	2010-06-30
Authors:	J. A. Cordero
Published in:	INRIA Research Report RR-7329
URL:	http://hal.inria.fr/inria-00496617/fr/

Multi-Point Relaying (MPR) is a well-known relay pruning algorithm that has proved to be useful for efficient dissemination in Mobile Ad hoc Networks (MANETs). But this technique may be useful for other tasks in MANET link-state routing as well. In particular, the approach is attractive for the selection of topology information to be flooded across the network. Requirements for such topology selection are however different from those applying for efficient dissemination, so approaches in such direction need to address these requirements and adapt or complement the MPR mechanism accordingly. This paper analyzes the main asymptotic properties of MPR and MPR-based topology selection algorithms, and provides sufficient conditions for the correctness of MPR-based topology selection. It examines as well in detail the MPR-based topology selection algorithm of MPR-OSPF, Path MPR, and shows that this algorithm may be unable, in certain conditions, to preserve optimal routes in its topology selection. The paper concludes by proposing and validating a modification of the Path MPR algorithm to overcome this sub-optimal performance.
Download File ]]>

Publication date:	2010-06-25
Authors:	T. Clausen, U. Herberg
Published in:	Proceedings of the IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS2010)
URL:	http://www.ieee-wcnis.org/

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.
Download File ]]>

Publication date:	2010-06-21
Authors:	E. Baccelli, J. A. Cordero, P. Jacquet
Published in:	Proceedings of the Fifth IEEE Workshop on Wireless Mesh Networks (WiMesh 2010)

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 commu- nications. 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.
Download File ]]>

Publication date:	2010-06-20
Authors:	U. Herberg, T. Clausen
Published in:	draft-ietf-manet-packetbb-sec-00
URL:	http://tools.ietf.org/html/draft-ietf...

This document describes a general and flexible TLV (type-length-value structure) for representing cryptographic signatures as well as timestamps, using the generalized MANET packet/message format [RFC5444]. It defines two Packet TLVs, two Message TLVs, and two Address Block TLVs, for affixing cryptographic signatures and timestamps to a packet, message and address, respectively.
Download File ]]>

Publication date:	2010-06-15
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-dearlove-olsrv2-metrics-05
URL:	https://datatracker.ietf.org/doc/draf...

This document describes how link metrics may be added, in a relatively straightforward manner, to the specification of OLSRv2, in order to allow routing by other than minimum hop count routes. In addition to metric signaling and use, the most significant change is a separation of the routing and flooding functions of MPRs.
Download File ]]>

Publication date:	2010-06-15
Authors:	J. A. Cordero, E. Baccelli, T. Clausen
Published in:	INRIA Research Report 7319
URL:	http://hal.inria.fr/inria-00492439/en/

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, \eg 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 memorandum 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.
Download File ]]>

Publication date:	2010-06-10
Authors:	T. Clausen, U. Herberg
Published in:	INRIA Research Report 7311
URL:	http://hal.inria.fr/inria-00490958/en/

Mobile Ad Hoc NETworks (MANETs) are generally 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 performance 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.
Download File ]]>

Publication date:	2010-05-31
Authors:	T. Clausen, U. Herberg
Published in:	INRIA Research Report 7296
URL:	http://hal.archives-ouvertes.fr/inria...

Recent trends have suggested convergence to Wireless Sensor Networks (WSNs) becoming 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 WSNs. The current effort of this working group is development of a unicast 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 memorandum investigates the possibility for providing (efficient) network-wide broadcast mechanisms in WSNs, using the logical structure already established by RPL. The aim hereof is to impose minimal additional state requirements on WSN routers, beyond that already maintained by RPL. This memorandum presents a selection of such broadcast mechanisms for RPL routed WSNs, and evaluates their performances. As part of this evaluation, the memorandum compares with MPR Flooding -- an established efficient flooding optimization, widely used in MANETs.
Download File ]]>

Publication date:	2010-05-21
Authors:	U. Herberg, I. Taylor
Published in:	Proceedings of the 2010 International Workshop on Future Engineering, Applications and Services (FEAS)
URL:	http://www.ftrg.org/futuretech2010/Wo...

This paper presents a framework for developing and executing Java routing protocol implementations within the network simulator NS2. NS2 provides extensive support for developing C++ routing protocols, but has no Java support. In this paper, we describe extensions we have made to the AgentJ toolkit that enable routing protocols to be integrated directly into NS2 without needing to extend the internals of NS2 for each new protocol. The framework defines a reusable AgentJ routing protocol definition that can be used to register new protocols dynamically from within Java code. The actual routing protocol can then leverage the AgentJ toolkit for executing unmodified Java applications in NS2. By means of aspect-oriented byte-code rewriting, AgentJ allows preexisting Java routing protocols, which run on the Internet, to run unmodified within NS2. This powerful system also helps researchers to both understand high-level and algorithmic properties of a given Java routing protocol through the analysis of an NS2 simulation and to rapidly develop and debug new routing protocols through prototyping and experimentation.
Download File ]]>

Publication date:	2010-05-13
Authors:	U. Herberg
Published in:	Proceedings of the 8th Annual Conference on Communication Networks and Services Research (CNSR)
URL:	http://www.cnsr.info/cnsr2010

MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constrained low-power devices. One of the bottlenecks of scalability in link-state routing protocols is the performance of the shortest path algorithm (e.g. Dijkstra). In this paper, we investigate the in-node performance of OLSRv2 and, in particular, study the benefits of using a dynamic shortest path (DSP) algorithm for this routing protocol. A DSP algorithm is an algorithm that adds or removes edges in the routing tree incrementally and calculates shortest paths, also incrementally. The performance in OLSRv2 with classic Dijkstra vs. DSP is evaluated, by comparing the CPU time for calculating paths in a large emulated network. Additionally, it is demonstrated that frequent topology changes due to mobility in MANETs lead to frequent routing table recalculations with only few routes updated each time. This property of MANETs makes the use of a DSP in OLSRv2 appropriate.
Download File ]]>

Publication date:	2010-04-30
Authors:	E. Baccelli, J. A. Cordero, P. Jacquet
Published in:	INRIA Research Report 7272

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 traditional routing protocol which has recently been extended, with RFC 5449, to work also on mobile ad hoc networks, and which makes use of a similar overlay synchronization subgraph. This paper compares the performance of RFC 5449 with that of SLOT-OSPF, our proposed OSPF extension for mobile ad hoc networks using SLOT. Simulations of various mobile ad hoc network scenarii show that SLOT-OSPF produces drastically less control traffic than RFC5449, allowing SLOT-OSPF to function correctly while RFC5449 stalls, when the number of routers in the domain is large.
Download File ]]>

Publication date:	2010-04-20
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-ietf-manet-olsrv2-11
URL:	https://datatracker.ietf.org/doc/draf...

Abstract: This document describes version 2 of the Optimized Link State Routing (OLSRv2) protocol for Mobile Ad hoc NETworks (MANETs)
Download File ]]>

Publication date:	2010-04-12
Authors:	T. Clausen, U. Herberg
Published in:	INRIA Research Report 7248
URL:	http://hal.inria.fr/inria-00472654/en/

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 article 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 a several cryptographic algorithms, such as RSA and Elliptic Curve Cryptography for very short signatures.
Download File ]]>

Publication date:	2010-04-10
Authors:	J. A. Cordero; E. Baccelli; P. Jacquet
Published in:	INRIA Research Report 7268
URL:	http://hal.archives-ouvertes.fr/inria...

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.
Download File ]]>

Publication date:	2010-04-06
Authors:	A. Brandt, E. Baccelli, R. Cragie
Published in:	draft-brandt-roll-rpl-applicability-home-building-00
URL:	https://datatracker.ietf.org/doc/draf...

The purpose of this document is to to provide guidance in the use of RPL to provide the features required in building or home environments, two application spaces which share a substantial of requirements. Note that this document refers to a specific revision of the RPL draft, and thus, a new revision of the RPL will likely necessitate a new revision of this document.
Download File ]]>

Publication date:	2010-04-06
Authors:	T. Clausen, U. Herberg
Published in:	INRIA Research Report 7244
URL:	http://hal.inria.fr/inria-00470377/en/

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 memorandum 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 memorandum 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.
Download File ]]>

Publication date:	2010-04-01
Authors:	U. Herberg, T. Clausen
Published in:	International Journal of Network Security & Its Applications (IJNSA)
URL:	http://airccse.org/journal/jnsa10_cur...

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.
Download File ]]>

Publication date:	2010-04-01
Authors:	W. Xie, M. Goyal, H. Hosseini, J. Martocci, Y. Bashir, E. Baccelli, A. Durresi
Published in:	oceedings of the IEEE Advanced Information Networking and Applications (AINA), Perth, Australia.

Directed Acyclic Graphs (DAGs), rooted at popu- lar/default destinations, have emerged as a preferred mech- anism to provide IPv6 routing functionality in large scale low power and lossy networks, that include wireless sensor networks and those based on power line communication. A DAG maintains its acyclic nature by requiring that each DAG node must have a higher ’rank’ than any of its DAG parents. While a node may decrease its DAG rank safely, increasing its DAG rank to add a new parent may result in a routing loop if the new parent is also a descendant in the DAG. In this paper, we first study via simulations the time required by the network to converge to a stable, loop-free state following a rank increase operation and the number of routing messages generated (the network ’churn’) during this time. Then, we describe the precautionary measures that can be used to avoid routing loops and evaluate via simulations how these measures affect the time and churn involved in reaching a stable state following a rank increase operation.
Download File ]]>

Publication date:	2010-03-23
Authors:	P. Levis, T. Clausen
Published in:	draft-ietf-roll-trickle-01
URL:	https://datatracker.ietf.org/doc/draf...

The Trickle algorithm allows wireless nodes 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 nechanism and transmission point selection allows Trickle's communication rate to scale logarithmically with density. This document describes Trickle and considerations in its use.
Download File ]]>

Publication date:	2010-03-23
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-12
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2010-03-08
Authors:	U. Herberg, T. Clausen
Published in:	draft-herberg-manet-packetbb-sec-03
URL:	http://tools.ietf.org/html/draft-herb...

This document describes a general and flexible TLV (type-length-value structure) for representing cryptographic signatures as well as timestamps, using the generalized MANET packet/message format [RFC5444]. It defines two Packet TLVs, two Message TLVs, and two Address Block TLVs, for affixing cryptographic signatures and timestamps to a packet, message and address, respectively.
Download File ]]>

Publication date:	2010-03-08
Authors:	U. Herberg, R. Cole, I. Chakeres
Published in:	draft-ietf-manet-nhdp-mib-03
URL:	http://tools.ietf.org/html/draft-ietf...

This memo 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 aspects of the Neighborhood Discovery Protocol (NHDP) process on a router. The NHDP MIB also reports state information, performance information and notifications. This additional state and performance information is useful to management stations troubleshooting neighbor discovery problems.
Download File ]]>

Publication date:	2010-02-28
Authors:	T.Clausen, U. Herberg
Published in:	INRIA Research Report 7218
URL:	http://hal.inria.fr/inria-00460419/en/

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 memorandum 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
Download File ]]>

Publication date:	2010-02-26
Authors:	T. Clausen, U. Herberg, J. Milan
Published in:	INRIA Research Report 7216
URL:	http://hal.inria.fr/inria-00460057/en/

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 memorandum 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.
Download File ]]>

Publication date:	2010-02-25
Authors:	P. Levis, T. Clausen
Published in:	draft-levis-roll-trickle-00
URL:	https://datatracker.ietf.org/doc/draf...

The Trickle algorithm allows wireless nodes 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 nechanism and transmission point selection allows Trickle's communication rate to scale logarithmically with density. This document describes Trickle and considerations in its use.
Download File ]]>

Publication date:	2010-02-14
Authors:	T. Clausen, U. Herberg
Published in:	INRIA Research Report 7203
URL:	http://hal.inria.fr/inria-00456376/en/

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.
Download File ]]>

Publication date:	2010-01-11
Authors:	Ulrich Herberg
Published in:	INRIA Research Report RR-7174
URL:	http://hal.archives-ouvertes.fr/inria...

MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constrained low-power devices. One of the bottlenecks of scalability in link-state routing protocols is the performance of the shortest path algorithm (e.g. Dijkstra). In this document, we investigate the in-node performance of OLSRv2 and, in particular, study the benefits of using a dynamic shortest path (DSP) algorithm for this routing protocol. A DSP algorithm is an algorithm that adds or removes edges in the routing tree incrementally and calculates shortest paths, also incrementally. The performance in OLSRv2 with classic Dijkstra vs. DSP is evaluated, by comparing the CPU time for calculating paths in a large emulated network. Additionally, it is demonstrated that frequent topology changes due to mobility in MANETs lead to frequent routing table recalculations with only few routes updated each time. This property of MANETs makes the use of a DSP in OLSRv2 appropriate.
Download File ]]>

Publication date:	2010-01-11
Authors:	Ulrich Herberg, Nestor Mariyasagayam, Thomas Heide Clausen
Published in:	INRIA Research Report RR-7173
URL:	http://hal.archives-ouvertes.fr/inria...

This document compares two protocols, MHVB and NHDP. While both protocols are intended for wireless multi-hop ad hoc networks, they differ fundamentally, both in operation and in purpose: MHVB is a location-based, general-purpose transport protocol for network wide information dissemination, whereas NHDP is a protocol enabling a router to acquire information describing its local network topology up to two hops away. Different as they may seem, these two protocols can, in certain situations, serve the same purpose. For example, MHVB can be employed by an ad hoc routing protocol in place of NHDP, for dissemination of topological information when location information is available. Similarly, NHDP may be used to carry certain location-based information, in place of MHVB. This document examines the viability of NHDP and MHVB for neighborhood discovery, and analyses their performance as such. Aside from the usual set of performance parameters, special interest is accorded to the "freshness" of neighborhood information, obtained through each of the protocols.
Download File ]]>

Publication date:	2009-11-12
Authors:	U. Herberg, T. Clausen
Published in:	draft-herberg-manet-nhdp-sec-00
URL:	http://tools.ietf.org/html/draft-herb...

This document specifies an extension to the Neighbor Discovery Protocol (NHDP) which uses cryptographic signatures in HELLO messages to encounter a selection of security threats to NHDP.
Download File ]]>

Publication date:	2009-11-12
Authors:	U. Herberg, T. Clausen
Published in:	draft-herberg-manet-nhdp-sec-threats-00
URL:	http://tools.ietf.org/html/draft-herb...

This document analyses common security threats of the Neighborhood Discovery Protocol (NHDP) and describes impacts for MANET routing protocols using NHDP.
Download File ]]>

Publication date:	2009-11-09
Authors:	U. Herberg, R. Cole, T. Clausen
Published in:	draft-ietf-manet-olsrv2-mib-01
URL:	http://tools.ietf.org/html/draft-ietf...

This memo 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 and managing aspects of the Optimized Link State Routing protocol version 2. The Optimized Link State Routing MIB also reports state information, performance metrics, and notifications. In addition to configuration, this additional state and performance information is useful to management stations troubleshooting Mobile Ad-Hoc Networks routing problems.
Download File ]]>

Publication date:	2009-11-09
Authors:	U. Herberg, R. Cole, I. Chakeres
Published in:	draft-ietf-manet-nhdp-mib-02
URL:	http://tools.ietf.org/html/draft-ietf...

This memo 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 aspects of the Neighborhood Discovery Protocol (NHDP) process on a router. The NHDP MIB also reports state information, performance information and notifications. This additional state and performance information is useful to management stations troubleshooting neighbor discovery problems.
Download File ]]>

Publication date:	2009-10-26
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-11
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2009-10-21
Authors:	U. Herberg, R. Cole, I. Chakeres
Published in:	draft-ietf-manet-nhdp-mib-01
URL:	http://tools.ietf.org/html/draft-ietf...

This memo 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 aspects of the Neighborhood Discovery Protocol (NHDP) process on a router. The NHDP MIB also reports state information, performance information and notifications. This additional state and performance information is useful to management stations troubleshooting neighbor discovery problems.
Download File ]]>

Publication date:	2009-10-09
Authors:	U. Herberg
Published in:	INRIA Research Report RR-7075

This document presents a modification of the existing tool AgentJ which allows for running a Java routing protocol within the network simulator NS2.
Download File ]]>

Publication date:	2009-09-27
Authors:	E. Baccelli, T. Clausen, U. Herberg. C. Perkins
Published in:	Proceedings of SoftCom

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.
Download File ]]>

Publication date:	2009-09-25
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-ietf-manet-olsrv2-10
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) protocol for Mobile Ad hoc NETworks (MANETs)
Download File ]]>

Publication date:	2009-09-20
Authors:	E. Baccelli, J. A. Cordero, P. Jacquet
Published in:	4th IEEE International Conference on Sensor Networks and Communications (ICSNC - SoftNet), Porto, Portugal, 2009

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, for operation on 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 multihop wireless networking, before concluding with a proposal for a unique, merged solution based on this analysis.
Download File ]]>

Publication date:	2009-07-27
Authors:	U. Herberg, T. Clausen
Published in:	draft-herberg-manet-packetbb-sec-02
URL:	http://tools.ietf.org/html/draft-herb...

This document describes a general and flexible TLV (type-length-value structure) for representing cryptographic signatures as well as timestamps, using the generalized MANET packet/message format [RFC5444]. It defines two Message TLVs and two Packet TLVs, for affixing a cryptographic signature and a timestamp to a packet and message, respectively.
Download File ]]>

Publication date:	2009-07-13
Authors:	U. Herberg, T. Clausen
Published in:	draft-herberg-manet-packetbb-sec-01
URL:	http://tools.ietf.org/html/draft-herb...

This document describes a general and flexible TLV (type-length-value structure) for representing cryptographic signatures as well as timestamps, using the generalized MANET packet/message format [RFC5444]. It defines two Message TLVs and two Packet TLVs, for affixing a cryptographic signature and a timestamp to a packet and message, respectively.
Download File ]]>

Publication date:	2009-07-13
Authors:	Y. Lacharite, M. Wang, P. Minet, T. Clausen
Published in:	draft-lacharite-manet-holsr-02
URL:	https://datatracker.ietf.org/doc/draf...

This document describes the Hierarchical Optimized Link State Routing (HOLSR) mechanism for heterogeneous mobile ad hoc networks. In this specification a heterogeneous mobile ad hoc network is defined as a network of mobile routers that are characterized by different communication capabilities, such as communication channels, processing powers or energy levels. The HOLSR mechanism is an extension to the OLSRv2 protocol. HOLSR takes advantage of the router's distinct communications capabilities to reduce the routing control overhead in large heterogeneous ad hoc networks, thus improving the performance of the routing mechanism. More precisely, HOLSR defines a hierarchy in the network and presents a routing scheme for this hierarchical structure with a better scalability.
Download File ]]>

Publication date:	2009-07-13
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-10
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2009-07-13
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-ietf-manet-olsrv2-09
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) protocol for Mobile Ad hoc NETworks (MANETs)
Download File ]]>

Publication date:	2009-07-09
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-dearlove-olsrv2-metrics-04
URL:	https://datatracker.ietf.org/doc/draf...

This document describes how link metrics may be added, in a relatively straightforward manner, to the specification of OLSRv2, in order to allow routing by other than minimum hop count routes. In addition to metric signaling and use, the most significant change is a separation of the routing and flooding functions of MPRs.
Download File ]]>

Publication date:	2009-07-06
Authors:	U. Herberg, T. Clausen
Published in:	draft-herberg-manet-packetbb-sec-00
URL:	http://tools.ietf.org/html/draft-herb...

This document describes a general and flexible TLV (type-length-value structure) for representing cryptographic signatures as well as timestamps, using the generalized MANET packet/message format [RFC5444]. It defines two Message TLVs and two Packet TLVs, for affixing a cryptographic signature and a timestamp to a packet and message, respectively.
Download File ]]>

Publication date:	2009-04-03
Authors:	Emmanuel Baccelli, Thomas Clausen, Philippe Jacquet
Published in:	European Research Consortium for Informatics and Mathematics, ERCIM News issue n°77, p. 20-21

The Internet Engineering Task Force was the birthplace of today’s Internet. Understanding its activities is necessary for individuals and institutions who wish to anticipate the future of the Internet. As things stand, this necessity is not likely to fade any time soon.
Download File ]]>

Publication date:	2009-03-26
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-09
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2009-03-13
Authors:	T. Clausen, C. Dearlove
Published in:	IETF - Std. Track RFC
URL:	http://www.rfc-editor.org/rfc/rfc5497...

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.
Download File ]]>

Publication date:	2009-03-10
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-ietf-manet-olsrv2-08
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) protocol. The protocol embodies an optimization of the classical link state algorithm tailored to the requirements of a Mobile Ad hoc NETwork (MANET).
Download File ]]>

Publication date:	2009-03-09
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-08
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2009-03-03
Authors:	U. Herberg, R. Cole, T. Clausen
Published in:	draft-ietf-manet-olsrv2-mib-00
URL:	https://datatracker.ietf.org/doc/draf...

This memo 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 and managing aspects of the Optimized Link State Routing protocol version 2. The Optimized Link State Routing MIB also reports state information, performance metrics, and notifications. In addition to configuration, this additional state and performance information is useful to management stations troubleshooting Mobile Ad-Hoc Networks routing problems.
Download File ]]>

Publication date:	2009-02-20
Authors:	T. Clausen
Published in:	Inria Research Report RR-6852

This memorandum describes a pragmatic set of configuration recommendations for MANETs, as well as provides a rationale for why these recommendations are sound. While there may be other equally valid ways of configuring a MANET, the recommendations in this memorandum have the merit of being supported by an existence proof (there’re running networks in existence, configured according to these recommendations), and they require neither modifications to the IP stack nor to upper-layer protocols or applications.
Download File ]]>

Publication date:	2009-02-15
Authors:	E. Baccelli, J. A. Cordero, P. Jacquet
Published in:	Inria Research Report RR-6822

Incorporating multi-hop 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 routing protocol OSPF, for operation on MANETs. Such extension allows OSPF, the most widely deployed interior gateway routing protocol on the Internet, to work on heterogeneous networks encompassing both wired and wireless routers. The latter may self-organize as multi-hop wireless subnetworks, and may be mobile. Three solutions have been proposed for this extension, among which two based on techniques derived from multi-point relaying (MPR) techniques and OLSR. 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.
Download File ]]>

Publication date:	2009-02-09
Authors:	E. Baccelli, T. Clausen, P. Jacquet. D. Nguyen
Published in:	IETF - Exp. RFC
URL:	http://www.rfc-editor.org/rfc/rfc5449...

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".
Download File ]]>

Publication date:	2009-02-05
Authors:	T. Clausen, C. Dearlove, J. Dean, C. Adjih
Published in:	IETF - Std. Track RFC
URL:	http://www.ietf.org/rfc/rfc5444.txt

This document specifies a packet format capable of carrying multiple messages that may be used by mobile ad hoc network routing protocols.
Download File ]]>

Publication date:	2009-02-01
Authors:	Emmanuel Baccelli, Thomas Clausen, Philippe Jacquet
Published in:	Performance Modelling and Analysis of Heterogeneous Networks, River Publishers, Denmark, Chapter 5, pp. 93--111

The OSPF routing protocol is currently the predominant IGP in use on the fixed Internet of today. This routing protocol scales ``world wide", under the assumptions of links being relatively stable, network density being rather 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 most nodes are mobile. In this chapter, 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 synchronisation 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.
Download File ]]>

Publication date:	2009-02-01
Authors:	Juan Antonio Cordero
Published in:	Inria Research Report RR-6827

This document analyses the MPR-OSPF current specification and compares it with the implemented version for the Quagga / Zebra routing suite, adapted for the GTNetS network simulator. It presents the relationship between Quagga/Zebra core and the GTNetS simulation framework, describes the inner architecture of the MPR-OSPF extension in the OSPF Quagga general implementation and identifies the different protocol main elements in the implemented code.
Download File ]]>

Publication date:	2008-11-18
Authors:	Y. Lacharite, M. Wang, P. Minet, T. Clausen
Published in:	draft-lacharite-manet-holsr-01
URL:	https://datatracker.ietf.org/doc/draf...

This document describes the Hierarchical Optimized Link State Routing (HOLSR) mechanism for heterogeneous mobile ad hoc networks. In this specification a heterogeneous mobile ad hoc network is defined as a network of mobile routers that are characterized by different communication capabilities, such as communication channels, processing powers or energy levels. The HOLSR mechanism is an extension to the OLSRv2 protocol. HOLSR takes advantage of the router's distinct communications capabilities to reduce the routing control overhead in large heterogeneous ad hoc networks, thus improving the performance of the routing mechanism. More precisely, HOLSR defines a hierarchy in the network and presents a routing scheme for this hierarchical structure with a better scalability.
Download File ]]>

Publication date:	2008-11-05
Authors:	Y. Lacharite, M. Wang, P. Minet, T. Clausen
Published in:	draft-lacharite-manet-holsr-00
URL:	https://datatracker.ietf.org/doc/draf...

This document describes the Hierarchical Optimized Link State Routing (HOLSR) mechanism for heterogeneous mobile ad hoc networks. In this specification a heterogeneous mobile ad hoc network is defined as a network of mobile routers that are characterized by different communication capabilities, such as communication channels, processing powers or energy levels. The HOLSR mechanism is an extension to the OLSRv2 protocol. HOLSR takes advantage of the router's distinct communications capabilities to reduce the routing control overhead in large heterogeneous ad hoc networks, thus improving the performance of the routing mechanism. More precisely, HOLSR defines a hierarchy in the network and presents a routing scheme for this hierarchical structure with a better scalability.
Download File ]]>

Publication date:	2008-10-14
Authors:	Ulrich Herberg
Published in:	Proceedings of the 4th OLSR Interop Workshop

This note describes the architecture of our implementation of OLSRv2 in Java, and some extensions thereto.
Download File ]]>

Publication date:	2008-10-01
Authors:	E. Baccelli, J. Schiller
Published in:	Proceedings of the IEEE International Conference on ITS Telecommunications (ITST), Phuket, Thailand

In the near-future, self-organized networking is expected to become an important component in ITS, and in the Internet architecture in general. An essential challenge concerning the integration of this new component is the accomplishment of scalable and efficient mobile ad hoc routing. This paper overviews considerations relative to the design of such MANET protocols inside the framework provided by the IETF, stating the need for new hybrid protocols and architecture which offer a gradual transition from ”traditional” MANET routing towards scalable MANET routing integrated in the Internet. This paper also proposes a tentative solution in this domain: DHT-OLSR, based on OLSR enhanced with dynamic clustering and distributed hash table routing.
Download File ]]>

Publication date:	2008-09-16
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-dearlove-olsrv2-metrics-03
URL:	https://datatracker.ietf.org/doc/draf...

This document describes how link metrics may be added, in a relatively straightforward manner, to the specification of OLSRv2, in order to allow routing by other than minimum hop count routes. In addition to metric signaling and use, the most significant change is a separation of the routing and flooding functions of MPRs.
Download File ]]>

Publication date:	2008-07-10
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-dearlove-olsrv2-metrics-01
URL:	https://datatracker.ietf.org/doc/draf...

This document describes how link metrics may be added, in a relatively straightforward manner, to the specification of OLSRv2, in order to allow routing by other than minimum hop count routes. In addition to metric signaling and use, the most significant change is a separation of the routing and flooding functions of MPRs.
Download File ]]>

Publication date:	2008-07-10
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-dearlove-olsrv2-metrics-02
URL:	https://datatracker.ietf.org/doc/draf...

This document describes how link metrics may be added, in a relatively straightforward manner, to the specification of OLSRv2, in order to allow routing by other than minimum hop count routes. In addition to metric signaling and use, the most significant change is a separation of the routing and flooding functions of MPRs.
Download File ]]>

Publication date:	2008-07-10
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-07
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2008-07-10
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-ietf-manet-olsrv2-07
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) protocol. The protocol embodies an optimization of the classical link state algorithm tailored to the requirements of a Mobile Ad hoc NETwork (MANET). The key optimization in OLSRv2 is that of multipoint relays (MPRs), providing an efficient mechanism for network-wide broadcast of link state information (i.e. reducing the cost of performing a network- wide link state broadcast). A secondary optimization is that OLSRv2 employs partial link state information; each node maintains information about all destinations, but only a subset of links. Consequently, only selected nodes flood link state advertisements (thus reducing the number of network-wide link state broadcasts) and these advertisements contain only a subset of links (thus reducing the size of network-wide link state broadcasts). The partial link state information thus obtained still allows each OLSRv2 node to at all times maintain optimal (in terms of number of hops) routes to all destinations in the network. OLSRv2 imposes minimum requirements on the network by not requiring sequenced or reliable transmission of control traffic. Furthermore, the only interaction between OLSRv2 and the IP stack is routing table management. OLSRv2 is particularly suitable for large and dense networks as the technique of MPRs works best in this context.
Download File ]]>

Publication date:	2008-06-26
Authors:	Song Yean Cho, Cedric Adjih
Published in:	Medhoc Net 2008

Abstract Network coding is a novel method for transmitting data, which has been recently proposed. In this article, we study using network coding for one specific case of multicast, broadcasting. Precisely, we focus on (energy-) efficient broadcasting in a multi-hop wireless networks: transmitting data from one source to all nodes with a small number of retransmissions. It is known that the efficiency of network coding is essentially determined by the selected rates of each node. Our contribution is to propose a simple and efficient method for determining a rate selection. Our method adapts dynamically and uses only local dynamic information of neighbors: Dynamic Rate Adaptation from Gap with Other Nodes (D.R.A.G.O.N.). The rationale of this rate selection method is detailed from some logical arguments. Experimental results illustrate the behavior of the method, and its excellent performance.
Download File ]]>

Publication date:	2008-06-06
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-ietf-manet-olsrv2-06
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) protocol. The protocol embodies an optimization of the classical link state algorithm tailored to the requirements of a Mobile Ad hoc NETwork (MANET). The key optimization in OLSRv2 is that of multipoint relays (MPRs), providing an efficient mechanism for network-wide broadcast of link state information (i.e. reducing the cost of performing a network- wide link state broadcast). A secondary optimization is that OLSRv2 employs partial link state information; each node maintains information about all destinations, but only a subset of links. Consequently, only selected nodes flood link state advertisements (thus reducing the number of network-wide link state broadcasts) and these advertisements contain only a subset of links (thus reducing the size of network-wide link state broadcasts). The partial link state information thus obtained still allows each OLSRv2 node to at all times maintain optimal (in terms of number of hops) routes to all destinations in the network. OLSRv2 imposes minimum requirements on the network by not requiring sequenced or reliable transmission of control traffic. Furthermore, the only interaction between OLSRv2 and the IP stack is routing table management. OLSRv2 is particularly suitable for large and dense networks as the technique of MPRs works best in this context.
Download File ]]>

Publication date:	2008-06-01
Authors:	C. Adjih, E. Baccelli, P. Minet, P. Mühlethaler, T. Plesse
Published in:	ournal of Telecommunications and Information Technology (JTIT), issue n°2 p. 70-76

The MANET networks are of prime interest for military networks. One of the proeminent routing protocols for MANET is OLSR, and indeed, OLSR has been used in many evaluations and experiments of MANETs. As OLSR is on its way to standardization, there are still a number of exten- sions that are useful and sometimes necessary for practical use of OLSR networks: such extensions are quality of service sup- port, security, and OSPF interconnection. In this paper, we present the architecture, design, specifications and implemen- tations that we made to integrate these features in a military test-bed. This test-bed is a real MANET comprising 18 nodes. These nodes communicate by radio and use the IEEE 802.11b MAC protocol. The OLSR routing protocol updates the rout- ing table used by the IP protocol to forward packets.
Download File ]]>

Publication date:	2008-03-10
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-06
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2008-02-27
Authors:	T. Clausen, C. Dearlove, B. Adamson
Published in:	RFC
URL:	http://www.rfc-editor.org/rfc/rfc5148...

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. This memo provides information for the Internet community.
Download File ]]>

Publication date:	2008-02-25
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-ietf-manet-olsrv2-05
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) 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 optimization of OLSRv2 is that of multipoint relays, providing an efficient mechanism for network-wide broadcast of link-state information. A secondary optimization is, that OLSRv2 employs partial link-state information: each node maintains information of all destinations, but only a subset of links. This allows that only select nodes diffuse link-state advertisements (i.e. reduces the number of network-wide broadcasts) and that these advertisements contain only a subset of links (i.e. reduces the size of each network-wide broadcast). The partial link-state information thus obtained allows each OLSRv2 node to at all times maintain optimal (in terms of number of hops) routes to all destinations in the network. OLSRv2 imposes minimum requirements to the network by not requiring sequenced or reliable transmission of control traffic. Furthermore, the only interaction between OLSRv2 and the IP stack is routing table management. OLSRv2 is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
Download File ]]>

Publication date:	2007-12-06
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-05
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2007-11-30
Authors:	T. Clausen, U. Herberg
Published in:	Inria Research Report RR-6376
URL:	http://hal.inria.fr/inria-00192959/en/

This memorandum outlines the goals for and constraints on an IP address and prefix autoconfiguration mechanism for mobile ad hoc networks.
Download File ]]>

Publication date:	2007-10-23
Authors:	S.Y. Cho, C. Adjih, P. Jacquet
Published in:	International Wireless Internet Conference
URL:	http://www.wicon.org/

Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this article, we study one specific case of multicast: broadcasting, sending data from one source to all nodes, in a multi-hop wireless network. The broadcast we focus on is based on network coding, a promising avenue for reducing cost; previous work of ours showed that the performance of network coding with simple heuristics is asymptotically optimal: each transmission is beneficial to nearly every receiver. This is for homogeneous and large networks of the plan. But for small, sparse or for inhomogeneous networks, some additional heuristics are required. This article proposes such additional new heuristics (for selecting rates) for broadcasting with network coding. Our heuristics are intended to use only simple local topology information. We detail the logic of the heuristics, and with experimental results, we illustrate the behavior of the heuristics, and demonstrate their excellent performance.
Download File ]]>

Publication date:	2007-09-01
Authors:	C. Adjih, E. Baccelli, P. Minet, P. Mühlethaler, T. Plesse
Published in:	Military Communications and Information Systems (MCC), Bonn, Germany, September 2007

MANET networks are of prime interest for military networks. One of the proeminent routing protocols for MANET is OLSR, and indeed, OLSR has been used in many evaluations and experiments of MANETs. As OLSR is on its way to standardization, there are still a number of extensions that are useful and sometimes necessary for practical use of OLSR networks: such extensions are quality of service support (QoS), security, and OSPF interconnection. In this paper, we present the archictecture, design, specifications and implementations that we made to integrate these features in a military testbed. This testbed is a real MANET comprising 18 nodes. These nodes communicate by radio and use the IEEE 802.11b MAC protocol. The OLSR routing protocol updates the routing table used by the IP protocol to forward packets.
Download File ]]>

Publication date:	2007-08-27
Authors:	S.Y. Cho, C. Adjih, P. Jacquet
Published in:	sigcomm 2007 student poster

We address the problem of efficient broadcasting in multi-hop wireless networks with network coding. Network coding was introduced by the seminal work of [1] as a new paradigm where intermediate nodes are mixing information from different flows (different bits or different packets). The problem that we are addressing is efficient broadcast, precisely: • Broadcast packets from one source to all nodes, with the minimum number of transmissions. Without network coding, finding the optimal solution is an NP complete problem. With network coding, essentially, nodes will retransmit coded packets with an average interval, defining a node rate. Finding an optimal solution consists in finding the coding nodes and their optimal rates. This can be formulated as a linear program, which can be solved in polynomial time [2]. However, we adopt a different, even simpler, approach: our previous work [3, 4] has shown a simple heuristic could achieve asymptotically the optimal efficiency for homogeneous large and dense wireless networks of the plane — and also that, noticeably, it outperforms methods not using network coding. This is true asymptotically, and for homogeneous networks. The heuristic need adjustments for less homogeneous, smaller or sparser networks, the topic of the poster. Our key contributions are the following: • We propose an improved heuristic for rate selection, inspired by [5]. It is based only on local topology information: knowledge of two-hop neighbors. • We study its performance on representative graphs with different densities (using min-cut calculation). We investigate and explain the variation of the performance.
Download File ]]>

Publication date:	2007-07-24
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-dearlove-olsrv2-metrics-00
URL:	https://datatracker.ietf.org/doc/draf...

This document describes how link metrics may be added, in a relatively straightforward manner, to the specification of OLSRv2, in order to allow routing by other than minimum hop count routes. In addition to metric signaling and use, the most significant change is a separation of the routing and flooding functions of MPRs.
Download File ]]>

Publication date:	2007-07-09
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-ietf-manet-olsrv2-04
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) 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 optimization of OLSRv2 is that of multipoint relays, providing an efficient mechanism for network-wide broadcast of link-state information. A secondary optimization is, that OLSRv2 employs partial link-state information: each node maintains information of all destinations, but only a subset of links. This allows that only select nodes diffuse link-state advertisements (i.e. reduces the number of network-wide broadcasts) and that these advertisements contain only a subset of links (i.e. reduces the size of each network-wide broadcast). The partial link-state information thus obtained allows each OLSRv2 node to at all times maintain optimal (in terms of number of hops) routes to all destinations in the network. OLSRv2 imposes minimum requirements to the network by not requiring sequenced or reliable transmission of control traffic. Furthermore, the only interaction between OLSRv2 and the IP stack is routing table management. OLSRv2 is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
Download File ]]>

Publication date:	2007-06-29
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-04
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2007-06-20
Authors:	Cedric Adjih, Song Yean Cho, Philippe Jacquet
Published in:	International Workshop on Information Theory for Sensor Networks

We study efficient broadcasting for wireless sensor networks, with network coding. We address this issue for homogeneous sensor networks in the plane. Our results are based on a simple principle (IREN/IRON), which sets the same rate on most of the nodes (wireless links) of the network. With this rate selection, we give a value of the maximum achievable broadcast rate of the source: our central result is a proof of the value of the min-cut for such networks, viewed as hypergraphs. Our metric for efficiency is the number of transmissions necessary to transmit one packet from the source to every destination: we show that IREN/IRON achieves near optimality for large networks; that is, asymptotically, nearly every transmission brings new information from the source to the receiver. As a consequence, network coding asymptotically outperforms any scheme that does not use network coding.
Download File ]]>

Publication date:	2007-06-12
Authors:	S.Y. Cho, C. Adjih, P. Jacquet
Published in:	Med hoc Net 2007

Recently, various working groups of standardization bodies, have finalized or have been finalizing standards for wireless mesh networks (WMNs), which will provide some ad-hoc network capabilities to wireless networks. An example is the task group “S”, 802.11s, focusing on mesh extensions for Wi-Fi networks. Such networks accommodate two kinds of nodes: mesh routers which form networks automatically in a similar fashion to ad-hoc networks ; and mesh clients which can simply associate with these mesh routers to access to the rest of the network. Because of the discrepancy of behavior between mesh routers and mesh clients, WMNs have a hybrid structure, where the mesh routers form a backbone, and where clients have no routing capability. Routing in WMNs may be achieved with an extension of routing with two levels of information: traditional routing tables between mesh routers, complemented with association tables for linking mesh clients to mesh routers. For the first level, routing between mesh routers, can be used, for instance modified versions of MANET protocols. For the second level, we propose an Association Discovery Protocol (ADP): it allows each mesh router to determine where are located the other stations. Our proposal had actually been integrated in the early 802.11s proposals [6], and in this article, our focus will be on such 802.11 mesh networks. Because the ADP has parameters which can be tuned, a performance analysis of the protocol is essential. In this article, we describe this protocol, and provide an analytic model of its performance. The performance evaluation is confirmed by simulation results.
Download File ]]>

Publication date:	2007-06-01
Authors:	E. Baccelli, T. Clausen, P. Jacquet, D. Nguyen
Published in:	International Conference on ITS Telecommunications (ITST), Sophia Antipolis, France, June 2007

Solutions for mobile ad hoc routing have matured over the last decade. Building atop these foundations, new challenges are set for MANETs, such as integration in the Internet core. On this topic, this paper designs and evaluates MPR-OSPF, an extension of the OSPF protocol enabling its operation on networks that may include both MANET nodes and usual fixed routers. Automatic integration of different types of vehicular ad hoc networks (VANETs) in the IP infrastructure is then possible using the classic OSPF framework. Techniques used therefore are derived from OLSR, the MANET routing protocol that is the most compatible with traditional IP environments.
Download File ]]>

Publication date:	2007-05-30
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-03
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2007-05-01
Authors:	E. Baccelli, T. Zahn, J. Schiller
Published in:	INRIA Research Report RR-6194, May 2007

Self-organized networking is foreseen as an important component in the Internet’s near-future architecture. An essential challenge concerning the integration of this new component is the accomplishment of scalable and efficient ad hoc routing. This report proposes a new solution in this space, DHT-OLSR, based on OLSR enhanced with dynamic clustering and distributed hash table (DHT) routing. We believe that such a protocol can provide an architecture that may introduce a gradual transition from traditional IP routing towards scalable IP MANET routing.
Download File ]]>

Publication date:	2007-02-09
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-01
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2007-02-05
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-02
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2007-02-05
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-ietf-manet-olsrv2-03
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) 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 optimization of OLSRv2 is that of multipoint relays, providing an efficient mechanism for network-wide broadcast of link-state information. A secondary optimization is, that OLSRv2 employs partial link-state information: each node maintains information of all destinations, but only a subset of links. This allows that only select nodes diffuse link-state advertisements (i.e. reduces the number of network-wide broadcasts) and that these advertisements contain only a subset of links (i.e. reduces the size of each network-wide broadcast). The partial link-state information thus obtained allows each OLSRv2 node to at all times maintain optimal (in terms of number of hops) routes to all destinations in the network. OLSRv2 imposes minimum requirements to the network by not requiring sequenced or reliable transmission of control traffic. Furthermore, the only interaction between OLSRv2 and the IP stack is routing table management. OLSRv2 is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
Download File ]]>

Publication date:	2007-01-01
Authors:	T. Clausen
Published in:	INRIA Research Report RR-6145
URL:	http://www.thomasclausen.org/Professi...

This memorandum describes a common misperception concerning MANETs and their underlying network architecture when integrating into classic IP networks. It details the consequences of this misperception - breaking compatibility with existing applications and protocols - and offers an architectural model for MANETs which integrate well into the IP Networking Architecture.
Download File ]]>

Publication date:	2006-06-26
Authors:	T. Clausen, C. Dearlove, P. Jacquet
Published in:	draft-ietf-manet-olsrv2-02
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) 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 optimization of OLSRv2 is that of multipoint relays, providing an efficient mechanism for network-wide broadcast of link-state information. A secondary optimization is, that OLSRv2 employs partial link-state information: each node maintains information of all destinations, but only a subset of links. This allows that only select nodes diffuse link-state advertisements (i.e. reduces the number of network-wide broadcasts) and that these advertisements contain only a subset of links (i.e. reduces the size of each network-wide broadcast). The partial link-state information thus obtained allows each OLSRv2 node to at all times maintain optimal (in terms of number of hops) routes to all destinations in the network. OLSRv2 imposes minimum requirements to the network by not requiring sequenced or reliable transmission of control traffic. Furthermore, the only interaction between OLSRv2 and the IP stack is routing table management. OLSRv2 is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
Download File ]]>

Publication date:	2006-06-19
Authors:	T. Clausen, C. Dearlove, J. Dean
Published in:	draft-ietf-manet-nhdp-00
URL:	https://datatracker.ietf.org/doc/draf...

This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).
Download File ]]>

Publication date:	2006-03-06
Authors:	T. Clausen, C. Dearlove
Published in:	draft-ietf-manet-olsrv2-01
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) 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 optimization of OLSRv2 is that of multipoint relays, providing an efficient mechanism for network-wide broadcast of link-state information. A secondary optimization is, that OLSRv2 employs partial link-state information: each node maintains information of all destinations, but only a subset of links. This allows that only select nodes diffuse link-state advertisements (i.e. reduces the number of network-wide broadcasts) and that these advertisements contain only a subset of links (i.e. reduces the size of each network-wide broadcast). The partial link-state information thus obtained allows each OLSRv2 node to at all times maintain optimal (in terms of number of hops) routes to all destinations in the network. OLSRv2 imposes minimum requirements to the network by not requiring sequenced or reliable transmission of control traffic. Furthermore, the only interaction between OLSRv2 and the IP stack is routing table management. OLSRv2 is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
Download File ]]>

Publication date:	2006-03-01
Authors:	E. Baccelli
Published in:	International Conference on Networks and Communication Systems (NCS), Chiang Mai, Thailand, March 2006

The Internet uses hierarchical networking, for scalability and manageability reasons. However the main ad hoc routing solutions (OLSR [1], AODV [6], DSR [8], TBRPF [7]) only provide flat networking, and generally suffer im- portant scalability issues. This paper therefore introduces a simple mechanism providing dynamic clustering with OLSR, one of the MANET routing solutions, chosen for its easy integration in the Internet infrastructure. The paper then describes how this dynamic clustering can be used to provide MANET hierarchical networking with OLSR.
Download File ]]>

Publication date:	2006-01-06
Authors:	E. Baccelli
Published in:	PhD Thesis of Ecole Polytechnique

Integrating mobile ad hoc devices in the Internet brings a number of new challenges, both in terms of opti- mization of the routing protocols providing ad hoc networks, and in terms of integration of ad hoc mobility with the IP-based infrastructure. This thesis overviews these challenges. Some existing solutions are analyzed and compared while a number of new solutions are introduced.
Download File ]]>

Publication date:	2005-09-01
Authors:	E. Baccelli, T. Clausen, J. Garnier
Published in:	IEEE Conference on Wireless Personal Multimedia Communications (WPMC), Aalborg, Denmark, Sept. 2005

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 address 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 assuming that such a mechanism is present in a MANET, allowing MANET nodes to initially configure their interfaces with addresses unique within the network, additional complications 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 interfaces 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 address assigned to one of its interfaces, and an address assigned to an interface on another node. The mechanisms proposed are, thus, entirely passive, creating no additional information exchange on the network.
Download File ]]>

Publication date:	2005-08-02
Authors:	T. Clausen
Published in:	draft-ietf-manet-olsrv2-00
URL:	https://datatracker.ietf.org/doc/draf...

This document describes version 2 of the Optimized Link State Routing (OLSRv2) 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 optimization of OLSRv2 is that of multipoint relays, providing an efficient mechanism for network-wide broadcast of link-state information. A secondary optimization is, that OLSRv2 employs partial link-state information: each node maintains information of all destinations, but only a subset of links. This allows that only select nodes diffuse link-state advertisements (i.e. reduces the number of network-wide broadcasts) and that these advertisements contain only a subset of links (i.e. reduces the size of each network-wide broadcast). The partial link-state information thus obtained allows each OLSRv2 node to at all times maintain optimal (in terms of number of hops) routes to all destinations in the network. OLSRv2 imposes minimum requirements to the network by not requiring sequenced or reliable transmission of control traffic. Furthermore, the only interaction between OLSRv2 and the IP stack is routing table management. OLSRv2 is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
Download File ]]>

Publication date:	2005-07-01
Authors:	T.Clausen, E.Baccelli, P.Jacquet
Published in:	INRIA Research Report RR-5619
URL:	http://www.thomasclausen.org/Professi...

Using reduced topology within link state routing has proven to be an efficient way to decrease routing overhead while still providing sufficient route quality. There are various ways to achieve topology reduction, based on different ways to form a backbone in the network this backbone usually originates from the flooding optimization scheme in use, such as MPR or CDS. In case of mobile ad hoc networks, flooding using MPR backbones is preferable as it is more robust in face of topology changes, compared to flooding using CDS backbones. This text therefore describes several methods to enable the use of reduced topology in wireless OSPF for MANETs, when MPR-based flooding optimizations are used. The topology reduction methods that are proposed for MPR-based approaches perform at least as well as the similar schemes that were recently proposed for CDS-based apporaches.
Download File ]]>

Publication date:	2005-06-01
Authors:	T.Clausen, C.Adjih, E.Baccelli, P.Jacquet
Published in:	INRIA Research Report RR-5609
URL:	http://www.thomasclausen.org/Professi...

We investigate in this paper the effect of mobility, collisions and obsolete informations on the performance of connected dominating set (CDS). In particular we show that neighbor-designated CDS such as multipoint relay (MPR) as are in general more robust than self-selected CDS such as rule k CDS. This is particularly crucial in application such as wireless OSPF where third party topology informations may take arbitrary delay
Download File ]]>

Publication date:	2005-06-01
Authors:	E. Baccelli
Published in:	Mediterranean Workshop on Ad-Hoc Networks (MED-HOC-NET), Porquerolles, France, June 2005

The main ad hoc routing protocols that were proposed generally provide only flat networks. However the Internet has always been of a hierarchical nature, for scalability and manageability reasons. This paper therefore introduces a simple mechanism providing dynamic clustering with OLSR, one of the MANET routing solutions, chosen for its ease of integration in the Internet infrastructure. This clustering can have many different applications. This work describes how it can be used to provide hierarchical routing with OLSR. However, it is not limited to this use.
Download File ]]>

Publication date:	2005-05-01
Authors:	E. Baccelli, T. Clausen
Published in:	IEEE International Symposium on Circuits and Systems (ISCAS), Kobe, Japan, May 2005

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 existing 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 requirements to the network. While we recognize that this is a partial solution 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.
Download File ]]>

Publication date:	2005-04-01
Authors:	E. Baccelli, T. Clausen, R. Wakikawa
Published in:	International Conference on Networks and Communication Systems (NCS), Krabi, Thailand, April 2005

Internet edge mobility has been possible for a number of years: mobile IP[8], allows a host to change its point of attachment to the Internet and NEMO [6] allows the same functionality for a group of hosts along with a mobile router. The virtue of NEMO and mobile IP is transparency: a host remains identifiable through the same IP address, and traffic sent to that IP address will be tunneled to arrive at the intended node. NEMO allows “nested networks”: a mobile network which attaches to another mobile network to arbitrary depth. However for each level of nesting, traffic is encapsulated and tunneled to reach the destination. This leads to increased overhead (encapsulation) and to sub-optimal paths (tunneling without consideration for the actual net- work topology). In this paper, we investigate route-optimization in nested NEMO networks. We employ an ad-hoc routing protocol between mobile routers to ensure shortest routes when both source and destination for traffic is within the nested NEMO network. The mechanism also simplifies the requirements for route optimization when the source node is located outside of the nested NEMO network.
Download File ]]>

Publication date:	2005-02-01
Authors:	T.Clausen, A.Laouiti, P.Muhlethaler, D.Raffo, C.Adjih
Published in:	INRIA Research Report RR-5621
URL:	http://www.thomasclausen.org/Professi...

The primary issue with respect to securing Mobile Ad hoc NETworks (MANETs) is that of ensuring network integrity even when the network is subject to attacks to break its connectivity. In this research report, we study how to secure the OLSR routing protocol . We first analyse the attacks that can be launched against the network integrity. We then present mechanisms for ensuring that only ``trusted'' nodes are admitted into the network and, subsequently, are the only nodes used to forward traffic. We also present mechanisms for detecting and dealing with scenarios where ``trusted'' nodes have become compromised.
Download File ]]>

Publication date:	2004-12-01
Authors:	T.Clausen, E.Baccelli, G.Rodolakis, C.Adjih, P. Jacquet
Published in:	IEEE Journal on Communications Networks (JCN), Special Issue on Ad Hoc Networking, Dec 2004
URL:	http://www.thomasclausen.org/Professi...

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.
Download File ]]>

Publication date:	2004-10-01
Authors:	E. Baccelli, T. Clausen, P. Jacquet
Published in:	Proceedings of the Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), London, UK.

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.
Download File ]]>

Publication date:	2004-10-01
Authors:	E. Baccelli, T. Clausen, P. Jacquet
Published in:	IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON), San Jose, USA, Oct. 2004

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 synchronization. The goal of this extension is to provide a mechanism, through which nodes in an ad-hoc sensor network can detect 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.
Download File ]]>

Publication date:	2004-08-01
Authors:	E. Baccelli, P. Jacquet
Published in:	International Conference on Internet and Multimedia Systems and Applications (IMSA), Hawaii, USA, Aug. 2004

Scarce bandwidth and interferences in mobile ad-hoc networks yield the need for more efficient diffusion techniques than these employed on usual wired networks, especially in dense environments. In this paper, we compare some optimized flooding mechanisms that were proposed in view to gain enough performance and allow applications such as multimedia diffusion in an ad hoc environment. We namely present multi-point relay (MPR) flooding and gateway flooding. We investigate the matter theoretically via mathematical modelling, as well as practically via simulations. It is shown how well each of these techniques improve the diffusion performances: when the network is dense, 2/3 of the gateway nodes participate in the retransmissions, while the density of multi-point relay retransmitters is 1/v , where v is the node density.
Download File ]]>

Publication date:	2004-07-01
Authors:	T.Clausen, P.Jacquet, L.Viennot
Published in:	ACM Journal on Wireless Networks (Winet) July 2004, volume 10 no. 4
URL:	http://www.thomasclausen.org/Professi...

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.
Download File ]]>

Publication date:	2004-06-01
Authors:	T.Clausen, P.Jacquet, E.Baccelli
Published in:	INRIA Research Report RR-5283
URL:	http://www.thomasclausen.org/Professi...

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 connectivity 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 synchronization. The goal of this extension is to provide a mechanism, through which nodes in an ad-hoc sensor network can detect 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.
Download File ]]>

Publication date:	2004-03-01
Authors:	T. Clausen
Published in:	INRIA Research Report RR-5135

In this paper, we describe the Optimized Link State Routing Protocol (OLSR), a proactive routing protocol for Mobile Ad-hoc NETworks (MANETs). We evaluate its performance through exhaustive simulations using the Network Simulator 2 (ns2), and compare with other ad-hoc protocols, specifically the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and the Dynamic Source Routing (DSR) protocol. We study the protocols under varying conditions (node mobility, network density) and with varying traffic (TCP, UDP, different number of connections/streams) to provide a qualitative assessment of the applicability of the protocols in different scenarios.
Download File ]]>

Publication date:	2004-01-01
Authors:	T.Clausen, E.Baccelli, and P.Jacquet
Published in:	INRIA Research Report RR-5096

In this paper, we specify a mechanism for link-state database exchanges in wireless ad-hoc networks. The mechanism is taylored for ad-hoc networks employing the wireless OSPF interface extension specification , however is suitable for any proactive link-state routing protocol.The database exchange mechanism is specified with the following applications in mind: reliable diffusion of link-state information, replacing OSPF acknowledgements with a mechanism, suitable for mobile wireless networks; reduced overhead for performing OSPF style database exchanges in a mobile wireless network; reduced initialization time when new node(s) are emerging in the network; reduced overhead and reduced convergence time when two (or more) WOSPF adhoc network clouds merge.
Download File ]]>

Publication date:	2003-10-01
Authors:	C. Adjih, E. Baccelli, P. Jacquet
Published in:	IEEE Military Communications Conference, vol. 22, no. 1, pp. 1274-1279, Boston, USA, Oct. 2003

Link state has been the dominating IGP routing technology in IP networks for more than a decade. With the advent of wireless ad-hoc networking, the need for light, efficient and robust routing makes it a good candidate to be also used in this constrained environment. One of the key issue in ad-hoc networking is the lack of bandwidth. Thus, in this paper we examine the overhead due to link state routing in an ad-hoc network. More precisely we study the classic link-state protocol OSPF and OLSR, a link state protocol that was developed specifically for ad-hoc networks. Further, we study how this overhead evolves when the node density increases. The last part of the paper presents directions towards extending OSPF for wireless and ad-hoc networks, which would make it a favorite to seamlessly unify wired and mobile IP networks.
Download File ]]>

Publication date:	2003-10-01
Authors:	T. Clausen, P. Jacquet
Published in:	The Internet Engineering Task Force (IETF) - MANET Working Group
URL:	http://www.ietf.org/html.charters/man...

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.
Download File ]]>

Publication date:	2003-02-01
Authors:	T.Clausen. A.Laouiti, P.Jacquet, P.Minet, L.Viennot, C.Adjih
Published in:	INRIA Research Report RR-4721
URL:	http://www.thomasclausen.org/Professi...

This document describes the Multicast extension for the Optimized Link State Routing protocol (MOLSR). MOLSR is in charge of building a multicast structure in order to route multicast traffic in an ad-hoc network. MOLSR is designed for mobile multicast routers, and works in a heterogenous network composed of simple unicast OLSR routers, MOLSR routers and hosts. In the last part of this document we introduce also a Wireless Internet Group Management Protocol (WIGMP). It offers the possibility for OLSR nodes (without multicast capabilities) to join multicast groups and receive multicast data.
Download File ]]>

Publication date:	2002-07-01
Authors:	T.Clausen, P.Jacquet, L.Viennot, G.Hansen
Published in:	INRIA Research Report RR-4509
URL:	http://www.thomasclausen.org/Professi...

Many protocols for Mobile Ad-hoc Networks such as AODV propose construction routes reactively using flooding. The advantage hereof is, that no prior assumptions of the network topology are required in order to provide routing between any pair of nodes in the network. In mobile networks, where the topology is subject to frequent changes, this is a particularly attractive property. In this paper, we investigate the effect of using flooding for acquiring routes. We show, that flooding may lead to non-optimal routes in terms of number of hops. This implies that more retransmissions are needed to send a packet along a route. We proceed by providing a qualitative analysis of the route lengths. Finally, we propose and evaluate through simulations, alternative flooding schemes such as MPR flooding and Suoerflooding. MPR flooding considerably reduces the flooding overhead and provides shorter routes very close to optimal. Superfloo- ding provides optimal routes but to the cost of an significant but anyhow reasonable increase of flooding overhead.
Download File ]]>

Publication date:	2001-05-01
Authors:	E. Baccelli, R. Rajan
Published in:	Proceedings of IM 2001 - IFIP/IEEE International Symposium on Integrated Network Management, no. 1, pp. 825-838, Seattle, USA.

In this paper, we present the design and the implementation of an OSPF route monitoring service hooked up to a managed IP network, enabling the administrator to be aware in real-time of the routes actually used throughout the OSPF domain. Such a service represents an advance over tools available today that offer off-line emulations of routing protocols, or that track network routing behavior in a local, semi-static manner. The real-time route monitoring service has applications to network management functions such as QoS service fulfillment, performance analysis and SLA verification.
Download File ]]>

Project Assistant Permanent Staff email: cindy[dot]vingadassamy[at]inria[dot]fr

Cindy is the first point of contact for all inqueries to Hipercom@LIX, and will be the person keeping track of all activities within Hipercom@LIX.
]]>

Masters Students email: veronika[dot]m[dot]bauer[at]gmail[dot]com

Veronika is about to graduate (we hope) from a joint master's program in Software Engineering of the Universities of Augsburg, LMU München, and TU München.

She has joined Hipercom@LIX for one semester to write her master's thesis on routing protocols for LLNs.

]]>

Project Assistant Alumni email: Lydie[dot]Fontaine[at]inria[dot]fr

Lydie came to Hipercom after a long career in the tech-industry, where she were working for some of the biggest companies in the IT sector. She thus brought to Hipercom a tremendous experience in how to manage and run a team, and is the person making sure that everything practically and administratively runs smoothly.

In general, Lydie will be the first point of contact for all inqueries to Hipercom@LIX, and will be the person keeping track of all activities within Hipercom@LIX.
]]>

Permanent Staff email: Thomas[at]ThomasClausen[dot]org + Homepage

A graduate of Aalborg University, Denmark (M.Sc., PhD - civilingeniør, cand. polyt), Thomas spent a number of years at INRIA. There he, among other things, spent his time developing and standardising OLSR.

In 2004 he joined faculty at Ecole Polytechnique, France's premiere technical university.

Thomas has a particular affinity for "applicable research", and enjoys working with industrial partners and standardisation bodies. He is, thus co-chair of the MANET AUTOCONF working group within the IETF, as well as the author and editor of several standard track and other documents within the IETF.

]]>

Permanent Staff email: philippe[dot]jacquet[at]inria[dot]fr + Homepage

Philippe Jacquet is Research director in Institut National de Recherche en Informatique et Automatique (INRIA) and is currently the scientific leader of Hipercom project.

Phillipe graduated from Ecole Polytechnique some time ago and subsequently joined the Corps des Mines. As "Ingenieur General des Mines" he is currently on leave - detached - at INRIA. If you don't understand very well all the details about these titles and positions, this is just a pure French administrative cooking which means that his main activity is research in a government institute.

Philippe's main research topics are algorithms, wireless networking, information theory, protocols and models. He has even looked at the feasibility of time backward information transfers. Philippe loves theory, but likes it the most when it is eventually useful (he is, however, open to discuss what exactly "eventually" means). But never forget that innovations very frequently arise out of planes,

Philippe is among the main originators of the OLSR protocol, a story that started in 1997...


]]>

Alumni email: songyean[dot]cho[at]gmail[dot]com

A graduate of Korea University, South Korea, Song Yean spent a number of years working as an engineer at Samsung Electronics. There she, among other things, spent her time developing and standardizing IEEE 802.11s.

In 2005 she started her Ph.D studies at Ecole Polytechnique, France's premiere technical university.

Her research focus is mesh networks and network coding theory.

Dr. Cho defended her PhD thesis on September 22, 2008. She has since returned to Samsung in Seoul.
]]>

PhD Students email: j[dot]a[dot]cordero[at]gmail[dot]com + Homepage

A graduate from Technical University of Catalonia / Spain, Juan Antonio joined Hipercom in 2007 as a PhD student.

Juan Antonio is the principal developer of
the Hipercom implementation of the OSPF-MPR extension for MANETs [RFC5449] , for both GTnetS simulation and Linux.
]]>

PhD Students email: ulrich[dot]herberg[at]polytechnique[dot]edu + Homepage

A graduate of TUM, Ulrich joined Hipercom in 2007 as a PhD student.

Ulrich is the principal developer of:
Simulation of Java Routing Protocols with Ns2
OLSRv2 Protocol Suite Interop Tools

]]>

PhD Students email: marienestor[dot]mariyasagayam[at]Hitachi-eu[dot]com + Homepage

Upon obtaining a masters degree from Eurecom, Nestor joined Hitachi Labs Europe and Hipercom as a CIFRE PhD student
]]>

Permanent Staff email: Emmanuel[dot]Baccelli[at]inria[dot]fr + Homepage

Emmanuel is a graduate of Ecole Polytechnique, France where he got a PhD in Computer Science and Mathematics. Since October 2006, he has been a staff researcher at INRIA, Paris. Part of the Hipercom project at Ecole Polytechnique, his focus is on ad hoc networking and its integration in the Internet. Among other projects in the field, he contributes continously in the MANET, OSPF, AUTOCONF and NEMO working groups in the IETF.

In a past life (i.e. before turning to research), Emmanuel was trained as an engineer, graduated from EURECOM and INT, and worked as such in the Silicon Valley with Metro-Optix Inc. and as a consultant for AT&T Labs in New Jersey, USA. He continued his industrial curriculum by collaborating with Hitachi Ltd. which funded part of his research during his PhD.

Emmanuel is the principal developer of:
muOLSR for Scatterweb

]]>

Alumni email: georgios[at]comp[dot]mq[dot]edu[dot]au + Homepage

Georgios joined Hipercom@LIX for his PhD entitled "Analytical Models and Performance Evaluation in Massive Mobile Ad Hoc Networks" -- which he successfully defended in 2006.

He is currently a research fellow at Macquarie University, Australia
]]>

Contact:

emmanuel[dot]baccelli[at]inria[dot]fr

Depuis le milieu des années 1990, deux révolutions transforment le monde des télécommunications : les technologies de communications sans-fil d'une part, et les technologies Internet d'autre part. La convergence semble maintenant inéluctable entre ces deux raz-de-marée, et la perspective est celle d’un réseau ambiant omniprésent, qui déplacera à chaque instant et en temps réel des quantités considérables d’information multimédia, que les éléments du réseau et les destinataires soient fixes ou mobiles.

Au coeur de cette convergence technologique, des réseaux mobiles d’un nouveau genre se développent : les réseaux ad hoc. Ces derniers incarnent d’une certaine manière la synthèse de l’Internet et des communications mobiles sans-fil. Leur principe de fonctionnement est le suivant : chaque terminal utilisateur peut être utilisé comme relais intermédiaire pour acheminer le trafic entre d’autres terminaux utilisateurs. En d’autres termes, les réseaux ad hoc abolissent la différence traditionnelle entre d’une part les terminaux qui utilisent le réseau, et d’autre part les machines de l’infrastructure (les routeurs), dédiées à la formation et à la maintenance du réseau, et à l’acheminement du trafic utilisateurs. Dans les réseaux ad hoc, il n’y a qu’un seul type de machine, qui à la fois utilise et forme le réseau, tandis que le medium radio est utilisé pour acheminer à la fois le trafic utile - les informations que veulent transmettre les utilisateurs - et le trafic de contrôle - les informations que doivent échanger les éléments du réseau pour découvrir et maintenir à jour les routes à travers le réseau, tâche que l'on appelle le routage.

L'objectif de ce stage est d'implémenter et tester certains algorithmes de routage ad hoc (basés sur protocole OLSR), et de diffusion d'information dans un réseau de capteurs. Une centaine de capteurs seraient utilisés à cet effet, ce qui en ferait l'un des plus grand réseau de ce type réalisé jusqu'à présent. Les problématiques de recherche abordées se rangent dans deux catégories: d'une part l'évaluation de certaines approches pour le routage ad hoc dans le contexte de grand réseaux de capteurs (contraintes de bande passante, de puissance de calcul, de mémoire etc.), et d'autre part l'élaboration de protocoles de tests et d'expériences utilisant les communications sans-fil ad hoc (appréhension de l'hostilité et de la versatilité du medium radio, de la simulation de la mobilité).

]]> The Internet Unwired

+ Homepage
A long-time collaborator of Hipercom on IP standardization matters and protocol development, Wakikawa laboratory at KEIO University has as goal is to develop a universal architecture of the Unwired Internet and protocols to achieve the Unwired Internet]]> Kenichi Mase, Yasunori Owada

+ Homepage
The Information and Communication Networks Laboratory at Niigata University, under the direction of professor Kenichi Mase, is one of our key partners in OLSRv2, as well as related ad hoc networking issues.]]> Leonidas Georgiadis

+ Homepage
]]> Wojciech Szpankowski

+ Homepage
]]> Bernard Mans

+ Homepage
]]> J. Schiller

+ Homepage
With a focus on mobile and wireless communications, communication architectures and operating systems for embedded devices, and quality of service aspects in communication systems, this department has developed ScatterWeb, a platform for self-configuring wireless sensor networks. What started as research project has already led to an awarded spin-off company and several academic collaborations, including one with Hipercom.
More information on the specificities of this platform can be found here: http://scatterweb.mi.fu-berlin.de]]>