Pages that link to "Item:Q4388895"
From MaRDI portal
The following pages link to An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks (Q4388895):
Displaying 50 items.
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- Leader election in ad hoc radio networks: a keen ear helps (Q394338) (← links)
- Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks (Q436818) (← links)
- Initializing sensor networks of non-uniform density in the weak sensor model (Q494934) (← links)
- Randomized mutual exclusion on a multiple access channel (Q518923) (← links)
- Improved lower bound for deterministic broadcasting in radio networks (Q551181) (← links)
- Tight bounds for FEC-based reliable multicast (Q598189) (← links)
- Deterministic recurrent communication in restricted sensor networks (Q764337) (← links)
- Quasi-optimal energy-efficient leader election algorithms in radio networks (Q879595) (← links)
- Acknowledged broadcasting and gossiping in ad hoc radio networks (Q884460) (← links)
- Distributed multiple-message broadcast in wireless ad hoc networks under the SINR model (Q896696) (← links)
- Scalable wake-up of multi-channel single-hop radio networks (Q906382) (← links)
- Broadcasting in geometric radio networks (Q924558) (← links)
- Fast radio broadcasting with advice (Q962160) (← links)
- Acknowledged broadcasting in ad hoc radio networks (Q975548) (← links)
- Broadcasting in dynamic radio networks (Q1015809) (← links)
- Many-to-many communication in radio networks (Q1024217) (← links)
- Energy efficient randomised communication in unknown AdHoc networks (Q1029326) (← links)
- A lower bound for radio broadcast (Q1176103) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- Faster broadcasting in unknown radio networks (Q1603436) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- Faster information gathering in ad-hoc radio tree networks (Q1742375) (← links)
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism (Q1770372) (← links)
- On adaptive deterministic gossiping in ad hoc radio networks. (Q1853048) (← links)
- The impact of information on broadcasting time in linear radio networks. (Q1853489) (← links)
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony (Q1938370) (← links)
- Optimal deterministic broadcasting in known topology radio networks (Q1954200) (← links)
- Activating anonymous ad hoc radio networks (Q1954211) (← links)
- Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599) (← links)
- Information gathering in ad-hoc radio networks (Q2051793) (← links)
- Exactly optimal deterministic radio broadcasting with collision detection (Q2097351) (← links)
- Noisy beeping networks (Q2105415) (← links)
- Distributed bare-bones communication in wireless networks (Q2121059) (← links)
- The cost of global broadcast in dynamic radio networks (Q2285142) (← links)
- On simple back-off in unreliable radio networks (Q2285148) (← links)
- Leader election in multi-hop radio networks (Q2326383) (← links)
- Performing work in broadcast networks (Q2375307) (← links)
- Broadcasting in UDG radio networks with missing and inaccurate information (Q2377136) (← links)
- Broadcasting in UDG radio networks with unknown topology (Q2377263) (← links)
- Centralized asynchronous broadcast in radio networks (Q2383598) (← links)
- Time efficient centralized gossiping in radio networks (Q2383602) (← links)
- Contention resolution in a non-synchronized multiple access channel (Q2402256) (← links)
- On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm (Q2457303) (← links)
- Asynchronous Broadcasting with Bivalent Beeps (Q2835032) (← links)
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS (Q3084678) (← links)
- Unbounded Contention Resolution in Multiple-Access Channels (Q3095329) (← 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)
