A New Greedy Algorithm for D-Hop Connected Dominating Set

@article{Li2014ANG,
  title={A New Greedy Algorithm for D-Hop Connected Dominating Set},
  author={Xianyue Li and Xiaofeng Gao and Chenxia Zhao},
  journal={2014 10th International Conference on Mobile Ad-hoc and Sensor Networks},
  year={2014},
  pages={54-57}
}
In this paper, we consider the problem how to interconnect an obtained d-hop MIS into a d-hop CDS. Firstly, we deal with a simple case d = 2 and present a greedy algorithm. Using this method, we can obtain a 2-hop CDS with approximation ratio min{3β,2β+2+2H (β-1)}, where β is the ratio of 2-hop MIS with 2-hop CDS and H (·) is the harmonic function. This ratio is better than the ratio using spanning tree method. Finally, we generalize the algorithm for general case. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…