A Randomized Distributed Algorithm for Peer-to-Peer Data Replication in Wireless Ad Hoc Networks

by: Hong-Zu Chou, Szu-Chi Wang, Sy-Yen Kuo

Dependable Computing, 2007. PRDC 2007. 13th Pacific Rim International Symposium on (2007), pp. 163-170.

View FullText article

DOI, IEEE Explore

Reviews [Write a review of this article]

There are no reviews of this article

Notes for this article

georgiad さんは全部で 1 非公開 + 0 公開のメモを書いています. もしあなたが georgiad さんなら、ログインすれば非公開のメモを見ることができます .

Find related articles from these CiteULike users

georgiad

Find related articles with these CiteULike tags

p2p, random_walks

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.

@inproceedings{citeulike:2804723, 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.}, author = {Chou, Hong-Zu and Wang, Szu-Chi and Kuo, Sy-Yen }, booktitle = {Dependable Computing, 2007. PRDC 2007. 13th Pacific Rim International Symposium on}, citeulike-article-id = {2804723}, doi = {http://dx.doi.org/10.1109/PRDC.2007.15}, journal = {Dependable Computing, 2007. PRDC 2007. 13th Pacific Rim International Symposium on}, keywords = {p2p, random\_walks}, pages = {163--170}, posted-at = {2008-05-16 10:01:54}, priority = {1}, title = {A Randomized Distributed Algorithm for Peer-to-Peer Data Replication in Wireless Ad Hoc Networks}, url = {http://dx.doi.org/10.1109/PRDC.2007.15}, year = {2007} }

RIS record

TY - CONF ID - citeulike:2804723 L3 - citeulike-article-id:2804723 TI - A Randomized Distributed Algorithm for Peer-to-Peer Data Replication in Wireless Ad Hoc Networks T2 - Dependable Computing, 2007. PRDC 2007. 13th Pacific Rim International Symposium on JF - Dependable Computing, 2007. PRDC 2007. 13th Pacific Rim International Symposium on SP - 163 EP - 170 N2 - 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. KW - p2p KW - random_walks AU - Chou, Hong-Zu AU - Wang, Szu-Chi AU - Kuo, Sy-Yen PY - 2007/// UR - http://dx.doi.org/10.1109/PRDC.2007.15 ER -

RIS BibTeX