MINIMUM CONNECTED r-HOP k-DOMINATING SET in WIRELESS NETWORKS

Discrete Mathematics, Algorithms and Applications

Volumn 1, Issue 1, 2009, Pages 45-57

  Li, Deying ^a   Liu, L I N ^a   Yang, Huiqiang ^a  

^a RENMIN UNIVERSITY OF CHINA   (China)

Author keywords

approximation algorithm; connected r hop k dominating set; r hop dominating; r hop k dominating set; wireless networks

Indexed keywords

EID: 77955853792     PISSN: 17938309     EISSN: 17938317     Source Type: Journal    
DOI: 10.1142/S1793830909000087     Document Type: Article

References (21)

1. O. Younis and S. Fahmy, Heed: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks, IEEE T. Mobile Comput. 3 (2004) 366-379.
2. B. Chen, K. Jamieson, H. Balakrishnan and R. Morris, Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks, in MobiCom'01: Proc. 7th Annu. Int. Conf. Mobile Comput. Net. (ACM Press, 2001), pp. 85-96.
3. S. Bandyopadhyay and E. Coyle, An energy efficient hierarchical clustering algorithm for wireless sensor networks, in IEEE INFOCOM (2003), pp. 1713-1723.
4. L. Bao and J. J. Garcia-Luna-Aceves, Topology management in ad hoc networks, in MobiHoc'03: Proc. 4th ACM Int. Symp. Mobile Ad Hoc Netw. Compu. (ACM Press, 2003), pp. 129-140.
5. X.-Y. Li, Topology control in wireless ad hoc networks, Ad Hoc Netw. (IEEE Press, 2003).
6. B. Das and V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, in Proc. IEEE Int. Conf. Commun. (ICC97), Vol. 1 (1997), pp. 376-380.
7. F. Kuhn, T. Moscibroda and R. Wattenhofer, Fault-tolerant clustering in ad hoc and sensor networks, in 26th Int. Conf. Distributed Comput. Syst. (ICDCS) (Lisboa, Portugal, 2006).
8. M. Couture, M. Barbeau, P. Bose and E. Kranakis, Incremental construction of kdominating sets in wireless sensor networks, OPODIS (2006), pp. 202-214.
9. M. A. Spohn and J. J. Garcia-Luna-Aceves, Improving broadcast operations in ad hoc networks using two-hop connected dominating sets, in Proc. IEEE Global Telecommun. Conf. Workshops (2004), pp. 147-152.
10. A. D. Amis, R. Prakash, H. P. Thai, V. Dung and T. Huynh, Max-min D-cluster formation in wireless ad hoc networks, in IEEE INFOCOM 2000, pp. 32-41.
11. S. Pai, M. Q. Rieck and S. Dhar, Distributed routing algorithms for wireless ad hoc networks using d-hop connected d-hop dominating sets, Comput. Netw. 47 (2005) 785-799.
12. M. A. Spohn and J. J. Garcia-Luna-Aceves, Bounded-distance multi-clusterhead formation in wireless ad hoc networks, Ad Hoc Networks 5 (2007) 505-530.
13. X. Cheng, M. Ding, D. Du and X. Jia, Virtual backbone construction in multihop ad hoc wireless networks, Wireless Communn. Mob. Comput. 6 (2006) 183-190.
14. S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (1998) 374-387.
15. X. Cheng, X. Huang, D. Li, W. Wu and D.-Z. Du, Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless network, Networks 42 (2003) 202-208.
16. Y. Li, D. Kim, F. Zou and D.-Z. Du, Constructing connected dominating sets with bounded diameters in wireless networks, WASA (2007), pp. 89-94.
17. F. Dai and J. Wu, On constructing k-connected k-dominating set in wireless network, IEEE Int. Parallel and Distributed Proc. Symp. (2005).
18. M. T. Thai, N. Zhang, R. Tiwari and X. Xu, On approximation algorithms of kconnected m-dominating sets in disk graphs, Theor. Comput. Sci. 358 (2007) 49-59.
19. W. Shang, F. Yao, P. Wan and X. Hu, Algorithms for minimum m-connected kdominating set problem, Theor. Comput. Sci. 381 (2007) 241-247.
20. T. N. Nguyen, D. T. Huynh and J. A. Bolla, Minimum power minimum D-hop dominating sets in wireless sensor networks, LNCS 5258, WASA2008, pp. 176-187.
21. Y. Li, S. Zhu, M. T. Thai and D.-Z. Du, Localized construction of connected dominating set in wireless networks, NSF Int. Workshop on Theor. Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks, Chicago, June (2004).