Deterministic Communication in Radio Networks with Large Labels

Authors:
Leszek Gasieniec;Aris Pagourtzis;Igor Potapov;Tomasz Radzik
Affiliations:
Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, England;School of Electrical and Computer Engineering, National Technical University of Athens, 15780, Zografou, Greece;Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, England;Department of Computer Science, King's College London, Strand, London WC2R 2LS, England
Venue:
Algorithmica
Year:
2007

Citing 0
Cited 8

Time efficient centralized gossiping in radio networks

Theoretical Computer Science
On Radio Broadcasting in Random Geometric Graphs

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On neighbor discovery in cognitive radio networks

Journal of Parallel and Distributed Computing
Brief announcement: faster gossiping in bidirectional radio networks with large labels

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Deterministic collision free communication despite continuous motion

Ad Hoc Networks
Gossiping in one-dimensional synchronous ad hoc wireless radio networks

Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Round complexity of leader election and gossiping in bidirectional radio networks

Information Processing Letters
Learning a ring cheaply and fast

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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(n2log n) time for N polynomially large in n. The O(nlog2n)-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(n2log2N 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(n3/2log2N log n)-time gossiping algorithm for directed networks; and a deterministic O(n log2N log2n)-time gossiping algorithm for undirected networks.