Communications of the ACM
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Power Efficient Topologies for Wireless Sensor Networks
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
Journal of Global Optimization
Algorithms for minimum m-connected k-tuple dominating set problem
Theoretical Computer Science
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Approximating node-weighted multicast trees in wireless ad-hoc networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Connected dominating sets in wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Algorithms for minimum m-connected k-dominating set problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Transactions on Communications
Switching to directional antennas with constant increase in radius and hop distance
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Estimating the density of brown plant hoppers from a light-traps network based on unit disk graph
AMT'11 Proceedings of the 7th international conference on Active media technology
Minimum data-latency-bound k-sink placement problem in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Constructing weakly connected dominating set for secure clustering in distributed sensor network
Journal of Combinatorial Optimization
Performance improvements for network-wide broadcast with instantaneous network information
Journal of Network and Computer Applications
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
Networked computing in wireless sensor networks for structural health monitoring
IEEE/ACM Transactions on Networking (TON)
Establishing strong connectivity using optimal radius half-disk antennas
Computational Geometry: Theory and Applications
Connected dominating set algorithms for wireless sensor networks
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 | 5.23 |
In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many constructions for approximating the minimum connected dominating set are based on the construction of a maximal independent set. The relation between the size mis(G) of a maximum independent set and the size cds(G) of a minimum connected dominating set in the same graph G plays an important role in establishing the performance ratio of those approximation algorithms. Previously, it is known that mis(G) ≤ 4ċcds(G) + 1 for all unit disk graphs G. In this paper, we improve it by showing mis(G) ≤ 3.8ċcds(G) + 1.2.