Abstract
Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary system state, making the system recover from errors and temporarily broken assumptions. Clustering nodes within ad-hoc networks can help forming backbones, facilitating routing, improving scaling, aggregating information, saving power and much more. We present a self-stabilizing distributed (k,r)-clustering algorithm. A (k,r)-clustering assigns k cluster heads within r communication hops for all nodes in the network while trying to minimize the total number of cluster heads. The algorithm assumes a bound on clock frequency differences and a limited guarantee on message delivery. It uses multiple paths to different cluster heads for improved security, availability and fault tolerance. The algorithm assigns, when possible, at least k cluster heads to each node within O(rπλ 3) time from an arbitrary system configuration, where π is a limit on message loss and λ is a limit on pulse rate differences. The set of cluster heads stabilizes, with high probability, to a local minimum within O(rπλ 4 glogn) time, where n is the size of the network and g is an upper bound on the number of nodes within 2r hops.
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
Abbasi, A.A., Younis, M.: A survey on clustering algorithms for wireless sensor networks. Comput. Commun. 30(14-15), 2826–2841 (2007)
Afek, Y., Brown, G.: Self-stabilization over unreliable communication media. Distributed Computing 7, 27–34 (1993)
Caron, E., Datta, A.K., Depardon, B., Larmore, L.L.: A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric. In: Sips, H., Epema, D., Lin, H.-X. (eds.) Euro-Par 2009. LNCS, vol. 5704, pp. 602–614. Springer, Heidelberg (2009)
Chen, Y.P., Liestman, A.L., Liu, J.: Clustering Algorithms for Ad Hoc Wireless Networks, ch. 7, vol. 2, pp. 154–164. Nova Science Publishers (2004)
Dolev, S.: Self-Stabilization. MIT Press (2000)
Dolev, S., Tzachar, N.: Empire of colonies: Self-stabilizing and self-organizing distributed algorithm. Theor. Comput. Sci. 410(6-7), 514–532 (2009)
Fu, Y., Wang, X., Li, S.: Construction k-dominating set with multiple relaying technique in wireless mobile ad hoc networks. In: CMC 2009, pp. 42–46. IEEE Computer Society, Washington, DC (2009)
Hu, Y., Perrig, A., Johnson, D.B.: Wormhole detection in wireless ad hoc networks. Technical report, Rice University, Department of Computer Science (2002)
Johnen, C., Nguyen, L.H.: Robust self-stabilizing weight-based clustering algorithm. Theor. Comput. Sci. 410(6-7), 581–594 (2009)
Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)
Larsson, A., Tsigas, P.: A self-stabilizing (k,r)-clustering algorithm with multiple paths for wireless ad-hoc networks. In: ICDCS 2011, Minneapolis, MN, USA (2011)
Larsson, A., Tsigas, P.: Self-stabilizing (k,r)-clustering in clock rate-limited systems. TR 2012:05, Computer Science and Engineering, Chalmers University of technology (2012)
Newsome, J., Shi, E., Song, D., Perrig, A.: The sybil attack in sensor networks: analysis & defenses. In: IPSN 2004, pp. 259–268. ACM, New York (2004)
Ravelomanana, V.: Distributed k-Clustering Algorithms for Random Wireless Multihop Networks. In: Lorenz, P., Dini, P. (eds.) ICN 2005, Part I. LNCS, vol. 3420, pp. 109–116. Springer, Heidelberg (2005)
Spohn, M.A., Garcia-Luna-Aceves, J.J.: Bounded-distance multi-clusterhead formation in wireless ad hoc networks. Ad Hoc Netw. 5(4), 504–530 (2007)
Sun, K., Peng, P., Ning, P., Wang, C.: Secure distributed cluster formation in wireless sensor networks. In: ACSAC 2006, pp. 131–140. IEEE Computer Society, Washington, DC (2006)
Wu, Y., Li, Y.: Construction algorithms for k-connected m-dominating sets in wireless sensor networks. In: MobiHoc 2008, pp. 83–90. ACM, New York (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larsson, A., Tsigas, P. (2012). Self-stabilizing (k,r)-Clustering in Clock Rate-Limited Systems. In: Even, G., Halldórsson, M.M. (eds) Structural Information and Communication Complexity. SIROCCO 2012. Lecture Notes in Computer Science, vol 7355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31104-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-31104-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31103-1
Online ISBN: 978-3-642-31104-8
eBook Packages: Computer ScienceComputer Science (R0)