Sciweavers

Share
DSN
2008
IEEE

Probabilistic quorum systems in wireless ad hoc networks

8 years 9 months ago
Probabilistic quorum systems in wireless ad hoc networks
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic. This paper explores several access strategies for implementing probabilistic quorums in ad hoc networks. In particular, we present the first detailed study of asymmetric probabilistic bi-quorum systems, that allow to mix different access strategies and different quorums sizes, while guaranteeing the desired intersection probability. We show the advantages of asymmetric probabilistic bi-quorum systems in ad hoc networks. Such an asymmetric construction is also useful for other types of networks with non uniform access costs (e.g, peer-to-peer networks). The paper includes both a formal analysis of these approaches backed up by an extensive simulation based study. In particular, we show that one of the strategies that uses Random Walks, exhibits the smallest communic...
Roy Friedman, Gabriel Kliot, Chen Avin
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where DSN
Authors Roy Friedman, Gabriel Kliot, Chen Avin
Comments (0)
books