The Wakeup Problem in Synchronous Broadcast Systems
SIAM Journal on Discrete Mathematics
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks
Theory of Computing Systems
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
The Wake-Up Problem in MultiHop Radio Networks
SIAM Journal on Computing
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 5.23 |
We present an alert algorithm for single-hop radio networks with polylogarithmic time complexity and sublogarithmic energy complexity. Our algorithm works correctly with high probability regardless of the number of stations that try to broadcast an alert signal. Moreover, we show that it can be made fairly robust against node failures. We show a lower bound for energy cost that matches the energy cost of our algorithm. Our solution has very weak computing, communication and storage requirements. Moreover the behavior of almost all devices is almost oblivious. Therefore, the algorithm can be applied for a system containing extremely weak devices.