Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Wireless digital communications: modulation & spread spectrum applications
Wireless digital communications: modulation & spread spectrum applications
Randomized algorithms
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
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
Energy-Efficient Routing in the Broadcast Communication Model
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
Leader Election Algorithms for Multi-channel Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Towards Fair Leader Election in Wireless Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
On alarm protocol in wireless sensor networks
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Leader election using loneliness detection
DISC'11 Proceedings of the 25th international conference on Distributed computing
Self-stabilizing leader election for single-hop wireless networks despite jamming
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Basic computations in wireless networks
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Sentries and sleepers in sensor networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
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
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.01 |
The main contribution of this work is to propose energy-efficient randomized leader election protocols for single-hop, single-channel radio networks (RN) that do not have collision detection (CD) capabilities. We first presents a leader election protocol for the case the number n of stations is known beforehand. The protocol runs in O(log f) time slots with no station being awake for more than O(log log f + log f/log n) time slots with probability at least 1 - 1/f for any f ≥ 1. We then present three leader election protocols for the case where n is not known beforehand. The first protocol terminates, with probability exceeding 1 - 1/f, in O((log n)2 + (log f)2) time slots, with no station being awake for more than O(log n + log f) time slots. Clearly, this first protocol terminates in O((log n)2) expected time slots. Our second protocol reduces the expected termination time to O(log n) time slots. This second protocol terminates, with probability exceeding 1 - 1/f in O(f3/5 log n) time slots. Finally, by combining these two protocols, we obtain a third leader election protocol that terminates in O(log n) expected time slots. This latter protocol terminates, with with probability exceeding 1 - 1/f, in O(min((log n)2 + (log f)2, f3/5log n)) time slots, with no station being awake for more than O(log n + log f) time slots.