Dynamic quorum policy for maximizing throughput in limited information multiparty MAC

Abstract

In multiparty MAC, a sender needs to transmit each packet to a set of receivers within its transmission range. Bandwidth efficiency of wireless multiparty MAC can be improved substantially by exploiting the fact that several receivers can be reached at the MAC layer by a single transmission. Multiparty communication, however, requires new design paradigms since systematic design techniques that have been used effectively in unicast and wireline multicast do not apply. For example, a transmission policy that maximizes the stability region of the network need not maximize the network throughput. Therefore, the objective is to design a policy that maximizes the system throughput subject to maintaining stability. We present a sufficient condition that can be used to establish the throughput optimality of a stable transmission policy. We subsequently design a distributed adaptive stable policy that allows a sender to decide when to transmit using simple computations. The computations are based only on limited information about current transmissions in the sender's neighborhood. Even though the proposed policy does not use any network statistics, it attains the same throughput as an optimal offline stable policy that uses in its decision process past, present, and even future network states. We prove the throughput optimality of this policy using the sufficient condition and the large deviation results. We present a MAC protocol for acquiring the local information necessary for executing this policy, and implement it in ns-2. The performance evaluations demonstrate that the optimal policy significantly outperforms the existing multiparty schemes in ad hoc networks. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. Abstract-In multiparty MAC, a sender needs to transmit each packet to a set of receivers within its transmission range. Bandwidth efficiency of wireless multiparty MAC can be improved substantially by exploiting the fact that several receivers can be reached at the MAC layer by a single transmission. Multiparty communication, however, requires new design paradigms since systematic design techniques that have been used effectively in unicast and wireline multicast do not apply. For example, a transmission policy that maximizes the stability region of the network need not maximize the network throughput. Therefore, the objective is to design a policy that maximizes the system throughput subject to maintaining stability. We present a sufficient condition that can be used to establ...

Cooperative Scheduling for Adaptive Duty Cycling in Asynchronous Sensor Networks

“…Wu et al [7] used it save power. Chaporkar et al [8] maximized throughput in limited information multiparty MAC with QS. Lai and Ravindran [9] presented quorum-based duty-cycling schedule where nodes send a beacon message at the beginning of wakeup slots.…”

“…The key properties of LOD owe to SQS, inheriting the advantages of some QSs with the non-empty intersection and rotation closure properties. QS was applied to establish channel control in dynamic spectrum access networks [6], to save power [7], to maximize throughput in limited information multiparty media access control (MAC) with QS [8] and to schedule duty cycling [9]. The non-empty intersection property ensures that any pair of neighboring nodes have common active time to communicate with each other.…”

Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems

“…Our contribution has been to design a scheduling policy that attains this goal. We have earlier designed a scheduling policy that attains the same goal but only in a system with a single queue [12], [16].…”

Quorum-based Localized Scheme for Duty Cycling in Asynchronous Sensor Networks

“…A QS is a set of subsets of a universe set such that every pair of subsets intersect with no empty. In recent years, QS is applied to establish control channels in dynamic spectrum access networks [8], to save power [9], and to maximize throughput in limited information multiparty MAC [10]. By ADC, each node can select sufficient amount of active time slots, composing a set ς ⊂ T (called a quorum) according to the amount of its demand while it can sleep to save energy at its rest time in a period.…”