메뉴 건너뛰기




Volumn 2380 LNCS, Issue , 2002, Pages 377-389

Gossiping with bounded size messages in ad hoc radio networks

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EID: 84869193784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_33     Document Type: Conference Paper
Times cited : (37)

References (20)
  • 1
    • 38249013511 scopus 로고
    • Single round simulation of radio networks
    • N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, Single round simulation of radio networks, J. Algorithms, 13 (1992), pp. 188-210.
    • (1992) J. Algorithms , vol.13 , pp. 188-210
    • Alon, N.1    Bar-Noy, A.2    Linial, N.3    Peleg, D.4
  • 2
    • 0026902215 scopus 로고
    • On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomisation
    • R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomisation, J. Computer and System Sciences, 45 (1992), pp. 104-126.
    • (1992) J. Computer and System Sciences , vol.45 , pp. 104-126
    • Bar-Yehuda, R.1    Goldreich, O.2    Itai, A.3
  • 3
    • 0027642528 scopus 로고
    • Multiple communication in multi-hop radio networks
    • R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM J. on Computing, 22 (1993), pp. 875-887.
    • (1993) SIAM J. on Computing , vol.22 , pp. 875-887
    • Bar-Yehuda, R.1    Israeli, A.2    Itai, A.3
  • 4
    • 0006109157 scopus 로고    scopus 로고
    • Randomized communication in radio networks
    • a chapter in, P.M. Pardalos, S. Rajasekaran, J.H. Reif, and J.D.P. Rolim, (Eds.), Kluwer Academic Publishers, to appear
    • B.S. Chlebus, Randomized communication in radio networks, a chapter in "Handbook on Randomized Computing," P.M. Pardalos, S. Rajasekaran, J.H. Reif, and J.D.P. Rolim, (Eds.), Kluwer Academic Publishers, to appear.
    • Handbook on Randomized Computing
    • Chlebus, B.S.1
  • 8
    • 84944049102 scopus 로고    scopus 로고
    • A randomized algorithm for gossiping in radio networks
    • M. Chrobak, L. Ga̧sieniec, and W. Rytter, A randomized algorithm for gossiping in radio networks, In Proc. COCOON'2001, pp. 483-492.
    • Proc. COCOON'2001 , pp. 483-492
    • Chrobak, M.1    Ga̧sieniec, L.2    Rytter, W.3
  • 11
    • 65549143661 scopus 로고    scopus 로고
    • Selective families, superimposed codes, and broadcasting in unknown radio networks
    • Washington, DC
    • A.E.F. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting in unknown radio networks, in Proc., 12th ACM-SIAM Symp. on Discrete Algorithms, Washington, DC, 2001, pp. 709-718.
    • (2001) Proc., 12th ACM-SIAM Symp. on Discrete Algorithms , pp. 709-718
    • Clementi, A.E.F.1    Monti, A.2    Silvestri, R.3
  • 12
    • 84943237670 scopus 로고    scopus 로고
    • Round robin is optimal for faulttolerant broadcasting on wireless networks
    • BRICS, University of Aarhus, Denmark, (ESA'2001)
    • A.E.F. Clementi, A. Monti, and R. Silvestri, Round robin is optimal for faulttolerant broadcasting on wireless networks, In Proc., 9th Ann. European Symposium on Algorithms, BRICS, University of Aarhus, Denmark, (ESA'2001), pp. 452-463.
    • Proc., 9th Ann. European Symposium on Algorithms , pp. 452-463
    • Clementi, A.E.F.1    Monti, A.2    Silvestri, R.3
  • 13
    • 0035973451 scopus 로고    scopus 로고
    • Faster broadcasting in unknown radio networks
    • G. De Marco, and A. Pelc, Faster broadcasting in unknown radio networks, Information Processing Letters, 79(2), pp. 53-56.
    • Information Processing Letters , vol.79 , Issue.2 , pp. 53-56
    • De Marco, G.1    Pelc, A.2
  • 16
    • 0037962389 scopus 로고    scopus 로고
    • Explicit construction of selectors and related combinatorial structures with applications
    • San Francisco
    • P. Indyk, Explicit construction of selectors and related combinatorial structures with applications, In Proc., 13th ACM-SIAM Symp. on Discrete Algorithms, San Francisco, 2002, pp. 697-704.
    • (2002) Proc., 13th ACM-SIAM Symp. on Discrete Algorithms , pp. 697-704
    • Indyk, P.1
  • 17
    • 0000227681 scopus 로고    scopus 로고
    • An Ω(Dlog(N/D)) lower bound for broadcast in radio networks
    • E. Kushilevitz, and Y. Mansour, An Ω(Dlog(N/D)) lower bound for broadcast in radio networks, SIAM J. on Computing, 27 (1998), pp. 702-712.
    • (1998) SIAM J. on Computing , vol.27 , pp. 702-712
    • Kushilevitz, E.1    Mansour, Y.2


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