A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks

In this paper we propose a novel location management scheme tailored for multicasting in Mobile Ad-hoc Networks (MANETs). We furthermore propose AMDLM, a location-based multicast algorithm relying on the location management service. Such an approach avoids fragile data structures such as trees or DAGs to manage multicast groups, without reverting to more reliable, yet overhead-prone mesh-based algorithms. AMDLM additionally enables us to derive analytical bounds due to its location-based nature

On the Accuracy of MANET Simulators

The deployment of wireless applications or protocols in the context of Mobile Ad-hoc NETwork (MANET), often requires to step through a simulation phase. For the results of the simulation to be meaningful, it is important that the model on which is based the simulator matches as closely as possible the reality. In this paper we present the results of the simulation of an algorithm using several popular simulators (OPNET Modeler, NS-2, GloMoSim). The results tend to show that significant divergences exist between the simulators. This can be explained partly by the mismatching of the modelisation of each simulator and also by the different levels of detail provided to implement and configure the simulated scenarios

Consensus with Unknown Participants or Fundamental Self-Organization

We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in the network is initially available. To this means we define a variant of the traditional consensus problem, by relaxing the requirement for the set of participating processes to be known by all at the beginning of the computation. This assumption captures the nature of self-organized networks, where there is no central authority that initializes each process with some context information. We consider asynchronous networks with reliable communication channels and no process crashes and provide necessary and sufficient conditions under which the problem admits a solution. These conditions are routing and mobility independent. Our results are relevant for agreement-related problems in general within self-organized networks

From a Location Service to a Multicast Service for Wireless Mobile Adhoc Networks

In this paper we propose a novel approach for multicasting in Mobile Ad-hoc Networks (MANETs). Since no fixed infrastructure of servers is assumed in MANETs, efficient location management schemes are necessary in order to store and provide information about various services offered throughout the network. MDLM is the first multicast algorithm relying on a location management service. We thus avoid fragile data structures such as trees or DAGs to manage multicast groups, without reverting to more reliable, yet overhead-prone mesh-based algorithms

Probabilistic Broadcast for Flooding in Wireless Mobile Ad hoc Networks

Although far from optimal, flooding is an in- dispensable message dissemination technique for network- wide broadcast within mobile ad hoc networks (MANETs). As such, the plain flooding algorithm provokes a high number of unnecessary packet rebroadcasts, causing contention, packet collisions and ultimately wasting precious limited bandwidth. We explore the phase transition phenomenon observed in percolation theory and random graphs as a basis for defining probabilistic flooding algorithms. By considering ideal and realistic models, we acquire a better understanding of the factors that determine phase transition, the consequences of the passage to realistic MANET conditions and to what extent we may benefit from probabilistic flooding in real MANET networks

FRANC: A Lightweight Java Framework for Wireless Multihop Communication

Simulation and emulation are popular means for evaluating wireless Mobile Ad hoc Networks (MANETs) protocols. Since MANETs are highly dependant on their physical environment, these techniques offer only a partial understanding of factors that may influence performance. Deploying real-life MANETs is therefore an indispensable complementary step for the advancement of MANETs. This paper presents FRANC, a dedicated extensible Java framework for the development, deployment and evaluation of applications and algorithms for wireless mobile ad hoc networks

A

framework for network coding in challenged wireless networ

A Lower Bound for Broadcasting in Mobile Ad Hoc Networks

We give a lower bound of $\Omega(n)$ rounds for broadcasting in a mobile ad hoc network, where $n$ is the number of nodes in the network. A round is the time taken by a node to successfully transmit a message to all its neighbors. It has been shown by Bruschi et al. and Chlebus et al. that a minimum of $\Omega(\log n)$ time-slots are required in a round to propagate the broadcast message by one hop. In static networks, this gives us the lower bound for network-wide broadcast to be $\Omega(D \log n)$ time-slots, where $D$ is its diameter. Although this lower bound is valid for a mobile network, we obtain a tighter lower bound of $\Omega(n \log n)$ time-slots by considering explicit node mobility. This result is valid even when $D \ll n$ and the network diameter never exceeds $D$. This shows that the dominating factor in the complexity of broadcasting in a mobile network is the number of nodes in the network and not its diameter