A randomized distributed algorithm for peer-to-peer data replication in wireless ad hoc networks

Hong Zu Chou*, Szu Chi Wang, Sy Yen Kuo

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we focus on enhancing the data accessibility of ad hoc networks, with emphasis on peer-to-peer communications. To achieve this goal, we propose a randomized distributed algorithm for data replication. Furthermore, a probabilistic approach is presented to derive the upper bound of convergence by a novel technique, called path coupling, which gives more insight into factors determining system performance. Our analysis demonstrates that data accessibility can be improved by the proposed approach, with very limited memory consumption.

Original languageEnglish
Title of host publicationProceedings - 13th Pacific Rim International Symposium on Dependable Computing, PRDC 2007
Pages163-170
Number of pages8
DOIs
StatePublished - 2007
Externally publishedYes
Event13th Pacific Rim International Symposium on Dependable Computing, PRDC 2007 - Melbourne, VIC, Australia
Duration: 17 12 200719 12 2007

Publication series

NameProceedings - 13th Pacific Rim International Symposium on Dependable Computing, PRDC 2007

Conference

Conference13th Pacific Rim International Symposium on Dependable Computing, PRDC 2007
Country/TerritoryAustralia
CityMelbourne, VIC
Period17/12/0719/12/07

Fingerprint

Dive into the research topics of 'A randomized distributed algorithm for peer-to-peer data replication in wireless ad hoc networks'. Together they form a unique fingerprint.

Cite this