Two-phased approximation algorithms for minimum CDS in wireless ad hoc networks

PJ Wan, L Wang, F Yao - 2008 The 28th International …, 2008 - ieeexplore.ieee.org
Connected dominating set (CDS) has a wide range of applications in wireless ad hoc
networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc …

A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks

Z Zhang, X Gao, W Wu, DZ Du - Journal of Global Optimization, 2009 - Springer
When homogeneous sensors are deployed into a three-dimensional space instead of a
plane, the mathematical model for the sensor network is a unit ball graph instead of a unit …

Efficient aggregation scheduling in multihop wireless sensor networks with SINR constraints

X Xu, XY Li, M Song - IEEE transactions on mobile computing, 2012 - ieeexplore.ieee.org
We study delay-efficient data aggregation scheduling in wireless sensor networks subject to
signal to interference-plus-noise ratio (SINR) constraints. We construct a routing tree and …

On construction of virtual backbone in wireless ad hoc networks with unidirectional links

MT Thai, R Tiwari, DZ Du - IEEE Transactions on Mobile …, 2008 - ieeexplore.ieee.org
Since there is no fixed infrastructure in wireless ad hoc networks, virtual backbone has been
proposed as the routing infrastructure to alleviate the broadcasting storm problem. The …

Tighter approximation bounds for minimum CDS in wireless ad hoc networks

M Li, PJ Wan, F Yao - … Symposium, ISAAC 2009, Honolulu, Hawaii, USA …, 2009 - Springer
Connected dominating set (CDS) has a wide range of applications in wireless ad hoc
networks. A number of approximation algorithms for constructing a small CDS in wireless ad …

Construction of strongly connected dominating sets in asymmetric multihop wireless networks

D Li, H Du, PJ Wan, X Gao, Z Zhang, W Wu - Theoretical Computer Science, 2009 - Elsevier
Consider an asymmetric wireless network represented by a digraph G=(V, E). A subset of
vertices U is called a strongly connected dominating set (SCDS) if the subgraph induced by …

A greedy algorithm on constructing the minimum connected dominating set in wireless network

D Fu, L Han, Z Yang, ST Jhang - International Journal of …, 2016 - journals.sagepub.com
In the past 20 years, the connected dominating set (CDS) as a virtual backbone network has
been widely used in the wireless networks. Many researchers have been devoted to …

Tighter approximation bounds for minimum CDS in unit disk graphs

M Li, PJ Wan, F Yao - Algorithmica, 2011 - Springer
Connected dominating set (CDS) in unit disk graphs has a wide range of applications in
wireless ad hoc networks. A number of approximation algorithms for constructing a small …

Minimum CDS in multihop wireless networks with disparate communication ranges

L Wang, PJ Wan, F Yao - IEEE transactions on mobile …, 2012 - ieeexplore.ieee.org
Connected dominating set (CDS) has a wide range of applications in mutihop wireless
networks. The Minimum CDS problem has been studied extensively in mutihop wireless …

A novel centralized algorithm for constructing virtual backbones in wireless sensor networks

C Luo, W Chen, J Yu, Y Wang, D Li - EURASIP Journal on Wireless …, 2018 - Springer
Finding the minimum connected dominating set (MCDS) is a key problem in wireless sensor
networks, which is crucial for efficient routing and broadcasting. However, the MCDS …