Approximating the tree and tour covers of a graph
Information Processing Letters
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
Approximation algorithms for directed Steiner problems
Journal of Algorithms
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
On approximability of the independent/connected edge dominating set problems
Information Processing Letters
Introduction to Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
How to trim an MST: a 2-approximation algorithm for minimum cost tree cover
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
New heuristic approaches for the dominating tree problem
Applied Soft Computing
Hi-index | 0.00 |
Our problem formulation is as follows. Given a weighted disk graph Gwhere the weight of edge represents the transmission energy consumption, we wish to determine a dominating tree Tof Gsuch that the total weight of edges in Tis minimized. To the best of our knowledge, this problem have not been addressed in the literature. Solving the dominating tree problem can yield a routing backbone for broadcast protocols since: (1) each node does not have to construct their own broadcast tree, (2) utilize the virtual backbone to reduce the message overhead, and (3) the weight of backbone is minimized.Our contributions to this problem is multi-fold: First, the paper is the first to study this problem, prove the hardness of this problem and propose an approximation framework. Second, we present a heuristic to approximate the solution with low time complexity. Third, a distributed algorithm is provided for practical implementation. Finally, we verify the effectiveness of our proposal through simulation.