Documente Academic
Documente Profesional
Documente Cultură
9, SEPTEMBER 2008
Abstract—In this paper, a cross-layer design framework for characteristics of the physical (PHY) layer. At the same time,
multi-input multi-output (MIMO)/orthogonal frequency divi- the PHY-layer resources are usually under-utilized because
sion multiplexing (OFDM) based wireless local area networks no MAC issue is taken into consideration too. As a result,
(WLANs) is proposed. In contrast to conventional systems where
the medium access control (MAC) and physical (PHY) layers are it is essential for a system designer to develop a cross-layer
separately optimized, our proposed methodology jointly designs approach [3], which can bridge the gap between the MAC
a multi-packet reception (MPR) based protocol with adaptive and PHY layers with the ultimate goal of achieving efficient
resource allocation. Specifically, a realistic collision model is management of system resources.
employed by taking into consideration the PHY layer parameters
such as channel information, space-time coded beamforming and The MAC protocols in conventional 802.11 systems em-
multiuser detection, as well as sub-carrier, bit, and power alloca- ploy a simplistic collision model which only supports one
tion. The allocation problem is formulated, so as to maximize the simultaneous transmission [1], [2]. Such an idealized model
system throughput, subject to the constraints from both the MAC is both optimistic and pessimistic [4]. Optimism is due to
and PHY layers. These constraints depend on the results of access
contention, data packets’ length, users’ spatial correlation and the assumption of error-free reception which ignores channel
the quality of channel feedback information. An iterative algo- effects such as fading and noise, while pessimism results from
rithm is then provided to obtain the optimal solution. Simulation the fact that it does not exploit the capability of the PHY layer
results will show that our proposed approach achieves significant to successfully decode multiple packets in the presence of
improvement in system performance such as average throughput simultaneous transmissions. Recently, a new standardization
and packet delay, compared with conventional schemes where
cross-layer design and optimization is not used. effort, IEEE 802.11n, which aims at a higher throughput by
deploying multiple antennas, has attracted much interest [5].
Index Terms—Cross-layer design, multi-packet reception, But its collision model is still essentially unchanged. This
adaptive resource allocation, multiple access, multi-input multi-
output (MIMO), orthogonal frequency division multiplexing situation motivates well the use of multi-packet reception
(OFDM). (MPR) to resolve collision and increase the network capacity.
However, most of the recent work in the context of MPR is
restricted to ALOHA [4], [6] and is very new in 802.11-like
I. I NTRODUCTION systems, which are based on a carrier sense multiple access
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
HUANG et al.: CROSS-LAYER MULTI-PACKET RECEPTION BASED MEDIUM ACCESS CONTROL AND RESOURCE ALLOCATION 3373
an attractive solution for future broadband wireless systems. via an iterative algorithm. The performance of the proposed
Although CSMA/SDMA protocols have been investigated in scheme is investigated in Section IV. Finally, this paper is
[7], [8], MPR combined with resource allocation and OFDMA concluded in Section V.
was not considered in the literature. Throughout this paper, the following notations shall be used.
The resource allocation problems in MIMO/OFDM systems (.)∗ , (.)T , and (.)H will denote conjugate, transpose and Her-
have been extensively investigated in recent years (e.g., [13], mitian transpose, respectively. |.| shall stand for the complex
[14], [15]). The existing formulations of resource allocation norm, E[.] for the expectation operation, and CN (a, ) for
do not fit well 802.11-like systems and most of them did not a complex Gaussian distribution with mean a and covariance
take the MAC issues into consideration [13], [14]. Moreover, matrix .
the existing allocation methods are hardly thorough solutions
for multiuser MIMO/OFDM systems. This is due to the II. S YSTEM M ODEL
challenges behind the resource allocation problems of such We consider the uplink transmission of a MIMO/OFDM
systems. For example, how to quantify and handle the co- based WLAN system where a number of mobile users or nodes
channel interference is not a trivial task, as this depends communicate with one access point (AP). Assume that there
on the transmission scheme and detection technique at the are totally Kt users in the system, each equipped with Mt
receiver, the accuracy of channel information, users’ spatial transmit antennas and the AP is equipped with Mr receive
separability, as well as the transmitted power of all admitted antennas. A key feature of our proposed MAC protocol is that
users. Likewise, how to select the user set for each sub-carrier it incorporates adaptive resource allocation into the protocol
usually requires a combinatorial search of optimal solutions, through the use of RTS/CTS exchange [16]. As a result,
which makes the allocation prohibitively complicated. Hence, the MPR capability will not only result from the use of
an allocation algorithm which can tackle such challenges and SDMA, but also OFDMA. In the following, the proposed
obtain the solution for the problem considering both of the protocol operation with the MPR capability, will be presented
MAC and PHY issues, is obviously of great interest. in Section II-A. Section II-B will then introduce the structures
In this paper, a cross-layer framework is proposed for of the transmitter and receiver.
802.11-based MIMO/OFDM systems, which jointly designs
the MPR-based MAC protocol and adaptive resource alloca-
A. Protocol Operation
tion. Specifically, the contributions of our work are four folds.
First of all and in contrast to the simplistic collision model The protocol operation is illustrated in Fig. 1. Before
used in conventional WLAN systems, the idea of MPR is the users initiate a transmission, they sense the channel to
applied by means of request-to-send/clear-to-send (RTS/CTS)- determine whether there is any pending transmission. If the
based protocol along with multiuser detection (MUD) to medium is found to be idle for an interval that exceeds the
resolve the collision problem. To determine the probability of distributed inter-frame space (DIFS), each user chooses a ran-
packets’ retransmission, a more realistic PHY model is used, dom backoff counter value uniformly distributed in the range
which takes into consideration multipath fading, interference, of [0, CW-1], where CW stands for contention window.1 After
noise, channel feedback quality, and the transmitter/receiver the random backoff time, the request access is then sent via an
design. Second, a critical element in all of the allocation RTS packet, which carries the information of the source and
schemes, namely, the channel state information (CSI), is esti- destination addresses. Since the AP has no priori knowledge
mated by exploiting the structure of RTS/CTS frames [16] in of the transmitting users, a blind detection technique [17] is
802.11 systems. Due to the time difference between RTS/CTS applied to estimate the CSI and decode multiple RTS packets
and data packets, partially outdated CSI at the transmitter is simultaneously. Any other user sensing the RTS will freeze
assumed and as a result, a transmitter design that combines its backoff timer at once. Note that the RTS packets also
space-time coding and beamforming is adopted to tackle contain the information of the data packets’ length. Upon
the imperfection of CSI. Third, we formulate the resource receiving the access request, the AP utilizes the information
allocation problem by incorporating both of the MAC and of the channel and packets’ length to perform the cross-
PHY issues such that the system throughput is maximized. To layer resource allocation of the subcarriers, bits and power.
make this problem tractable, we set up an allocation policy that The parameters of the space-time-coded beamformers (which
indicates under what conditions the users are allowed to share will be introduced in Section II-B 1)) are also computed at
the same subcarrier. Such decision depends on the correlation the same time. After a short inter-frame space (SIFS), the
between the spatial signatures of the estimated channels as access grant signals are then broadcast via a CTS packet
well as the channel feedback quality at the transmitter. Finally, to notify the specified users of the allocation results and
an iterative algorithm is proposed to solve the formulated channel information.2 Once the CTS packet is received, the
problem, and the optimal allocation of the subcarriers, bits selected users wait for a SIFS interval and begin to transmit
and power is obtained. Numerical results will show that our the data packets. Orthogonal training sequences, which are to
cross-layer approach results in a significant improvement in be transmitted in the preamble of the data packets, can be
system performance such as throughput and packet delay. selected according to the order of the received user addresses
The rest of this paper is organized as follows. In Section in the CTS packet. When the data transmission is finished, the
II, the system model including the frame structure, transmitter 1 CW is maintained in units of slot and is initially set to be CWmin .
and receiver designs is described. In Section III, we formulate 2 This is equivalent to providing the space-time-coded beamformer param-
the optimization problem and the optimal solution is obtained eters instead of the actual channel gains.
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
3374 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 9, SEPTEMBER 2008
AP executes the allocation algorithm Includes the allocation results and CSI
M M M M M M
DIFS SIFS SIFS SIFS
User K Busy Medium Backoff RTS Data Transmission
DIFS
Others Busy Medium Backoff Freeze Backoff Timer
AP checks the received packets. An acknowledgement (ACK) the AP to the receivers of mobile users via a CTS packet.
is then returned to the users with successful data transmissions Depending on the number of bits and power assigned to each
after a SIFS interval. We should note that the CSI used for subcarrier, the adaptive modulator will use a corresponding
allocation is estimated upon the reception of the RTS packets, QAM modulation scheme. A space-time-coded beamformer,
which may become partially outdated for data transmission which will be introduced in Section II-B 1), is then applied
because of the Doppler effect. In this case, the assumption of for each subcarrier. The resultant symbols are transformed into
partially outdated or erroneous CSI is required in our work. the time domain samples by inverse fast Fourier transform
It is assumed that the AP can successfully receive the (IFFT). A Guard interval is then added and these samples are
RTS packets if and only if the number of users which are transmitted through frequency selective fading channels to the
simultaneously sending RTS packets does not exceed the AP.
number of receive antennas. As a result, the number of At the receiver, the guard interval is removed and the
admitted users K, which can be supported simultaneously, is samples are transformed back into the frequency domain by
no larger than Mr . In particular, the admitted users are those the FFT block. With the knowledge of the channels and the
who simultaneously choose the minimum backoff time. If space-time-coded beamformers for different users, MUD is
collision occurs, i.e., when the number of users simultaneously applied to suppress the multi-access interference (MAI) and
sending RTS packets exceeds Mr , the contention window is jointly estimate the transmitted signals for all users. The
doubled for each retransmission until it reaches a maximum subcarrier, bit and power allocation information is used to
value CWmax . Alternatively, if a packet error is detected at the configure the MUD, as will be described in Section II-B 2).
AP and an ACK is not received within ACKtimeout period, 1) Partial CSI and Space-Time-Coded Beamformer: There
retransmission is also required. Upon successful transmission are two key techniques that have been proposed in the
of a packet, CW is reset to CWmin . literature for exploiting transmit antenna arrays: Space-time
coding and transmit beamforming. These two strategies are
based on two different and extreme assumptions regarding
B. Transmitter and Receiver Structures the channel feedback available at the transmitter. Space-time
During the RTS transmission, conventional space-time cod- coding requires no feedback, whereas conventional beamform-
ing is employed at the transmitter and accordingly blind ing requires accurate feedback. Clearly, the former is too
detection is applied at the receiver for receiving multiple pessimistic and the latter is rarely valid, and we expect that
RTS packets. Upon successfully decoding the RTS packets, a good transmitter design would be a combination of space-
the AP can identify the senders and inform them of the time coding and beamforming [19], [20], [21]. In this paper,
orthogonal training sequences which will be used during the we focus on the channel mean feedback, where the spatial
data transmission phase. As a result, the CSI is estimated in fading channels are modeled as Gaussian random variables
the preamble of data frames, with which MUD techniques with non-zero mean and white covariance conditioned on
can be adopted to separate the multiple data packets at the the channel feedback. This channel model can accommodate
AP. In the following, we focus on the configurations of the different types of partial CSI, such as outdated CSI caused
transmitter and receiver during the data packets’ transmission, by feedback delay, and uncertain CSI induced by channel
which are given in Fig. 2 and Fig. 3, respectively. Assume estimation, prediction or feedback errors.
that the frequency band is divided into N subcarriers. The In the proposed system, the CSI, which is assumed to be
serial data stream of user k is transformed into a number of perfectly estimated, is obtained upon the reception of the RTS
parallel branches by de-multiplexing. To form one space-time- packets. However, due to the time difference between the RTS
coded OFDM block, we pair two consecutive OFDM symbols. and data packets, such CSI will be partially outdated compared
Recall that the information of the allocation results is sent from to the true channel information. As a result, the assumption
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
HUANG et al.: CROSS-LAYER MULTI-PACKET RECEPTION BASED MEDIUM ACCESS CONTROL AND RESOURCE ALLOCATION 3375
Control information
from the BS
Estimated
partial CSI
Parallel-to-
Power loading and serial and #1
M-QAM adaptive ⎡ s1[1] ⎤
⎢ ⎥
2D beamformer IFFT add
.
modulation for 1th
.
⎣ s2 [1]⎦ for 1th subcarrier
.
guard
DEMULTIPLEXING .
subcarrier
. interval
.
. .
Data stream
. . .
of user k
. .
. . .
Power loading and
M-QAM adaptive
.
⎡ s1[ N ] ⎤
2D beamformer
Parallel-to-
serial and # Mt
⎢ ⎥
for Nth add
modulation for Nth ⎣ s 2 [ N ]⎦ IFFT
subcarrier guard
subcarrier
interval
Fig. 2. Transmitter structure of the kth user for the uplink MIMO/OFDM.
Remove
guard interval MUD Data stream of user 1
#1
FFT #1
and
. serial-to-parallel
. .
. . . . .
. . . . .
. .
Extension
Remove
#Mr Removing
guard interval MR
MUD
and FFT Data stream of user K
and C
serial-to- #N
serial-to-parallel
parallel
Fig. 3. Receiver structure (at the AP) for the uplink MIMO/OFDM.
of partially outdated CSI and associated transmitter design are where ξ denotes the correlation coefficient between the true
required in our system. Specifically, for sub-carrier n and user channel and estimated channel in the time domain while σh2
k, the Mr × Mr MIMO channel is modeled as is the total energy for all FIR channels of all the users. When
the Doppler effect is considered, ξ depends on the Doppler
H[n, k] = H̄[n, k] + Ξ[n, k], (1) frequency fd normalized by the time difference tΔ [18]. That
where H[n, k] is the conditional mean of H[n, k] is, ξ = J0 (2πfd tΔ ), where J0 (·) is the zeroth order Bessel
given the feedback information Hf [n, k], and function of the first kind.
2
Ξ[n, k]∼CN (0Mr ×Mt , Mt σε [n, k]IMr ) is the associated Usually there is no information exchange between different
zero-mean perturbation matrix. The deterministic pair users. As a result, each user designs the space-time-coded
(H̄[n, k], σ2 [n, k]) parameterizes the partially outdated CSI beamformer according to its own channel independently, with-
and the variance σ2 [n, k] reflects the quality of the CSI. out taking into consideration other mobile-to-AP links. In
When the FIR channels {hμν [k]}M t ,Mr
μ=1,ν=1 between different our algorithm, we adopt the space-time-coded beamformer
transmit and receive antenna pairs are independent and the L as proposed in [18] to configure each user’s transmitter.
taps {hμν [l, k]}L l=1 in hμν [k] are uncorrelated, we have This space-time-coded beamformer is briefly described in the
f
H
E H [n, k]H [n, k] following. Since the transmitter configuration is similar for all
ξ= , and σε2 [n, k] = (1−|ξ|2 )σh2 , ∀n, k, users and sub-carriers, we focus on user k and sub-carrier n
E [H[n, k]H [n, k]]
H
(2) only. For brevity, the square bracket [n, k] is dropped for the
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
3376 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 9, SEPTEMBER 2008
∗
#1 with multiple antennas. As mentioned earlier, the challenges
v1,1
behind SDMA and the existence of co-channel interference
δ1
⊗ (CCI) make these problems difficult to be solved. To deal
.
vM∗ t ,1 ⊗
⊗ with this, the authors in [13] proposed a grouping approach,
.
.
.
which divides all the users into groups by guaranteeing low
s1 , s2 Space Time ⊗ ∗
.
.
interference between any pair of users from different groups.
Block v 1,2
.
. # Mt As a result, the multiuser joint resource allocation problem is
δ2
⊗
Coding
.
reduced to a simple single-user optimization problem. How-
⊗ vM∗ t ,2 ever, such strategy only works when the correlations of the
.
⊗
.
.
users’ channel matrices are the same for all the sub-carriers.
⊗ In particular, the obtained solution is suboptimal because the
Fig. 4. Structure of space-time-coded beamformer.
users from the same group cannot share the sub-carriers even
if they are highly separated. Another allocation algorithm was
proposed in [14] based on sequential insertion of spatially
moment. separable users. The basic idea is to assign each user to an
The structure of the space-time-coded beamformer is de- appropriate sub-carrier by evaluating the incurred rate benefit
picted in Fig. 4. The modulated symbols s1 and s2 are used to of the allocation. However, this algorithm is heuristic and
generate the Alamouti space-time matrix.3 Splitting the trans- cannot be applied when partial CSI is assumed.
mit power with percentages δ1 , δ2 results in δ1 P for the first In this paper and in contrast to previous works, a cross-layer
basis-beam and δ2 P for the second basis-beam. The power- approach is developed to maximize the system throughput. To
loaded symbols achieve this, we select the optimal user combination among all
∗ are then multiplied
T by two
beamforming vec-
T the admissible combinations for each sub-carrier and allocate
tors v1∗ = v1,1 ∗
, · · · , vM t ,1
and v ∗
2 = v ∗
1,2 , · · · , v ∗
Mt ,2 ,
respectively. The key problem is how to adjust (v1 , v2 , δ1 , δ2 ) the bits and power based on partially outdated CSI. In the
to optimize the average BER performance. Such optimization following, we firstly investigate the influence of users’ sepa-
can be performed according to [18]. Let d2 denote the scaled ration on the allocation strategy. Such allocation strategy aims
square Euclidean distance for the constellation, which is a to indicate the condition under which the users are allowed
function of the power loading P and the number of loaded to share the same sub-carrier. A resource allocation problem
bits b [18, Eqn. (11)]. A threshold d20 will then be required to is then formulated by considering both of the MAC and PHY
achieve a target BERt [18, Eqns. (23) & (25)]. issues. Finally, an allocation algorithm is proposed to obtain
2) Multiuser Detector: In our system, multiple users can the optimal solution.
transmit on the same sub-carriers and the superimposed sig-
nals can be separated at the receiver using multiple-antenna A. Users’ Separability
techniques. For each sub-carrier, the receiver aims to estimate The allocation in MIMO/OFDM systems includes the se-
the transmitted modulated symbols from different users. The lection of the users on each subcarrier, as well as the bits,
sub-carrier allocation information is then used to identify the and power assignment for each user. A good allocation
corresponding users assigned to this sub-carrier. With the strategy should prevent the users of low separability from
transmitter design in Section II-B 1), the proposed architecture being assigned into the same sub-carriers because the resultant
can be viewed as a space-time block coded (STBC) system high interference will greatly reduce the system capacity.
where each symbol is transmitted through a beam. As a result, To achieve this and make the allocation problem tractable,
the MUDs which were originally designed for multiuser STBC we dynamically control the user assignment according to
systems can be applied to jointly detect the transmitted signals the users’ separability such that the mutual interference can
for different users. Specifically, we assume that the maximum- be substantially avoided. Usually the users’ separability is
likelihood (ML) MUD [22] is adopted in our system, which is determined by the correlation of the channel matrices between
the optimal receive architecture that maximizes the posteriori the users. However, only partially outdated CSI is available in
probability. Other types of MUDs such as zero-forcing (ZF), our system. As a result, we shall investigate the performance
minimum mean-square error (MMSE), parallel interference with different channel correlations as well as different channel
cancellation (PIC) and successive interference cancellation feedback qualities.
(SIC), can be also deployed at the receiver with a reduced We begin by giving the definition of the channel correla-
complexity. For further details of these techniques, interested tion. Let the channel matrices Hk1 , Hk2 of user k1 , k2 be
readers are referred to [22], [23], [24]. decomposed into
Hk1 = Uk1 Λk1 VkH1 and Hk2 = Uk2 Λk2 VkH2 . (3)
III. M ULTIUSER A DAPTIVE R ESOURCE A LLOCATION
In the case of perfect CSI, the space-time-coded beamformer
In this section, we shall introduce the problem formulation
is reduced to a conventional beamformer. Accordingly, the
and allocation algorithm based on the system described in the receive-antenna weight vectors uk1 and uk2 are equal to the
previous section. Recently, the resource allocation problems
first column vectors of Uk1 and Uk2 . The channel correlation
have been extensively studied in the context of OFDM systems
which depends on the receive-antenna weight vectors, is
3 Without loss of generality, the Alamouti scheme is used throughout this defined by
paper. ρk1 ,k2 = uH
k1 uk2 . (4)
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
HUANG et al.: CROSS-LAYER MULTI-PACKET RECEPTION BASED MEDIUM ACCESS CONTROL AND RESOURCE ALLOCATION 3377
−1
10
Single User Bound
a correlation higher than ρth . Note that the channel feedback
MLD quality ξ is an indirect parameter for checking the admissible
combinations and clearly play a role in determining the value
of ρth . Specifically, we define 1i,n as the admissibility index
−2
10
for the ith combination on the nth sub-carrier. That is,
ξ=0.6
1 ith combination is admissible on the nth subcarrier
1i,n =
0 else.
BER
(5)
For example, consider a four-user scenario with ρth = 0.5.
ξ=0.8
−3
10 Assume that the correlation matrix on sub-carrier n is given
by
⎡ ⎤
ξ=1 1 0.6 0.3 0.7
⎢ 0.6 1 0.2 0.4 ⎥
ℵ=⎢ ⎣ 0.3 0.2 1 0.3 ⎦ .
⎥ (6)
−4
10
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
0.7 0.4 0.3 1
ρ
subset of users. Hence, there are a total of 2k combinations. βi,n = 1 ∀n, (7c)
For example, assume that K = 4. A total of 16 combinations i=1
from (0,0,0,0) to (1,1,1,1) can be obtained. Each combination
corresponds to a user set where the value 1 or 0 indicates 4 To limit the interference to the other Basic Service Sets (BSSs) or neigh-
whether the corresponding user is an element of such set boring systems, and compare different schemes under the same transmission
power condition, we use the total power constraint in this paper (Eqn. (7b)).
or not. A combination is admissible if and only if in the However, it can be easily extended to the case of individual power constraints
corresponding user subset, we cannot find a pair of users with by applying a similar technique in the allocation algorithm.
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
3378 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 9, SEPTEMBER 2008
K
N 2
inequalities5 . That is,
1i,n βi,n fk,i,n (Pk,i,n )
n=1 i=1 Rk
= ∀k = 1, · · · , K−1.
N
2 K
N 2K
Rk+1 1i,n βi,n fk,i,n (Pk,i,n )
1i,n βi,n fk+1,i,n (Pk+1,i,n ) Rk
n=1 i=1
n=1 i=1
(7d)
≤
N
2K R[k+1]K
In the above equations, Rk denotes the packet length of user 1i,n βi,n f[k+1]K ,i,n P[k+1]K ,i,n
n=1 i=1
k. Also βi,n is defined as
k = 1, · · · , K. (12)
1 ith combination is chosen in subcarrier n Here [·]K represents the modulus based on K with 1 ≤ [·]K ≤
βi,n =
0 else. K. For example, [−1]K = K −1, [0]K = K, and [K + 1]K =
(8) 1.
To make the problem tractable, βi,n is relaxed to be a real
number within the interval [0,1] in (7a). The real-valued βi,n
C. Allocation Algorithm
can be interpreted as the time sharing factor for the ith com-
bination on the nth sub-carrier. Specifically, assume that the We note that fk,i,n (Pk,i,n ) is a concave function. However,
number of OFDM symbols required to transmit the data frame the objective function βi,n fk,i,n (Pk,i,n ) in (7a) may not be
is Ns , then the ith combination is assigned to the nth sub- concave in (βi,n , Pk,i,n ). To solve this problem, we let ck,i,n =
carrier for a duration of Ns βi,n OFDM symbols. For example, Pk,i,n βi,n and rewrite (7a)-(7d) as
consider 4 users and let us focus on the 1st sub-carrier. The 2
K
N
K
ck,i,n
data frame contains Ns = 40 OFDM symbols. Moreover, we max 1i,n βi,n fk,i,n (13a)
assume that the 4th combination ((0,0,1,1), including user 3 βi,n ∈[0,1]
n=1 i=1 k=1
βi,n
ck,i,n ∈[0,∞)
and user 4) and the 13th combination ((1,1,0,0), including
user 1 and user 2) share this sub-carrier with β4,1 = 0.4, and subject to
K
β13,1 = 0.6. In such case, user 3 and user 4 will occupy this
2
N
K
sub-carrier of the first 16 OFDM symbols while that of the ck,i,n = Ptotal , (13b)
remaining 24 OFDM symbols will be shared by user 1 and n=1 i=1 k=1
for user k of the ith combination on sub-carrier n, given the βi,n = 1 ∀n, (13c)
allocated power Pk,i,n . Assume that adaptive M-QAM is used, i=1
then given the target bit error rate BERt and the transmit
power P , the number of bits that can be transmitted within
N
2 K
ck,i,n
each symbol is approximated as [25] 1i,n βi,n fk,i,n βi,n
n=1 i=1 Rk
N
2K c ≤ R[k+1]
[k+1]K ,i,n K
1.5 · P 1i,n βi,n f[k+1]K ,i,n βi,n
log2 M = log2 1 + , (9) n=1 i=1
d20
k = 1, · · · ,K. (13d)
where d20 (see Section II-B 1)) can be obtained in [18, Eqns. It can be easily shown that βi,n fk,i,n (ck,i,n /βi,n ) is con-
(23) & (25)]. For brevity, let cave within βi,n ∈ [0, 1] and ck,i,n ≥ 0. On the other hand,
1i,n does not change the concavity of the objective function.
1.5 The Lagrangian is obtained as
γ= . (10)
d20
N 2K K
c
L= 1i,n βi,n fk,i,n βk,i,n
i,n
n=1 i=1 k=1 K
For a specific user k and sub-carrier n, γk,n represents N 2K
K N
2
the equivalent channel condition. Then, the rate function −λ ck,i,n − Ptotal − tn βi,n − 1
fk,i,n (Pk,i,n ) is obtained as
n=1 i=1 k=1 n=1
i=1
K N 2K
c
− uk 1i,n βi,n fk,i,n βk,i,n
i,n
· R[k+1]K
log2 (1 + γk,n Pk,i,n ) k ∈ φi k=1
n=1 i=1
fk,i,n (Pk,i,n ) = (11) 2K c
0 k∈/ φi ,
K N
[k+1]K ,i,n
+ uk 1i,n βi,n f[k+1]K ,i,n βi,n · Rk ,
k=1 n=1 i=1
where φi denotes the set of users contained in the ith com- (14)
bination. Note that in the above problem formulation, both where λ and tn are the Lagrange multipliers for the constraints
1i,n and fk,i,n (Pk,i,n ) depend on the transmitter and receiver (13b), (13c), and uk are the Karush-Kuhn-Tucker (KKT)
structures, because the channel correlation threshold ρth and multipliers for the constraint (13d), respectively. A set of KKT
the equivalent channel condition γk,n are decided based on conditions for the optimal solution (c∗k,i,n , βi,n
∗
) can then be
the proposed system which is described in Section II. obtained as follows [26]:
The constraint (7d) includes (K −1) independent equalities. 5 Since if a ≤ a ≤ · · · ≤ a
1 2 K ≤ a1 , it follows that a1 = a2 = · · · =
Alternatively, this constraint can be replaced by K dependent aK .
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
HUANG et al.: CROSS-LAYER MULTI-PACKET RECEPTION BASED MEDIUM ACCESS CONTROL AND RESOURCE ALLOCATION 3379
∗
If βi,n 0, we have
= and
(λ0 )
Qk,i,n
∂ck,i,n
∂L
(ck,i,n ,βi,n )=(c∗
∗ k,i,n ,βi,n )
∗
∗ = 1 − uk R[k+1]K + u[k−1]K R[k−1]K fk,i,n (gk,i,n (λ0 ))
= 1i,n fk,i,n β ∗
ck,i,n
− λ − uk 1i,n R[k+1]K fk,i,n ck,i,n
∗
−gk,i,n (λ0 )λ0 .
i,n ∗ βi,n
(21)
ck,i,n
+u[k−1]K 1i,n R[k−1]K fk,i,n β ∗ To satisfy the constraint (13c), we let
i,n
c∗
=1i,n 1 − uk R[k+1]K + u[k−1]K R[k−1]K fk,i,n k,i,n
∗ βi∗ ,n = 1 and βi,n
∗
= 0 for all i = i , (22)
βi,n
< 0 c∗k,i,n = 0
−λ , where
= 0 c∗k,i,n > 0
(15a)
i = arg max Gi,n (λ0 ), and ψn = i : arg 1i,n = 1 .
and
i∈ψn i
(23)
∂L
∂βi,n (c ∗ ∗ Here ψn denotes the set of admissible combinations in the nth
k,i,n ,βi,n )=(ck,i,n ,βi,n )
K
c∗ sub-carrier.
= 1i,n · 1 − uk R[k+1]K fk,i,n ( βk,i,n ∗ ) Given the values of (λ, u1 , u2 , · · · , uK ), we can obtain
i,n
k=1
K the optimal solutions of (c∗k,i,n , βi,n ∗
). However, the values of
c∗ c∗
− βk,i,n
∗
fk,i,n ( βk,i,n
∗ ) + 1i,n uk Rk f[k+1]K ,i,n (15b) (λ, u1 , u2 , · · · , uK ) are also required to be adjusted in order
i,n i,n
c∗ c∗
k=1
c∗
to satisfy the KKT conditions (13b), (13d), (15d) and (15e).
[k+1]K ,i,n [k+1]K ,i,n [k+1]K ,i,n
( β∗ )− ∗ f [k+1] ( ∗ ) The proposed iterative algorithm, which obtains the values of
i,n ∗
βi,n K ,i,n βi,n
> 0 βi,n =1 (λ, u1 , u2 , · · · , uK ), is described as follows:
−tn ∗
= 0 βi,n ∈ (0, 1). Step 1: Initialize all the KKT multipliers u1 = u2 = · · · =
∗
Otherwise, if βi,n = 0, then uK = 0 and λ to be a very small value.
Step 2: Based on the current values of (λ, u1 , u2 , · · · , uK ),
∂L ∂L compute the temporarily optimal solutions of (c∗k,i,n , βi,n ∗
)
ck,i,n + βi,n ≤0
∂ck,i,n ∂βi,n using Eqns. (16)-(23).
for all βi,n ∈ (0, 1] and ck,i,n > 0. (15c) Step 3: Examine whether the KKT condition (13b) is
satisfied or not. If yes, go to the next step. If not, adjust the
Moreover, the other KKT conditions include value of λ and repeat Step 2 using the updated value of λ,
K N 2K until the total power constraint (13b) is satisfied.
ck,i,n
uk 1i,n βi,n fk,i,n βi,n · R[k+1]K Step 4: Examine whether the KKT conditions (13d), (15d)
k=1
n=1 i=1
and (15e) are all satisfied or not. If yes, stop. If one or
N 2K c
− 1i,n βi,n f[k+1]K ,i,n [k+1]K ,i,n
· Rk more conditions are not satisfied, iteratively search the values
of (u1 , u2 , · · · , uK ). In each iteration, choose the user k ◦
βi,n
n=1 i=1
= 0, satisfying
(15d) k ◦ = arg max Ek+ (24)
uk ≥ 0, k = 1, · · · , K. (15e) k
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
3380 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 9, SEPTEMBER 2008
100
Ek◦ < 0. As a result, the correct value of uk◦ which results Proposed Scheme
(l) (u)
in Ek◦ = 0 should be between uk◦ and uk◦ . 90 Physical Layer Optimization
(l) (u) Fixed Allocation
(m) (u +u ) (m)
Set uk◦ = k◦ 2 k◦ and repeat Step 2 using uk ◦ . 80
may happen that we cannot find a value of uk◦ to satisfy the SNR per subcarrier (dB)
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
HUANG et al.: CROSS-LAYER MULTI-PACKET RECEPTION BASED MEDIUM ACCESS CONTROL AND RESOURCE ALLOCATION 3381
TABLE I
S IMULATION PARAMETERS resource allocation (DRA), and w/o MPR+FRA, respectively.
Another scheme used for comparisons is the one where the AP
SLOT 9 us detects multiple RTS packets but sends CTS to only one user
SIFS 16 us with adaptive resource allocation. This scheme is referred to as
DIFS 34 us
Multiple RTS Reception with Single Data Packet Transmission
(MRSD). Fig. 7 demonstrates the average throughput achieved
PHY Header 20 us
by different methods, as the SNR increases from 5 dB to 30
OFDM Symbol Duration 4 us
dB. A data packet is defined to be successfully received if
CT Stimeout 300 us and only if all the bits in this packet are correctly decoded.
ACKtimeout 300 us The average throughput is then defined as the average number
of packets which are successfully received within a time unit
7
(ms). Because our objective is to demonstrate the advantage of
our proposed cross-layer methodology which jointly designs
6 Proposed Cross−Layer Approach an MPR based protocol with adaptive resource allocation, an
uncoded system is assumed in the simulation. We can see
that our proposed cross-layer approach can always achieve
Throughput (Number of Packets/ms)
5
significant improvement in the average throughput, compared
to all the other schemes. Moreover, MPR+FRA outperforms
4
MRSD and w/o MPR+ DRA in most cases, except in the
low SNR range. This result reveals that MPR plays a more
3
important role compared to DRA as SNR increases, because
the overhead required for the channel access contention can be
2
considerably reduced by scheduling multiple users at a time. A
MPR+FRA
w/o MPR+DRA
close observation of this figure further shows that the average
1
w/o MPR+FRA throughput of w/o MPR schemes appears more stable with
MRSD respect to different SNRs, compared to the schemes using
0
5 10 15 20 25 30
MPR. On the other hand, the throughput gap between the w/o
SNR per subcarrier (dB) MPR+DRA and w/o MPR+FRA schemes becomes narrow in
the high SNR range.
Fig. 7. Comparisons of average throughput under saturated traffic.
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
3382 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 9, SEPTEMBER 2008
8 12
MPR+FRA Cross−Layer Approach
6
8
4
3
2 2
1 0
10 20 30 40 50 60 70 80 90 100 0.04 0.08 0.12 0.16 0.2 0.24 0.28
Number of Users
Packet Arrival Rate (packets/ms)
Fig. 8. Average throughput versus different numbers of users in the network. Fig. 9. Comparison of average packet delay versus packet arrival rates.
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
HUANG et al.: CROSS-LAYER MULTI-PACKET RECEPTION BASED MEDIUM ACCESS CONTROL AND RESOURCE ALLOCATION 3383
12
Cross−Layer Approach
A PPENDIX I: C ALCULATION OF S HARING FACTORS
MPR+FRA
Since the two combinations i1 and i2 are required to share
w/o MPR+DRA
10
w/o MPR+FRA
the same sub-carrier n◦ , the allocation on the sub-carriers
MRSD other than n◦ remains the same irrespective of the chosen two
8 2 K
c ◦ ,i,n
Average Packet Delay (ms)
Fig. 10. Average packet delay of five schemes under different values of
βi1 ,n◦
SNR. Rk◦ (f[k◦ +1]K ,i2 ,n◦ +Δ[k◦ +1]K )−R[k◦ +1]K (fk◦ ,i2 ,n◦ +Δk◦ )
= R[k◦ +1]K (fk◦ ,i1 ,n◦ −fk◦ ,i2 ,n◦ )−Rk◦ (f[k◦ +1]K ,i1 ,n◦ −f[k◦ +1]K ,i2 ,n◦ )
.
5.5
(33)
Cross−Layer Approach According to the definition of Sk◦ , S[k◦ +1]K , Sk ◦ , S[k
◦ +1] ,
K
5 MPR+FRA
it can be concluded that
w/o MPR+DRA
4.5 w/o MPR+FRA
MRSD Sk◦ = fk◦ ,i1 ,n◦ + Δk◦ (34)
Throughput (Number of Packets/ms)
3.5
S[k◦ +1]K = f[k◦ +1]K ,i1 ,n◦ + Δ[k◦ +1]K (35)
V. C ONCLUSIONS R EFERENCES
[1] IEEE Std 802.11a-1999,
A PHY-MAC based cross-layer framework in the context of http://standards.ieee.org/getieee802/download/802.11a-1999.pdf
MIMO/OFDM systems was proposed in this paper. Our design [2] IEEE Std 802.11g-2003,
objective is to achieve a high system throughput by jointly http://standards.ieee.org/getieee802/download/802.11g-2003.pdf
[3] S. Shakkottai, T. S. Rappaport, and P. C. Karlsson, “Cross-layer design
using MPR and adaptive resource allocation. Specifically, a for wireless networks,” IEEE Commun. Mag., vol. 41, no. 10, pp. 74–80,
RTS/CTS based multiple access mechanism was proposed, Oct. 2003.
which is responsible for providing interconnection and infor- [4] L. Tong, V. Naware, and P. Venkitasubramaniam, “Signal processing
in random access,” IEEE Signal Processing Mag., vol. 21, no. 5, pp.
mation exchange between the MAC and PHY layers. We then 29–39, Sept. 2004.
formulated an allocation problem which encapsulates both of [5] Y. Xiao, “IEEE 802.11n: enhancements for higher throughput in wireless
the MAC and PHY issues. An iterative algorithm was also LANs,” IEEE Wireless Commun., vol. 12, no. 6, pp. 82–91, Dec. 2005.
[6] V. Naware, G. Mergen, and L. Tong, “Stability and delay of finite-
provided to obtain the optimal solution. A distinctive feature of user slotted ALOHA with multipacket reception,” IEEE Trans. Inform.
the proposed method is that the allocation strategy is directly Theory, vol. 51, no. 7, pp. 2636–2656, July 2005.
related to the users’ spatial correlation and the quality of [7] C. Sakr and T. D. Todd, “Carrier-sense protocols for packet-switched
smart antenna basestations,” in Proc. ICNP’97, pp. 45–52, Oct. 1997.
channel feedback information. It was demonstrated that our [8] P. X. Zheng, Y. J. Zhang, and S. Liew, “Multipacket reception in wireless
cross-layer approach can achieve more efficient management local area networks,” in Proc. IEEE ICC’06, Turkey, vol. 8, pp. 3670–
of the system resources compared to the single-layer optimiza- 3675, June 2006.
[9] T. Keller and L. Hanzo, “Adaptive multicarrier modulation: a convenient
tion, and that the system performance such as throughput and framework for time-frequency processing in wireless communications,”
packet delay is significantly enhanced. in Proc. IEEE, vol. 8, no. 5, pp. 611–640, May 2000.
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.
3384 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 9, SEPTEMBER 2008
[10] C. Y. Wong, R. S. Cheng, K. B. Letaief, and R. Murch, “Multiuser Khaled Ben Letaief (S’85-M’86-SM’97-F’03) re-
OFDM with adaptive subcarrier, bit and power allocation,” IEEE J. ceived the BS degree with distinction in Electri-
Select. Areas Commun., vol. 17, no. 10, pp. 1747–1758, Oct. 1999. cal Engineering from Purdue University at West
[11] Y. Chen, J. Chen, and C. Li, “A fast suboptimal subcarrier, bit and power Lafayette, Indiana, USA, in December 1984. He
allocation algorithm for multiuser OFDM-based systems,” in Proc. IEEE received the MS and Ph.D. Degrees in Electrical En-
ICC’04, vol. 6, pp. 3212–3216, June 2004. gineering from Purdue University, in August 1986,
[12] Z. Shen, J. G. Andrews, and B. L. Evans, “Adaptive resource allocation and May 1990, respectively. From January 1985 and
in multiuser OFDM systems with proportional rate constraints,” IEEE as a Graduate Instructor in the School of Electrical
Trans. Wireless Commun., vol. 4, no. 6, pp. 2726–2737, Nov. 2005. Engineering at Purdue University, he has taught
[13] Y. J. Zhang and K. B. Letaief, “An efficient resource allocation scheme courses in communications and electronics.
for spatial multiuser access in MIMO/OFDM systems,” IEEE Trans. From 1990 to 1993, he was a faculty member at
Commun., vol. 53, no. 1, pp. 107–116, Jan. 2005. the University of Melbourne, Australia. Since 1993, he has been with the
[14] I. Koutsopoulos and L. Tassiulas, “Adaptive resource allocation in Hong Kong University of Science & Technology where he is currently a
SDMA-based wireless broadband networks with OFDM signaling,” in Chair Professor of Electronic and Computer Engineering (ECE) and Head
Proc. IEEE INFOCOM’02, vol. 3, pp. 1376–1385, June 2002. of the ECE Department. He is also the Director of the Hong Kong Telecom
[15] W. L. Huang and K. B. Letaief, “A cross-layer resource allocation Institute of Information Technology as well as the Director of the Center
and scheduling for multiuser space-time block coded MIMO/OFDM for Wireless Information Technology. His current research interests include
systems,” in Proc. IEEE ICC’05, vol. 4, pp. 2655–2659, May 2005. wireless and mobile networks, Broadband wireless access, OFDM, CDMA,
[16] Z. Kong, D. H. K. Tsang, B. Bensaou, and D. Gao, “Performance and Beyond 3G systems. In these areas, he has published over 280 journal
analysis of IEEE 802.11e contention-based channel access,” IEEE J. and conference papers and given invited keynote talks as well as courses all
Select. Areas Commun., vol. 22, no. 10, pp. 2095–2106, Dec. 2004. over the world.
[17] S. Talwar, M. Viberg, and A. Paulraj, “Blind separation of synchronous Dr. Letaief served as consultants for different organizations and is currently
co-channel digital signals using an antenna array, Part I: Algorithms,” the founding Editor-in-Chief of the IEEE T RANSACTIONS ON W IRELESS
IEEE Trans. Signal Processing, vol. 44, no. 5, May 1996. C OMMUNICATIONS. He has served on the editorial board of other pres-
[18] P. Xia, S. Zhou, and G. B. Giannakis, “Adaptive MIMO-OFDM based tigious journals including the IEEE J OURNAL ON S ELECTED A REAS IN
on partial channel state information,” IEEE Trans. Signal Processing, C OMMUNICATIONS - W IRELESS S ERIES (as Editor-in-Chief) and the IEEE
vol. 51, no. 1, pp. 202–213, Jan. 2004. T RANSACTIONS ON C OMMUNICATIONS. He has been involved in organizing
[19] S. Zhou and G. B. Giannakis, “Optimal transmitter eigen-beamforming a number of major international conferences and events. These include serving
and space-time block coding based on channel mean feedback,” IEEE as the Technical Program Chair of the 1998 IEEE Globecom Mini-Conference
Trans. Signal Processing, vol. 50, no. 10, pp. 2599–2613, Oct. 2002. on Communications Theory, held in Sydney, Australia as well as the Co-
[20] G. Jongren, M. Skoglund, and B. Ottersten, “Combining beamforming Chair of the 2001 IEEE ICC Communications Theory Symposium, held in
and orthogonal space-time block coding,” IEEE. Trans. Inform. Theory, Helsinki, Finland. In 2004, he served as the Co-Chair of the IEEE Wireless
vol. 48, no. 3, pp. 611–627, Mar. 2002. Communications, Networks and Systems Symposium, held in Dallas, USA as
[21] E. Visotsky and U. Madhow, “Space-time transmit precoding with well as the Co-Technical Program Chair of the 2004 IEEE International Con-
imperfect feedback,” IEEE. Trans. Inform. Theory, vol. 47, no. 6, pp. ference on Communications, Circuits and Systems, held in Chengdu, China.
2632–2639, Sept. 2001. He is also the General Co-Chair of the 2007 IEEE Wireless Communications
[22] A. F. Naguib and N. Seshadri, “Combined interference cancellation and and Networking Conference, WCNC’07, held in Hong Kong as well as the
maximum likelihood decoding of space-time block codes,” US Patent Technical Program Co-Chair of the 2008 IEEE International Conference on
6,178,196, Jan. 2001. Communication, ICC’08 held in Beijing. He served as the Chair of the IEEE
[23] A. F. Naguib, N. Seshadri, and A. R. Calderbank, “Increasing data rate Communications Society Technical Committee on Personal Communications
over wireless channels: space-time coding and signal processing for high as well as a member of the IEEE ComSoc Technical Activity Council.
data rate wireless communications,” IEEE Signal Processing Mag., vol. In addition to his active research activities, Professor Letaief has been a
17, no. 3, pp. 76–92, May 2000. dedicated teacher committed to excellence in teaching and scholarship. He
[24] J. G. Andrews, “Interference cancellation for cellular systems: a contem- received the Mangoon Teaching Award from Purdue University in 1990;
porary overview,” IEEE Wireless Commun., vol. 12, no. 2, pp. 19–29, the Teaching Excellence Appreciation Award by the School of Engineering
Apr. 2005. at HKUST (4 times); and the Michael G. Gale Medal for Distinguished
[25] G. D. Forney Jr., R. G. Gallager, G. R. Lang, F. M. Longstaff, and S. Teaching (Highest university-wide teaching award and only one recipient/year
U. Qureshi, “Efficient modulation for band-limited channels,” IEEE J. is honored for his/her contributions).
Select. Areas Commun., vol. SAC-2, pp. 632–646, Sept. 1984. He is a Fellow of IEEE and an IEEE Distinguished lecturer of the IEEE
[26] E. K. P. Chong and S. H. Zak, An Introduction to Optimization. New Communications Society, and an elected member of the IEEE Communica-
York: Wiley, 2001 tions Society Board of Governors.
[27] D. L. Goeckel, “Adaptive coding for time-varying channels using
outdated fading estimates,” IEEE Trans. Commun., vol. 47, no. 6, pp. Ying Jun Zhang received her PhD degree in Elec-
844–855, June 1999. trical and Electronic Engineering from the Hong
[28] T. G. Robertazzi, Computer Networks and Systems. New York: Springer, Kong University of Science and Technology, Hong
1995. Kong. Since Jan. 2005, she has been with the De-
partment of Information Engineering in the Chinese
Wei Lan Huang (S’04-M’07) was born in Hu- University of Hong Kong, where she is currently an
nan, China, in August 1982. She received the B.E. assistant professor.
degree (with first class honors) in Communication Dr. Zhang is an Editor of IEEE T RANSACTIONS
Engineering from Beijing University of Posts and OF W IRELESS C OMMUNICATIONS , and an Asso-
Telecommunications, Beijing, China, in June 2003, ciate Editor of W ILEY S ECURITY AND C OMMU -
and the Ph.D. degree in the Department of Electronic NICATIONS N ETWORKS J OURNAL. She has served
and Computer Engineering, the Hong Kong Uni- as a Track Chair of ICCCN 2007 and Publicity Chair of IEEE MASS
versity of Science and Technology, Kowloon, Hong 2007. She has been serving as a Technical Program Committee Member for
Kong, in August 2007. She is now working with leading conferences including IEEE ICC, IEEE GLOBECOM, IEEE WCNC,
Nokia Research Center. Her research interests in- IEEE ICCCAS, IWCMC, IEEE CCNC, IEEE ITW, IEEE MASS, MSN, and
clude cross-layer design and optimization, adaptive ChinaCom.
resource allocation in MIMO/OFDM systems, cognitive radio, wireless ad Her research interests include wireless communications and mobile net-
hoc networks, and mobile internet service. works, adaptive resource allocation, cross layer design and optimization,
wireless LAN/MAN, broadband OFDM and multicarrier techniques, MIMO
signal processing. As the only winner from Engineering Science, Dr. Zhang
has won the Hong Kong Young Scientist Award 2006, conferred by the Hong
Kong Institution of Science.
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 10:14 from IEEE Xplore. Restrictions apply.