A lower bound for radio broadcast (Q1176103)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 13462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for radio broadcast |
scientific article; zbMATH DE number 13462 |
Statements
A lower bound for radio broadcast (English)
0 references
25 June 1992
0 references
A new --- graph oriented model for dealing with broadcasting in radio networks is proposed. The authors consider a radio network as a unidirectional, multihop network of nodes (processors) that communicate in synchronous time-slots. They prove the existence of a family of radius -2 networks with \(n\) nodes for which any broadcast schedule requires at least \(\Omega(\log^ 2 n)\) round of transmissions.
0 references
broadcasting algorithm
0 references
radio channel
0 references
computer networks
0 references
0.8845869
0 references
0 references
0.8717853
0 references
0.8671442
0 references
0.86491865
0 references
0.86427045
0 references
0.84804314
0 references
0.8403774
0 references
