scientific article; zbMATH DE number 910916
From MaRDI portal
Recommendations
- Centralized broadcast in multihop radio networks
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Broadcasting in undirected ad hoc radio networks
- Broadcasting in undirected ad hoc radio networks
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
Cited in
(19)- Information dissemination in unknown radio networks with large labels
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- Power consumption in packet radio networks
- Broadcasting in geometric radio networks
- Improved lower bound for deterministic broadcasting in radio networks
- Faster broadcasting in unknown radio networks
- Improved schedule for radio broadcast
- Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
- Almost optimal distributed M2M multicasting in wireless mesh networks
- Performing work in broadcast networks
- Faster deterministic communication in radio networks
- Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
- Centralized broadcast in multihop radio networks
- Radio's Impact on Public Spending
- The impact of information on broadcasting time in linear radio networks.
- Structural Information and Communication Complexity
- Broadcast ring sandwich networks
- Synchronous rendezvous for location-aware agents
- Radio communication in random graphs
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 Q4886093)
