Literature Database Entry


Dongxiao Yu, Yifei Zou, Yong Zhang, Shikun Shen and Falko Dressler, "Optimal Distributed Leader Election without Decoding," Proceedings of International Conference on Identification, Information & Knowledge in the Internet of Things (IIKI 2019), Jinan, China, October 2019.


n the past decades, with the exponential implementation of large-scale wireless networks such as Internet-of-Things, an enormous demand on designing the relative algorithms and protocols has come into our sight. As an important primitive function in wireless communication, the problem of leader election has attracted much attention in research. In this paper, we pursue efficient distributed solutions for leader election in large-scale wireless networks. Specifically, a simple but optimal distributed leader election algorithm in wireless networks with asynchronous wakeup nodes is proposed, under the practical Signal-to-Interference-plus-Noise (SINR) interference-depicting model. Our algorithm is randomized and can elect a leader in an asymptotically optimal time bound of Θ(log n) with high probability, where n is the number of nodes in network. The algorithm does not rely on any information about the network topology, needs only simple node capability to implement, and uses no encoding and decoding functions. Hence, the algorithm is efficient and energy-saving, which makes it possible to be implemented in a wide range of scenarios, and become a building block for many higher-level operations, like consensus, broadcast and so on.

Quick access

BibTeX BibTeX


Dongxiao Yu
Yifei Zou
Yong Zhang
Shikun Shen
Falko Dressler

BibTeX reference

    author = {Yu, Dongxiao and Zou, Yifei and Zhang, Yong and Shen, Shikun and Dressler, Falko},
    title = {{Optimal Distributed Leader Election without Decoding}},
    address = {Jinan, China},
    booktitle = {International Conference on Identification, Information \& Knowledge in the Internet of Things (IIKI 2019)},
    month = {10},
    year = {2019},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.

Last modified: 2024-07-21