Complexity of network synchronization
Journal of the ACM (JACM)
Multicluster, mobile, multimedia radio network
Wireless Networks
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Limiting the impact of mobility on ad hoc clustering
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
Optimal Initialization and Gossiping Algorithms for Random Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Nested clusters with intercluster routing
The Journal of Supercomputing
A distributed hierarchical clustering algorithm for large-scale dynamic networks
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
| Hi-index | 0.00 |
The Distributed Mobility-Adaptive 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, i.e. 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 multi-hop ad hoc wireless network of n stations in O(k 1/2log驴1/2 k)+D b 驴1+O(log驴(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. 18(1):17---28 2007).