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 条
12345