Multicluster, mobile, multimedia radio network
Wireless Networks
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
International Journal of Network Management
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
A Distributed Approach to Node Clustering in Decentralized Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
A distributed group mobility adaptive clustering algorithm for mobile ad hoc networks
Computer Communications
A constant-factor approximation for d-hop connected dominating sets in unit disk graph
International Journal of Sensor Networks
| Hi-index | 0.00 |
Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a technique is presented to construct multi-hop clusters with balanced sizes, based on the neighborhood benchmark (NB) to quantify the connectivity and link stability of mobile nodes. By exploiting autonomous clusterhead selection and a specialized handshake process with the clusterheads, the nodes with highest NB scores are selected as clusterheads and all the clusters constructed are connected. The deviation of cluster sizes is kept small using a partial probability-based approach. Our technique generates highly stable multi-hop clusters with low overhead, and provides the flexibility of controlling the cluster radius adaptively for various network applications.