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
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
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
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
Connected dominating set (CDS) has a wide range of applications in mutihop wireless networks. The Minimum CDS problem has been studied extensively in mutihop wireless networks with uniform communication ranges. However, in practice the nodes may have different communication ranges either because of the heterogeneity of the nodes, or due to interference mitigation, or due to a chosen range assignment for energy conservation. In this paper, we present a greedy approximation algorithm for computing a Minimum CDS in multihop wireless networks with disparate communications ranges and prove that its approximation ratio is better than the best one known in the literature. Our analysis utilizes a tighter relation between the independence number and the connected domination number.