Deterministic dominating set construction in networks with bounded degree

Roy Friedman, Alex Kogan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 2logΔ-approximation in O(Δ3+log* n) and O(Δ2logΔ+log* n) time, respectively. These algorithms rely on coloring rather than node IDs to break symmetry.

Original languageEnglish
Title of host publicationDistributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings
Pages65-76
Number of pages12
DOIs
StatePublished - 2011
Event12th International Conference on Distributed Computing and Networking, ICDCN 2011 - Bangalore, India
Duration: 2 Jan 20115 Jan 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6522 LNCS

Conference

Conference12th International Conference on Distributed Computing and Networking, ICDCN 2011
Country/TerritoryIndia
CityBangalore
Period2/01/115/01/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Deterministic dominating set construction in networks with bounded degree'. Together they form a unique fingerprint.

Cite this