Minimum connected dominating sets and maximal independent sets in unit disk graphs

Theoretical Computer Science

Volumn 352, Issue 1-3, 2006, Pages 1-7

  Wu, Weili ^a   Du, Hongwei ^b   Jia, Xiaohua ^b   Li, Yingshu ^c   Huang, Scott C H ^b  

^a The University of Texas at Dallas   (United States)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Connected dominating set; Independent set; Unit disk graphs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; SET THEORY;

CONNECTED DOMINATING SET; INDEPENDENT SET; UNIT DISK GRAPHS;

GRAPH THEORY;

EID: 32644448886     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.08.037     Document Type: Article

References (14)

1. K.M. Alzoubi, P.-J. Wan, O. Frieder, Message-optimal connected dominating sets in mobile ad hoc networks, Proc. Third ACM Internat. Symp. Mobile ad hoc Networking and Computing, June 09-11, 2002, Lausanne, Switzerland.
2. K.M. Alzoubi, P.-J. Wan, O. Frieder, Weakly connected dominating sets and sparse spanners for wireless ad hoc networks, The 23rd IEEE Internat. Conf. Distributed Computing Systems, 2003.
3. V. Bharghavan, B. Das, Routing in ad hoc networks using minimum connected dominating sets, Internat. Conf. Communication, Montreal, Canada, June 1997.
4. M. Cadei, M.X. Cheng, X. Cheng, D.-Z. Du, Connected domination in ad hoc wireless networks, Proc. Sixth Internat. Conf. Computer Science and Informatics (CS&I'2002), 2002.
5. Y.P. Chen, A.L. Liestman, Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks, Proc. Third ACM Internat. Symp. Mobile ad hoc Networking and Computing, June 09-11, 2002, Lausanne, Switzerland.
6. X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks Networks 42 2003 202 208
7. H. Eriksson MBone: The Multicast Backbone Comm ACM 37 1994 54 60
8. M. Min, H. Du, X. Jia, C.X. Huang, S.C.-H. Huang, W. Wu, Improving construction for connected dominating set with Steiner tree in wireless sensor networks, J. Global Optimization, 2006, to appear.
9. L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, and K.-I. Ko A greedy approximation for minimum connected dominating set Theoret. Computer Science 329 2004 325 330
10. A. Salhieh, J. Weinmann, M. Kochha, L. Schwiebert, Power efficient topologies for wireless sensor networks, ICPP'2001, pp. 156-163.
11. R. Sivakumar, B. Das, V. Bharghavan, An improved spine-based infrastructure for routing in ad hoc networks, IEEE Symp. Computer and Communications, Athens, Greece, June, 1998.
12. I. Stojmenovic, M. Seddigh, J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, Proc. IEEE Hawaii Int. Conf. System Sciences, January 2001.
13. P.-J. Wan, K.M. Alzoubi, O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks, Proc. Infocom'2002.
14. J. Wu, H.L. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. Third ACM Internat. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 1999, pp. 7-14.