On Efficient Gossiping in Radio Networks
From MaRDI portal
Publication:3408156
DOI10.1007/978-3-642-11476-2_2zbMath1274.68008OpenAlexW2138021770MaRDI QIDQ3408156
Publication date: 24 February 2010
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_2
Related Items (7)
Information dissemination in unknown radio networks with large labels ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Deterministic protocols in the SINR model without knowledge of coordinates ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Information gathering in ad-hoc radio networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time efficient \(k\)-shot broadcasting in known topology radio networks
- Energy efficient randomised communication in unknown AdHoc networks
- Families of finite sets in which no set is covered by the union of \(r\) others
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Distributed broadcast in radio networks of unknown topology.
- An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
- Faster broadcasting in unknown radio networks
- On adaptive deterministic gossiping in ad hoc radio networks.
- Optimal deterministic broadcasting in known topology radio networks
- Faster communication in known topology radio networks
- Time efficient centralized gossiping in radio networks
- Deterministic M2M multicast in radio networks
- An improved algorithm for radio broadcast
- Fast broadcasting and gossiping in radio networks
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Centralized broadcast in multihop radio networks
- A randomized algorithm for gossiping in radio networks
- The capacity of wireless networks
- Efficient broadcasting in known topology radio networks with long-range interference
- Algorithm Theory - SWAT 2004
- Optimal Two-Stage Algorithms for Group Testing Problems
- Nonrandom binary superimposed codes
- Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks
- Sensor Network Gossiping or How to Break the Broadcast Lower Bound
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
- Broadcasting algorithms in radio networks with unknown topology
- Fundamentals of Computation Theory
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: On Efficient Gossiping in Radio Networks
