Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Journal of Computer and System Sciences
Wireless digital communications: modulation & spread spectrum applications
Wireless digital communications: modulation & spread spectrum applications
Randomized algorithms
Wireless and personal communications systems
Wireless and personal communications systems
Mobile and wireless networks
Multicluster, mobile, multimedia radio network
Wireless Networks
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
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
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
Randomized Leader Election Protocols in Radio Networks with No Collision Detection
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
An Energy Efficient Leader Election Protocol for Radio Network with a Single Transceiver
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Towards Fair Leader Election in Wireless Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Leader election in anonymous radio networks: model checking energy consumption
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Repelling Sybil-type attacks in wireless ad hoc systems
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Asynchronous leader election and MIS using abstract MAC layer
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
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 |
In this work, we present leader election protocols for single-hop, single-channel noisy radio networks that do not have collision detection (CD) capabilities. In most leader election protocols presented so far, it is assumed that every station has the ability to transmit and monitor the channel at the same time, it requires every station to be equipped with two transceivers. This assumption, however, is unrealistic for most mobile stations due to constraints in cost, size, and energy dissipation. Our main contribution is to show that it is possible to elect a leader in an anonymous radio network where each station is equipped with a single transceiver. We first present a leader election protocol for the case the number n of stations is known beforehand. The protocol runs in O(logf) time slots with probability at least $1-{1\over f}$ for any f 1. We then present a leader election protocol for the case where n is not known beforehand but an upper bound u of n is known. This protocol runs in O(logflogu) time slots with probability at least $1-{1\over f}$ for any f 1. We also prove that these protocols are optimal. More precisely, we show that any leader election protocol elect a leader with probability at least $1-{1\over f}$ must run in Ω(logf) time slots if n is known. Also, we proved that any leader election protocol elect a leader with probability at least $1-{1\over f}$ must run in Ω(logflogu) time slots if an upper bound u of n is known.