Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Weak Communication in Radio Networks
Euro-Par '02 Proceedings of the 8th International Euro-Par 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
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 Initialization Algorithms on Single-Hop Radio Networks
IEICE - Transactions on Information and Systems
Towards Fair Leader Election in Wireless Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
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
Countermeasures against sybil attacks in WSN based on proofs-of-work
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
| Hi-index | 0.00 |
We consider single-hop radio networks, where collisions in the shared channel cannot be detected (no-CD model). A radio channel can be accessed by an adversary trying to degrade functionality of the network, so we are interested in algorithms that work in the presence of an adversary, who knows the algorithm executed and may try make it faulty by injecting own messages. We also focus on algorithms that are time and energy efficient. We propose a randomized initialization algorithm for a single-hop no-CD radio network. The algorithm has time complexity O(N) and energy cost $O(\sqrt{log{N}})$. This is not much worse than the best fragile algorithms constructed so far (O( N) in time complexity and O(log log N) energy cost). Our algorithm succeeds with probability $\rm 1 - 2^{-\Omega(\sqrt{log{N}})}$ in presence of an adversary, who has energy cost Θ(log N).