Professional Documents
Culture Documents
Aloha Ofdma
Aloha Ofdma
DOI 10.1007/s11277-012-0992-9
Abstract We propose the finite-state Markov channel (FSMC) model to the throughput
analysis of DS CDMA/unslotted ALOHA wireless networks in the mobile environment. The
FSMC model can characterize the correlation structure of Rayleigh fading process, and the
degree of correlation depends on the Doppler frequency shift. The FSMC model is suited
to the throughput analysis by queueing theory due to its Markov chain nature. The previous
papers in DS CDMA/unslotted ALOHA wireless networks in Rayleigh fading consider a
whole packet. They ignore that the channel gain or multiple access interference can change
symbol-to-symbol. In our proposed analysis, both the channel gain and multiple access
interference can change from symbol to symbol. It is not just a packet-level analysis in the
previous papers, and is a more general symbol-level analysis. Our generalized scheme should
be more suited to realistic Rayleigh fading in the mobile environment. We consider two cases:
(1) the system without carrier load sensing protocol (CLSP) and (2) systems with CLSP. For
both cases, we analyze the theoretical throughput by queueing theory for various averaged
signal-to-noise ratios and Doppler frequency shifts, and the computer simulated throughput
matches the theoretical throughput.
123
S.-M. Tseng et al.
1 Introduction
123
Throughput Analysis of DS CDMA
to extend the two-state model to a finite-state one, which is called finite-state Markov channel
(FSMC) model [19,20]. FSMC model comes from the fact that the users’ received SNR may
be highly time-varying in mobile channels. FSMC provides a mathematically tractable model
for time-varying channels.
Since a typical time-varying channel, namely the Rayleigh fading channel, produces time-
varying received SNR, by partitioning the range of the received SNR into a finite number of
intervals, a FSMC model can be built for the Rayleigh fading channel. A finite state Markov
chain channel is defined by its transition probabilities. We denote discrete-time Markov chain
channel with the state space {1, . . . , M} and transition probability matrix H = [h i, j ]. The
h i, j is defined as the probability that the Rayleigh fading channel changes from the state i to
the state j.
Let A denote the received SNR that is proportional to the square of the signal envelope.
The probability density function (PDF) of A is exponential and can be written as
1 − ξx
f A (x) = e (1)
ξ
where ξ is the expected value of A. Let 0 = A0 < A1 < · · · < A M−1 < A M = ∞
be the thresholds of the received SNR. Then the Rayleigh fading is said to be in the state
j, j = 1, 2, . . . , M, if the received SNR is in the interval [A j−1 , A j ). Let level crossing rate
N j , j ∈ {1, . . . , M}, be the expected number of times per second the received SNR passes
downward across the threshold A j . We have
Aj
2π A j
Nj = f m e− ξ , j = 1, . . . , M (2)
ξ
R ( j) = Rϕ j (5)
A j A j−1 Aj
1 − ξx
ϕj = e d x = e− ξ − e− ξ , j = 1, 2, . . . , M. (6)
ξ
A j−1
Because of (4), the level crossing rate should be much smaller than the value of R ( j) at SNR
threshold Ak . Thus we can get the approximated value of the transition probability as follows
[19].
123
S.-M. Tseng et al.
N j+1
h j, j+1 ≈ , j ∈ {1, 2, . . . , M − 1}
R ( j)
Nj
h j, j−1 ≈ ( j) , j ∈ {2, . . . , M}
R
h j, j = 1 − h j, j−1 − h j, j+1 , j ∈ {2, . . . , M − 1}
h 1,1 = 1 − h 1,2
h M,M = 1 − h M,M−1
3 System Model
where
23 1 k−1 1 k−1
σ2 = k N2 +N + − −
360 20 36 20 36
where N0 /2 is the two-sided power spectral density of Gaussian noise, and Q(x) is given by
∞
1 u2
Q(x) = √ exp − du (8)
2 2
x
The third term of (7) may not be real-valued, if k is too small. If this occurs, we can use
the standard Gaussian approximation [28] instead.
k N0 −0.5
Pb (k, j) = Q + (9)
3N 2A j
123
Throughput Analysis of DS CDMA
In (7) and (9), bit errors in a packet are caused by the effect of the multiple access
interference (MAI) and Rayleigh fading.
We recall the following theorem [29] before deriving the throughput of DS CDMA/unslotted
ALOHA system with fixed packet length in Rayleigh fading FSMC channels.
Theorem 1 For M/G/∞ queuing model with arrival rate λ, the probability distribution for
the number of packets in the system is given by
k
λ
− μλ μ
Pk = e k≥0 (10)
k!
where 1/μ is the average packet length.
From the above theorem (proof is given in Theorem 4.1 in [29]), in the steady-state, the
probability distribution of the number of interfering packets (=the number of packets −1) in
the DS CDMA/unslotted ALOHA system is only related to the average packet length and not
related to the probability distribution of the packet length (because only the average packet
length is shown in (10)). In DS CDMA/unslotted ALOHA system, the bit error probability
only depends on the number of interfering packets at that time instant, so the M/D/∞ queuing
model (fixed packet length) is equal to the M/M/∞ queuing model (exponential packet
length). Therefore, we reclaim the DS CDMA/unslotted ALOHA system that can be modeled
as the M/M/∞ queuing model [15].
The number of interference packet k is defined as the state of the M/M/∞ queuing model.
Each packet has an independent, identically distribution exponential service duration with
death rate as follows:
1
μ= (11)
Tp
And, the arrival rate is given by
G
λ= (12)
Tp
Thus the M/M/∞ queuing model has the following rates:
λk = λ
μk = kμ
Then, the steady state probabilities Pk, j is given by
k
A j−1 Aj
λ
− μλ μ
P k, j = e− ξ − e− ξ e , k≥0 (13)
k!
Like [10], we assume that the interference level is constant during a bit duration t.
The number of interfering packets will increase, decrease or remain the same during the bit
duration t. Therefore, suppose that at the ith bit in a packet, there are k interfering packets,
there are possible k − 1, k, k + 1 interference packets at the (i − 1)th bit. Different from the
previous with throughput analysis in AWGN channels, the DS CDMA/unslotted ALOHA
123
S.-M. Tseng et al.
Fig. 1 The state transition diagram of DS CDMA/unslotted ALOHA system with Rayleigh fading channel
j+1
Ps (k, j, i) = Ps (k, j , i − 1) · (1 − λt − kμt) · (1 − Pb (k, j )) · h j , j
j = j−1
+Ps (k − 1, j , i − 1) · (λt) · (1 − Pb (k − 1, j )) · h j , j
+Ps (k + 1, j , i − 1) · ((k + 1)μt) · (1 − Pb (k + 1, j )) · h j , j (14)
The initial condition is given by
Ps (k, j, 1) = P k, j , k ≥ 0, i = 2, . . . , L . (15)
Therefore, the packet success probability Q is given as following:
∞
M
Q= Ps (k, j, L)(1 − Pb (k, j)) (16)
k=0 j=1
123
Throughput Analysis of DS CDMA
In carrier load sensing protocol (CLSP), when the channel load is higher than a threshold α,
the hub station will reject packet transmission. Figure 2 depicts the transmission procedure
when a user attempts to transmit a packet, where U is the number access attempts and Umax is
the maximum number of access attempts. Increasing of U, if U is less than or equal to Umax ,
the user proceeds to monitor the channel load. Otherwise, the user discards the packet. If
channel load is less than a certain CLSP threshold α, the packet will be transmitted. Otherwise,
the packet is either rejected or backoff. Therefore, the number of transmitting packet on the
server is always less than or equal to α. The state transition diagram of the system with CLSP
is shown in Fig. 3.
We define G sys as an average offered load on the server. G sys equals the rate at which
packets are transmitted and is given by
α
k=0 k · Ps (k, j, 1)
G sys = α (18)
k=0 Ps (k, j, 1)
Ps (k, j, 1)
Psc (k, j, 1) = α−1 (19)
k=0 Ps (k, j, 1)
where j is the channel state. Define Psc (k, j, i) as the probability of the following: the number
interfering packets becomes k on the ith bit, the fading channel is in the state j on the ith
bit and the packet transmitted successfully from the first bit to the (i − 1)th bit. According,
the state transits during the bit duration t and the Psc (k, j, i) is calculated recursively as
follows:
123
S.-M. Tseng et al.
j+1
Psc (k, j, i) = Psc (k, j , i − 1) · (1 − λt − kμt) · (1 − Pb (k, j )) · h j , j
j = j−1
+Psc (k − 1, j , i − 1) · (λt) · (1 − Pb (k − 1, j )) · h j , j
+Psc (k + 1, j , i − 1) · ((k + 1)μt) · (1 − Pb (k + 1, j )) · h j , j (20)
Thus, we can obtain the new packet success probability Q c and the throughput Sc
∞
M
Qc = Psc (k, j, L)(1 − Pb (k, j)) (21)
k=0 j=1
Sc = G sys × Q c (22)
6 Numerical Results
123
Throughput Analysis of DS CDMA
5
line: analysis fm=10Hz
4.5 symbol: simulation fm=50Hz
Througput S (packet/packet duration)
4 fm=100Hz
no fading
3.5
fm=10Hz
3 fm=50Hz
2.5 fm=100Hz
no fading
2
1.5
0.5
0
0 2 4 6 8 10 12 14 16 18 20
Offered Load G (packet/packet duration)
Observing Figs. 4 and 5, we can see that the throughput for the DS CDMA/unslotted
ALOHA system in Rayleigh fading mobile channels decreases when the SNR decreases
and/or the Doppler frequency increases. The difference of the maximum throughput between
AWGN only and Rayleigh fading is more than 2 packets in a packet duration. We also see that
the simulation results are matched to the theoretic throughput derived by queueing analysis.
Throughput performance of DS CDMA/unslotted ALOHA in Rayleigh fading FSMC
channel with CLSP is presented in Figs. 6 and 7 for various CLSP threshold α. The SNR is
30 dB and the Doppler frequency shift f m is 10 Hz.
Figure 6 shows the numerical results of CLSP for the case α ≤ 8.In the case of α ≤ 5,
some packets may be rejected by CLSP even though the channel is able to support additional
transmissions. At the high offered load, CLSP can decrease the MAI, so we can get the higher
throughput than that of the system without CLSP.
Figure 7 presents the result of the throughput at α ≥ 7. As α becomes too large, the effect
of MAI becomes stronger, the throughput decreases. From Figs. 6 and 7, we can get the
optimum throughput is achieved with α = 7.
123
S.-M. Tseng et al.
5
fm=10Hz
line: analysis
4.5 symbol: simulation fm=50Hz
3 fm=50Hz
fm=100Hz
2.5
no fading
2
1.5
0.5
0
0 2 4 6 8 10 12 14 16 18 20
Offered Load G (packet/packet duration)
3
line: analysis
symbol: simulation
Througput Sc (packet/packet duration)
2.5
2
CLSP=4
CLSP=5
CLSP=6
1.5
CLSP=7
CLSP=8
without CLSP
1
CLSP=4
CLSP=5
CLSP=6
0.5
CLSP=7
CLSP=8
without CLSP
0
1 3 5 7 9 11 13 15 17 19 21
Offered Load Gsys (packet/packet duration)
To show the advantage of the proposed symbol-level analysis over the conventional packet-
level analysis, we also compare these two in Figs. 8 and 9, for SNR = 20 and 30 dB cases,
respectively. We consider no fading and various Doppler frequency cases. In Figs. 8 and 9,
we show that the throughput of the proposed symbol-level analysis is more accurate than
the conventional packet-level analysis. This is because the proposed model considers the
channel gain and multiple access interference and make more general symbol-level analysis.
The conventional method of packet-level analysis is just a special case in which we average
MAI over a packet.
123
Throughput Analysis of DS CDMA
3
line: analysis
symbol: simulation
2
CLSP=7
CLSP=8
CLSP=9
1.5
CLSP=10
CLSP=11
without CLSP
1
CLSP=7
CLSP=8
CLSP=9
0.5
CLSP=10
CLSP=11
without CLSP
0
1 3 5 7 9 11 13 15 17 19 21
Offered Load Gsys (packet/packet duration)
5
mark only: packet -level fm=10Hz
4.5 analysis
fm=50Hz
line and mark: symbol
Througput S (packet/packet duration)
2.5 fm=100H
no fading
2
fm=10Hz
1.5 fm=50Hz
fm=100Hz
1
no fading
0.5
0
0 2 4 6 8 10 12 14 16 18 20
Offered Load G (packet/packet duration)
7 Conclusions
We consider the channel gain and multiple access interference and make a more general
symbol-level analysis, not just a conventional packet-level analysis. In other words, both the
channel gains and interference levels can fluctuate during the packet transmission. The numer-
ical results shows that, the proposed symbol-level throughput analysis is matched the sim-
ulated throughput, and the conventional packet-level throughput analysis is less accurate
because the MAI effect is averaged out over a packet duration and thus the MAI fluctuation
is ignored.
123
S.-M. Tseng et al.
5
mark only: packet - fm=10Hz
4.5 level analysis
fm=50Hz
line and mark: symbol
2.5 fm=100Hz
no fading
2
fm=10Hz
1.5 fm=50Hz
fm=100Hz
1
no fading
0.5
0
0 2 4 6 8 10 12 14 16 18 20
Offered Load G (packet/packet duration)
Acknowledgments This paper was supported in part by National Science Council, Taiwan under Grant
95-2221-E-027-019.
References
123
Throughput Analysis of DS CDMA
13. Lovelace, W. M., Townsend, J. K., & Ulman, R. J. (2006). Packet-level interference estimation and
adaptive rate control in ultra-wideband (UWB) radio. In: Proceedings of the IEEE MILCOM (pp. 1–6).
14. Liao, X., Nie, J., & Zhang, L. (2008). Throughput bounds of unslotted CDMA packet networks. In:
Proceedings of the 9th international conference for young computer scientists (ICYCS) (pp. 628–632)
(pp. 18–21).
15. Tseng, S. M., Kuo, Y. C., Chang, Y. C., & Tseng, D. F. (2009). Simpler and more accurate throughput
analysis of a DS CDMA/unslotted ALOHA system with two user classes based on M/M/infinity queuing
model. International Journal of Communication Systems, 22(8), 989–1000.
16. Tseng, S. M., Hsu, C. W., & Wang, Y. C. (2010). Simpler throughput analysis of CDMA/unslotted
ALOHA radio networks with variable message length based on M/M/inf queuing model. Wireless Personal
Communications, 53(2), 153–162.
17. Cai, X., Sun, Y., & Akansu, A. N. (2003). Performance of CDMA random access systems with packet
combining in fading channels. IEEE Transcations on Wireless Communications, 2(3), 413–419.
18. Hamdi, K. A. (2007). Accurate DS-CDMA packet-error rate analysis in Rayleigh fading. IEEE Transca-
tions on Communications, 55(3), 551–562.
19. Wang, H. S., & Moayeri, N. (1995). Finite-state Markov channel—a useful model for radio communication
channels. IEEE Transcations on Vehicular Technology, 44(1), 163–171.
20. Zhang, Q., & Kassam, S. A. (1999). Finite-state Markov model for Rayleigh fading channels. IEEE
Transcations on Communications, 47(11), 1688–1692.
21. Gilbert, E. N. (1960). Capacity of a burst-noise channel. Bell System Technical Journal, 39, 1253–1265.
22. Elliott, E. O. (1963). Estimates of error rates for codes on burst-noise channels. Bell System Technical
Journal, 42, 1977–1997.
23. Wei, Y., Yu, F. R., & Song, M. (2010). Distributed optimal relay selection in wireless cooperative networks
with finite-state Markov channels. IEEE Transcations Vehicular Technology, 59(5), 2149–2158.
24. Sallabi, F., & Shuaib, K. (2011). Modeling of downlink wireless fading channel for 3GPP LTE cellular
system. In: Proceedings of GCC conference and exhibition (GCC), 2011 IEEE (pp. 421–424) (pp. 19–22).
25. Nguyen D. T., Vu, X. T., & Tuan, N. Q. (2009) An FSMC model for the ACM scheme with repetition
coding in mobile WiMAX. In Proceedings of international conference on advanced technologies for
communications (pp. 233–236) (pp. 12–14).
26. Huang, H., & Lau, V. K. N. (2009) Delay-optimal distributed power and transmission threshold control
for S-ALOHA network with FSMC fading channels. In: Proceedings of ISIT 2009 (pp. 571–575). Korea:
Seoul.
27. Holtzman, J. M. (1991). A simple, accurate method to calculate spread spectrum multiple access error
probabilities. IEEE Transcations on Communications, 40, 461–464.
28. Pursley, M. (1977). Performance evaluation for phase-coded spread-spectrum multiple-access
communication-part I: System analysis. IEEE Transcations on Communications, 25(8), 795–799.
29. Cinlar, E. (1995). An introduction to spatial queues. In J. H. Dshalalow (Ed.), Advances in queueing.
Boca Raton: CRC Press.
Author Biographies
Shu-Ming Tseng received the B.S. degree from National Tsing Hua
University, Taiwan, and the M.S. and Ph.D. degrees from Purdue Uni-
versity, IN, USA, all in electrical engineering, in 1994, 1995, and
1999, respectively. He was with the Department of Electrical Engi-
neering, Chang Gung University, Taiwan, from 1999 to 2001. Since
2001, he has been with the Department of Electronic Engineering,
National Taipei University of Technology, Taiwan, where he is cur-
rently a Professor. His research interests are MIMO, OFDM, queue-
ing analysis, software defined radio, and cooperative communications.
He serves as an Editor for KSII Transactions on Internet and Informa-
tion Systems, indexed in SCIE, since 2013. Prof. Tseng served as a
Technical Program Committee member for symposia of the IEEE VTC
Fall 2003, WirelessCom 2005, IWCMC 2006, M-CCN 2007, WiCON
2010, ISITA2010/ISSSTA2010, APWCS 2011, etc. He is listed in
Marquis Who’s Who in World since 2006.
123
S.-M. Tseng et al.
Chih-Hao Chen got the M.S. degree from the Department of Elec-
tronic Engineering, National Taipei University of Technology, Taiwan,
in 2011. He is now with Taiwan Cellular Corp.
123