Information exchange with collision detection on multiple channels
DOI10.1007/S10878-014-9713-5zbMATH Open1338.90097OpenAlexW1983312796MaRDI QIDQ5963613FDOQ5963613
Authors: Yue-Peng Wang, Yuexuan Wang, Dongxiao Yu, Jiguo Yu, Francis C. M. Lau
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9713-5
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Communication networks in operations research (90B18)
Cites Work
- Deterministic multi-channel information exchange
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
- Maximal independent sets in multichannel radio networks
- On selection problem in radio networks
- Adversarial queuing on the multiple-access channel
- Tree algorithms for packet broadcast channels
- Unbounded contention resolution in multiple-access channels
- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- Title not available (Why is that?)
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
Cited In (3)
This page was built for publication: Information exchange with collision detection on multiple channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963613)