Discrete Mathematics - Topics on domination
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Information and Computation
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Ad hoc networks beyond unit disk graphs
Wireless Networks
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
| Hi-index | 0.00 |
If a set K of nodes in a wireless network want to set up a routing structure that allows them to communicate with each other, one possible approach is to use a Steiner tree that spans all the nodes in K. However, a tree can be disconnected by the failure of a single link, and so it is desirable to employ other routing structures that are fault-tolerant. Furthermore, many real-world wireless networks are heterogeneous, meaning that the suitability of nodes for inclusion in the routing structure varies significantly. Therefore, it is meaningful to assign weights to the nodes and aim to compute a fault-tolerant routing structure of minimum total weight. In this paper, we model this problem as the problem of computing a minimum-weight 2-edge-connected Steiner subgraph spanning a given set of terminals, and we propose a constant-factor approximation algorithm for this problem in wireless networks that are modelled as unit disk graphs or quasi unit disk graphs.