Escolar Documentos
Profissional Documentos
Cultura Documentos
1-4244-0330-8/06/$20.002006
c IEEE
The 17th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC’06)
physical layer as described in [4] that is designed to deliver Both multiple access schemes are considered ideal, i. e.,
high throughput by providing high spectral efficiency. there are no guard intervals or guard sub-carriers necessary,
Currently, in OFDM-based WLANs packets are time- and we assume symbol and frequency synchronous reception
multiplexed though typically via random access methods. For of all users. U users share an available bandwidth B and a
the system laid out in [4] a user with favorable channel condi- transmission (frame) duration T . In TDMA the entire band-
tions may be able to transmit several hundred bytes in a single width is used exclusively by user u ∈ U = {1, . . . , U } for a
OFDM symbol. But as stated before, lots of packets are con- duration µu T , 0 ≤ µu ≤ 1, u µu = 1. In SUP each user is
siderably smaller than that. With stringent latency constraints allocated all of the bandwidth during all of the time where we
a user cannot wait for additional packets in order to aggregate do not require explicitly the usual spreading operation. As we
them. This is especially a concern in an uplink scenario. Then, consider discrete time and frequency, T corresponds to N tem-
the user is not able to exploit the rate offered by the physical poral samples and B to M sub-carriers. The system performs
layer. This motivates the introduction of a maximum requested power control such that the total energy received during time T
rate for a class. We define it to be the rate (more exactly: spec- is constrained. This makes the schemes use the same amount
tral efficiency) that is necessary to transmit a single packet in of resources (duration, bandwidth, energy).
exactly one OFDM symbol, i. e., The transmitters send sequences of symbols from a zero-
mean complex Gaussian alphabet corresponding to code
SL SH
r̂L = , r̂H = , (2) words. All sequences of a transmitter are equally likely. In line
M M with [4] a sequence is mapped to all of the user’s sub-carriers
where M denotes the number of sub-carriers and r̂L , r̂H rather than to a single sub-carrier. The transmitters do not know
are measured in bits per sub-carrier channel use (abbreviated the instantaneous channel state. Hence they fix their rate and
“bits/dim”). power for the entire transmission.
Summarizing, our objective is to determine what multiple We assume that all users are subject to stringent delay re-
access scheme, TDMA or SUP, has higher throughput in our quirements and thus encounter slow fading; a scenario typi-
system scenario. We define as the throughput the maximum cal of indoor applications like WLANs. Hence, we model the
sum rate, RS , given that the total system energy is constrained channel as being constant during the transmission of one code
and rate restrictions apply. Thus, for each scheme we need to word (block fading). The channel may be frequency selective
solve the optimization problem but we assume frequency-flat fading on each sub-carrier.
The receiver performs optimum maximum likelihood se-
U
quence detection on the received signal
RS = max Ru (Θ), (3)
Θ U
u=1
y(n, m) = hu (m)xu (n, m) + v(n, m), (4)
where Ru denotes the rate of user u averaged over T and B u=1
and the optimization is over the vector parameter Θ. Varying
where xu (n, m) is the symbol sent by user u at time n and
Θ is subject to the following constraints:
sub-carrier m, hu (m) is the corresponding channel coefficient
(i) Constant system energy. Equivalently, the signal-to-noise with E[|hu (m)|2 ] = 1 and v(n, m) denotes the complex white
ratios (SNRs) of the users averaged over T and B sum up Gaussian receiver noise. In TDMA for every (n, m) only one
to a constant γS . We call γS the system SNR. of the xu (n, m) is nonzero, and single-user detection suffices.
In SUP joint maximum likelihood decoding (JD) of the {xu }
(ii) Constant typical rate ratio. We aim to guarantee a fixed is optimal but often too complex. Thus we look at successive
ratio of rates for the L and H traffic classes at all times. We decoding with interference cancellation (SIC). The user signals
map these classes to at least one “logical” user per class. are decoded one-by-one with subsequent decoding steps oper-
For the sum rates of L users, RL , and H users, RH , we ating on the received signal with the interference by all preced-
require RL (Θ) = ρRH (Θ). ing users canceled out.
(iii) Maximum requested rates. Corresponding to their typical
IV. TDMA R EFERENCE C ASE
packet sizes the L and H users can efficiently exploit an
offered rate only if it is at most equal to the maximum re- In this section we adapt (i)-(iii) to obtain the sum rate perfor-
quested rate, r̂L and r̂H , respectively. Allocating a larger mance of TDMA. We will use this as reference for our discus-
rate to a user would not increase the effective throughput sion of SUP in Section V..
as it just wastes resources (time, bandwidth or energy). In our case it suffices to consider multiplexing U = 2 users
only. This is because
In Sections IV., V. we recast the problem with respect to
TDMA and SUP. • we have two traffic classes that determine the requested
rates (as rate ratio ρ and maximum values r̂L , r̂H ) and
III. S YSTEM M ODEL
• the users know the average channel statistics only and are
We now introduce the setup of our multiple access system and power controlled such that multi-user diversity cannot be
the channel model. exploited as in [6].
The 17th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC’06)
Thus, the active users of the same traffic class are indistinguish- 6
TDMA
Here, f (γ, p) is the maximum rate a single user can achieve For too large γS constraint (9) becomes active. As r̂L < r̂H
with SNR γ during its active time µT . Furthermore, p is the the L user will be restricted first. In this case the power granted
outage probability, i. e., with probability p the user faces a to the L user can be reduced such that its instantaneous rate
channel that does not support the fixed rate f (γ, p) of the user. equals r̂L , and thus γL < γS is fixed with f (γL , p) = r̂L .
More formally, we may write As long as the H user is not restricted itself it may use more
f (γ, p) = arg max {Pr (C(γκ) < r) < p} , (7) power such that γH = (γS − µL γL )/(1 − µL ) > γS . Now the
r maximization of RS depends on µL only and reduces to
where the instantaneous capacity of a single link conditioned 1
RS = max 1+ µL r̂L (10)
on a particular channel state is [3] µL ρ
M γS − µL γL
1 s.t. µL r̂L = ρ (1 − µL ) f ,p .
C(γκ) = log (1 + κ(m)γ) . (8) 1 − µL
M m=1 2
Note that RS according to (10) is based on unequal user SNRs
In (7), (8) κ denotes the M -dimensional channel power vector which is suboptimal for maximizing RS given system SNR γS .
given by κ(m) = |h(m)|2 . Therefore RS < f (γS , p) in this case. According to (10) µL
Finally, we consider condition (iii). An active user gets to should be chosen as large as possible. The rate requirements
transmit at least one OFDM symbol. Without packet aggrega- are met by having the L user transmit most of the time and at
tion the rate r̂ that is necessary to transmit a single packet in low SNR while giving the H user most of the system energy to
just one OFDM symbol is the maximum rate the user can ex- transmit only now and then.
ploit. We call r̂ the maximum requested rate. If the user was Eventually, at some γS∗ the H user will become re-
granted a higher rate it still could not transmit more data (in stricted as well, i. e., with µ∗L solving (10) we have
fact, there may be no more data available). Thus, (iii) can be f ((γS∗ − µ∗L γL )/(1 − µ∗L ), p) = r̂H . At γS∗ the sum rate has
−1 −1
rewritten as achieved its maximum, RS∗ = (1 + ρ)/(r̂H + ρr̂L ). Larger
SNRs will not increase the effective throughput as no additional
f (γL , p) ≤ r̂L , (9) packets can be mapped to the physical layer resources.
f (γH , p) ≤ r̂H .
Example: TDMA throughput for Gbit WLAN system.
Note that by assuming the medium access layer not to do packet For the system in [4] Fig. 1 shows the maximum sum rate of
aggregation we consider the worst case. However, this is rel- TDMA for varying system SNR γS at fixed rate ratio ρ = 0.2.
evant in applications like network-gaming that have stringent With M = 596 sub-carriers as in [4] and packet sizes of
delay constraints such that packet aggregation might be im- 50 and 1500 bytes we have r̂L = 0.67 bits/dim and r̂H =
possible after all. Furthermore, by invoking this assumption 20.13 bits/dim, respectively. The channel is modeled as block
we can clearly separate the physical layer-related effects from fading and frequency selective with an IEEE 802.11n channel
mechanisms of the higher layers. D power delay profile and 100 MHz bandwidth. The outage
Now, given system SNR γS , rate ratio ρ and maximum re- probability is p = 0.01.
quested rates r̂L and r̂H , we can obtain RS based on (3) con- In Fig. 1 the dotted line, denoted r̂L → ∞, shows the uncon-
strained by (5), (ii) and (9). Consider first that (9) is inactive. strained single user reference curve. TDMA follows this curve
Then the maximum sum rate is that of a single user with SNR as long as the maximum rate constraint (9) is inactive, i. e., as
γS , RS = f (γS , p), which is achieved by setting equal the user long as RS (γS ) < r̂L . For larger SNR values the rate loss due
SNRs, γL = γH = γS . This holds regardless of ρ and is a to mismatching small packets to OFDM symbols becomes dra-
consequence of f (γ, p) being concave in γ. matically apparent. The maximum rate achieved if (9) is active
The 17th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC’06)
RL / bits/dim
3 3
SUP
TDMA
2 2
TDMA RL /RH
SUP
1 U =2 1 r̂L = 0.67
U =3
U =4
0 0
0 0.2 0.4 0.6 0.8 1 0 1 2 3 4 5
Rate ratio ρ = RL /RH RH / bits/dim
Figure 2: Throughput for varying rate ratio RL /RH and one to Figure 3: Two user rate regions for SUP and TDMA uncon-
three L users. γS = 20 dB and r̂L = 0.67. strained by (iii). γS = 20 dB.
Note from Fig. 3 that RS is largest if either RL or RH are While with U = 2 it is impossible to improve RS by increas-
zero. This implies that to maximize RS as few users as possi- ing γS , in contrast to TDMA adding more users can be benefi-
ble should transmit with their largest possible rate. Due to con- cial. We add more L users as that user class limits performance.
straint (ii) there must be at least two. Due to (iii) it may make Then, as evident from Fig. 1 the throughput increases further
sense to allow more users to transmit. We will see that for our with increasing γS > γS∗ . Moreover, Fig. 2 demonstrates that
practical system design of interest the L user class reaches its adding more users helps maintaining a large throughput even
maximum rates (iii) sooner than the H user class and will limit with high rate ratio ρ. However, note that the throughput with
the system performance. If that happens we may add more L U > 2 users never exceeds that with U − 1, confirming that as
users. Thus, we discuss the case of U users among which ex- few users as possible should transmit.
actly one is an H user and U − 1 users are L users. If U > 2
then at least U − 2 L users transmit with their maximum rate of VI. C ONCLUSION
r̂L and one L user may transmit at a rate smaller than r̂L . This
We have investigated the achievable sum rate of TDMA and
L user will be decoded first and before the remaining L users
SUP under system energy and rate constraints. The constraints
whose exact decoding order is irrelevant.
on rate ratio and maximum requested rates have been obtained
Now we can rewrite the sum rate maximization problem as
from an abstraction of measured packet size distributions. We
U put a particular emphasis on WLAN systems as in [4]. For
RS (ρ) = max max Ru (Θ), (14) these we found that the need of every such system to transmit
Θ R∈Cπ (γ)
u=1 a large number of small packets severely limits the throughput
of conventional time-multiplexing based multiple access if the
the rate ratio constraint (ii) as
number of bits that must be transmitted in one OFDM symbol
U
gets large. On the other hand, with otherwise unchanged pa-
Ru (Θ) = ρR1 (Θ) (15) rameters, SUP reduces the number of bits that one user must
u=2 transmit in one OFDM symbol and the throughput is much in-
creased over TDMA.
and the maximum rate constraint (iii) as
ACKNOWLEDGMENT
r̂H u = 1
Ru (Θ) ≤ , (16)
r̂L u ∈ {2, . . . , U } This research was supported by the German Ministry of Ed-
ucation and Research within the project Wireless Gigabit with
where user 1 is considered the H user and the remaining users Advanced Multimedia Support (WIGWAM) under grant 01 BU
the L users. Note that here Ru is a constant rate rather than a 370.
quantity averaged over time as in TDMA. Thus, the maximum
rate user u needs to transmit a single packet in one OFDM sym- R EFERENCES
bol, r̂, must be compared to Ru directly and we have (16). The [1] Ezio Biglieri, John Proakis, and Shlomo Shamai (Shitz). Fading chan-
optimization parameter Θ = [γ, π] combines the vector of user nels: Information-theoretic and communications aspects. IEEE Trans.
SNRs γ = [γ1 , . . . , γU ] and the decoding order. Inform. Theory, 44(6):2619–2692, October 1998.
With (11), (15) and (16) we can obtain RS from (14) for [2] Holger Boche and Marcin Wiczanowski. Queueing theoretic optimal
scheduling for multiple input multiple output multiple access channel.
every choice of U , γS and ρ. For the system parameters as in In Proc. ISSPIT 2003, pages 576–579. IEEE, 2003.
Section IV. Figs. 1, 2 show RS versus γS and ρ, respectively, [3] Giuseppe Caire, Giorgio Taricco, and Ezio Biglieri. Optimum power
for up to U = 4 users. control over fading channels. IEEE Trans. Inform. Theory, 45(5):1468–
As expected the sum rate achieves larger values compared to 1489, July 1999.
TDMA even for U = 2. Apart from the rate loss due to multi- [4] Gerhard Fettweis and Ralf Irmer. WIGWAM: System concept develop-
ment for 1 Gbit/s air interface. In 14th Wireless World Research Forum
access interference SUP follows the single user reference over
(WWRF 14), San Diego, USA, July 2005.
a larger range of γS in Fig. 1, and over a larger range of ρ in
[5] Andrea Goldsmith. Wireless Communications. Cambridge Univ. Press,
Fig. 2. This is a consequence of the different maximum rate New York, 2005.
constraints (iii) in TDMA (9) and SUP (16). [6] R. Knopp and P.A. Humblet. Information capacity and power control in
Sticking with U = 2, at some γS∗ the maximum rate con- single-cell multiuser communications. In Proc. Intern. Conf. Commun.,
straint (16) becomes active. In our case of r̂L r̂H the L user ICC 1995, volume 1, pages 331–335. IEEE, June 1995.
is restricted only, i. e., RL = r̂L . However, due to (15) the rate [7] David Kotz and Kobby Essien. Analysis of a campus-wide wireless net-
work. In Proc. 8th ACM MOBICOM, pages 107–118. ACM Press, 2002.
of the H user is restricted also. We have RH = r̂L /ρ and thus
[8] Chen Na, Jeremy K. Chen, and Theodore S. Rappaport. Hotspot traf-
fic statistics and throughput models for several applications. In Proc.
1
RS = r̂L 1 + (17) GLOBECOM 2004, volume 5, pages 3257–3263. IEEE, November 2004.
ρ [9] Diane Tang and Mary Baker. Analysis of a local-area wireless network.
In Proc. 6th ACM MOBICOM, pages 1–10. ACM Press, 2000.
regardless of the system SNR and bandwidth allocation, i. e., [10] David N.C. Tse and Stephen V. Hanly. Multiaccess fading channels–
spending γS > γS∗ only wastes energy. This argument can be Part I: Polymatroid structure, optimal resource allocation and throughput
extended to U > 2 by replacing r̂L with (U − 1)r̂L in (17). The capacities. IEEE Trans. Inform. Theory, 44(7):2796–2815, November
relevant curves for our example are given in Figs. 1, 2. 1998.