Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Reports, Documentation, and Standards
  4. Reaching Agreement with Unknown Participants in Mobile Self-Organized Networks in Spite of Process Crashes
 
Loading...
Thumbnail Image
report

Reaching Agreement with Unknown Participants in Mobile Self-Organized Networks in Spite of Process Crashes

Cavin, David  
•
Sasson, Yoav  
•
Schiper, Andre  
2005

We consider the consensus problem in self-organized networks such as MANETs. Consensus offers a means for reliably solving agreement related problems, which in a self-organized setting can help bring enhanced structure and reliability to the highly dynamic and disorganized environment of MANETs. We consider asynchronous networks with reliable communications channels. Neither the identity nor the number of nodes is initially known to the participants. This captures the self-organized nature of the network, where no central authority initializes each process with some context information. In [CSS04], the authors have identified the conditions for which the above problem admits a solution when the processes are correct. The contribution of this paper is to determine the necessary and sufficient conditions for the above problem when processes can crash. These conditions are routing and mobility independent.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

getDoc.pdf

Access type

openaccess

Size

442.91 KB

Format

Adobe PDF

Checksum (MD5)

de3b924c873f71ccf29035b751ee9e8b

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés