Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
From MaRDI portal
Publication:803112
DOI10.1007/BF02259748zbMATH Open0726.94018MaRDI QIDQ803112FDOQ803112
Authors: Oded Goldreich, Alon Itai, Reuven Bar-Yehuda 
Publication date: 1991
Published in: Distributed Computing (Search for Journal in Brave)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Multiple Communication in Multihop Radio Networks
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- A perspective on multiaccess channels
Cited In (13)
- Noisy beeping networks
- Monitoring churn in wireless networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
- Design patterns in beeping algorithms: examples, emulation, and analysis
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
- Modeling Radio Networks
- Sorting on Single-Channel Wireless Sensor Networks
- TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION
- Leader election in multi-hop radio networks
- The cost of global broadcast in dynamic radio networks
- Modeling radio networks
- The abstract MAC layer
This page was built for publication: Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803112)
