A self-stabilizing O(k)-time k-clustering algorithm

Computer Journal

Volumn 53, Issue 3, 2010, Pages 342-350

  Datta, Ajoy K ^a   Larmore, Lawrence L ^a   Vemula, Priyanka ^a  

^a University of Nevada Las Vegas   (United States)

Author keywords

Distributed algorithm; K clustering; Stabilization

Indexed keywords

ASYNCHRONOUS DISTRIBUTED ALGORITHMS; AVERAGE SIZE; CLUSTERING PROBLEMS; CONNECTED NETWORKS; DISTRIBUTED ALGORITHM; DOMINATING SETS; LOWER BOUNDS; MINIMUM K-DOMINATING SET; NP-HARD; WORST CASE;

COMPUTATIONAL COMPLEXITY; STABILIZATION;

CLUSTERING ALGORITHMS;

EID: 77649287390     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxn071     Document Type: Article

References (9)

1. Amis, A.D., Prakash, R., Huynh, D. and Vuong, T. (2000) Max- Min D-Cluster Formation in Wireless Ad Hoc Networks. IEEE Infocom, Tel-Aviv, March 26-30, pp. 32-41.
2. Spohn, M.A. and Garcia-Luna-Aceves, J.J. (2007) Bounded- Distance Multi-Clusterhead Formation in Wireless Ad Hoc Networks. Ad Hoc Netw. 5, 504-530.
3. Kutten, S. and Peleg, D. (1998) Fast Distributed Construction of Small k-Dominating Sets and Applications. J. Algorithms, 28, 40-66.
4. Penso, L.D. and Barbosa, V.C. (2004) A distributed algorithm to find k-dominating sets. Discrete Appl. Math., 141, 243-253.
5. Ravelomanana,V. (2005) Distributed k-ClusteringAlgorithms for Random Wireless Multihop Networks. Networking - ICN 2005, 4th Int. Conf. Networking, ReunionIsland, France, April 17-21, pp. 109-116.
6. Fernandess, Y. and Malkhi, D. (2004) K-Clustering in Wireless Ad Hoc Networks. Proc. DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Philadelphia, PA, USA, October 1.
7. Dijkstra, E.W. (1974) Self stabilizing systems in spite of distributed control. Commun. ACM, 17, 643-644.
8. Dolev, S. (2000) Self-Stabilization. The MIT Press, Cambridge, MA.
9. Dolev, S., Isaelie,A. and Moran, S. (1997) Uniform dynamic selfstabilizing leader election. IEEE Trans. Parallel Distrib. Syst., 8, 424-440.