An efficient approximation scheme for minimum connected dominating set in wireless ad hoc networks

@article{Gao2004AnEA,
  title={An efficient approximation scheme for minimum connected dominating set in wireless ad hoc networks},
  author={Bo Gao and Yuhang Yang and Huiye Ma},
  journal={IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004},
  year={2004},
  volume={4},
  pages={2744-2748 Vol. 4}
}
We present a new distributed approximation algorithm that constructs a minimum connected dominating set (MCDS) for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one-hop neighbors and there is only one shortest path connecting two dominators that are at most three hops away. Compared with other… CONTINUE READING
6 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Geometirc Spanners for Wireless Ad Hoc Networks

  • K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, O. Frieder
  • IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED…
  • 2003
Highly Influential
15 Excerpts

On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks

  • J. Wu, H. L. Li
  • Proceedings of the 3rd ACM International Workshop…
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…