Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wu, J., Li, H.: On Calculating-Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In: Proc. 3rd International Workshop of Discrete Algorithms and Methods for Mobile Comp. and Commun., pp. 7–14 (1998)
Chen, Y.Z.P., Liestman, A.L.: Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks. In: Proc. 3rd ACM International Symposium Mobile Mobile Ad Hoc Net. and Comp., pp. 165–172 (2002)
Chen, G., Nocetti, F., Gonzalez, J., Stojmenovic, I.: Connectivity-Based k-Hop Clustering in Wireless Networks. In: HICSS 2002. Proceedings of the 35th Annual Hawaii International Conference on System Sciences, vol. 7, pp. 188–198 (2002)
Basu, P., Khan, N., Little, T.D.C.: A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks. In: ICDCSW 2001. Proceedings of the 21st International Conference on Distributed Computing Systems, p. 413 (2001)
Perkins, C., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In: ACM SIGCOMM’94 Conference on Communications Architectures, Protocols and Applications, pp. 234–244 (1994)
Chatterjee, N., Potluri, A., Negi, A.: A Self-Organizing Approach to MANET Clustering. In: HiPC 2006. Poster Paper, International Conference on High Performance Computing, December 18-21, 2006, Bangalore, India (2006), http://www.hipc.org/hipc2006/posters/manet.pdf
The Network Simulator ns-2.29 (2005), http://www.isi.edu/nsnam/ns/2005
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chatterjee, N., Potluri, A., Negi, A. (2007). A Scalable and Adaptive Clustering Scheme for MANETs. In: Janowski, T., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2007. Lecture Notes in Computer Science, vol 4882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77115-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-77115-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77112-8
Online ISBN: 978-3-540-77115-9
eBook Packages: Computer ScienceComputer Science (R0)