Information exchange with collision detection on multiple channels
From MaRDI portal
Publication:5963613
DOI10.1007/s10878-014-9713-5zbMath1338.90097MaRDI QIDQ5963613
Francis C. M. Lau, Jiguo Yu, Yuexuan Wang, Dongxiao Yu, Yue-Peng Wang
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
wireless network; randomized algorithm; information exchange; distributed algorithm; multiple channels
90B18: Communication networks in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks, Distributed wireless link scheduling in the SINR model, Deterministic multi-channel information exchange
Cites Work
- Unnamed Item
- Unnamed Item
- Deterministic multi-channel information exchange
- 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
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- 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
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels