Faster Centralized Communication in Radio Networks
From MaRDI portal
Recommendations
Cited in
(19)- Faster deterministic communication in radio networks
- Information gathering in ad-hoc radio networks with tree topology
- On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks
- Faster communication in known topology radio networks
- Fast message dissemination in random geometric networks
- Time efficient centralized gossiping in radio networks
- Latency-optimal communication in wireless mesh networks
- Message and time efficient multi-broadcast schemes
- Centralization of transmission in networks
- Multi-channel assignment for communication in radio networks
- Upper and lower bounds for deterministic broadcast in powerline communication networks
- Time-efficient broadcast in radio networks
- Time efficient k-shot broadcasting in known topology radio networks
- On Radio Broadcasting in Random Geometric Graphs
- Centralized broadcast in multihop radio networks
- Faster communication in known topology radio networks
- Rumors across radio, wireless, telephone
- Structural Information and Communication Complexity
- Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
This page was built for publication: Faster Centralized Communication in Radio Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459129)
