A lower bound for radio broadcast (Q1176103): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(91)90015-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095713941 / rank | |||
Normal rank | |||
Latest revision as of 09:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for radio broadcast |
scientific article |
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
