Channel Aware Distributed Scheduling for Exploiting Multi-Receiver Diversity and Multiuser Diversity in Ad-Hoc Networks: A Unified PHY/MAC Approach

Abstract

We study channel aware distributed scheduling in ad hoc networks where many links contend for the common channel using random access, and the focus here is on the model where each transmitter node has multiple intended receivers. In such a network, channel probing takes place in two phases: 1) in phase I, all transmitters contend for the channel using random access to reserve the channel, and the probing to accomplish a successful channel contention takes a random duration; and 2) in phase II, subsequent probings are carried out to estimate the link conditions from the successful transmitter in phase I to its intended receivers, according to specific probing mechanisms, and the probing for each receiver takes a constant duration. In this paper, we shall study various probing mechanisms for utilizing multi-receiver diversity in phase II and multiuser diversity in phase I for ad hoc (peer-to-peer) communications.Clearly, further probing increases the likelihood of seeing better channel conditions for exploiting diversities, but at the cost of additional time. Therefore, channel probing must be done efficiently to balance the tradeoff between the throughput gain from better channel conditions and the probing cost. One main objective of this study is to characterize this tradeoff in a stochastic decision making framework. Specifically, we cast network throughput optimization as an optimal stopping problem, and then explore channel aware distributed scheduling to leverage multi-receiver diversity and multiuser diversity in a joint manner. We show that the optimal scheduling policies for all proposed probing mechanisms exhibit threshold structures, indicating that they are amenable to easy distributed implementation. We show that the optimal thresholds and the maximum network throughput can be obtained off-line by solving fixed point equations. We further develop iterative algorithms to compute the optimal thresholds and the throughput.

Opportunistic channel-aware spectrum access for cognitive radio networks with periodic sensing

“…For selecting a channel, SU uses the scheme of sequential sensing and probing without recall [12]. We consider sensing errors and denote the probability of false alarm as P fa and miss detection as P md .…”

Rate-percentile-optimal sequential channel sensing and probing in cognitive radio networks under spectrum uncertainty

“…In the more general case of unknown channel state transition, the optimization has been formulated as optimal stopping problems, including the infinite-horizon version and the finite-horizon version. The former was used to study the MAC problems under various environments, including the uni-cast scenario in [29], the multi-cast scenario in [27], the noisy channel scenario in [28], [20], and the inaccurate sensing scenario in [19]. The latter is usually used when there is a channel-access delay requirement [18], [10].…”

Throughput-efficient sequential channel sensing and probing in cognitive radio networks under sensing errors

“…For wireless systems with dedicated channels, there have been several works that consider joint optimization of the reward obtained from channel selection and the cost incurred by channel probing (e.g., [15,20,19,9,7,21]). The differences between our problem and these previous works include the following: First, the problem of combined channel sensing and probing has not been considered in all these works.…”

“…The significance of (19) is that it dictates when probing should be used for a given set of sensing/probing/access parameters.…”