메뉴 건너뛰기




Volumn , Issue , 2007, Pages 89-94

Constructing connected dominating sets with bounded diameters in wireless networks

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED DIAMETER; CENTRALIZED MANAGEMENT; CONNECTED DOMINATING SET (CDS); CONNECTED DOMINATING SETS (CDSS); CONSTRUCTION ALGORITHMS; FIXED INFRASTRUCTURE; INTERNATIONAL CONFERENCES; NP-HARD; PERFORMANCE RATIO (PR); VIRTUAL BACKBONE (VB); WIRELESS ALGORITHMS;

EID: 46849094526     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WASA.2007.148     Document Type: Conference Paper
Times cited : (23)

References (16)
  • 1
    • 0242527347 scopus 로고    scopus 로고
    • K. M. Alzoubi, W. P, J, and O. Frieder. Message-optimal connected dominating sets in mobile ad hoc networks. Proceedings of the 3rd ACM international symposium on mobile ad hoc networking and computing, June 2002.
    • K. M. Alzoubi, W. P, J, and O. Frieder. Message-optimal connected dominating sets in mobile ad hoc networks. Proceedings of the 3rd ACM international symposium on mobile ad hoc networking and computing, June 2002.
  • 5
    • 2142846003 scopus 로고    scopus 로고
    • A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks
    • 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:202-208, 2003.
    • (2003) Networks , vol.42 , pp. 202-208
    • Cheng, X.1    Huang, X.2    Li, D.3    Wu, W.4    Du, D.-Z.5
  • 7
    • 0023092944 scopus 로고
    • A design concept for reliable mobile radio networks with frequency hopping signaling
    • A. Ephremides, J. Wieselthier, and D. Baker. A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. IEEE, 75(1):56-7, 1987.
    • (1987) Proc. IEEE , vol.75 , Issue.1 , pp. 56-57
    • Ephremides, A.1    Wieselthier, J.2    Baker, D.3
  • 8
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connected dominating sets
    • S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20:374-387, 1998.
    • (1998) Algorithmica , vol.20 , pp. 374-387
    • Guha, S.1    Khuller, S.2
  • 11
    • 10044221102 scopus 로고    scopus 로고
    • A greedy approximation for minimum connected dominating sets
    • December
    • 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, December 2004.
    • (2004) Theoretical Computer Science , vol.329 , Issue.1-3 , pp. 325-330
    • Ruan, L.1    Du, H.2    Jia, X.3    Wu, W.4    Li, Y.5    Ko, K.-I.6
  • 14
    • 0036346466 scopus 로고    scopus 로고
    • Distributed construction of connected dominating set in wireless ad hoc networks
    • P.-J. Wan, K. M. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. IEEE Infocom, 2002.
    • (2002) IEEE Infocom
    • Wan, P.-J.1    Alzoubi, K.M.2    Frieder, O.3
  • 16
    • 32644448886 scopus 로고    scopus 로고
    • Minimum connected dominating sets and maximal independent sets in unit disk graphs
    • 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.
    • (2006) Theoretical Computer Science , vol.352 , Issue.1-3 , pp. 1-7
    • Wu, W.1    Du, H.2    Jia, X.3    Li, Y.4    Huang, S.C.H.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.