Distributed construction of connected dominating sets with minimum routing cost in wireless networks

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2010, Pages 448-457

  Ding, Ling ^a   Gao, Xiaofeng ^a   Wu, Weili ^a   Lee, Wonjun ^b   Zhu, Xu ^c   Du, Ding Zhu ^a  

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

^b Korea University   (South Korea)

^c XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Connected dominating set; General graph; NP hard; Obstacle; Shortest path; Virtual backbones; Wireless network

Indexed keywords

CONNECTED DOMINATING SET; GENERAL GRAPH; NP-HARD; OBSTACLE; SHORTEST PATH; VIRTUAL BACKBONE;

AD HOC NETWORKS; COMPUTATIONAL COMPLEXITY; COSTS; DATA STORAGE EQUIPMENT; DISKS (STRUCTURAL COMPONENTS); DISTRIBUTED COMPUTER SYSTEMS; ENERGY UTILIZATION; GRAPH THEORY; HEURISTIC ALGORITHMS; MOBILE TELECOMMUNICATION SYSTEMS; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 77955898231     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2010.17     Document Type: Conference Paper

References (29)

1. Y.-P. Tsai, T.-L Hsu, R.-S. Liu, and Y.-K. Ho. A backbone routing protocol based on the connected dominating set in ad hoc networks. World Congress on Computer Science and Information Engineering, 1:14-18, 2009.
2. X. Cheng, M. Ding, D. H. Du, and X. Jia. Virtual backbone construction in multihop ad hoc wireless networks: Research articles. Wireless Communications and Mobile Computing, 6(2):183-190, 2006.
3. P.-J. Wan, K. M. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications, 9(2):141-149, 2004.
4. X. Cheng, X. Huang, D. Li, and D.-Z. Du. Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks, 42:2003.
5. K. Mohammed, L. Gewali, and V. Muthukumar. Generating quality dominating sets for sensor network. In Proc. of IEEE ICCIMA, 2005.
6. D. Kim, Y. Wu, Y. Li, F. Zou, and D.-Z. Du. Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 20(2):147-157, 2009.
7. M. T. Thai, F. Wang, D. Liu, S. Zhu, and D.-Z. Du. Connected dominating sets in wireless networks with different transmission ranges. IEEE Transactions on Mobile Computing, 6(7):721-730, 2007. (Pubitemid 46842925)
8. F. Reichenbach, R. Salomon, and D. Timmermann. Distributed obstacle localization in large wireless sensor networks. In Proc. of ACM IWCMC, 2006.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). W. H. Freeman, 1979.
10. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Mathematics, 86(1-3):165-177, 1990.
11. D.-Z. Du, B. Lu, H. Ngo, and P. M. Pardalos. Steiner tree problems, 2000.
12. S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374-387, 1996.
13. L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, and K.-I. Ko. A greedy approximation for minimum connected dominating sets. Theoretical Computer Science, 329(1-3):325-330, 2004.
14. M. Min, H. Du, X. Jia, C. X. Huang, S. C.-H. Huang, and W. Wu. Improving construction for connected dominating set with steiner tree in wireless sensor networks. Journal of Global Optimization, 35(1):111-119, 2006. (Pubitemid 43787036)
15. W. Wu, H. Du, X. Jia, Y. Li, and S. C.-H. Huang. Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science, 352(1):1-7, 2006. (Pubitemid 43243277)
16. D. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L. Wang, and G. Xue. Approximations for steiner trees with minimum number of steiner points. Journal of Global Optimization, 18(1-3):17-33, 2000.
17. G.-H. Lin and G. Xue. Steiner tree problem with minimum number of steiner points and bounded edge-length. Information Processing Letters, 69(2):53-57, 1999.
18. D.-Z. Du and P. Pardalos. Handbook of Combinatorial Optimization. Kluwer Academic, 2004.
19. B. Das and V. Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In Proc. of IEEE ICC, 1997.
20. S. Butenko, X. Z. Cheng, D.-Z. Du, and P. M. Pardalos. On the construction of virtual backbone for ad hoc wireless network. In Proc. of Conference on Cooperative Control and Optimization, 2001.
21. K. Alzoubi, P.-J. Wan, and O. Frieder. New distributed algorithm for connected dominating set in wireless ad hoc networks. In Proc. of IEEE HICSS, 2002.
22. J. Wu, F. Dai, M. Gao, and I. Stojmenovic. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. IEEE/KICS Journal of Communications and Networks, 4:59-70, 2002.
23. W. Di, Q. Yan, and T. Ning. Connected dominating set based hybrid routing algorithm in ad hoc networks with obstacles. In Proc. of IEEE ICC, 2006.
24. L. Ding, Y. Shao, and M. Li. On reducing broadcast transmission cost and redundancy in ad hoc wireless networks using directional antennas. In WCNC, pages 2295-2300, 2008.
25. B. Deb, S. Bhatnagar, and B. Nath. Multi-resolution state retrieval in sensor networks. In Proc. of IEEE International Workshop on Sensor Network Protocols and Applications, 2003.
26. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
27. D. S. Johnson. Approximation algorithms for combinatorial problems. In Proc. of ACM STOC, 1973.
28. S. Funke, A. Kesselman, U. Meyer, and M. Segal. A simple improved distributed algorithm for minimum cds in unit disk graphs. ACM Transactions on Sensor Networks, 2(3):444-453, 2006.
29. Y. Zeng, X. Jia, and Y. He. Energy efficient distributed connected dominating sets construction in wireless sensor networks. In Proc. of ACM IWCMC, 2006.