An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
From MaRDI portal
Publication:1402221
DOI10.1007/s00453-002-1010-5zbMath1045.68026OpenAlexW2025278163MaRDI QIDQ1402221
Publication date: 19 August 2003
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-002-1010-5
Related Items
Time efficient centralized gossiping in radio networks, Information dissemination in unknown radio networks with large labels, Information gathering in ad-hoc radio networks with tree topology, Round complexity of leader election and gossiping in bidirectional radio networks, Faster information gathering in ad-hoc radio tree networks, Deterministic M2M multicast in radio networks, Information gathering in ad-hoc radio networks, Energy efficient randomised communication in unknown AdHoc networks, On Efficient Gossiping in Radio Networks