On selection problem in radio networks
From MaRDI portal
Recommendations
- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
- Communication in dynamic radio networks
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- Broadcasting in dynamic radio networks
Cited in
(44)- Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks
- Maximal selection in tandem networks with symmetric hearing range
- Packet latency of deterministic broadcasting in adversarial multiple access channels
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Ordered and delayed adversaries and how to work against them on a shared channel
- Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
- New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions
- Performing work in broadcast networks
- Consensus and collision detectors in radio networks
- Deterministic multi-channel information exchange
- Adversarial multiple access channels with individual injection rates
- Counting in one-hop beeping networks
- Bounded information dissemination in multi-channel wireless networks
- Deterministic non-adaptive contention resolution on a shared channel
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- -almost selectors and their applications
- Unbounded contention resolution in multiple-access channels
- scientific article; zbMATH DE number 5014521 (Why is no real title available?)
- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
- scientific article; zbMATH DE number 3956780 (Why is no real title available?)
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- Unbounded contention resolution in multiple-access channels
- Deterministic communication in radio networks
- scientific article; zbMATH DE number 1848288 (Why is no real title available?)
- scientific article; zbMATH DE number 2119730 (Why is no real title available?)
- Deterministic blind radio networks
- Local queuing under contention
- Randomized mutual exclusion on a multiple access channel
- Sensor Network Gossiping or How to Break the Broadcast Lower Bound
- Coordination Problems in Ad Hoc Radio Networks
- Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
- Token traversal in ad hoc wireless networks via implicit carrier sensing
- Efficient k-shot broadcasting in radio networks
- Information exchange with collision detection on multiple channels
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
- Dynamic multiple-message broadcast: bounding throughput in the affectance model
- Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
- Contention resolution with message deadlines
- Jamming-resistant backoff with polylogarithmic sending and listening cost
- Energy efficient alert in single-hop networks of extremely weak devices
- Deterministic local problems in radio networks: on the impact of local domination and a bit of advice
- Deterministic recurrent communication in restricted sensor networks
- Scalable wake-up of multi-channel single-hop radio networks
This page was built for publication: On selection problem in radio networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177237)
