scientific article; zbMATH DE number 2086637
From MaRDI portal
Publication:4737173
Recommendations
Cited in
(21)- Optimal gathering protocols on paths under interference constraints
- Information gathering in ad-hoc radio networks with tree topology
- On adaptive deterministic gossiping in ad hoc radio networks.
- Bounded time-stamping in message-passing systems
- Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)
- Faster communication in known topology radio networks
- The cost of global broadcast in dynamic radio networks
- Time efficient centralized gossiping in radio networks
- Deterministic M2M multicast in radio networks
- Bounded information dissemination in multi-channel wireless networks
- Labeling schemes for deterministic radio multi-broadcast
- scientific article; zbMATH DE number 1696679 (Why is no real title available?)
- Efficient distributed communication in ad-hoc radio networks
- On Efficient Gossiping in Radio Networks
- Gossiping in a Multi-channel Radio Network
- Information dissemination in unknown radio networks with large labels
- scientific article; zbMATH DE number 2119728 (Why is no real title available?)
- Algorithm Theory - SWAT 2004
- Sensor Network Gossiping or How to Break the Broadcast Lower Bound
- Deterministic communication in radio networks with large labels
- Acknowledged broadcasting and gossiping in ad hoc radio networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737173)