Deterministic communication in radio networks with large labels

Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik

Research output: Contribution to journalArticle

19 Scopus citations

Abstract

We study deterministic gossiping in ad hoc radio networks with large node labels. The labels (identifiers) of the nodes come from a domain of size N which may be much larger than the size n of the network (the number of nodes). Most of the work on deterministic communication has been done for the model with small labels which assumes N = O(n). A notable exception is Peleg's paper, where the problem of deterministic communication in ad hoc radio networks with large labels is raised and a deterministic broadcasting algorithm is proposed, which runs in O(n 2log n) time for N polynomially large in n. The O(nlog 2n)-time deterministic broadcasting algorithm for networks with small labels given by Chrobak et al. implies deterministic O(n log N log n)-time broadcasting and O(n 2log 2N log n)-time gossiping in networks with large labels. We propose two new deterministic gossiping algorithms for ad hoc radio networks with large labels, which are the first such algorithms with subquadratic time for polynomially large N. More specifically, we propose: a deterministic O(n 3/2log 2N log n)-time gossiping algorithm for directed networks; and a deterministic O(n log 2N log 2n)-time gossiping algorithm for undirected networks.

Original languageEnglish (US)
Pages (from-to)97-117
Number of pages21
JournalAlgorithmica (New York)
Volume47
Issue number1
DOIs
StatePublished - Jan 1 2007
Externally publishedYes

Keywords

  • Ad hoc radio networks
  • Communication protocols
  • Gossiping
  • Selective families of sets

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

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

  • Cite this