New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks

@inproceedings{Alzoubi2002NewDA,
  title={New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks},
  author={Khaled M. Alzoubi and Peng-Jun Wan and Ophir Frieder},
  booktitle={HICSS},
  year={2002}
}
Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. In this paper, we first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms can not guarantee to generate a CDS of small size. Their message complexities can be as high as O n , and their time complexities may also be as large as… CONTINUE READING
Highly Influential
This paper has highly influenced 48 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 390 citations. REVIEW CITATIONS
233 Citations
13 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 233 extracted citations

390 Citations

02040'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 390 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

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…
  • 2002
Highly Influential
10 Excerpts

Multicluster

  • M. Gerla, J. Tsai
  • mobile, multimedia radio network”, ACM-Baltzer…
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…