In this paper, we study the leader election problem in the full information model. We show two results in this context. First, we exhibit a constructive O(log N) round protocol that is resilient against linear size coalitions. That is, our protocol is resilient against any coalition of size less then betaN for some constant (but small) value of beta. Second, we provide an easy, non-constructive probabilistic argument that shows the existence of O(log N) round protocol in which beta can be made as large as 1/2 - epsilon for any positive epsilon. Our protocols are extremely simple.
Title
Simple and Efficient Leader Election in the Full Information Model
Published
1994-03-10
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-94-800
Type
Text
Extent
9 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
