An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Yamin Li, Shietung Peng, Wanming Chu. An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks. In IEEE 3rd International Conference on Mobile Adhoc and Sensor Systems, MASS 2006, 9-12 October 2006, Vancouver, BC, Canada. pages 199-205, IEEE, 2006. [doi]

The following publications are possibly variants of this publication:

A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networksXiuzhen Cheng, Xiao Huang, Deying Li, Weili Wu, Ding-Zhu Du. networks, 42(4):202-208, 2003. [doi]

Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor NetworksJi Li, Chuan Heng Foh, Lachlan L. H. Andrew, Moshe Zukerman. icc 2008: 332-336 [doi]

runs on WebDSL