### Abstract

We study deterministic gossiping in ad-hoc radio networks, where labels of the nodes are large, i.e., they are polynomially large in the size n of the network. A label-free model was introduced in the context of randomized broadcasting in ad-hoc radio networks, see [2]. Most of the work on deterministic communication in ad-hoc networks was done for the model with labels of size O(n), with few exceptions; Peleg [19] raised the problem of deterministic communication in ad-hoc radio networks with large labels and proposed the first deterministic O(n^{2} logn)-time broadcasting algorithm. In [11] Chrobak et al. proved that deterministic radio broadcasting can be performed in time O(n log^{2} n); their result holds for large labels. Here we propose two new deterministic gossiping algorithms for ad-hoc radio networks with large labels. In particular: - a communication procedure giving an O(n^{5/3} log^{3} n)-time deterministic gossiping algorithm for directed networks and an O(n^{4/3} log^{3} n)-time algorithm for undirected networks; -a gossiping procedure designed particularly for undirected networks resulting in an almost linear O(n log^{3} n)-time algorithm.

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

Title of host publication | Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings |

Editors | Rolf Möhring, Rajeev Raman |

Publisher | Springer Verlag |

Pages | 512-524 |

Number of pages | 13 |

ISBN (Electronic) | 3540441808, 9783540441809 |

State | Published - Jan 1 2002 |

Externally published | Yes |

Event | 10th Annual European Symposium on Algorithms, ESA 2002 - Rome, Italy Duration: Sep 17 2002 → Sep 21 2002 |

### Publication series

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

Volume | 2461 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 10th Annual European Symposium on Algorithms, ESA 2002 |
---|---|

Country | Italy |

City | Rome |

Period | 9/17/02 → 9/21/02 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Deterministic communication in radio networks with large labels'. Together they form a unique fingerprint.

## Cite this

*Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings*(pp. 512-524). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2461). Springer Verlag.