Discrete Mathematics - Topics on domination
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
On greedy construction of connected dominating sets in wireless networks: Research Articles
Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Theoretical Computer Science
A simple improved distributed algorithm for minimum CDS in unit disk graphs
ACM Transactions on Sensor Networks (TOSN)
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Theoretical Computer Science
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless ad hoc networks have been proposed in the literature. The majority of these algorithms follow a general two-phased approach. The first phase constructs a dominating set, and the second phase selects additional nodes to interconnect the nodes in the dominating set. In the performance analyses of these two-phased algorithms, the relation between the independence number 驴 and the connected domination number 驴 c of a unit-disk graph plays the key role. The best-known relation between them is $\alpha\leq3\frac{2}{3}\gamma_{c}+1$. In this paper, we prove that 驴 ≤ 3.4306驴 c + 4.8185. This relation leads to tighter upper bounds on the approximation ratios of two approximation algorithms proposed in the literature.