메뉴 건너뛰기




Volumn 79, Issue 2, 2001, Pages 53-56

Faster broadcasting in unknown radio networks

Author keywords

Algorithms; Broadcasting; k selective family; Radio network

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

EID: 0035973451     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00178-2     Document Type: Article
Times cited : (48)

References (16)
  • 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. 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
  • 3
    • 0027642528 scopus 로고
    • Multiple communication in multihop radio networks
    • Bar-Yehuda R., Israeli A., Itai A. Multiple communication in multihop radio networks. SIAM J. Comput. 22:1993;875-887.
    • (1993) SIAM J. Comput. , vol.22 , pp. 875-887
    • Bar-Yehuda, R.1    Israeli, A.2    Itai, A.3
  • 4
    • 0031119011 scopus 로고    scopus 로고
    • Lower bounds for the broadcast problem in mobile radio networks
    • Bruschi D., Del Pinto M. Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10:1997;129-135.
    • (1997) Distrib. Comput. , vol.10 , pp. 129-135
    • Bruschi, D.1    Del Pinto, M.2
  • 5
    • 0022184360 scopus 로고
    • On broadcasting in radio networks - Problem analysis and protocol design
    • Chlamtac I., Kutten S. On broadcasting in radio networks - Problem analysis and protocol design. IEEE Trans. Commun. 33:1985;1240-1246.
    • (1985) IEEE Trans. Commun. , vol.33 , pp. 1240-1246
    • Chlamtac, I.1    Kutten, S.2
  • 10
    • 51249175955 scopus 로고
    • Families of finite sets in which no set is covered by the union of r others
    • Erdös P., Frankl P., Füredi Z. 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
  • 12
    • 0022034656 scopus 로고
    • A Perspective on multiaccess channels
    • Gallager R. A Perspective on multiaccess channels. IEEE Trans. Inform. Theory. 31:1985;124-142.
    • (1985) IEEE Trans. Inform. Theory , vol.31 , pp. 124-142
    • Gallager, R.1
  • 14
    • 0000227681 scopus 로고    scopus 로고
    • An Ω(Dlog(N/D)) lower bound for broadcast in radio networks
    • Kushilevitz E., Mansour Y. An Ω(Dlog(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
  • 16
    • 0026106486 scopus 로고
    • Deterministic sampling - A new technique for fast pattern matching
    • Vishkin U. Deterministic sampling - A new technique for fast pattern matching. SIAM J. Comput. 20:1991;22-40.
    • (1991) SIAM J. Comput. , vol.20 , pp. 22-40
    • Vishkin, U.1


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