On constructing k-connected k-dominating set in wireless networks

@article{Dai2005OnCK,
  title={On constructing k-connected k-dominating set in wireless networks},
  author={Fei Dai and Jie Wu},
  journal={19th IEEE International Parallel and Distributed Processing Symposium},
  year={2005},
  pages={10 pp.-}
}
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Previous work in this area has focused on selecting a small virtual backbone for high efficiency. We propose to construct a k-connected k-dominating set (k-CDS) as a backbone to balance efficiency and fault tolerance. Three localized k-CDS construction protocols are proposed. The first protocol… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 179 citations. REVIEW CITATIONS
108 Citations
31 References
Similar Papers

Citations

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

180 Citations

01020'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 180 citations based on the available data.

See our FAQ for additional information.

References

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

On calculating connected dominating sets for efficient routing in ad hoc wireless networks

  • J. Wu, H. Li
  • Proc. of DialM, pages
  • 1999
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…