Locality in distributed graph algorithms
SIAM Journal on Computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Spine routing in ad hoc networks
Cluster Computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Some simple distributed algorithms for sparse networks
Distributed Computing
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Clustering wireless ad hoc networks with weakly connected dominating set
Journal of Parallel and Distributed Computing
Leveraging Linial's Locality Limit
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A local 2-approximation algorithm for the vertex cover problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Bluetooth and Wi-Fi wireless protocols: a survey and a comparison
IEEE Wireless Communications
Exploiting locality in distributed SDN control
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
| Hi-index | 0.00 |
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usually significantly smaller than n, the total number of nodes in the system. Such networks arise in various settings of wireless and peer-to-peer communication. A trivial approach of choosing all nodes into the dominating set yields an algorithm with the approximation ratio of Δ + 1. We show that any deterministic algorithm with non-trivial approximation ratio requires Ω(log* n) rounds, meaning effectively that no o(Δ)-approximation deterministic algorithm with a running time independent of the size of the system may ever exist. On the positive side, we show two deterministic algorithms that achieve logΔ and 2 logΔ-approximation in O(Δ3 + log* n) and O(Δ2 logΔ + log* n) time, respectively. These algorithms rely on coloring rather than node IDs to break symmetry.