Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Elections in Anonymous Networks Yehuda Afek
 

Summary: Elections in Anonymous Networks
Yehuda Afek
Computer Science Department
Tel Aviv University
Ramat­Aviv 69978
Israel
Yossi Matias \Lambda
Computer Science Department
Tel Aviv University, Israel
and
Institute for Advanced Computer Studies
University of Maryland, College Park, MD 20742
Abstract
We address the problem of electing a leader in an anonymous, asynchronous network
of arbitrary topology. Our algorithms are considerably simpler than known algorithms
and have equal or improved communication complexity.
1 Introduction
Consider the problem of electing a leader in an anonymous, asynchronous network of ar­
bitrary topology. Angluin (1980) showed that from symmetry considerations, there is no
deterministic algorithm to elect a leader (i.e., to break the symmetry) in a general anony­

  

Source: Afek, Yehuda - School of Computer Science, Tel Aviv University

 

Collections: Computer Technologies and Information Sciences