📖
Solving Consensus in Opportunistic Networks
Abdulkader Benchi, Pascale Launay, Frédéric Guidec

Solving Consensus in Opportunistic Networks

Science & Mathematics Published 2015 Verification Pending

Overview & Synopsis

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.

Advertisement
SPONSOR CONTENT
Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Solving Consensus in Opportunistic Networks
Author / Organization Abdulkader Benchi, Pascale Launay, Frédéric Guidec
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2015
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-78796
Original Source Link Visit Source Page on hal.science »