Solving Consensus in Opportunistic Networks - Archive ouverte HAL
Communication Dans Un Congrès Année : 2015

Solving Consensus in Opportunistic Networks

Résumé

Opportunistic networks are partially connected wireless ad hoc networks, in which pairwise unpredicted transient contacts between mobile devices are the only opportunities for these devices to exchange information or services. Ensuring the coordination of multiple parts of a distributed application in such conditions is a challenge. This paper presents a system that can solve consensus problems in an opportunis-tic network. This system combines an implementation of the One-Third Rule (OTR) algorithm with a communication layer that supports network-wide, content-driven message dissemination based on controlled epidemic routing. Experimental results obtained with a small flotilla of smartphones are also presented, that validate the system and demonstrate that consensus can be solved effectively in an opportunistic network.
Fichier principal
Vignette du fichier
icdcn15benchi.pdf (538.32 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01129406 , version 1 (11-03-2015)

Identifiants

Citer

Abdulkader Benchi, Pascale Launay, Frédéric Guidec. Solving Consensus in Opportunistic Networks. 2015 International Conference on Distributed Computing and Networking, Jan 2015, Goa, India. pp.1:1-1:10, ⟨10.1145/2684464.2684479⟩. ⟨hal-01129406⟩
739 Consultations
519 Téléchargements

Altmetric

Partager

More