Abstract
The research of mobile ad hoc networks has attracted a lot of attentions recently. In particular, extensive research efforts have been devoted to the design of clustering strategies to divide all nodes into a clustering architecture such that the transmission overhead for the update of routing tables after topological changes can be reduced. The performance of a clustering architecture has been demonstrated to be closely related to the number of its clusters. In this paper, we will propose an efficient clustering algorithm to minimize the number of clusters and the variation of cluster sizes. Computer simulations show that both the number of clusters and the variation of cluster sizes generated by our clustering algorithm are less than those generated by other existing clustering algorithms that also aim to minimize the number of clusters.
This work was supported by the National Science Council of the Republic of China under Grant # NSC 91-2218-E-224-007
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alimonti, P., Calamoneri, T.: Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. In: D’Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol. 1197, pp. 2–16. Springer, Heidelberg (1997)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)
Chen, G., Nocetti, F.G., Gonzalez, J.S., Stojmenovic, I.: Connectivity Based K-Hop Clustering in Wireless Networks. In: Proc. of the 35th Hawaii International Conference on System Sciences (2002)
Gerla, M., Tsai, J.: Multicluster, Mobile, Multimedia Radio Network. ACM/Baltzer Journal of Wireless Networks 1, 225–238 (1995)
Iwata, A., Chiang, C.C., Pei, G., Gerla, M., Chen, T.W.: Scalable Routing Strategies for Ad Hoc Wireless Networks. IEEE J. Select. Areas Commun. 17, 1369–1379 (1999)
Su, D.C., Hwang, S.F., Dow, C.R., Wang, Y.W.: An Efficient K-Hop Clustering Routing Scheme for Ad-Hoc Wireless Networks. Journal of the Internet Technology 3, 139–146 (2002)
Wang, C.W., Sheu, P.R.: A Study on Stable Clustering for Mobile Ad Hoc Networks. Technical Report, National Yunlin University of Science & Technology (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sheu, PR., Wang, CW. (2003). Minimizing Both the Number of Clusters and the Variation of Cluster Sizes for Mobile Ad Hoc Networks. In: Kahng, HK. (eds) Information Networking. ICOIN 2003. Lecture Notes in Computer Science, vol 2662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45235-5_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-45235-5_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40827-7
Online ISBN: 978-3-540-45235-5
eBook Packages: Springer Book Archive