Construction of strongly connected dominating sets in asymmetric multihop wireless networks
From MaRDI portal
Publication:1006037
DOI10.1016/j.tcs.2008.09.058zbMath1162.68002MaRDI QIDQ1006037
Weili Wu, Zhao Zhang, Xiaofeng Gao, Hongwei David Du, Deying Li, Peng-Jun Wan
Publication date: 17 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.058
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68W25: Approximation algorithms
Related Items
The Optimal Design of Low-Latency Virtual Backbones, Complexity of the maximum leaf spanning tree problem on planar and regular graphs, Strong minimum energy hierarchical topology in wireless sensor networks, Minimum energy multicast/broadcast routing with reception cost in wireless sensor networks, On the \((h,k)\)-domination numbers of iterated line digraphs, Finding minimum weight connected dominating set in stochastic graph based on learning automata, Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs, Domination parameters of a graph and its complement, Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks, Bounds on the connected domination number of a graph, On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks
Cites Work
- A greedy approximation for minimum connected dominating sets
- Approximation algorithms for connected dominating sets
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
