Algorithms for minimum m-connected k-tuple dominating set problem

Theoretical Computer Science

Volumn 381, Issue 1-3, 2007, Pages 241-247

  Shang, Weiping ^a,c   Wan, Pengjun ^b   Yao, Frances ^c   Hu, Xiaodong ^a  

^a INSTITUTE OF APPLIED MATHEMATICS   (China)

^b Illinois Institute of Technology   (United States)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithm; Connected dominating set; k vertex connectivity; Wireless sensor networks

Indexed keywords

BROADCASTING; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK ROUTING; PROBLEM SOLVING; SET THEORY; WIRELESS SENSOR NETWORKS;

CONNECTED DOMINATING SET; K-VERTEX CONNECTIVITY; ROUTING INFRASTRUCTURE; SET PROBLEMS;

APPROXIMATION ALGORITHMS;

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

References (12)

1. Alzoubi K.M., Wan P.-J., and Frieder O. Distributed heuristics for connected dominating sets in wireless ad hoc networks. Journal of Communications and Networks 4 1 (2002) 22-29
2. J.L. Bredin, E.D. Demaine, M. Hajiaghayi, D. Rus, Deploying sensor networks with guaranteed capacity and fault tolerance, in: Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc, 2005, pp. 309-319
3. Harary F., and Haynes T. Double domination in graphs. ARS Combinatoria 55 1 (2000) 201-213
4. Klasing R., and Laforest C. Hardness results and approximation algorithms of k-tuple domination in graphs. Information Processing Letters 89 2 (2004) 75-83
5. H. Koskinen, J. Karvo, O. Apilo, On improving connectivity of static ad-hoc networks by adding nodes, in: Proceedings of the 4th annual Mediterranean Workshop on Ad Hoc Networks, Med-Hoc-Net, 2005, pp. 169-178
6. Li Y.S., Thai M.T., Wang F., Yi C.-W., Wan P.-J., and Du D.-Z. On greedy construction of connected dominating sets in wireless networks. Wiley Journal on Wireless Communications and Mobile Computing 5 8 (2005) 927-932
7. P. Sinha, R. Sivakumar, V. Bharghavan, Enhancing ad hoc routing with dynamic virtual infrastructures, in: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, 2001, pp. 1763-1772
8. Tarjan R. Depth first search and linear graph algorithms. SIAM Journal on Computing 1 2 (1972) 146-160
9. Wan P.-J., Alzoubi K.M., and Frieder O. Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications 9 2 (2004) 141-149
10. F. Wang, T. Thai, D.Z. Du, On the construction of 2-connected virtual backbone in wireless networks, IEEE Transactions on Wireless Communications (in press)
11. Wu W., Du H., Jia X., Li Y., and Huang C.-H. Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science 352 1 (2006) 1-7
12. S. Yang, F. Dai, M. Cardei, J. Wu, On multiple point coverage in wireless sensor networks, in: Proc. of the 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS, Nov. 2005