An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
From MaRDI portal
Publication:1402221
DOI10.1007/s00453-002-1010-5zbMath1045.68026MaRDI 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
Information dissemination in unknown radio networks with large labels, Energy efficient randomised communication in unknown AdHoc networks, Information gathering in ad-hoc radio networks with tree topology, Faster information gathering in ad-hoc radio tree networks, Information gathering in ad-hoc radio networks, Time efficient centralized gossiping in radio networks, Round complexity of leader election and gossiping in bidirectional radio networks, Deterministic M2M multicast in radio networks, On Efficient Gossiping in Radio Networks