Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Journal of Computer and System Sciences
Randomized algorithms
Energy-efficient randomized routing in radio networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
On adaptive deterministic gossiping in ad hoc radio networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for leader election in radio networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The Wakeup Problem in Synchronous Broadcast Systems
SIAM Journal on Discrete Mathematics
Randomized Initialization Protocols for Packet Radio Networks
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
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
Weak Communication in Radio Networks
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Deterministic Radio Broadcasting at Low Cost
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
Efficient algorithms for leader election in radio networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Weak Communication in Radio Networks
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Quasi-optimal energy-efficient leader election algorithms in radio networks
Information and Computation
Brief announcement: self-monitoring in dynamic wireless networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Time-optimal information exchange on multiple channels
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Merging and merge-sort in a single hop radio network
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Reliable broadcasting without collision detection
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
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
Secure initialization in single-hop radio networks
ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks
Immune size approximation algorithms in ad hoc radio network
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Monitoring churn in wireless networks
Theoretical Computer Science
Energy efficient alert in single-hop networks of extremely weak devices
Theoretical Computer Science
| Hi-index | 0.00 |
Algorithms for radio networks are studied in two scenarios: (a) the number of active stations is known (or approximately known) (b) the number of active stations is unknown. In the second (more realistic) case it is much harder to design efficient algorithms. For this reason, we design an efficient randomized algorithm for a single-hop radio network that approximately counts the number of its active stations. With probability higher than 1 - 1/n, this approximation is within a constant factor, the algorithm runs in poly-logarithmic time and its energy cost is o(log log n). This improves the previous O(log n) bound for energy. In particular, our algorithm can be applied to improve energy cost of known leader election and initialization protocols (without loss of time efficiency).