16.11.2012 Views

Wireless Network Design: Optimization Models and Solution ...

Wireless Network Design: Optimization Models and Solution ...

Wireless Network Design: Optimization Models and Solution ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

14 Cross Layer Scheduling in <strong>Wireless</strong> <strong>Network</strong>s 323<br />

(termed as slot in this chapter) boundaries. This model is termed as Block Fading<br />

Model.<br />

Under this model, if a user transmits a signal χn in slot n, then the received signal<br />

Yn is given by:<br />

Yn = Hnχn + Zn, (14.1)<br />

where Hn corresponds to the time-varying channel (tap) gain due to fading <strong>and</strong> Zn is<br />

the complex Additive White Gaussian Noise (AWGN) (with zero mean <strong>and</strong> variance<br />

N0). Usually Hn is modeled as a zero mean complex Gaussian r<strong>and</strong>om variable.<br />

Let σ 2 denote the variance of Hn. Then |Hn| is a Rayleigh r<strong>and</strong>om variable <strong>and</strong><br />

Xn = |Hn| 2 is an exponentially distributed r<strong>and</strong>om variable with probability density<br />

function expressed as:<br />

fX(x) = 1<br />

σ<br />

2 exp(−x2<br />

), x ≥ 0. (14.2)<br />

2σ 2<br />

This model is called Rayleigh fading model.<br />

We refer to Xn as channel state in slot n. Note that the channel state Xn may<br />

change from slot to slot either in an independent <strong>and</strong> identically distributed (i.i.d.)<br />

fashion or in a correlated fashion (e.g. may follow a Markov model). Moreover, the<br />

channel state Xn is a continuous (exponential) r<strong>and</strong>om variable. However, for the<br />

scheduling problems considered later in this chapter, we assume that the channel<br />

state Xn takes values from a finite discrete set X. This discretization can be achieved<br />

by partitioning the channel state into equal probability bins with preselected thresholds.<br />

For example, let x(1) < ... < x(L) be these thresholds. Then the channel is<br />

said to be in state xk if x ∈ [x(k),x(k + 1)), k = 1,...,L. The channel state space X<br />

can be represented as X = {x1,...,xL}.<br />

For a wireless channel, capacity analysis can be performed both in the presence<br />

as well as absence of Channel State Information (CSI) at the transmitter. Throughout<br />

this chapter, we assume that the transmitter has the knowledge of perfect CSI. In a<br />

Time Division Duplex (TDD) system, due to channel reciprocity, it may be possible<br />

for the transmitter to obtain the CSI through channel estimation based on the signal<br />

received on the opposite link. In a Frequency Division Duplex (FDD) system, the<br />

receiver has to estimate the CSI <strong>and</strong> feed this information back to the transmitter. In<br />

practice, e.g., in IEEE 802.16 [26], the channel related information can be conveyed<br />

using ranging request (RNG-REQ) messages. In this chapter, we do not take into<br />

account the specific feedback mechanisms; rather, we assume that the transmitter<br />

has the knowledge of perfect CSI.<br />

Different notions of capacity of fading channels have been defined in the literature.<br />

The classical notion of Shannon capacity defines the maximum information<br />

rate that can be achieved over the channel with zero probability of error. This notion<br />

involves a coding theorem <strong>and</strong> its converse, i.e., that there exists a code that achieves<br />

the capacity (information can be reliably transmitted using this code at a rate less<br />

than or equal to the capacity) <strong>and</strong> that reliable communication is not possible if<br />

information is transmitted at a rate higher than the capacity.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!