Discrete Mathematics - Topics on domination
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
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximations for Steiner Trees with Minimum Number of Steiner Points
Journal of Global Optimization
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
Propagation and Leader Election in a Multihop Broadcast Environment
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science
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
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
On approximation algorithms of k-connected m-dominating sets in disk graphs
Theoretical Computer Science
Trade-off scheme for fault tolerant connected dominating sets on size and diameter
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Connected Vertex Covers in Dense Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Construction of strongly connected dominating sets in asymmetric multihop wireless networks
Theoretical Computer Science
Pervasive and Mobile Computing
On the construction of 2-connected virtual backbone in wireless networks
IEEE Transactions on Wireless Communications
An Amortized Search Tree Analysis for k-Leaf Spanning Tree
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Connected dominating sets in wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Minimum CDS in multihop wireless networks with disparate communication ranges
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Journal of Network and Computer Applications
Energy efficient data aggregation in solar sensor networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
The MST of symmetric disk graphs (in arbitrary metric spaces) is light
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Energy efficient joint data aggregation and link scheduling in solar sensor networks
Computer Communications
A faster exact algorithm for the directed maximum leaf spanning tree problem
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
Journal of Discrete Algorithms
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
SIAM Journal on Discrete Mathematics
DisC diversity: result diversification based on dissimilarity and coverage
Proceedings of the VLDB Endowment
Connected dominating set algorithms for wireless sensor networks
International Journal of Sensor Networks
New heuristic approaches for the dominating tree problem
Applied Soft Computing
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Since there is no fixed infrastructure or centralized management in wireless ad hoc networks, a Connected Dominating Set (CDS) has been proposed to serve as a virtual backbone. The CDS of a graph representing a network has a significant impact on the efficient design of routing protocols in wireless networks. This problem has been studied extensively in Unit Disk Graphs (UDG), in which all nodes have the same transmission ranges. However, in practice, the transmission ranges of all nodes are not necessarily equal. In this paper, we model a network as a disk graph and introduce the CDS problem in disk graphs. We present two efficient approximation algorithms to obtain a minimum CDS. The performance ratio of these algorithms is constant if the ratio of the maximum transmission range over the minimum transmission range in the network is bounded. These algorithms can be implemented as distributed algorithms. Furthermore, we show a size relationship between a maximal independent set and a CDS as well as a bound of the maximum number of independent neighbors of a node in disk graphs. The theoretical analysis and simulation results are also presented to verify our approaches.