### Abstract

We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in expected time O(D log(n/D)+log^{2} n) in n-node radio networks of diameter D, which is optimal, as it matches the lower bounds of Alon et al. and Kushilevitz and Mansour. Our algorithm improves the best previously known randomized broadcasting algorithm of Bar-Yehuda, Goldreich and Itai, running in expected time O(D log n+log^{2} n). For deterministic broadcasting, we show the lower bound Ω(n logn/log(n/D)) on broadcasting time in n-node radio networks of diameter D. This implies previously known lower bounds of Bar-Yehuda, Goldreich and Itai and Bruschi and Del Pinto, and is sharper than any of them in many cases. We also give an algorithm working in time O(n log n), thus shrinking - for the first time - the gap between the upper and the lower bound on deterministic broadcasting time to a logarithmic factor.

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

Pages | 73-82 |

Number of pages | 10 |

State | Published - Dec 1 2003 |

Externally published | Yes |

Event | Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 - Boston, MA, United States Duration: Jul 13 2003 → Jul 16 2003 |

### Conference

Conference | Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 |
---|---|

Country | United States |

City | Boston, MA |

Period | 7/13/03 → 7/16/03 |

### Fingerprint

### ASJC Scopus subject areas

- Software
- Hardware and Architecture
- Computer Networks and Communications

### Cite this

*Broadcasting in Undirected Ad hoc Radio Networks*. 73-82. Paper presented at Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, MA, United States.

**Broadcasting in Undirected Ad hoc Radio Networks.** / Kowalski, Dariusz R.; Pelc, Andrzej.

Research output: Contribution to conference › Paper

}

TY - CONF

T1 - Broadcasting in Undirected Ad hoc Radio Networks

AU - Kowalski, Dariusz R.

AU - Pelc, Andrzej

PY - 2003/12/1

Y1 - 2003/12/1

N2 - We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in expected time O(D log(n/D)+log2 n) in n-node radio networks of diameter D, which is optimal, as it matches the lower bounds of Alon et al. and Kushilevitz and Mansour. Our algorithm improves the best previously known randomized broadcasting algorithm of Bar-Yehuda, Goldreich and Itai, running in expected time O(D log n+log2 n). For deterministic broadcasting, we show the lower bound Ω(n logn/log(n/D)) on broadcasting time in n-node radio networks of diameter D. This implies previously known lower bounds of Bar-Yehuda, Goldreich and Itai and Bruschi and Del Pinto, and is sharper than any of them in many cases. We also give an algorithm working in time O(n log n), thus shrinking - for the first time - the gap between the upper and the lower bound on deterministic broadcasting time to a logarithmic factor.

AB - We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in expected time O(D log(n/D)+log2 n) in n-node radio networks of diameter D, which is optimal, as it matches the lower bounds of Alon et al. and Kushilevitz and Mansour. Our algorithm improves the best previously known randomized broadcasting algorithm of Bar-Yehuda, Goldreich and Itai, running in expected time O(D log n+log2 n). For deterministic broadcasting, we show the lower bound Ω(n logn/log(n/D)) on broadcasting time in n-node radio networks of diameter D. This implies previously known lower bounds of Bar-Yehuda, Goldreich and Itai and Bruschi and Del Pinto, and is sharper than any of them in many cases. We also give an algorithm working in time O(n log n), thus shrinking - for the first time - the gap between the upper and the lower bound on deterministic broadcasting time to a logarithmic factor.

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

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

M3 - Paper

AN - SCOPUS:1142305230

SP - 73

EP - 82

ER -