Construction of strongly connected dominating sets in asymmetric multihop wireless networks

DOI10.1016/J.TCS.2008.09.058MaRDI QIDQ1006037zbMATH OpenOpenAlexFDO

Authors Hongwei Du, Xiaofeng Gao, Zhao Zhang, Weili Wu, 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

zbMATH Keywords

asymmetric wireless networkstrongly connected dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
• A distributed approximation algorithm for strongly connected dominating-absorbent sets in asymmetric wireless ad-hoc networks
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks
• Construction and estimation of dominating sets in communication structures
• MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
• Distributed algorithms for connected domination in wireless networks
• An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks

Cites work

• A greedy approximation for minimum connected dominating sets
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• 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
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS

Cited in

(13)

• Connected k-tuple twin domination in de Bruijn and Kautz digraphs
• Domination parameters of a graph and its complement
• A distributed approximation algorithm for strongly connected dominating-absorbent sets in asymmetric wireless ad-hoc networks
• Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks
• Bounds on the connected domination number of a graph
• Complexity of the maximum leaf spanning tree problem on planar and regular graphs
• On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks
• 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
• The optimal design of low-latency virtual backbones
• Finding minimum weight connected dominating set in stochastic graph based on learning automata
• Trees with the connected domination number

This page was built for publication: Construction of strongly connected dominating sets in asymmetric multihop wireless networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006037)