Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Scalable location services for hierarchically organized mobile ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Connected k-Hop Clustering in Ad Hoc Networks
ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
CASAN: Clustering algorithm for security in ad hoc networks
Computer Communications
| Hi-index | 0.00 |
Constructing stable and reliable weight-based clusters which can provide faster convergence rates and performance results for dynamic routing is a challenging task in mobile ad hoc networks. In this paper, we propose an adaptive framework for weight estimation and dissemination which considers decisive node properties in determining a node's suitability for becoming clusterheads and employs adaptive cluster radius and dynamic network constraints as a weight dissemination criterion. It is observed that the proposed algorithm is suitable for scalable ad hoc networks and is adaptable for any cluster formation decisions based on weighted or cost metric approaches. We present a cluster formation and maintenance algorithm that forms well distributed clusters and performs adaptive control to increase the cluster life time so as to optimize routing efficiency. The simulation results corroborate that this protocol is the best suited scheme for adaptive stable clustering and control overhead reduction in large scale mobile ad hoc networks.