Pages that link to "Item:Q1954200"
From MaRDI portal
The following pages link to Optimal deterministic broadcasting in known topology radio networks (Q1954200):
Displaying 33 items.
- Upper and lower bounds for deterministic broadcast in powerline communication networks (Q324622) (← links)
- Time efficient \(k\)-shot broadcasting in known topology radio networks (Q352244) (← links)
- Information dissemination in unknown radio networks with large labels (Q391755) (← links)
- Almost optimal distributed M2M multicasting in wireless mesh networks (Q441875) (← links)
- Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
- Improved lower bound for deterministic broadcasting in radio networks (Q551181) (← links)
- Randomized broadcast in radio networks with collision detection (Q901873) (← links)
- Broadcasting in geometric radio networks (Q924558) (← links)
- Tree exploration with advice (Q958304) (← links)
- Fast radio broadcasting with advice (Q962160) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Acknowledged broadcasting in ad hoc radio networks (Q975548) (← links)
- A note on the lower bound of centralized radio broadcasting for planar reachability graphs (Q1028487) (← links)
- Activating anonymous ad hoc radio networks (Q1954211) (← links)
- Exactly optimal deterministic radio broadcasting with collision detection (Q2097351) (← links)
- Radio aggregation scheduling (Q2202004) (← links)
- Efficient broadcasting in radio networks with long-range interference (Q2375820) (← links)
- Fast message dissemination in random geometric networks (Q2375822) (← links)
- Broadcasting in UDG radio networks with missing and inaccurate information (Q2377136) (← links)
- Broadcasting in UDG radio networks with unknown topology (Q2377263) (← links)
- Latency-optimal communication in wireless mesh networks (Q2437856) (← links)
- Message and time efficient multi-broadcast schemes (Q2513670) (← links)
- Labeling schemes for deterministic radio multi-broadcast (Q2672450) (← links)
- Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast (Q3095331) (← links)
- Time-Efficient Broadcast in Radio Networks (Q3404475) (← links)
- On Efficient Gossiping in Radio Networks (Q3408156) (← links)
- Centralized Communication in Radio Networks with Strong Interference (Q3511405) (← links)
- Fast Radio Broadcasting with Advice (Q3511406) (← links)
- On Radio Broadcasting in Random Geometric Graphs (Q3540232) (← links)
- Broadcasting in UDG Radio Networks with Missing and Inaccurate Information (Q3540235) (← links)
- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges (Q3540236) (← links)
- Deterministic size discovery and topology recognition in radio networks with short labels (Q6040656) (← links)
- Dynamic multiple-message broadcast: bounding throughput in the affectance model (Q6174655) (← links)
