A New Greedy Algorithm for Constructing the Minimum Size Connected Dominating Sets in Wireless Networks

@inproceedings{Luo2017ANG,
  title={A New Greedy Algorithm for Constructing the Minimum Size Connected Dominating Sets in Wireless Networks},
  author={Chuanwen Luo and Yongcai Wang and Jiguo Yu and Wenping Chen and Deying Li},
  booktitle={WASA},
  year={2017}
}
Finding the Minimum-size Connected Dominating Set (MCDS), i.e., the communication backbone with the minimum number of nodes is a key problem in wireless networks, which is crucial for designing efficient routing algorithms and for network energy efficiency etc. This paper proposes a new greedy algorithm to approach the MCDS problem. The key idea is to… CONTINUE READING