Two-phased approximation algorithms for minimum CDS in wireless ad hoc networks

Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008

Volumn , Issue , 2008, Pages 337-344

  Wan, Peng Jun ^a   Wang, Lixin ^a   Yao, Frances ^b  

^a Illinois Institute of Technology

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; CONNECTED DOMINATING SET; DISTRIBUTED ALGORITHMS; DISTRIBUTED COMPUTING SYSTEMS; DOMINATING SETS; INTERNATIONAL CONFERENCES; SECOND PHASE; UPPER BOUNDS; WIRELESS AD HOC NETWORKS;

AD HOC NETWORKS; ALGORITHMS; COMPUTER SYSTEMS; DATA STORAGE EQUIPMENT; PARALLEL ALGORITHMS; POLYNOMIAL APPROXIMATION; SET THEORY; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

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

References (12)

1. K.M. Alzoubi, P.-J. Wan and O. Frieder, Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. ACM Mobihoc 2002.
2. V. Bharghavan and B. Das: Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets, IEEE ICC 1997.
3. J. Blum, M. Ding, and X. Cheng: Applications of Connected Dominating Sets in Wireless Networks, Handbook of Combinatorial Optimization (Editors D.-Z. Du and P. Pardalos), pp. 329-369, 2004, Kluwer Academic Publisher.
4. M. Cadei, X. Cheng and D.-Z. Du: Connected Domination in Ad Hoc Wireless Networks, Proc. 6th International Conference on Computer Science and Informatics, 2002.
5. V. Chvátal: A greedy heuristic for the set-covering problem. Mathematics of Operation Research, 4(3):233-235, 1979.
6. L. Fejes Tóth, Über die dichteste Kugellagerung, Math. Zeit. 48 (1942-1943), 676-684
7. S. Funke, A. Kesselman, U. Meyer, M. Segal: A simple improved distributed algorithm for minimum CDS in unit disk graphs, ACM Transactions on Sensor Networks 2(3):444-453, 2006.
8. 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. Volume 5, Issue 8 (December 2005), pp. 927-932.
9. I. Stojmenovic, M. Seddigh, and J. Zunic: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, Proc. IEEE Hawaii Int. Conf. on System Sciences, January 2001.
10. P.-J. Wan, K.M. Alzoubi, and O. Frieder: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks, ACM/Springer Mobile Networks and Applications, Vol. 9, No. 2, pp. 141-149, 2004. A preliminary version of this paper appeared in IEEE INFOCOM, 2002.
11. G. Wegner: Über endliche Kreispackungen in der Ebene, Studia Sci. Math. Hungar., 21:1-28, 1986.
12. 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-3):1-7, 2006.