### Abstract

The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where |V| = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires D + Ω(√n - D) transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in D + O(√n log n) rounds. Moreover, if we allow each node to transmit at most k times, the lower bound D + Ω((n - D)^{1/(2k)}) on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in D + O(kn^{1/(k-2)} log^{2} n) rounds. The paper concludes with a discussion of several other strategies for energy efficient radio broadcasting and a number of open problems in the area.

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

Title of host publication | Distributed Computing - 21st International Symposium, DISC 2007, Proceedings |

Pages | 253-267 |

Number of pages | 15 |

State | Published - Dec 1 2007 |

Externally published | Yes |

Event | 21st International Symposium on Distributed Computing, DISC 2007 - Lemesos, Cyprus Duration: Sep 24 2007 → Sep 26 2007 |

### Publication series

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

Volume | 4731 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 21st International Symposium on Distributed Computing, DISC 2007 |
---|---|

Country | Cyprus |

City | Lemesos |

Period | 9/24/07 → 9/26/07 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Energy and time efficient broadcasting in known topology radio networks'. Together they form a unique fingerprint.

## Cite this

*Distributed Computing - 21st International Symposium, DISC 2007, Proceedings*(pp. 253-267). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4731 LNCS).