Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
An introduction to parallel algorithms
An introduction to parallel algorithms
Randomized algorithms
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
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
Towards Fair Leader Election in Wireless Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Repelling Sybil-type attacks in wireless ad hoc systems
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Randomized leader election protocols in noisy radio networks with a single transceiver
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Round complexity of leader election and gossiping in bidirectional radio networks
Information Processing Letters
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 |
The main contribution of this work is to propose efficient randomized leader election protocols in Packet Radio Networks (PRN). We show that in a one-channel PRN a leader can be elected among n identical stations in O(log log n) broadcast rounds with probability at least 1 - O(1/log n) or in O(log n) broadcast rounds with probability at least 1- O(1/n). We begin by designing such a protocol for the case where the number n of stations is known beforehand. Next, we show that the leader election can be completed within the same number of broadcast rounds even if n is not known. We show that our protocols are optimal in the sense that no randomized protocol that terminates in o(log n) rounds can elect a leader with probability higher than 1 - O(1/n) and no randomized protocol that terminates in o(log log n) rounds can elect a leader with probability higher than 1 - O(1/log n).