Fast broadcasting and gossiping in radio networks
From MaRDI portal
Publication:3150281
DOI10.1016/S0196-6774(02)00004-4zbMath1005.68009OpenAlexW2134516390MaRDI QIDQ3150281
Marek Chrobak, Wojciech Rytter, Leszek Gąsieniec
Publication date: 30 September 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00004-4
Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Optimal gossiping in geometric radio networks in the presence of dynamical faults ⋮ Fast message dissemination in random geometric networks ⋮ Broadcasting in UDG radio networks with missing and inaccurate information ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Time efficient centralized gossiping in radio networks ⋮ Contention resolution in a non-synchronized multiple access channel ⋮ Finding the size and the diameter of a radio network using short labels ⋮ Acknowledged broadcasting and gossiping in ad hoc radio networks ⋮ Information dissemination in unknown radio networks with large labels ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ Deterministic size discovery and topology recognition in radio networks with short labels ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Restrained medium access control on adversarial shared channels ⋮ Centralized Communication in Radio Networks with Strong Interference ⋮ Unnamed Item ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Deterministic Communication in Radio Networks ⋮ Almost optimal distributed M2M multicasting in wireless mesh networks ⋮ Deterministic protocols in the SINR model without knowledge of coordinates ⋮ Optimal deterministic broadcasting in known topology radio networks ⋮ Broadcasting in geometric radio networks ⋮ On Radio Broadcasting in Random Geometric Graphs ⋮ Broadcasting in UDG Radio Networks with Missing and Inaccurate Information ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks ⋮ Sensor Network Gossiping or How to Break the Broadcast Lower Bound ⋮ Modeling radio networks ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Information Spreading in Dynamic Networks: An Analytical Approach ⋮ On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Efficient Distributed Communication in Ad-Hoc Radio Networks ⋮ Energy-efficient broadcasting in ad hoc wireless networks ⋮ Gossiping by energy-constrained mobile agents in tree networks ⋮ GATHERING RADIO MESSAGES IN THE PATH ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Radio communication in random graphs ⋮ Unnamed Item ⋮ Short labeling schemes for topology recognition in wireless tree networks ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Deterministic M2M multicast in radio networks ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Message and time efficient multi-broadcast schemes ⋮ Broadcasting in undirected ad hoc radio networks ⋮ Multicommodity Multicast, Wireless and Fast ⋮ Information gathering in ad-hoc radio networks ⋮ Broadcasting in dynamic radio networks ⋮ On the effect of the deployment setting on broadcasting in Euclidean radio networks ⋮ Energy efficient randomised communication in unknown AdHoc networks ⋮ Asynchronous Broadcasting with Bivalent Beeps ⋮ Time-Efficient Broadcast in Radio Networks ⋮ On Efficient Gossiping in Radio Networks ⋮ Leader election in multi-hop radio networks ⋮ Optimal gathering protocols on paths under interference constraints ⋮ Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel ⋮ Exactly optimal deterministic radio broadcasting with collision detection ⋮ Faster broadcasting in unknown radio networks
