Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Randomized algorithms
Computation in noisy radio networks
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Efficient algorithms for leader election in radio networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Randomized O (log log n)-Round Leader Election Protocols in Packet Radio Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Randomized Leader Election Protocols in Radio Networks with No Collision Detection
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Energy-Efficient Initialization Protocols for Radio Networks with no Collision Detection
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Adversary immune size approximation of single-hop radio networks
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Basic computations in wireless networks
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Sentries and sleepers in sensor networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Secure initialization in single-hop radio networks
ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks
| Hi-index | 0.00 |
Quite often algorithms designed for no-collision-detection radio networks use a hidden form of collision detection: it is assumed that a station can simultaneously send and listen. Then, if it cannot hear its own message, then apparently a collision has occurred. IEEE Standard 802.11 says that a station can either send or listen to a radio channel, but not both. So we consider a weak radio network model with no collision detection where a station can either send or receive signals. Otherwise we talk about strong model.We show that power of weak and strong radio networks differ substantially in deterministic case. On the other hand, we present an efficient simulation of strong by weak ones, with randomized preprocessing of O(n) steps and O(log log n) energy cost.