Abstract
We propose an algorithm that builds a hierarchical clustering in a network, in the presence of topological changes. Clusters are built and maintained by random walks, that collect and dispatch information to ensure the consistency of clusters.
We implement distributed communication primitives allowing clusters to emulate nodes of an overlay distributed system. Each cluster behaves like a virtual node, and executes the upper level algorithm. Those primitives ensure that messages sent by a cluster are received and treated atomically only once by their recipient, even in the presence of topological changes. Decisions concerning the behavior of the cluster (virtual node for the higher level algorithm) are taken by the node that owns the random walk at this time.
Based on this abstraction layer and the overlay network it defines, we present a distributed hierarchical clustering algorithm, aimed at clustering large-scale dynamic networks.
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
Baker, D., Ephremides, A.: The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications 29(11), 1694–1701 (1981)
Basagni, S.: Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks. In: IEEE VTS 50th Vehicular Technology Conference, VTC 1999 - Fall, vol. 2, pp. 889–893 (1999)
Basagni, S.: Distributed clustering for ad hoc networks. In: Proceedings of the Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 1999), pp. 310–315 (1999)
Bui, A., Kudireti, A., Sohier, D.: An adaptive random walk-based distributed clustering algorithm. International Journal of Foundations on Computer Science 23(4), 802–830 (2012)
Chatterjee, M., Das, S.K., Turgut, D.: Wca: A weighted clustering algorithm for mobile ad hoc networks. Journal of Cluster Computing (Special Issue on Mobile Ad hoc Networks) 5, 193–204 (2001)
Dolev, S., Gilbert, S., Lynch, N.A., Schiller, E., Shvartsman, A.A., Welch, J.L.: Virtual mobile nodes for mobile ad hoc networks. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 230–244. Springer, Heidelberg (2004)
Dolev, S., Tzachar, N.: Empire of colonies: Self-stabilizing and self-organizing distributed algorithm. Theoretical Computer Science 410, 514–532 (2009), http://www.sciencedirect.com/science/article/pii/S0304397508007548 , principles of Distributed Systems
Gerla, M., Chieh Tsai, J.T.: Multicluster, mobile, multimedia radio network. Journal of Wireless Networks 1, 255–265 (1995)
Myoupo, J.F., Cheikhna, A.O., Sow, I.: A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem. J. Supercomput. 52(2), 135–148 (2010), http://dx.doi.org/10.1007/s11227-009-0274-9
Nolte, T., Lynch, N.: Self-stabilization and virtual node layer emulations. In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol. 4838, pp. 394–408. Springer, Heidelberg (2007), http://dl.acm.org/citation.cfm?id=1785110.1785140
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Avril, F., Bui, A., Sohier, D. (2015). Distributed Hierarchy of Clusters in the Presence of Topological Changes. In: Le Thi, H., Nguyen, N., Do, T. (eds) Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, vol 358. Springer, Cham. https://doi.org/10.1007/978-3-319-17996-4_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-17996-4_33
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17995-7
Online ISBN: 978-3-319-17996-4
eBook Packages: EngineeringEngineering (R0)