### Abstract

We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under complete knowledge of the network we give a tight answer to the above question: O(n) bits of advice are sufficient but o(n) bits are not, in order to achieve constant broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of advice.

Original language | English (US) |
---|---|

Title of host publication | Structural Information and Communication Complexity - 15th International Colloquium, SIROCCO 2008, Proceedings |

Pages | 291-305 |

Number of pages | 15 |

DOIs | |

State | Published - Aug 4 2008 |

Externally published | Yes |

Event | 15th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2008 - Villars-sur-Ollon, Switzerland Duration: Jun 17 2008 → Jun 20 2008 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 5058 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 15th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2008 |
---|---|

Country | Switzerland |

City | Villars-sur-Ollon |

Period | 6/17/08 → 6/20/08 |

### Fingerprint

### Keywords

- Advice
- Deterministic broadcasting
- Distributed algorithm
- Radio network

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Structural Information and Communication Complexity - 15th International Colloquium, SIROCCO 2008, Proceedings*(pp. 291-305). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5058 LNCS). https://doi.org/10.1007/978-3-540-69355-0_24

**Fast radio broadcasting with advice.** / Ilcinkas, David; Kowalski, Dariusz R.; Pelc, Andrzej.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Structural Information and Communication Complexity - 15th International Colloquium, SIROCCO 2008, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5058 LNCS, pp. 291-305, 15th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2008, Villars-sur-Ollon, Switzerland, 6/17/08. https://doi.org/10.1007/978-3-540-69355-0_24

}

TY - GEN

T1 - Fast radio broadcasting with advice

AU - Ilcinkas, David

AU - Kowalski, Dariusz R.

AU - Pelc, Andrzej

PY - 2008/8/4

Y1 - 2008/8/4

N2 - We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under complete knowledge of the network we give a tight answer to the above question: O(n) bits of advice are sufficient but o(n) bits are not, in order to achieve constant broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of advice.

AB - We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under complete knowledge of the network we give a tight answer to the above question: O(n) bits of advice are sufficient but o(n) bits are not, in order to achieve constant broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of advice.

KW - Advice

KW - Deterministic broadcasting

KW - Distributed algorithm

KW - Radio network

UR - http://www.scopus.com/inward/record.url?scp=48249094973&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=48249094973&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-69355-0_24

DO - 10.1007/978-3-540-69355-0_24

M3 - Conference contribution

AN - SCOPUS:48249094973

SN - 3540693262

SN - 9783540693260

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 291

EP - 305

BT - Structural Information and Communication Complexity - 15th International Colloquium, SIROCCO 2008, Proceedings

ER -