Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
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
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
Connectivity-Based k-Hop Clustering in Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Private location-based information retrieval through user collaboration
Computer Communications
Hi-index | 0.00 |
Clustering has evolved as an important research topic in MANETs as it improves the system performance of large MANETs. Most existing schemes have large overhead associated with cluster formation and cluster maintenance. They also trigger reclustering periodically. This renders these schemes non-scalable. In this paper, we present a clustering scheme that minimizes message overhead for cluster formation and maintenance. We do not require reclustering as clusters in our scheme do not degenerate into single node clusters over time. We simulated our clustering scheme in ns-2. The results show that the number of clusters formed are in proportion to the number of nodes in the MANET.We also show that our scheme is resilient to variations in mobility. This shows that our scheme is scalable as well as adaptable.