Romain Mellier

A clustering mutual exclusion protocol for multi-hop mobile ad hoc networks

Obtaining a hierarchical organization of a network is a well-known and studied problem of distributed computing. It has been proved effective in the solution of several problems such as, minimizing the amount of storage for communication information. In this paper, we derive a clustering token-based mutual exclusion algorithm for multi-hop mobile ad hoc networks which needs O(n) broadcast rounds. Moreover our approach yields a fault-tolerant protocol.

Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks

Previous mutual exclusion (MUTEX for short) protocols for mobile ad hoc networks are based on the token circulation technique. They assume that the network is reliable to avoid starvation. Considering that the MUTEX issue is to share a communication channel, we have designed an average-case-analysis protocol for single-hop networks which is based on the fully distributed construction of a random binary tree. Contrarily to other papers, the stations are not identified and their number (n) is unknown. Assuming that time is slotted, our algorithm runs in approximately n/log 2 slots. The derived k-MUTEX protocol runs in n/log k slots.

AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights

In 1999, S. Basagni has presented the DMAC algorithm (distributed mobility-adaptive clustering) that partitions the nodes of a mobile ad hoc network into clusters, thus giving the network a hierarchical organization. This algorithm supports the mobility of the nodes, even during the cluster formation. Its main feature is that it considers weighted networks to choose the clusterheads, in contrary to the other heuristics which take into account parameters, like the degree or the identifier, which have no physical relation with the network topology. The problem of that protocol is that it assumes that the weights are unique (i.e. distincts for each node). We propose an original solution to this issue and we present a complete performance study measuring the improvement.

A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks

This paper presents distributed broadcast algorithms for Mobile Ad Hoc NETworks (MANETs for short) with unknown time-varying topology. The first one is an improvement of a protocol of Basagni, Bruschi and Chlamtac (1999), solving in an other way the problem of sharing communication channels. The second one introduces a technique inspired by the Magic Packet technology presented by AMD in 1995 and the principle of controlled-mobility to minimize the energy consumption of mobiles. The last one improves this mechanism to save much more energy. We show that each of these algorithms need at most O(n.log n) broadcast rounds in a complete layered MANET.

A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks

This paper presents a simple mutual exclusion algorithm for ad hoc mobile networks. Our algorithm does not use the token circulation technique. A station which requests a Critical Section (CS) competes in order to be alone to use the unique channel dedicated to this CS. To reach this goal, we derive a Markov process which guarantees that each station will enter the CS. More precisely, we show that, in presence of collision detection, n/ln2 broadcast rounds are necessary in the average case to satisfy n (n unknown) stations wishing to enter the same CS.