메뉴 건너뛰기




Volumn 333, Issue 3, 2005, Pages 355-371

Time complexity of radio broadcasting: Adaptiveness vs. obliviousness and randomization vs. determinism

Author keywords

Adaptiveness; Radio broadcasting; Randomization

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; PROBLEM SOLVING; RADIO COMMUNICATION; TELECOMMUNICATION NETWORKS; TRANSMITTERS;

EID: 13844255683     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.04.017     Document Type: Conference Paper
Times cited : (33)

References (21)
  • 2
    • 0022421096 scopus 로고
    • A new distributed depth-first-search algorithm
    • B. Awerbuch A new distributed depth-first-search algorithm Inform. Process. Lett. 20 1985 147 150
    • (1985) Inform. Process. Lett. , vol.20 , pp. 147-150
    • Awerbuch, B.1
  • 3
    • 0026902215 scopus 로고
    • On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization
    • R. Bar-Yehuda, O. Goldreich, and A. Itai On the time complexity of broadcast in radio networks an exponential gap between determinism and randomization J. Comput. System Sci. 45 1992 104 126
    • (1992) J. Comput. System Sci. , vol.45 , pp. 104-126
    • Bar-Yehuda, R.1    Goldreich, O.2    Itai, A.3
  • 5
    • 0031119011 scopus 로고    scopus 로고
    • Lower bounds for the broadcast problem in mobile radio networks
    • D. Bruschi, and M. Del Pinto Lower bounds for the broadcast problem in mobile radio networks Distributed Comput. 10 1997 129 135
    • (1997) Distributed Comput. , vol.10 , pp. 129-135
    • Bruschi, D.1    Del Pinto, M.2
  • 6
    • 0026122424 scopus 로고
    • The wave expansion approach to broadcasting in multihop radio networks
    • I. Chlamtac, and O. Weinstein The wave expansion approach to broadcasting in multihop radio networks IEEE Trans. Comm. 39 1991 426 433
    • (1991) IEEE Trans. Comm. , vol.39 , pp. 426-433
    • Chlamtac, I.1    Weinstein, O.2
  • 14
    • 0035973451 scopus 로고    scopus 로고
    • Faster broadcasting in unknown radio networks
    • G. De Marco, and A. Pelc Faster broadcasting in unknown radio networks Inform. Process. Lett. 79 2001 53 56
    • (2001) Inform. Process. Lett. , vol.79 , pp. 53-56
    • De Marco, G.1    Pelc, A.2
  • 15
    • 51249175955 scopus 로고
    • Families of finite sets in which no set is covered by the union of r others
    • P. Erdös, P. Frankl, and Z. Füredi Families of finite sets in which no set is covered by the union of r others Israel J. Math. 51 1985 79 89
    • (1985) Israel J. Math. , vol.51 , pp. 79-89
    • Erdös, P.1    Frankl, P.2    Füredi, Z.3
  • 21
    • 0000227681 scopus 로고    scopus 로고
    • An Ω(D log(N/D)) lower bound for broadcast in radio networks
    • E. Kushilevitz, and Y. Mansour An Ω (D log (N / D)) lower bound for broadcast in radio networks SIAM J. Comput. 27 1998 702 712
    • (1998) SIAM J. Comput. , vol.27 , pp. 702-712
    • Kushilevitz, E.1    Mansour, Y.2


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