A distributed algorithm to find k -dominating sets
40
TL;DR: This work gives a new synchronous distributed algorithm to find a k-dominating set in G of size no greater than [n/(k+1]], which has the same time complexity as the best currently known algorithm, but improves on that algorithm's message complexity and is, in addition, conceptually simpler.
read more
About: This article is published in Discrete Applied Mathematics. The article was published on 30 May 2004. and is currently open access. The article focuses on the topics: Time complexity & Connectivity.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Graph Domination, Coloring and Cliques in Telecommunications
Balabhaskar Balasundaram,Sergiy Butenko +1 more
- 01 Jan 2006
TL;DR: Applications of graph optimization problems such as minimum dominating set, minimum vertex coloring and maximum clique in multihop wireless networks are discussed and the solution methods proposed in the literature for these problems are surveyed.
110
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
Fabian Kuhn,Thomas Moscibroda,Roger Wattenhofer +2 more
- 04 Jul 2006
TL;DR: This paper studies distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks and gives a probabilistic algorithm that runs in time O(log log n) and achieves an O(1) approximation in expectation.
Connected Dominating Sets
Yiwei Wu and Yingshu Li
- 11 Aug 2009
TL;DR: This chapter surveys some existing cluster-based algorithms and focuses on connected dominating set algorithms, including both centralized and distributed, for how to construct CDS, and some algorithms for kmCDS are described in detail.
69
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
TL;DR: Simulations show that the connected k-hop dominating set is small and stable and needs little maintenance overhead in the random-walk mobility and Gauss-Markov mobility models.
37
A Self-Stabilizing O(n)-Round k-Clustering Algorithm
Ajoy K. Datta,Stéphane Devismes,Lawrence L. Larmore +2 more
- 27 Sep 2009
TL;DR: A silent self-stabilizing distributed algorithm that computes a subset of I of G which is a minimal $k$-dominating set of G, and partition of G into clusters, each of radius $k$, is proposed.
33
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Parallel symmetry-breaking in sparse graphs
Andrew V. Goldberg,Serge Plotkin,Gregory E. Shannon +2 more
- 01 Jan 1987
TL;DR: Efficient deterministic techniques for breaking symmetry in parallel are described and applied to construct fast linear processor algorithms for several problems, including (&Dgr; + 1)-coloring constant-degree graphs, 5-coloring planar graphs, and finding depth-first-search trees inPlanar graphs.
How to Allocate Network Centers
TL;DR: The paper discusses the significant parameters of center allocation, defines the resulting optimization problems, and proposes several approximation algorithms for selecting centers and for distributing the users among them.
203
A sub-linear time distributed algorithm for minimum-weight spanning trees
Juan A. Garay,Shay Kutten,David Peleg +2 more
- 03 Nov 1993
TL;DR: This paper proposes that a more sensitive parameter is the network's diameter Diam, and provides a distributed minimum-weight spanning tree algorithm whose time complexity is sub-linear in n, but linear in Diam (specifically, O(Diam+n/sup 0.614/)).
196
Related Papers (5)
Alan D. Amis,Ravi Prakash,T.H.P. Vuong,D.T. Huynh +3 more
- 26 Mar 2000
[...]
Shlomi Dolev
- 01 Jan 2000