THE TIME-COMPLEXITY OF DETERMINISTIC BROADCAST RADIO NETWORKS

被引：8
|
作者：
HWANG, FK
机构：
[1] AT and T Bell Laboratories, P.O. Box 636, Murray Hill
来源：
DISCRETE APPLIED MATHEMATICS | 1995年 / 60卷 / 1-3期
关键词：
D O I：
10.1016/0166-218X(94)00053-G
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Bar-Yehuda, Goldreich and Itai studied both the probabilistic and the deterministic time complexity of broadcast in a multihop network. They show that in the deterministic case the number of time-slots needed for successful broadcast is lower bounded by the numbers of moves of two associated games. They also obtain lower bounds for the numbers of moves in these games. In this paper we determine the exact numbers of moves and time-slots needed in the games and in broadcasting.
引用
收藏
页码：219 / 222
页数：4
相关论文
共 50 条
  • [31] UNIVERSAL QUANTIFIERS AND TIME-COMPLEXITY OF RANDOM-ACCESS MACHINES
    GRANDJEAN, E
    MATHEMATICAL SYSTEMS THEORY, 1985, 18 (02): : 171 - 187
  • [32] Average-time complexity of gossiping in radio networks
    Chlebus, Bogdan S.
    Kowalski, Dariusz R.
    Rokicki, Mariusz A.
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2006, 4056 : 253 - 267
  • [33] DETERMINISTIC COMMUNICATION IN RADIO NETWORKS
    Czumaj, Artur
    Davies, Peter
    SIAM JOURNAL ON COMPUTING, 2018, 47 (01) : 218 - 240
  • [34] ColorCast: Deterministic Broadcast in Powerline Networks with Uncertainties
    Pignolet, Yvonne Anne
    Schmid, Stefan
    Tredan, Gilles
    2014 IEEE INTERNATIONAL CONFERENCE ON SMART GRID COMMUNICATIONS (SMARTGRIDCOMM), 2014, : 458 - 463
  • [35] AN OPTIMAL ALGORITHM WITH UNKNOWN TIME-COMPLEXITY FOR CONVEX MATRIX SEARCHING
    LARMORE, LL
    INFORMATION PROCESSING LETTERS, 1990, 36 (03) : 147 - 151
  • [36] Lower-bound time-complexity analysis of logic programs
    King, A
    Shen, K
    Benoy, F
    LOGIC PROGRAMMING - PROCEEDINGS OF THE 1997 INTERNATIONAL SYMPOSIUM, 1997, : 261 - 275
  • [37] Time-complexity of the word problem for semigroups and the Higman Embedding Theorem
    Birget, JC
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 1998, 8 (02) : 235 - 294
  • [38] Constant-Length Labeling Schemes for Deterministic Radio Broadcast
    Ellen, Faith
    Gorain, Barun
    Miller, Avery
    Pelc, Andrzej
    ACM TRANSACTIONS ON PARALLEL COMPUTING, 2021, 8 (03)
  • [39] Constant-Length Labeling Schemes for Deterministic Radio Broadcast
    Ellen, Faith
    Gorain, Barun
    Miller, Avery
    Pelc, Andrzej
    SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019, 2019, : 171 - 178
  • [40] Weighted broadcast in linear radio networks
    Das, Gautam K.
    Nandy, Subhas C.
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2006, 4041 : 343 - 353
12345