메뉴 건너뛰기




Volumn 1499, Issue , 1998, Pages 104-118

Propagation and leader election in a multihop broadcast environment

Author keywords

Broadcast networks; Distributed; Leader election

Indexed keywords

BROADCASTING; DISTRIBUTED COMPUTER SYSTEMS;

EID: 84947923809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056477     Document Type: Conference Paper
Times cited : (66)

References (12)
  • 1
    • 0023581508 scopus 로고
    • Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems
    • B. Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. Proc. 19th Syrup. on Theory of Computing, pages 230-240, May 1987.
    • (1987) Proc. 19Th Syrup. on Theory of Computing , pp. 230-240
    • Awerbuch, B.1
  • 2
    • 0026902215 scopus 로고
    • On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
    • R. Bar-Yehuda, O. Goldreich, and A. Ital. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal on Computer and System Sciences, 45:104-126, 1992.
    • (1992) Journal on Computer and System Sciences , vol.45 , pp. 104-126
    • Bar-Yehuda, R.1    Goldreich, O.2    Ital, A.3
  • 4
    • 84947949447 scopus 로고
    • An almost linear time and o(Vlogv-I-e) message distributed algorithm for minimum weight spanning trees
    • F. Chin and H. F. Ting. An almost linear time and o(vlogv-I-e) message distributed algorithm for minimum weight spanning trees. Proceeding8 of Foundations Of Computer Science (FOCS), October 1985.
    • (1985) Proceeding8 of Foundations of Computer Science (FOCS)
    • Chin, F.1    Ting, H.F.2
  • 5
    • 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. IEgE Transaction on Communications, COM-39(3):426-433, 1991.
    • (1991) Iege Transaction on Communications , vol.39 COM , Issue.3 , pp. 426-433
    • Chlamtac, I.1    Weinstein, O.2
  • 7
    • 0024751425 scopus 로고
    • Distributed assignment algorithm for multihop packet radio networks
    • I. Cidon and M. Sidi. Distributed assignment algorithm for multihop packet radio networks. IEEE Transaction on Computers, 38(10):1353-1361, October 1989.
    • (1989) IEEE Transaction on Computers , vol.38 , Issue.10 , pp. 1353-1361
    • Cidon, I.1    Sidi, M.2
  • 10
    • 0000601523 scopus 로고    scopus 로고
    • A sub-linear time distributed algorithm for minimum-weight spanning trees
    • J. A. Garay, S. Kutten, and D. Peleg. A sub-linear time distributed algorithm for minimum-weight spanning trees. SIAM Journal on Computing, pages 302-316, 1998.
    • (1998) SIAM Journal on Computing , pp. 302-316
    • Garay, J.A.1    Kutten, S.2    Peleg, D.3


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