Abstract
Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists in partitioning network nodes into groups called clusters, giving a hierarchical organization of the network. A self-stabilizing algorithm, regardless of the initial system configuration, converges to legitimates configurations without external intervention. Due to this property, self-stabilizing algorithms tolerate transient faults.
In this paper we present a robust self-stabilizing clustering algorithm for ad hoc network. The robustness property guarantees that, starting from an arbitrary configuration, in one round, network is partitioned into clusters. After that, the network stays partitioned during the convergence phase toward a legitimate configuration where the clusters partition ensures that any neighborhood has at most k clusterheads (k is a given parameter).
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
Frodigh, M., Johansson, P., Larsson, P.: Wireless ad hoc networking: The art of networking without a network. In: Ericsson Review, No. 4 (2000)
Banerjee, S., Khuller, S.: A clustering scheme for hierarchical control in multi-hop wireless networks. In: The 20th Conference of the IEEE Communications Society (INFOCOM 2001), pp. 1028–1037 (2001)
Basagni, S.: Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks. In: Proceedings of the IEEE 50th International Vehicular Technology Conference (VTC 1999), pp. 889–893 (1999)
Basagni, S.: Distributed clustering for ad hoc networks. In: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN 1999), pp. 310–315 (1999)
Chatterjee, M., Das, S., Turgut, D.: WCA: A weighted clustering algorithm for mobile ad hoc networks. Journal of Cluster Computing, Special issue on Mobile Ad hoc Networking 5(2), 193–204 (2002)
Fernandess, Y., Malkhi, D.: K-clustering in wireless ad hoc networks. In: Proceedings of the second ACM international workshop on Principles of mobile computing (POMC 2002), pp. 31–37 (2002)
Gerla, M., Tsai, J.T.: Multicluster, mobile, multimedia radio network. Wireless Networks 1(3), 255–265 (1995)
Lin, C.R., Gerla, M.: Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15(7), 1265–1275 (1997)
Johnen, C., Nguyen, L.: Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2006. LNCS, vol. 4240, pp. 83–94. Springer, Heidelberg (2006)
Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: Proceedings of the 5th IPDPS Workshop on Advances in Parallel and Distributed Computational Models (WAPDCM 2003) (2003)
Xu, Z., Hedetniemi, S.T., Goddard, W., Srimani, P.K.: A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph. In: Proceedings of the 5th International Workshop on Distributed Computing (IWDC 2003). LNCS, vol. 2918. Springer, Heidelberg (2003)
Bein, D., Datta, A.K., Jagganagari, C.R., Villain, V.: A self-stabilizing link-cluster algorithm in mobile ad hoc networks. In: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 2005), pp. 436–441 (2005)
Mitton, N., Fleury, E., Lassous, I.G., Tixeuil, S.: Self-stabilization in self-organized multihop wireless networks. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops (WWAN 2005), pp. 909–915 (2005)
Mitton, N., Busson, A., Fleury, E.: Self-organization in large scale ad hoc networks. In: Proceedings of the third Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET 2004) (2004)
Kakugawa, H., Masuzawa, T.: A self-stabilizing minimal dominating set algorithm with safe convergence. In: Proceedings of the 8th IPDPS Workshop on Advances in Parallel and Distributed Computational Models (APDCM 2006) (2006)
Johnen, C., Tixeuil, S.: Route preserving stabilization. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 184–198. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johnen, C., Nguyen, L.H. (2006). Robust Self-stabilizing Clustering Algorithm. In: Shvartsman, M.M.A.A. (eds) Principles of Distributed Systems. OPODIS 2006. Lecture Notes in Computer Science, vol 4305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945529_29
Download citation
DOI: https://doi.org/10.1007/11945529_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49990-9
Online ISBN: 978-3-540-49991-6
eBook Packages: Computer ScienceComputer Science (R0)