Self-stabilizing (k,r)-Clustering in Clock Rate-Limited Systems
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.
KeywordsCluster Algorithm Wireless Sensor Network Cluster Head Multiple Path Cluster Head Node
Unable to display preview. Download preview PDF.
- 4.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)Google Scholar
- 5.Dolev, S.: Self-Stabilization. MIT Press (2000)Google Scholar
- 7.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)Google Scholar
- 8.Hu, Y., Perrig, A., Johnson, D.B.: Wormhole detection in wireless ad hoc networks. Technical report, Rice University, Department of Computer Science (2002)Google Scholar
- 10.Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)Google Scholar
- 11.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)Google Scholar
- 12.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)Google Scholar
- 16.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)Google Scholar