Accessing probabilistic quorums in dynamic networks

Abstract

Quorums are a fundamental building block for solving various fundamental problems such as consensus, distributed dictionaries, distributed storage, among others. In particular, probabilistic quorums have shown to be scalable, efficient, and suitable for dynamic environments [12]. Unfortunately, most existent analytic results for accessing probabilistic quorums are tailored to static networks [8]. However, we believe that the correct functioning of such systems must be assured in a much wider range of scenarios.In this paper, we discuss the random walk based scheme for accessing probabilistic quorums in dynamic networks where an oblivious adversary changes the communication links arbitrarily in each round. We show that O(n 3 log n) communication steps are needed to access a probabilistic quorum under these conditions.

Energy Balance Quorum System for Wireless Sensor Networks

“…On the contrary, the Low-power Beacon Interval applies to the sensor in the absence of any transmission requirements, then immediately enters the Low-power Beacon Interval to save power. In the study of [2,6], a Quorum-based [3,4] rendezvous mechanism was proposed, which considers 2 consecutive Beacon Intervals as a time cycle. The Beacon Intervals in the time cycle are in the order of small to large and from left to right corresponding to the × dimension of the Quorum square matrix system.…”