Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 1737-1744

  Du, Hongwei ^a,e   Ye, Qiang ^a   Wu, Weili ^b   Lee, Wonjun ^c   Li, Deying ^d   Du, Dingzhu ^b   Howard, Stephen ^a  

^a UNIVERSITY OF PRINCE EDWARD ISLAND   (Canada)

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

^c Korea University   (South Korea)

^d RENMIN UNIVERSITY OF CHINA   (China)

^e HITSGS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION SCHEME; CONNECTED DOMINATING SET; DISTRIBUTED ALGORITHM; EXTENSIVE SIMULATIONS; INTERMEDIATE NODE; MINIMUM CONNECTED DOMINATING SET; NODE PAIRS; RESEARCH DIRECTIONS; ROUTING EFFICIENCY; ROUTING PATH; SHORTEST PATH; TOPOLOGY CONTROL; UNIT DISK GRAPHS; VIRTUAL BACKBONE;

ALGORITHMS; SENSORS; TELECOMMUNICATION NETWORKS;

WIRELESS SENSOR NETWORKS;

EID: 79960877514     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5934967     Document Type: Conference Paper

References (22)

1. V. Bharghavan and B. Das, Routing in Ad Hoc Networks using Minimum Connected Dominating Sets, International Conference on Communication, Montreal, Canada, June 1997.
2. M. Cadei, M.X. Cheng, X. Cheng and D.-Z. Du, Connected Domination in Ad Hoc Wireless Networks, Proc. the Sixth International Conference on Computer Science and Informatics (CS&I), 2002.
3. 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.
4. B. N. Clark, C. J. Colbourn and D. S. Johnson, Unit Disk Graphs, Discrete Math. 86 (1990) 165.177.
5. Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu Zhu and Ding-Zhu Du, Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Network, to appear in The 30th International Conference on Distributed Computing Systems, ICDCS 2010.
6. D.-Z. Du, R.L. Graham, P.M. Pardalos, P.-J. Wan, W. Wu and W. Zhao, Analysis of Greedy Approximations with Nonsubmodular Potential Functions, Proceedings of the 19th Annual ACM-SIAM Symposium on Dicrete Algorithms (SODA), San Francisco, USA; January 20-22, 2008, pp. 167-175.
7. S. Funke, A. Kesselman and U. Meyer, A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs, ACM Trans. Sensor Net. 2 (2006) 444.453.
8. X. Gao, Y. Wang, X. Li and W. Wu, Analysis on Theoretical Bounds for Approximating Dominating Set Problems, Discrete Mathematics, Algorithms and Applications vol. 1, no. 1 (2009) 71-84.
9. S. Guha and S. Khuller. Approximation Algorithms for Connected Dominating Sets. Algorithmica, 20 (1998) 374-387.
10. Donghyun Kim, Yiwei Wu, Yingshu Li, Feng Zou, and Ding-Zhu Du, "Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks," IEEE Transactions on Parallel and Distributed Systems (TPDS), vol. 20, no. 2, pp. 147-157, February, 2009.
11. Minming Li, Peng-Jun Wan and F. Frances Yao: Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. ISAAC 2009: 699-709.
12. Y.S. Li, M.T. Thai, F. Wang, C.-W. Yi, P.-J. Wan, D.-Z. Du, On Greedy Construction of Connected Dominating Sets in Wireless Networks, Wiley Journal on Wireless Communications and Mobile Computing, 5 (2005) 927-932.
13. M. Min, X. Huang, C.-H. Huang, W. Wu, H. Du, and X. Jia, Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks, Journal of Global Optimization, 35 (2006) 111-119.
14. L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, and Ker-I Ko, A Greedy Approximation for Minimum Connected Dominating Set, Theoretical Computer Science, 329 (2004) 325-330.
15. A. Salhieh, J. Weinmann, M. Kochha, and L. Schwiebert, Power Efficient Topologies for Wireless Sensor Networks, ICPP'2001, pp.156-163.
16. R. Sivakumar, B. Das, and V. Bharghavan, An improved spine-based infrastructure for routing in ad hoc networks, IEEE Symposium on Computer and Communications, Athens, Greece, June, 1998.
17. I. Stojmenovic, M. Seddigh, J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, Proc. IEEE Hawaii Int. Conf. on System Sciences, January 2001.
18. J. Willson, X. Gao, Z. Qu, Y. Zhu, Y. Li and W. Wu, Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints, submitted.
19. P. Wan, K. M. Alzoubi and O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks, in Proc. 3rd ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (1999), pp. 7.14.
20. Peng-Jun Wan, Lixin Wang, F. Frances Yao: Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. ICDCS 2008: 337-344.
21. J. Wu, and H. Li, On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks, Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp.7-14, 1999.
22. W. Wu, H. Du, X. Jia, Y. Li and S. Huang, Minimum connected dominating sets and maximal independent sets in unit disk graphs, Theor. Comput. Sci. 352 (2006) 1.7.