Deterministic multi-channel information exchange
From MaRDI portal
Publication:2396723
Recommendations
Cites work
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- Asynchronous exclusive selection
- Average-Time Complexity of Gossiping in Radio Networks
- DYNAMIC SHARING OF A MULTIPLE ACCESS CHANNEL
- Gossiping in a Multi-channel Radio Network
- Information exchange with collision detection on multiple channels
- Leader election in shared spectrum radio networks
- Many-to-many communication in radio networks
- Maximal independent sets in multichannel radio networks
- On selection problem in radio networks
- Randomness conductors and constant-degree lossless expanders
- Renaming in an asynchronous environment
- Secure communication over radio channels
- The wireless synchronization problem
- Tight bounds for MIS in multichannel radio networks
- Trusted computing for fault-prone wireless networks
- Unbounded contention resolution in multiple-access channels
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)