메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 220-223

A simple improved distributed algorithm for minimum CDS in unit disk graphs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; ROUTERS; VIRTUAL REALITY;

EID: 33746783398     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIMOB.2005.1512873     Document Type: Conference Paper
Times cited : (14)

References (8)
  • 3
    • 2142846003 scopus 로고    scopus 로고
    • Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks
    • to appear
    • 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, to appear.
    • Networks
    • Cheng, X.1    Huang, X.2    Li, D.3    Du, D.-Z.4
  • 5
    • 0001214488 scopus 로고    scopus 로고
    • Über die dichteste kugellagerung
    • L. Fejes Tóth, "Über die dichteste Kugellagerung", Math.Zeit. 48 (1942 1943), 676-684
    • Math.Zeit. , vol.48 , Issue.1942-1943 , pp. 676-684
    • Tóth, L.F.1
  • 6
    • 33750353684 scopus 로고    scopus 로고
    • Fast distributed well connected dominating sets for ad hoc networks
    • UM Computer Science Department
    • R. Gandhi and S. Parthasarathy, "Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks," CS-TR-4559, UM Computer Science Department.
    • CS-TR-4559
    • Gandhi, R.1    Parthasarathy, S.2
  • 8
    • 0036346466 scopus 로고    scopus 로고
    • Distributed construction of connected dominating set in wireless ad hoc networks
    • P. J. Wan, K. Alzoubi and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless ad hoc networks," Proc. of INFOCOM 2002.
    • Proc. of INFOCOM 2002
    • Wan, P.J.1    Alzoubi, K.2    Frieder, O.3


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