Efficient algorithms for leader election in radio networks

Authors:
Tomasz Jurdziński;Mirosław Kutyłowski;Jan Zatopiański
Affiliations:
Chemnitz University of Technology, Germany and Wrocław University, Poland;Wrocław University of Technology, Wrocław, Poland and Adam Mickiewicz University, Poznań, Poland;Wrocław University, Wrocław, Poland
Venue:
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Year:
2002

Citing 15
Cited 22

Log-logarithmic selection resolution protocols in a multiple access channel

SIAM Journal on Computing
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
Randomized algorithms

Randomized algorithms
Computation in noisy radio networks

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The wakeup problem in synchronous broadcast systems (extended abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Ethernet: distributed packet switching for local computer networks

Communications of the ACM
Assigning labels in an unknown anonymous network with a leader

Distributed Computing
On adaptive deterministic gossiping in ad hoc radio networks

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Uniform Leader Election Protocols in Radio Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
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
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Limitations of the QRQW and EREW PRAM Models

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
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 emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection

Distributed Computing
Probabilistic computations: Toward a unified measure of complexity

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

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
A better wake-up in radio networks

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On selection problem in radio networks

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Adversarial queuing on the multiple-access channel

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Robust implicit EDF: A wireless MAC protocol for collaborative real-time systems

ACM Transactions on Embedded Computing Systems (TECS) - Special Section LCTES'05
Leader Election Algorithms for Multi-channel Wireless Networks

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
REDMAN: An optimistic replication middleware for read-only resources in dense MANETs

Pervasive and Mobile Computing
Consensus and mutual exclusion in a multiple access channel

DISC'09 Proceedings of the 23rd international conference on Distributed computing
How much memory is needed for leader election

DISC'10 Proceedings of the 24th international conference on Distributed computing
Adversarial Queuing on the Multiple Access Channel

ACM Transactions on Algorithms (TALG)
Merging and merge-sort in a single hop radio network

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Reliable broadcasting without collision detection

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
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
Sentries and sleepers in sensor networks

OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Distributed tree comparison with nodes of limited memory

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Immune size approximation algorithms in ad hoc radio network

EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Asynchronous leader election and MIS using abstract MAC layer

FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Distributed tree comparison with nodes of limited memory

Networks
Knowledge, level of symmetry, and time of leader election

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A distributed algorithm for multiple intersections adaptive traffic lights control using a wireless sensor networks

Proceedings of the first workshop on Urban networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present energy efficient algorithms for leader election in single channel single-hop radio networks with no collision detection. We present a deterministic solution with sublogarithmic energy cost (the best previous result was O(log n)) and show a double logarithmic lower bound. We prove that this lower bound holds in a randomized case, in a certain sense.For the case, when the number n of active stations can be approximated in advance, we show a randomized algorithm with energy consumption O(log* n) that yields a result with high probability (the best previous result was O(log log n)).