Quorum-Based Asynchronous Power-Saving Protocols for IEEE 802.11 Ad Hoc Networks

Abstract

This paper investigates the power mode management problem for an IEEE 802.11-based mobile ad hoc network (MANET) that allows mobile hosts to tune to the power-saving (PS) mode. There are two major issues that need to be addressed in this problem: (a) wakeup prediction and (b) neighbor discovery. The former is to deliver buffered packets to a PS host at the right time when its radio is turned on. The latter is to monitor the environment change under a mobile environment. One costly, and not scalable, solution is to time-synchronize all hosts. Another possibility is to design asynchronous protocols as proposed by Tseng et al. in [25]. In this paper, we adopt the latter approach and correlate this problem to the quorum system concept. We identify a rotation closure property for quorum systems. It is shown that any quorum system that satisfies this property can be translated to an asynchronous power-saving protocol for MANETs. Thus, the result bridges the classical quorum system design problem in the area of distributed systems to the power mode management problem in the area of mobile ad hoc networks. We derive a lower bound for quorum sizes for any quorum system that satisfies the rotation closure property. We identify a group of quorum systems that are optimal or near optimal in terms of quorum sizes, which can be translated to efficient asynchronous power-saving protocols. We also propose a new e-torus quorum system, which can be translated to an adaptive protocol that allows designers to trade hosts' neighbor sensibility for power efficiency. Simulation experiments are conducted to evaluate and compare the proposed protocols.

Singer cyclic difference sets for an energy-efficient joining scheme

“…In probabilistic methods, nodes listen, transmit, or sleep with different probabilities, which leads to unpredictable rendezvous delays and long tails of the joining delay distribution [10]. Deterministic protocols provide bounds on delay based on the Chinese Remainder Theorem (DISCO, U-Connect) [3], [11], quorum-based overlaps (Quorum, Searchlight, Hello) [12], [13], [14], [6], [15], or combinatorial techniques with CDS [16], [4]. In this paper, we focus on the lowest consuming protocols of the literature: Searchlight [6] and B-Nihao [2].…”

Asymmetric Block Design-Based Neighbor Discovery Protocol in Sensor Networks

“…Tseng et al [8,9] introduce a Quorum-based protocol for multi-hop ad hoc networks. The Quorum divides the total number of time slots into a set of m 2 contiguous intervals, m being a global parameter.…”

“…A probabilistic neighbor discovery protocol, the Birthday protocol [7], has been proposed for asynchronous neighbor discovery based on discovery probabilities. A quorum-based neighbor discovery protocol has been introduced in multi-hop ad hoc networks [8,9]. A node arbitrarily chooses one column and one row of entries for neighbor discovery in a given two-dimensional mˆm array.…”

Quorum system and random based asynchronous rendezvous protocol for cognitive radio ad hoc networks

“…The usual definition of a quorum system (QS) is given in [27]: Definition 3.1. A quorum system Q under an universal set U , U = {0, 1, ..., n − 1} with n being a cycle length (frequently used Z n symbol referring to U = Z n ), is a collection of non-empty subsets of U , called quorums, satisfying the intersection property ∀A, B ∈ Q : A ∩ B ∅.…”