A simple improved distributed algorithm for minimum CDS in unit disk graphs
暂无分享,去创建一个
[1] Khaled M. Alzoubi. Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.
[2] Peng-Jun Wan,et al. Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..
[3] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[4] Peng-Jun Wan,et al. Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..
[5] L. Fejes. Über die dichteste Kugellagerung , 1942 .
[6] Harry B. Hunt,et al. Simple heuristics for unit disk graphs , 1995, Networks.
[7] Srinivasan Parthasarathy,et al. Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks , 2004 .
[8] Deying Li,et al. A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.