### 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 a 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 the advice.

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

Pages (from-to) | 1544-1557 |

Number of pages | 14 |

Journal | Theoretical Computer Science |

Volume | 411 |

Issue number | 14-15 |

DOIs | |

State | Published - Mar 17 2010 |

### Fingerprint

### Keywords

- Advice
- Deterministic broadcasting
- Distributed algorithm
- Radio network

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Theoretical Computer Science*,

*411*(14-15), 1544-1557. https://doi.org/10.1016/j.tcs.2010.01.004