Abstract
We present a self-stabilizing clustering algorithm for asynchronous networks. Our algorithms works under any scheduler and is silent. The sizes of the clusters are bounded by a parameter of the algorithm. Our solution also avoids constructing a large number of small clusters. Although the clusters are disjoint (no node belongs to more than one cluster), the clusters are connected to form a tree so that the resulting overlay graph is connected. The height of the tree of clusters is bounded by the diameter of the network.
This research was partially funded by the Foundation for Scientific Cooperation Digiteo.
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
Amis, A.D., Prakash, R., Huynh, D., Vuong, T.: Max-min d-cluster formation in wireless ad hoc networks. In: IEEE INFOCOM, pp. 32–41 (2000)
Basagni, S.: Distributed clustering for ad hoc networks. In: International Symposium on parallel Architectures, Algorithms and Networks (ISPAN), pp. 310–315 (1999)
Bernard, T., Bui, A., Pilard, L., Sohier, D.: A distributed clustering algorithm for large-scale dynamic networks. International Journal of Cluster Computing, doi:10.1007/s10586-011-0153-z
Bui, A., Clavière, S., Datta, A.K., Sohier, D., Larmore, L.L.: Self-stabilizing hierarchical construction of bounded size clusters. Technical Report, http://www.prism.uvsq.fr/rapports/2011/document_2011_30.pdf
Bui, A., Clavière, S., Sohier, D.: Distributed construction of nested clusters with inter-cluster routing. IEEE Advances in Parallel and Distributed Computing Models (2011)
Bui, A., Kudireti, A., Sohier, D.: A fully distributed clustering algorithm based on random walks. In: International Symposium on Parallel and Distributed Computing (ISPDC 2009), pp. 125–128. IEEE CS Press, Los Alamitos (2009)
Caron, E., Datta, A.K., Depardon, B., Larmore, L.L.: A self-stabilizing k-clustering algorithm for weighted graphs. J. Parallel and Distributed Comp. 70, 1159–1173 (2010)
Datta, A.K., Larmore, L.L., Vemula, P.: A self-stabilizing O(k)-time k-clustering algorithm. The Computer Journal 53(3), 342–350 (2010)
Datta, A.K., Devismes, S., Larmore, L.L.: A random walk based clustering with local recomputations for mobile ad hoc networks. In: IPDPS, pp. 1–8 (2010)
Dijkstra, E.W.: Self stabilizing systems in spite of distributed control. Communications of the Association of Computing Machinery 17, 643–644 (1974)
Dolev, S.: Self-Stabilization. The MIT Press, Cambridge (2000)
Dolev, S., Tzachar, N.: Empire of colonies: Self-stabilizing and self-organizing distributing algorithm. Theoretical Computer Science 410, 514–532 (2009)
Ephremides, A., Wieselthier, J.E., Baker, D.J.: A design concept for reliable mobile radio networks with frequency hopping signaling. IEEE 75(1), 56–73 (1987)
Johnen, C., Mekhaldi, F.: Robust self-stabilizing construction of bounded size weight-based clusters. In: D’Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010. LNCS, vol. 6271, pp. 535–546. Springer, Heidelberg (2010)
Johnen, C., Nguyen, L.: Robust self-stabilizing weight-based clustering algorithm. Theoretical Computer Science 410(6-7), 581–594 (2009)
Mitton, N., Busson, A., Fleury, E.: Self-organization in large scale ad hoc networks. In: Mediterranean ad hoc Networking Workshop, MedHocNet (2004)
Mitton, N., Fleury, E., Guerin Lassous, I., Tixeuil, S.: Self-stabilization in self-organized multihop wireless networks. In: Second International Workshop on Wireless Ad Hoc Networking. IEEE Computer Society, Los Alamitos (2005)
Sucec, J., Marsic, I.: Location management handoff overhead in hierarchically organized mobile ad hoc networks. Parallel and Distributed Processing Symp. 2, 194 (2002)
Sung, S., Seo, Y., Shin, Y.: Hierarchical clustering algorithm based on mobility in mobile ad hoc networks. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3982, pp. 954–963. Springer, Heidelberg (2006)
Yang, S.-J., Chou, H.-C.: Design issues and performance analysis of location-aided hierarchical cluster routing on the manet. In: International Conference on Communications and Mobile Computing, pp. 26–33. IEEE Computer Society, Los Alamitos (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bui, A., Clavière, S., Datta, A.K., Larmore, L.L., Sohier, D. (2011). Self-stabilizing Hierarchical Construction of Bounded Size Clusters. In: Kosowski, A., Yamashita, M. (eds) Structural Information and Communication Complexity. SIROCCO 2011. Lecture Notes in Computer Science, vol 6796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-22212-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22211-5
Online ISBN: 978-3-642-22212-2
eBook Packages: Computer ScienceComputer Science (R0)