Tighter approximation bounds for minimum CDS in wireless ad hoc networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5878 LNCS, Issue , 2009, Pages 699-709

  Li, Minming ^a   Wan, Peng Jun ^b   Yao, Frances ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION BOUNDS; APPROXIMATION RATIOS; CDS; CONNECTED DOMINATING SETS; CONNECTED DOMINATION NUMBER; DOMINATING SETS; INDEPENDENCE NUMBER; PERFORMANCE ANALYSIS; SECOND PHASE; UNIT DISK GRAPHS; UPPER BOUND;

AD HOC NETWORKS; COMPUTATION THEORY; DATA STORAGE EQUIPMENT; WIRELESS AD HOC NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 75649096025     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_71     Document Type: Conference Paper

References (14)

1. Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In: ACM Mobihoc (2002)
2. Bharghavan, V., Das, B.: Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets. In: IEEE ICC (1997)
3. Blum, J., Ding, M., Cheng, X.: Applications of Connected Dominating Sets in Wireless Networks. In: Du, D.-Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 329-369. Kluwer Academic Publisher, Dordrecht (2004)
4. Cadei, M., Cheng, X., Du, D.-Z.: Connected Domination in Ad Hoc Wireless Networks. In: Proc. 6th International Conference on Computer Science and Informatics (2002)
5. Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operation Research 4(3), 233-235 (1979)
6. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics 86, 165-177 (1990)
7. Funke, S., Kesselman, A., Meyer, U., Segal, M.: A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Transactions on Sensor Networks 2(3), 444-453 (2006)
8. Li, Y.S., Thai, M.T., Wang, F., Yi, C.-W., Wan, P.-J., Du, D.-Z.: On Greedy Construction of Connected Dominating Sets in Wireless Networks. Journal on Wireless Communications and Mobile Computing 5(8), 927-932 (2005)
9. Lin, F., Yang, X. (eds.): Geometric Measure Theory: An Introduction. International Press (2003)
10. Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. In: Proc. IEEE Hawaii Int. Conf. on System Sciences (January 2001)
11. Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Network. ACM/Springer Mobile Networks and Applications 9(2), 141-149 (2004);
12. A preliminary version of this paper appeared in IEEE INFOCOM (2002)
13. Wan, P.-J., Wang, L., Yao, F.: Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. In: IEEE ICDCS 2008, pp. 337-344 (2008)
14. Wu, W., Du, H., Jia, X., Li, Y., Huang, S.C.-H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science 352(1-3), 1-7 (2006)