Authors: Jean Frédéric Myoupo Aboubecrine Ould Cheikhna Idrissa Sow
Publish Date: 2009/03/20
Volume: 52, Issue: 2, Pages: 135-148
Abstract
The Distributed MobilityAdaptive Clustering DMAC due to Basagni 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 The main feature of DMAC is that in a weighted network in which two or more nodes cannot have the same weight nodes have to choose the clusterheads taking into account only the node weight ie the mobility when a node weight is the inverse of its speed In our approach many nodes may have the same speed and hence the same weight We assume that nodes have no identities and the number of nodes say n is the only known parameter of the network After the randomized clustering we show that the initialization problem can be solved in a multihop ad hoc wireless network of n stations in Ok 1/2log 1/2 k+D b −1+Olog max P i +log 2max P i broadcast rounds with high probability where k is the number of clusters D b is the blocking diameter and max P i 1≤i≤k is the maximum number of nodes in a cluster Thus the initialization protocol presented here uses less broadcast rounds than the one in Ravelemanana IEEE Trans Parallel Distributed Syst 18117–28 2007
Keywords: