On greedy construction of connected dominating sets in wireless networks

Abstract

Due to the fact that there is no fixed infrastructure or centralized management in ad hoc wireless networks, a Connected Dominating Set (CDS) of the graph representing the network is widely used as the virtual backbone of the network. Constructing a minimum CDS is NP-hard. In this paper, we propose a completely localized distributed algorithm which is r-CDS to construct a CDS with constant performance ratio. Our algorithm is better at maintenance since there is no need to build a tree or select a leader which are the common methods used in most of the distributed but serialized algorithms. We also compare our algorithm with other localized algorithms. The theoretical and simulation results show that our algorithm has a better performance ratio and constructs a CDS with smaller size in most cases.

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks

“…Cardei et al [3] obtained similar results. Li et al [17,18] successively reduced the performance ratio to 5.8 + ln 4 and 4.8 + ln 5, respectively.…”

Construction of a Fault Tolerance Connected Dominating Set in Wireless Sensor Network

“…At the second phase, more nodes are added (color blue) to connect those black nodes. Li et al [3] proposed another two-phase distributed algorithm with a better approximation ratio of (4.8+ln5). At the first phase, an MIS is computed.…”

Maintaining CDS in Mobile Ad Hoc Networks

“…While computing the minimum CDS is known to be NP-hard [3], a number of distributed CDS protocols [8,5,10,2,11,7] have been proposed to construct a CDS of small size. Both Wan's protocol [8] and Li's protocol [5] obtain CDS by expending the maximal independent set.…”

“…Both Wan's protocol [8] and Li's protocol [5] obtain CDS by expending the maximal independent set. On the other hand, Wu's protocol [10] obtains CDS by eliminating unnecessary nodes through a number of rules.…”

“…To reduce the cost of routing table maintenance in the virtual backbone, it is preferred that the size of the corresponding CDS to be as small as possible. Although computing the minimal CDS is known to be NP-hard [3], a number of protocols [8,5,10,2,11,7] have been proposed to construct CDS with competitive size. Among these protocols, only few [2,11,7] are capable of maintaining CDS under topology changes.…”