Deterministic M2M multicast in radio networks
From MaRDI portal
Publication:2508975
DOI10.1016/j.tcs.2006.06.017zbMath1101.90013OpenAlexW2064871734MaRDI QIDQ2508975
Evangelos Kranakis, Leszek Gąsieniec, Qin Xin, Andrzej Pelc
Publication date: 20 October 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.017
Related Items (5)
Labeling schemes for deterministic radio multi-broadcast ⋮ Almost optimal distributed M2M multicasting in wireless mesh networks ⋮ The cost of global broadcast in dynamic radio networks ⋮ Many-to-many communication in radio networks ⋮ On Efficient Gossiping in Radio Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Families of finite sets in which no set is covered by the union of \(r\) others
- 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.
- On \(r\)-cover-free families
- Fast broadcasting and gossiping in radio networks
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Routing with Polynomial Communication-Space Trade-Off
- Centralized broadcast in multihop radio networks
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- Lower bounds for the broadcast problem in mobile radio networks
- Deterministic broadcasting in ad hoc radio networks
- Faster communication in known topology radio networks
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Structural Information and Communication Complexity
- Algorithm Theory - SWAT 2004
- Optimal Two-Stage Algorithms for Group Testing Problems
- Nonrandom binary superimposed codes
- Broadcasting algorithms in radio networks with unknown topology
This page was built for publication: Deterministic M2M multicast in radio networks
