Deterministic Dominating Set Construction in Networks with Bounded Degree

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

• Type: Journal
• Year: 2011
• Where: ICDCN
• Authors: Roy Friedman, Alex Kogan
• Keywords: Algorithm, Distributed And Parallel Computing, ICDCN 2011, Maximal Degree, Node