On approximation algorithms of k-connected m-dominating sets in disk graphs

Theoretical Computer Science

Volumn 385, Issue 1-3, 2007, Pages 49-59

  Thai, My T ^a   Zhang, Ning ^a   Tiwari, Ravi ^a   Xu, Xiaochun ^a  

^a University of Florida   (United States)

Author keywords

Connected dominating set; Disk graphs; Fault tolerance; Virtual backbone; Wireless ad hoc network

Indexed keywords

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; PROBLEM SOLVING; VIRTUAL REALITY;

CONNECTED DOMINATING SETS; DISK GRAPHS; VIRTUAL BACKBONE; WIRELESS AD HOC NETWORK;

SET THEORY;

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

References (15)

1. Garey M.R., and Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness (1979), Freeman, New York
2. Clark B., Colbourn C., and Johnson D. Unit disk graphs. Discrete Mathematics 86 (1990) 165-177
3. F. Dai, J. Wu, On construction k-connected k-dominating set in wireless network, in: Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International, 2005
4. F. Wang, M.T. Thai, D.Z. Du, On the construction of 2-connected virtual backbone in wireless network, manuscript
5. Thai M.T., Wang F., Liu D., Zhu S., and Du D.Z. Connected dominating sets in wireless networks with different transmission ranges. IEEE Transactions on Mobile Computing 6 7 (2007)
6. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, J.-P. Sheu, The broadcast storm problem in a mobile ad hoc network, in: Proceedings of MOBICOM, 1999
7. P.-J. Wan, K.M. Alzoubi, O. Frieder, Distributed construction on connected dominating set in wireless ad hoc networks, in: Proceedings of the Conference of the IEEE Communications Society, INFOCOM, 2002
8. Guha S., and Khuller S. Approximation algorithms for connected dominating sets. Algorithmica 20 (1998) 374-387
9. Y. Li, S. Zhu, M.T. Thai, D.-Z. Du, Localized construction of connected dominating set in wireless networks, in: NSF International Workshop on Thoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks, 2004
10. Li Y., Thai M.T., Wang F., Yi C.-W., Wang P.-J., and Du D.-Z. On greedy construction of connected dominating sets in wireless networks. Wireless Communications and Mobile Computing 5 88 (2005) 927-932 (special issue)
11. B. Das, R. Sivakumar, V. Bharghavan, Routing in ad hoc networks using a spine, in: International Conference on Computers and Communication Networks, 1997
12. Du D.-Z., Thai M.T., Li Y., Liu D., and Zhu S. Strongly connected dominating sets in wireless sensor networks with unidirectional links. Proceedings of APWEB. LNCS (2006)
13. M. Park, C. Wang, J. Willson, M.T. Thai, W. Wu, A. Farago, A dominating and absorbent set in wireless ad-hoc networks with different transmission range, in: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC, 2007
14. Thai M.T., and Du D.-Z. Connected dominating sets in disk graphs with bidirectional links. IEEE Communications Letters 10 3 (2006) 138-140
15. Cheng X., Huang X., Li D., Wu W., and Du D.-Z. Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42 4 (2003) 202-208