Deterministic communication in radio networks with large labels

DOI10.1007/s00453-006-1212-3zbMath1147.68008OpenAlexW2127694687MaRDI QIDQ868440

Tomasz Radzik, Aris Pagourtzis, Leszek Gąsieniec, Igor Potapov

Publication date: 5 March 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-1212-3

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (10)

Fast message dissemination in random geometric networks ⋮ Time efficient centralized gossiping in radio networks ⋮ Finding the size and the diameter of a radio network using short labels ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ Deterministic size discovery and topology recognition in radio networks with short labels ⋮ On the complexity of neighbourhood learning in radio networks ⋮ On Radio Broadcasting in Random Geometric Graphs ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ Short labeling schemes for topology recognition in wireless tree networks ⋮ Time-Efficient Broadcast in Radio Networks

This page was built for publication: Deterministic communication in radio networks with large labels