Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

By Pengjun Wan, Khaled M. Alzoubi, Ophir Frieder. Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002

1,080 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks (2011, methodology): “Additionally the connected dominating set (CDS) [49] technique can be also utilized for reducing the redundant flooding messages.”
A Survey on Distributed Topology Control Techniques for Extending the Lifetime of Battery Powered Wireless Sensor Networks (2013, background): “The estimated message complexity of PACDS is actually O(m) where m is the number of edges in the unit-disk graph, as each edge contributes to two messages in the first stage [77].”
Distributed Event-Triggered Scheme for Economic Dispatch in Smart Grids (2016, methodology): “We employ the distributed minimum CDS searching algorithm in [21] as a part of our algorithm, such that (N L , D) = DistrMiniCDS(G) where D, G are all minimum CDSs in terms of different levels and the graph of a power network.”
An extended localized algorithm for connected dominating set formation in ad hoc wireless networks (2004, methodology): “This algorithm is an early version of [23] ; it has an approximation ratio of 12 and a slow converging speed.”