Incremental Construction of k-Dominating Sets in Wireless Sensor Networks

Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new incremental local algorithm to construct a k-dominating set. The algorithm constructs a monotone family of dominating sets D1 D2 . . . Di . . . Dk such that each Di is an i-dominating set. For unit disk graphs, the size of each of the resulting i-dominating sets is at most six times the optimal.

• Type: Journal
• Year: 2008
• Where: AHSWN
• Authors: Mathieu Couture, Michel Barbeau, Prosenjit Bose, Evangelos Kranakis
• Keywords: AHSWN 2008, Incremental Local Algorithm, K-dominating Set, Monotone Family