메뉴 건너뛰기




Volumn 45, Issue 1, 1992, Pages 104-126

On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS - PROTOCOLS; INFORMATION THEORY - COMMUNICATION CHANNELS; PROBABILITY; RADIO TRANSMISSION - MATHEMATICAL MODELS;

EID: 0026902215     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(92)90042-H     Document Type: Article
Times cited : (377)

References (20)
  • 3
    • 84915930777 scopus 로고
    • Efficient emulation of single-hop radio network with collision detection on multi-hop radio network without collision detection
    • Nice, France, Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York, (proceedings)
    • (1989) 3rd International Workshop , vol.392 , pp. 24-32
    • Bar-Yehuda1    Goldreich2    Itai3
  • 11
  • 12
  • 14
    • 0013456371 scopus 로고
    • A feedback-less distributed broadcast algorithm for multihop radio networks with time-varying structure
    • Rome, May 1987, Computer Science Dept, Technion, Haifa, Israel, Also available as TR-451
    • (1987) 2nd ACM International MCPR Workshop
    • Hofri1
  • 15
    • 0012368803 scopus 로고
    • Aloha Packet System with and without Slots and Capture
    • Advanced Research Projects Agency, Network Information Center, Stanford Research Institute, Stanford, CA
    • (1972) ASS Notes 8
    • Roberts1
  • 18
    • 51149104111 scopus 로고
    • The wave expansion approach to broadcasting in multihop radio networks
    • Computer Science Dept, Technion, Haifa, Israel
    • (1987) M.Sc. Thesis
    • Weinstein1
  • 19
    • 0022711782 scopus 로고
    • Log-logarithmic selection resolution protocols in a multiple access channels
    • (1986) SIAM J. Comput. , vol.15 , pp. 468-477
    • Willard1


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