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
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Recent Developments in Cooperative Control and Optimization (Cooperative Systems, "3)
Recent Developments in Cooperative Control and Optimization (Cooperative Systems, "3)
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
IEEE Transactions on Computers
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
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
Journal of Global Optimization
Hi-index | 0.00 |
Broadcasting in wireless ad hoc networks can use a virtual backbone formed by a connected dominating set (CDS). If nodes use constant and identical transmission power, energy-efficient broadcasting amounts to minimizing the size of the backbone (i.e., CDS cardinality). This is referred to as the minimum connected dominating set (MCDS) problem. We present two feasibility conditions, and show that each of the conditions is both sufficient and necessary for characterizing a CDS. The first condition yields an integer programming model, which allows us to compute an MCDS for networks of moderate size (up to 80 nodes in our experiments). The second condition leads to a class of distributed algorithms. We compare numerically the performance of this class of algorithms to that of a centralized algorithm, as well as to MCDS found using the integer programming model. Our performance evaluation suggests that the class of algorithms presented in this paper have a close-optimal performance. In addition, we highlight possible algorithm extensions to cope with timing and mobility issues.