Consensus and collision detectors in wireless Ad Hoc networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Simulation of a Novel Leader Election Protocol with the Use of Petri Nets
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Leader Election Algorithms for Multi-channel Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
REDMAN: An optimistic replication middleware for read-only resources in dense MANETs
Pervasive and Mobile Computing
A distributed algorithm for waking-up in heterogeneous sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
On the fundamental limits of broadcasting in wireless mobile networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On alarm protocol in wireless sensor networks
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Unbounded contention resolution in multiple-access channels
DISC'11 Proceedings of the 25th international conference on Distributed computing
A leader election protocol for timed asynchronous distributed systems
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Asynchronous leader election and MIS using abstract MAC layer
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
The fundamental limits of broadcasting in dense wireless mobile networks
Wireless Networks
| Hi-index | 0.00 |
A radio network is a distributed system with no central arbiter, consisting of n radio transceivers, henceforth referred to as stations. We assume that the stations are identical and cannot be distinguished by serial or manufacturing number. The leader election problem asks to designate one of the station as leader.In this work, we focus on single-channel, single-hop radio networks. We assume that time is slotted and all transmissions occur at slot boundaries. In each time slot the stations transmit on the channel with some probability until, eventually, one of the stations is declared leader. The {\em history} of a station up to time slot t is captured by the status of the channel and the transmission activity of the station in each of the t time slots.From the perspective of how much of the history information is used, we identify three types of leader election protocols for single-channel, single-hop radio networks: {\bf oblivious} if no history information is used, {\bf uniform} if only the history of the status of the channel is used, and {\bf non-uniform} if the stations use both the status of channel and the transmission activity. The main goal of this paper is to provide a survey of recent leader election protocols for radio networks.