메뉴 건너뛰기




Volumn 10, Issue 3, 1997, Pages 129-135

Lower bounds for the broadcast problem in mobile radio networks

Author keywords

Broadcast; Distributed algorithms; Mobile computing

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; ELECTRIC NETWORK TOPOLOGY; NETWORK PROTOCOLS; PROBLEM SOLVING; PROGRAM PROCESSORS; RADIO BROADCASTING;

EID: 0031119011     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050030     Document Type: Article
Times cited : (118)

References (14)
  • 2
    • 0026902215 scopus 로고
    • On the time complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
    • Bar-Yehuda R, Goldreich O, Itai A: On the time complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J Comput Syst Sci 45(1): 104-126 (1992)
    • (1992) J Comput Syst Sci , vol.45 , Issue.1 , pp. 104-126
    • Bar-Yehuda, R.1    Goldreich, O.2    Itai, A.3
  • 3
    • 0023384755 scopus 로고
    • Evaluation of the random token protocol for high-speed and radio networks
    • July
    • Chlamtac I, Ganz A: Evaluation of the random token protocol for high-speed and radio networks. IEEE J Select Areas Commun 5(6), July 1987
    • (1987) IEEE J Select Areas Commun , vol.5 , Issue.6
    • Chlamtac, I.1    Ganz, A.2
  • 4
    • 0001002898 scopus 로고
    • Tree based broadcasting in multi-hop radio networks
    • October
    • Chlamtac I, Kutten S: Tree based broadcasting in multi-hop radio networks. IEEE Trans Comput (C-36), October 1987
    • (1987) IEEE Trans Comput (C-36)
    • Chlamtac, I.1    Kutten, S.2
  • 6
    • 0026122424 scopus 로고
    • The wave expansion approach to broadcasting in multihop radio networks
    • Chlamtac I, Weinstein O: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans Commun 39(3): 426-433 (1991)
    • (1991) IEEE Trans Commun , vol.39 , Issue.3 , pp. 426-433
    • Chlamtac, I.1    Weinstein, O.2
  • 9
    • 3042900469 scopus 로고    scopus 로고
    • An Ω (D log(N/D)) lower bound for broadcast in radio networks
    • Kushilevitz F., Mansour Y: An Ω (D log(N/D)) lower bound for broadcast in radio networks. In: Proc of PODC 93
    • Proc of PODC 93
    • Kushilevitz, F.1    Mansour, Y.2
  • 10
    • 0003070483 scopus 로고
    • Fault-tolerant broadcasts and related problems
    • Addison-Wesley, New York
    • Hadzilacos V, Toueg S: Fault-tolerant broadcasts and related problems In: Distributed Systems Addison-Wesley, New York 1993
    • (1993) Distributed Systems
    • Hadzilacos, V.1    Toueg, S.2
  • 11
    • 85013904542 scopus 로고    scopus 로고
    • Time-message trade-offs for the weak unison problem
    • Proc of CIAC. Springer, Berlin Heidelberg New York
    • Israeli A, Kranakis E, Krizanc D, Santoro N: Time-message trade-offs for the weak unison problem. In: Proc of CIAC. LNCS 778. Springer, Berlin Heidelberg New York
    • LNCS , vol.778
    • Israeli, A.1    Kranakis, E.2    Krizanc, D.3    Santoro, N.4
  • 12
    • 0023383891 scopus 로고
    • Performance evaluation of multiple-access networks: Introduction and issue overview
    • July
    • Li VOK: Performance evaluation of multiple-access networks: introduction and issue overview. IEEE J Select Areas Commun 5(6) July 1987
    • (1987) IEEE J Select Areas Commun , vol.5 , Issue.6
    • Li, V.O.K.1
  • 13
    • 0023384369 scopus 로고
    • Collision detection and multitone tree search for multiple-access protocols on radio channels
    • July
    • Lo WF, Mouftah HT: Collision detection and multitone tree search for multiple-access protocols on radio channels. IEEE J Select Areas Commun 5(6), July 1987
    • (1987) IEEE J Select Areas Commun , vol.5 , Issue.6
    • Lo, W.F.1    Mouftah, H.T.2
  • 14
    • 0023011969 scopus 로고
    • Collision detection in radio channels
    • Computer Science Press
    • Rom R: Collision detection in radio channels. In: Local area and multiple access networks. Computer Science Press 1986
    • (1986) Local Area and Multiple Access Networks
    • Rom, R.1


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