HIgh PERformance COMmunications

Abstract: This manuscript provides several ad hoc routing protocol extensions and evaluations thereof, that allow increasing performance, scaling the network size, and integrating ad hoc networks into the Internet:

First, this manuscript presents software tools, which allow to study unmodified routing pro- tocols, implemented in Java, in the network simulator NS2.

Second, the manuscript provides an architectural discussion of ad hoc networks, which ex- plains the problems of automatic configuration of IP addresses (called “autoconfiguration”) on ad hoc routers, and presents an architectural model for ad hoc networks, compatible with the Internet. An autoconfiguration protocol, based on the proposed architectural model, is specified, and its properties are formally verified by means of model checking.

Third, several extensions to the Optimized Link State Routing Protocol version 2 (OLSRv2) are presented: The in-router performance of the protocol is largely increased when using a dynamic shortest path algorithm for calculating routes.

Another proposed optimization is an SNMP-based framework to manage and control perfor- mance related objects on routers running OLSRv2.

An extension of OLSRv2 is presented, where packets are retransmitted later for temporarily unavailable destinations, instead of dropping them, leading to delivery ratios significantly higher than standard OLSRv2 in certain scenarios.

This manuscript presents an analysis of security threats to OLSRv2, followed by a specifica- tion of a router and link admittance control mechanism for OLSRv2, alleviating many of these attacks.

Fourth, this manuscript investigates scalability of wireless sensor networks (WSNs), and evaluates a routing protocol for such WSNs being specified by the IETF as of 2011, denoted RPL. Moreover, as RPL does not contain any mechanism for efficient broadcasts, several optimized broadcasting mechanisms in RPL are presented and compared.
Category: Thesis

Abstract: This document describes a 1-hop and symmetric 2-hop neighborhood discovery protocol (NHDP) for mobile ad hoc networks (MANETs).

This is part of the Hipercom@LIX efforts towards OLSRv2 Standardization
Category: Standard - IETF

Abstract: The Trickle algorithm allows nodes in a lossy shared medium (e.g., low-power and lossy networks) to exchange information in a highly robust, energy efficient, simple, and scalable manner. Dynamically adjusting transmission windows allows Trickle to spread new information on the scale of link-layer transmission times while sending only a few messages per hour when information does not change. A simple suppression mechanism and transmission point selection allow Trickle's communication rate to scale logarithmically with density. This document describes the Trickle algorithm and considerations in its use.

muOLSR for Sensor Connectivity
Category: Standard - IETF

Abstract: This document describes a general and flexible TLV (type-length-value structure) for representing time-values, such as an interval or a duration, using the generalized Mobile Ad hoc NETwork (MANET) packet/message format. It defines two Message TLVs and two Address Block TLVs for representing validity and interval times for MANET routing protocols.
Category: Standard - IETF

Abstract: This document specifies a packet format capable of carrying multiple messages that may be used by mobile ad hoc network routing protocols.
Category: Standard - IETF

Abstract: This document provides recommendations for jittering (randomly modifying timing) of control traffic transmissions in Mobile Ad hoc NETwork (MANET) routing protocols to reduce the probability of transmission collisions. This memo provides information for the Internet community.


Category: Standard - IETF

Abstract: This document describes the Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks. The protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN. The key concept used in the protocol is that of multipoint relays (MPRs). MPRs are selected nodes which forward broadcast messages during the flooding process. This technique substantially reduces the message overhead as compared to a classical flooding mechanism, where every node retransmits each message when it receives the first copy of the message. In OLSR, link state information is generated only by nodes elected as MPRs. Thus, a second optimization is achieved by minimizing the number of control messages flooded in the network. As a third optimization, an MPR node may chose to report only links between itself and its MPR selectors. Hence, as contrary to the classic link state algorithm, partial link state information is distributed in the network. This information is then used for route calculation. OLSR provides optimal routes (in terms of number of hops). The protocol is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
Category: Standard - IETF