Fast broadcasting and gossiping in radio networks

被引：103
|
作者：
Chrobak, Marek [1 ]
GĄsieniec, Leszek [2 ]
Rytter, Wojciech [3 ]
机构：
[1] Department of Computer Science, University of California, Riverside, CA 92521, United States
[2] Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, United Kingdom
[3] Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warsaw, Poland
来源：
Journal of Algorithms | 2002年 / 43卷 / 02期
关键词：
* Corresponding author. E-mail addresses: marek@cs.ucr.edu (M. Chrobak); leszek@csc.liv.ac.uk; (L; Ga¸sieniec); rytter@csc.liv.ac.uk (W. Rytter). 1 Research done while the author was visiting University of Liverpool. Research supported by grant EPSRC GR/N09077 (UK) and by NSF grant CCR-9988360. 2 Research supported by grants EPSRC GR/N09077 and NUF-NAL (The Nuffield Foundation Awards to Newly Appointed Lecturers). 3 Research supported by grants EPSRC GR/N09077 and KBN 8T11C03915;
D O I：
10.1016/S0196-6774(02)00004-4
中图分类号：
学科分类号：
摘要：
27
引用
下载
收藏
页码：177 / 189
相关论文
共 50 条
  • [41] Optimal Gossiping in Geometric Radio Networks in the Presence of Dynamical Faults
    Clementi, Andrea
    Monti, Angelo
    Pasquale, Francesco
    Silvestri, Riccardo
    NETWORKS, 2012, 59 (03) : 289 - 298
  • [42] Gossiping: Adaptive and reliable broadcasting in MANETs
    Khelil, Abdelmajid
    Suri, Neetaj
    DEPENDABLE COMPUTING, PROCEEDINGS, 2007, 4746 : 123 - +
  • [43] Faster deterministic gossiping in directed ad hoc radio networks
    Gasieniec, L
    Radzik, T
    Xin, Q
    ALGORITHM THEORY- SWAT 2004, 2004, 3111 : 397 - 407
  • [44] Deterministic broadcasting in unknown radio networks
    Chlebus, BS
    Gasieniec, L
    Gibbons, A
    Pelc, A
    Rytter, W
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 861 - 870
  • [45] MULTIPLE ACCESS BROADCASTING RADIO NETWORKS
    TELLEZGIRON, L
    COMPUTER NETWORKS AND ISDN SYSTEMS, 1982, 6 (05): : 368 - 368
  • [46] Faster broadcasting in unknown radio networks
    De Marco, G
    Pelc, A
    INFORMATION PROCESSING LETTERS, 2001, 79 (02) : 53 - 56
  • [47] Round complexity of leader election and gossiping in bidirectional radio networks
    Vaya, Shailesh
    INFORMATION PROCESSING LETTERS, 2013, 113 (09) : 307 - 312
  • [48] FAST GOSSIPING FOR THE HYPERCUBE
    KRUMME, DW
    SIAM JOURNAL ON COMPUTING, 1992, 21 (02) : 365 - 380
  • [49] An O(n1.5) Deterministic Gossiping Algorithm for Radio Networks
    Algorithmica, 2003, 36 : 93 - 96
  • [50] Optimal gossiping with unit size messages in known topology radio networks
    Manne, Fredrik
    Xin, Qin
    COMBINATORIAL AND ALGORITHMIC ASPECTS OF NETWORKING, 2006, 4235 : 125 - +
12345