Deterministic multi-channel information exchange
DOI10.1016/J.JCSS.2017.02.006zbMATH Open1403.94013OpenAlexW2591599665MaRDI QIDQ2396723FDOQ2396723
Authors: Stephan Holzer, Thomas Locher, Roger Wattenhofer, Yvonne Anne Pignolet 
Publication date: 24 May 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2017.02.006
Recommendations
multi-channel\(k\)-selectionmultiple access channelsingle-hop networksdeterministic algorithms and lower boundsinformation exchange problemmany-to-all communicationmulti-message broadcastwireless computing
Cites Work
- Leader election in shared spectrum radio networks
- Renaming in an asynchronous environment
- Unbounded contention resolution in multiple-access channels
- Maximal independent sets in multichannel radio networks
- On selection problem in radio networks
- Information exchange with collision detection on multiple channels
- Secure communication over radio channels
- Gossiping in a Multi-channel Radio Network
- The wireless synchronization problem
- Randomness conductors and constant-degree lossless expanders
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- Many-to-many communication in radio networks
- Tight bounds for MIS in multichannel radio networks
- Asynchronous exclusive selection
- DYNAMIC SHARING OF A MULTIPLE ACCESS CHANNEL
- Average-Time Complexity of Gossiping in Radio Networks
- Trusted computing for fault-prone wireless networks
Cited In (2)
This page was built for publication: Deterministic multi-channel information exchange
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396723)
