A lower bound for radio broadcast (Q1176103): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3726125 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Broadcasting in Radio Networks--Problem Analysis and Protocol Design / rank | |||
Normal rank | |||
Revision as of 10:08, 15 May 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
