# Throughput of coded DS CDMA/unslotted ALOHA networks with variable length data traffic and two user classes in Rayleigh fading FSMC model.

1. IntroductionDirect-sequence code-division multiple access (DS CDMA) is a wireless transmission technology which offers random access abilities and potential for higher throughput [1-7]. In [8-15], the DS CDMA/slotted ALOHA system is investigated in wireless and optical channels. In [16-20], the throughput of the DS CDMA/unslotted ALOHA system is analyzed in AWGN channels. The throughput analysis of the DS CDMA/unslotted ALOHA wireless network in Rayleigh fading channels has been conducted in [21-23]. They all assumed packet-level analysis, and ignore that the channel gain and/or multiple access interference level changes symbol-by-symbol within the packet. In [24], we proposed the finite-state Markov channel (FSMC) to analyze throughput performance of the uncoded DS CDMA unslotted ALOHA networks with fixed length data traffic. The channel gain as well as multiple access interference can vary from symbol by symbol.

In this paper, we propose the FSMC to analyze throughput performance of the coded DS CDMA unslotted ALOHA systems for variable message length with one or two user classes, and access control in mobile channels. This is an extension of our previous work in [24]. We add channel coding, variable length data traffic, and two user classes in this paper. We assign different priorities to two user classes by different packet transmission probabilities (access control), which improve the throughput of the higher priority user class in high offered load [18][19].

The significance of this extension is as follows:

* Proper channel coding in DS/CDMA unslotted ALOHA system can enhance the throughput because the error correction codes convert some unsuccessful packets transmission into the successful ones. This is confirmed in Figs. 4-6 in simulation results. In [24], however, channel coding is not used.

* The major data traffic types in today's mobile communications are electronic mail, multimedia file transfers, and web traffic which can all be modeled as variable message length traffic. In [24], however, one message equal to one fixed length packet (fixed length data traffic) is assumed. In this paper, we assume one message is equal to variable number of fixed length packets [17][20]. In other words, we assume variable message length and it is more suited to the major data traffic types in today's mobile communications.

* Many mobile users may require services with different qualities-of-service (QoS). We propose a DS/CDMA unslotted ALOHA system with two user classes and analyzed the throughput of the proposed system. The analysis complexity is significantly higher than that in [24]. The state transition diagram in Fig. 3 now become three-dimensional instead of two-dimensional in Fig. 2 of [24]. The packet success probability in (24) now has four-dimensional summation instead of two-dimensional one in (16) of [24]. In [24], however, there is only one user class, so different QoS is not possible.

The rest of this paper is organized as follows: In Section 2, the FSMC model is briefly introduced. In Section 3, the system model is presented. In Section 4, we analyze the throughput of the DS CDMA/unslotted ALOHA networks in Rayleigh fading FSMC channel for variable length data traffic and one/two user classes. The simulation and numerical results are given in Section 5. Section 6 is the conclusion.

2. FSMC Model (1-D Markov process)

In many cases, modeling a Rayleigh fading channel as a two-state Gilbert-Elliot channel [25][26] is not sufficient because the channel condition can vary dramatically. Extending the two-state model to a finite-state one is called FSMC model [27][28]. FSMC model depend on the condition that the users' received signal-to-noise ratio (SNR) may be highly time-varying in mobile channels.

Because a traditional time-varying Rayleigh fading channel, produce time-varying received SNR, by dividing the range of the received SNR into a finite number of interval, 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 state space {1,2, ...,M} and transition probability matrix h = [[h.sub.i,j]], 1 [less than or equal to] i, j [less than or equal to] M. The [h.sub.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

[f.sub.A](x) = [1/[xi]][e.sup.-x/[xi]] (1)

Where [xi] is the expected value of A. Let 0 = [A.sub.0] < [A.sub.1] < ... < [A.sub.M-1] < [A.sub.M] = [infinity] be the thresholds of the received SNR. Therefore, the Rayleigh fading is said to be in the state j, j = 1, 2, ...,M, if the received SNR is in the interval [[A.sub.j-1], [A.sub.j]). [N.sub.j], j [member of] {1, 2, ...,M} is the expected number of the received SNR level crossing downward the boundary [A.sub.j] at state j of FSMC, and can be written as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (2)

[f.sub.m] is the maximum Doppler frequency and given by

[f.sub.m] = v/[lambda] (3)

where v is the vehicle speed and [lambda] is the wavelength.

We assume the interference levels depend on consecutive symbols are neighboring states. Then, the element of the transition probability matrix H is given by [27]

[h.sub.i,j] = 0, [for all][absolute value of i - j]>1 (4)

We used a BPSK modulated communication system with a transmission rate of R bits per second. The average bit per second transmitted during which the radio channel is in state j is

[R.sup.(j)] = R[[phi].sub.j] (5)

where the steady state probability for each state is

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (6)

Finally, we can get the approximated value of the transition probability as follows [27]

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]

3. System Model

We consider a single-carrier DS CDMA system with random spreading codes of length N in an unslotted ALOHA network for two user classes with variable message length. Each class's message has [B.sub.n] (n = 1,2) fixed-length packets, where [B.sub.n] is geometrically distributed with expected value [bar.[B.sub.n]]. Where [bar.[B.sub.1]] and [bar.[B.sub.2]] are the average number of packets in a message for class 1 and class 2, respectively. The length of packet is fixed to be L bits, so the message length of class 1 and 2 are [B.sub.1]L [bits] and [B.sub.2]L [bits], respectively. We consider a single hub station and an infinite number of independent users in our system network. We use a Poisson process with an arrival rate [[lambda].sub.1] for class 1 and arrival rate [[lambda].sub.2] for class 2 to model the arrival process of the system for our system network.

The offered traffic load for the class n, of the network is defined as [G.sub.n] (packets/packet duration), n=1, 2. The corresponding throughput is defined as [S.sub.n] (packets/packet duration), n=1, 2. Finally, the system throughput is defined as [S.sub.tot]=[S.sub.1] + [S.sub.2], respectively. It's easy to obtain the packet duration [T.sub.p][sec] by L multiplied by 1/R, where R[bits/sec] is the data rate of system.

The bit-error probability of an asynchronous DS CDMA system [29] for k interfering users and FSMC channel state j by simplified improved Gaussian approximation is expressed as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (7)

where

[[sigma].sup.2] = k[[N.sup.2][23/360] + N(1/20 + [[k - 1]/36]) - 1/20 - [[k - 1]/36]]

where [N.sub.0]/2 is the two-sided power spectral density of Gaussian noise, [E.sub.b] is the bit energy and Q(x) is given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (8)

The third term of (7) may not be real-valued, if k is too small. If this occurs, we can use standard Gaussian approximation [30] instead,

[P.sub.b](k, j) = Q[[(k/3N + 1/2[A.sub.j]).sup.-0.5]] (9)

In (7) and (9), bit errors in a packet are caused by the effect of the multiple access interference (MAI) and Rayleigh fading. The hub station decides the packet transmission probability [P.sub.tr,n] of class n users based on the offered load of class n users, [G.sub.n], n=1, 2, and then broadcasts the packet transmission probability to mobile stations (MSs). The total offered load must be less than [G.sub.max], where [G.sub.max] is the maximum offered load the system can reach. The packet transmission probabilities for low, medium, and heavy load are as follows [18][19]

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (10)

4. Throughput Analysis For DS CDMA/UNLOTTED ALOHA System Combining FSMC Model

4.1 M/M/[infinity] Queueing Model

The DS CDMA/unslotted ALOHA system with variable message length and one/two user classes can be modeled as the M/M/[infinity] queuing model, as stated in our previous works in AWGN channels [19][20]. Here we briefly review the reasoning. We first recall a theorem from [31].

Theorem 1 [31] :For M/G/[infinity] queueing model with arrival rate [lambda], the probability distribution for the number of packet in the system is given by

[P.sub.k] = [e.sup.-[lambda]/[mu]] [[([lambda]/[mu]).sup.k]/k!] k [greater than or equal to] 0 (11)

where 1/[mu] is the average packet length.

The above theorem from [31] states that the number of users in M/G/[infinity] queuing system is function of the average packet length only, not the distribution of packet length. Thus M/M/[infinity] (exponential packet length) is equivalent to M/D/[infinity] (fixed packet length) for DS/CDMA unslotted ALOHA systems because the packet success probability depends on the number of users only (the equivalence may not be true for other communication systems). Thus, instead of the M/D/[infinity] queueing model with the death rate approximation in [17] (variable message length and one user class) [18] (variable message length and two user classes), we propose M/M/[infinity] queueing model for the DS CDMA unslotted ALOHA system [20] (variable message length and one user class) [19] (variable message length and two user classes). As shown in [17-20], when one message is equal to variable number of fixed length packets (variable message length), the analysis of variable message length in AWGN channels follows (or bases on) the analysis of fixed packet/message length (one message=one packet) in AWGN channels [16]. Therefore the DS CDMA/unslotted ALOHA system with variable message length and one/two user classes in FSMC fading channels can be modeled as the M/M/[infinity] queuing model like our previous works in AWGN channels [19-20].

4.2 Proposed Throughput Analysis for Variable Message Length and One User Class (2D Markov process)

In [24], they consider fixed message length and one user class in the FSMC model but they don't consider message is variable message length. Each message has independent and identically distributed exponential service duration with the departure rate as follows [20]

[mu] = 1/[T.sub.p] (12)

where [mu] depends on k because the departure rate in M/M/[infinity] queueing mode is proportional to the number of interfering users.

Because the one message is equal to variable number ([bar.B] on average) of fixed length packets, the message arrival rate [lambda] (messages/sec) is related to the average number of generated packets within a packet duration G (packets/packet duration) by the following simple conversion formula [17][20]

[lambda] = G/[T.sub.p] x [bar.B] (13)

The state transition diagram for M/M/[infinity] queuing model is shown in Fig. 1.

Thus the M/M/[infinity] queueing model with the following rate:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (14)

where [[lambda].sub.k] and [[mu].sub.k] is the arrival rate and departure rate in state k, which is the state of the M/M/[infinity] queueing model, respectively.

Then, the steady state probabilities [P.sub.k,j] is given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (15)

Like [16], we assume that the interference level is constant during a bit duration [DELTA]t. We also assume the interference levels associated with consecutive symbols are neighboring states. The number of interfering packets will increase, decrease or remain the same during the bit duration [DELTA]t. Therefore, suppose that at the i-th 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 system in Rayleigh fading we proposed, has an additional parameter--channel state j. The channel states of the FSMC will downward across, upward across or remain the same during the bit duration [DELTA]t. Therefore, suppose that the channel state is [A.sub.j] at the i-th bit in a packet,, the state is possible [A.sub.j-j], [A.sub.j], [A.sub.j+1] at the (i-1)-th bit according to the transition probability [h.sub.i,j]. The state transition diagram of the proposed system is two-dimensional and shown in Fig. 2. Note that the bit duration [DELTA]t is very small due to high data rate, so the probability having more than one interferer added from one symbol duration to the next is close to zero.

Define [P.sub.s](k, j, i) as the probability of the following: the number interfering packets becomes k on the i-th bit, the fading channel is in the state j on the i-th bit and the packet transmitted successfully from the first bit to the (i-1)-th bit. According, the state transits during the bit duration [DELTA]t and the [P.sub.s] (k, j, i) is calculated recursively as follows:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (16)

The initial condition is given by

[P.sub.s](k, j, 1) = [P.sub.k, j], k [greater than or equal to] 0, i = 2, ...,L. (17)

Therefore, the packet success probability Q is given as following:

Q = [[infinity].summation over (k=0)][M.summation over (j=1)] [P.sub.s] (k, j, L)(1 - [P.sub.b](k, j)) (18)

Then, the throughput S is given as follows:

S = G X Q (19)

4.3 Proposed Throughput Analysis for Variable Message Length and Two User Classes (3D Markov Process)

Now we further divide users into two user classes. [k.sub.1] is number of interference of the i-th bit in class 1, [k.sub.2] is number of interference of the i-th bit in class 2 and [P.sub.s,n] (e, [k.sub.n], j, i) is probability of class n. The departure rates of class 1 and 2 messages are derived as:

[[mu].sub.1] = [k.sub.1]/[T.sub.p] and [[mu].sub.2] = [k.sub.2]/[T.sub.p] (20)

Also, the arrival rate of class messages is obtained as:

[[lambda].sub.n] = [G.sub.n]/[T.sub.P] x [bar.[B.sub.n]], n = 1, 2 (21)

where [bar.[B.sub.n]] is average number of packets in a class n message.

Define [P.sub.S]'(e, [k.sub.1], [k.sub.2], j, i) as the probability of the following: the number of interfering packets become [k.sub.1] and [k.sub.2] on the i-th bit, the SNR of FSMC fading channel is in state j on the i-th bit and the first (i-1) bits has e bit errors in the transmitted packet. [P.sub.S](e, [k.sub.1], [k.sub.2], j, i) is calculated recursively as follows:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (22)

The first five terms in (22) are the probabilities that the first (i-2)th bits havee-1 bit errors and the (i-1)th bit is also in error. The other terms in (22)are the probabilities that the first (i -2) th bits have e bit errors and the (i-1)th bit is correct.

The initial condition is given by:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (23)

where

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]

Therefore, the packet success probability Q' is given as following:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (24)

where t is the maximum number of correctable bits per packet by using error correction codes.

Then, the throughput of two user classes S is given as follows:

[S.sub.n] = [[L - 2t]/L] x [G.sub.n] x Q' (25)

where (L-2t)/L is the code rate of the error correction code

[S.sub.total] = [S.sub.1] + [S.sub.2] (26)

where [S.sub.n] is throughput of class n, [S.sub.total] is throughput of whole system.

The normalized (per unit bandwidth) throughput of two user classes [S.sub.norm] is given as following:

[S.sub.norm] = S/N x L/[T.sub.p] [bitS / Hz / s] (27)

where N is the spreading codes length and also the bandwidth expansion factor, and L/Tp is to convert packets/packet duration to bits/s because one packet has L bits and the packet duration is Tp.

5. The Simulation And Numerical Result

We simulate DS CDMA/unslotted ALOHA system using binary phase-shift keying (BPSK) modulation, spreading code length (processing gain)N=30,the packet length L = 512 bits, the data rate R = 9.6 k bps. We set average length of messages is 5 for one user classes, same as [17]. Then, we set the average length of class 1 messages is 7 and class 2 messages is 5 for two user classes, same as [18][19]. The number of SNR states of FSMC channel model is 8. The maximum Doppler frequency shift Fd is 10, 50 and 100 Hz. Because FSMC state usually over two, we chose 8. According to [32], they analyze 3 to 10 states for different modulations so we chose the 8 for our system. In Figs. 4-12, we use error correction code, and the number of correctable bits is 6, 8 and 10.

Figs. 4-6 shows that the simulation and numerical result of the proposed model versus the various Doppler frequency shift Fd with the number of correctable bit [sup.t] =6, 8 and 10, respectively. They first show that the throughput decreases as the Doppler frequency shift increases if the number of correctable bit [sup.t] is fixed. We can observe another thing comparing Figs. 4-6: for Fd=10, the peak throughput is 4.5, 5.2, 6.0, for [sup.t] =6, 8, 10, respectively; for Fd=50, the peak throughput is 3.3, 4.0, 4.8, for [sup.t] =6, 8, 10, respectively; for Fd=100, the peak throughput is 2.7, 3.4, 4.2 for [sup.t] =6, 8, 10, respectively. Therefore, the throughput increases as the number of correctable bit [sup.t] increases if the Doppler frequency shift is fixed. This is because error correction codes convert some unsuccessful packet transmission in the successful ones. We also observe that the system throughput decreases as Doppler frequency shift Fd increases. This is because the probability of the received SNR state crosses down the poor SNR state increases as Doppler frequency shift Fd increases.

Figs. 7-9 are DS/CDMA unslotted ALOHA with variable message length for two user classes in Rayleigh fading FSMC model without access control. That is [P.sub.tr, n] =1. In Fig. 7, for Fd=10, when message arrival per packet duration over 1.0, system throughput will decrease from the peak throughput 5.9. We find similar phenomena in different Doppler frequency offsets in Figs. 8-9. In Fig. 8, for Fd=50, when message arrival per packet duration over 0.9, system throughput will decrease from the peak throughput 4.7. In Fig. 9, for Fd=100, when message arrival per packet duration over 0.8, system throughput will decrease from the peak throughput 4.2.

The access control in (10) can maintain total throughout at maximum when high message arrival, as shown in Figs. 10-12. For example, in Fig. 10, for Fd=10, when message arrival per packet duration is over 1.0, the total throughput remains at the peak 5.9 when message arrival per packet duration is over 1.0. For comparison, in Fig. 7, the total throughput drops from the peak 5.9 when message arrival per packet duration is over 1.0..

For each simulation point in Fig. 4-12, the number of packets simulated is 500,000. We can see the simulation and numerical results are very close, so the number of packets simulated is sufficient to ensure high degree of confidence level.

6. Conclusion

In previous papers, they mostly consider the non-fading channels. In the papers[21][22][23], the authors consider only that the channel coefficient of Rayleigh fading was the same in the whole packet, which is not realistic. In [24], we proposed the FSMC to analyze throughput performance of the uncoded DS CDMA unslotted ALOHA networks with fixed length data traffic and one user class. The channel gain as well as multiple access interference can vary from symbol by symbol. In this paper, we propose the FSMC to analyze throughput performance of the coded DS CDMA unslotted ALOHA systems for variable message length with one or two user classes, and access control in mobile channels. Compared to [24], we add channel coding, variable length data traffic, and two user classes in this paper. In this paper, we analyze the effect of channel coefficients and the effect of Doppler frequency shift symbol-by-symbols. We can observe that the system throughput decreases as the Fd increases. The proposed use of FSMC allows us to model the symbol-by symbol SNR variation in mobile channels. The numerical and simulation results both show that our proposed two user class network can reach maximum system throughput in high offered load.

http://dx.doi.org/10.3837/tiis.2014.12.005

This work was supported in part by the Ministry of Science and Technology, Taiwan, under Grant NSC 98-2221-E-027-038-MY2

Reference

[1] Shu-Ming Tseng, "A high-throughput multicarrier DS CDMA/ALOHA network," IEICE Transactions on Communications, vol. E86-B, no.4, pp. 1265-1273, April, 2003. Article (CrossRef Link)

[2] H. H. Chen and M. Guizani, "Multiple access technologies for B3G wireless communications," IEEE Communications Magazine, vol. 43, no. 4, pp. 65-67, June, 2005. Article (CrossRef_Link)

[3] Shu-Ming Tseng, "Sequential detection for multiuser MIMO CDMA systems with single spreading code per user," IEEE Transactions Wireless Communications, vol. 8, no. 7, pp. 3492-3497, July, 2009. Article (CrossRef Link)

[4] Kai Yu, Yi Sun, Pingzhi Fan, Xianfu Lei and Lei Shu, "Performance Analysis of Large CDMA Random Access Systems with Retransmission Diversity over Fading Channels," KSII Transactions on Internet and Information Systems, vol. 4, no. 4, pp. 509-528, August, 2010. Article (CrossRef Link)

[5] Zhu-wei Wang, Da-Cheng Yang and Laurence B. Milstein, "Multi-User Resource Allocation for a Distributed Multi-Carrier DS-CDMA Network," IEEE Transactions Wireless Communications, vol. 60, no. 1, pp. 143-152, January, 2012. Article (CrossRef Link)

[6] Zhi Zhang, Zhonghai Lu and Qiang Chen, "Design and Optimization of a CDMA-Based Multi-Reader Passive UHF RFID System for Dense Scenarios," IEICE Transactions on Communications, vol. E95B, no. 1, pp. 206-216, January, 2012. Article (CrossRef Link)

[7] Mohammad A. Shoaie, Simin Khazraei and Mohammad R. Pakravan, "Performance Analysis of Slotted ALOHA Random Access Packet-Switching Optical CDMA Networks Using Generalized Optical Orthogonal Codes and M-ary Overlapping PPM Signaling," Journal of Optical Communications and Networking, vol. 3, no. 7, pp. 568-576, July, 2011. Article (CrossRef Link)

[8] J. Shao and H. Zhao, "Stability of the ACK-ALOHA-CDMA mechanism for VSAT systems," Journal of Information & Computational Science, vol.8, no. 13, pp.2677-2684, December, 2011. Article (CrossRef Link)

[9] J. Shao, K. Yin and X. Liang, "Performance evaluation of the non-zero propagation delay ACK-ALOHA-CDMA channels," in Proc. of 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCom'09), pp. 1-3, September 24-26, 2009. Article (CrossRef Link)

[10] H. Saragih and F.Santoso, "Capture delay analysis on the throughputs of direct-sequence code division multiple access (DS-CDMA) with slotted-ALOHA (S-ALOHA) systems over Nakagami/Nakagami fading channels," International Journal of Wireless Information Networks, vol. 18, no. 3, pp. 186-192, September, 2011. Article (CrossRef Link)

[11] M. A. Shoaie, S. Khazraei and M. R. Pakravan, "Performance analysis of slotted ALOHA random access packet-switching optical CDMA networks using generalized optical orthogonal codes and M-ary overlapping PPM signaling," Journal of Optical Communications and Networking, vol. 3, no. 7, pp. 568-576, July, 2011. Article (CrossRef Link)

[12] H. Saragih, "Analysis throughput multi-code multicarrier CDMA S-ALOHA" Internetworking Indonesia Journal, vol. 2, no. 1, pp. 11-16, March, 2010. Article (CrossRef Link)

[13] H. Saragih and F. Santoso, "Throughput analysis of adaptive slotted-ALOHA CDMA over a multipath fading channel with capture effects," International Journal of Wireless Information Networks, vol. 16, no. 4, pp. 217-224, December, 2009. Article (CrossRef Link)

[14] J. Shao, K. Yin and X. Liang, "Performance evaluation of the non-zero propagation delay ACK-ALOHA-CDMA channels," in Proc. of 5th International Conference on Wireless Communications, Networking and Mobile Computing, pp. 1-3, September, 2009. Article (CrossRef Link)

[15] Y. Birk and U. Tal, "Maximizing delay-constrained throughput in multi-channel DS-CDMA ALOHA networks through power diversity and successive decoding," Wireless Networks, vol. 15, no. 8, pp. 1126-1139, November, 2009. Article (CrossRef Link)

[16] T. Sato, H. Okada, T. Yamazato, M. Katayama and A. Ogawa, "Throughput analysis of DS/SSMA unslotted ALOHA system with fixed packet length," IEEE Journal of Selected Areas Communications, vol. 14, no. 4, pp. 750-756, May, 1996. Article (CrossRef Link)

[17] Jae-Woo So, Il Han, Byung-Cheol Shin and Dong-Ho Cho, "Performance analysis of DS/SSMA unslotted ALOHA system with variable length data traffic," IEEE Journal of Selected Areas in Communications, vol. 19, no. 11, pp. 2215-2224, November, 2001.

[18] Jae-Woo So and D. H. Cho, "Performance analysis of a DS/SSMA unslotted ALOHA system with two user classes," IEEE Transactions on Vehicular Technology, vol. 51, no.6, pp. 1628-1639, November, 2002. Article (CrossRef Link)

[19] Shu-Ming Tseng, Yu-Chin Kuo, Yi-Cheng Chang and Der-Feng Tseng, "Simpler and more accurate throughput analysis of a DS CDMA/unslotted ALOHA system with two user classes based on M/M/infinity queueing model," International Journal of Communication Systems, vol. 22, no. 8, pp. 989-1000, August, 2009. Article (CrossRef Link)

[20] Shu-Ming Tseng, Chun-Wei Hsuand Yung-Chung Wang, "Simpler throughput analysis of CDMA/Unslotted ALOHA radio networks with variable message length based on M/M/inf queueing model," Wireless Personal Communications, vol. 53, no. 2, pp.153-162, April, 2010. Article (CrossRef Link)

[21] X. Cai, Y. Sun and A. N. Akansu, "Performance of CDMA Random Access Systems With Packet Combining in Fading Channels," IEEE Trans. Wireless Commun., vol. 2, no. 3, pp. 413-419, May, 2003. Article (CrossRef Link)

[22] V. V. Phan, S. G. Glisic and D. D. Luong, "Packet-Length Adaptive CLSP/DS-CDMA: Performance in Burst-Error Correlated Fading Channels," IEEE Trans. Wireless Commun., vol. 3, no. 1, pp. 147-158, January, 2004. Article (CrossRef Link)

[23] K. A. Hamdi, "Accurate DS-CDMA Packet-Error Rate Analysis in Rayleigh Fading," IEEE Trans. Commun., vol. 55, no. 3, pp. 551-562, March, 2007. Article (CrossRef Link)

[24] Shu-Ming Tseng, Hung-Pin Lin, Chih-Hao Chen and Yung-Chung Wang, "Throughput Analysis of DS CDMA/ Unslotted ALOHA Wireless Networks with Fixed Packet Length in Rayleigh Fading Finite-State Markov Channel Model," Wireless Personal Communications, vol. 71, no. 4, pp. 3091-3104, August, 2013. Article (CrossRef Link)

[25] E. N. Gilbert, "Capacity of a burst-noise channel," Bell Syst. Tech. J., vol. 39, pp. 1253-1265, March, 1960. Article (CrossRef Link)

[26] E. O. Elliott, "Estimates of error rates for codes on burst-noise channels," Bell Syst. Tech. J., vol. 42, pp. 1977-1997, April, 1963. Article (CrossRef Link)

[27] H. S. Wang and N. Moayeri, "Finite-state Markov channel--a useful model for radio communication channels," IEEE Transactions on Vehicular Technology, vol. 44, no. 1, pp. 163-171, February, 1995. Article (CrossRef Link)

[28] Q. Zhang and S.A. Kassam, "Finite-state Markov model for Rayleigh fading channels," IEEE Trans. Commun., vol. 47, no. 11, pp. 1688-1692, November, 1999. Article (CrossRef Link)

[29] J. M. Holtzman, "A simple, accurate method to calculate spread-spectrum multiple-access error probabilities," IEEE Transactions on Communications,, vol. 40, no. 3, pp. 461-464, March, 1992. Article (CrossRef Link)

[30] M. Pursley, "Performance evaluation for phase-coded spread-spectrum multiple-access communication-part I: System analysis," IEEE Transactions on Communications, vol. 25, no. 8, pp. 795-799, August, 1977. Article (CrossRef Link)

[31] E. Cinlar, "An introduction to spatial queues," Advances in Queueing, Edited by J. H. Dshalalow, CRC Press, 1995. Article (CrossRef Link)

[32] D.T. Nguyen, X.T. Vu and N.Q. Tuan, "An FSMC Model for the ACM Scheme with Repetition Coding in Mobile WiMAX," in Proc. of International Conference on Advanced Technologies for Communications.(ATC), pp. 233-236, October 12-14, 2009. Article (CrossRef Link)

Received January 17, 2014; revised April 10, 2014; revised September 9, 2014; accepted September 13, 2014; published December 31, 2014

Shu-Ming Tseng (1) *, Li-Hsin Chiang (1), and Yung-Chung Wang (1)

(1) Department of Electronic Engineering, National Taipei University of Technology Taipei 106, Taiwan

[e-mail: shuming@ntut.edu.tw, romeo@ntut.edu.tw, ycwang@ntut.edu.tw]

* Corresponding author: Shu-Ming Tseng

Shu-Ming Tseng received the B.S. degree from National Tsing Hua University, Taiwan, and the M.S. and Ph.D. degrees from Purdue University, IN, USA, all in electrical engineering, in 1994, 1995, and 1999, respectively. He was with the Department of Electrical Engineering, 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 has been a Professor since 2007. He has published 35 SCI journal papers in the areas of MIMO/ OFDM/CDMA, cooperative communications, queueing analysis, software defined radio, and cross layer design. He serves as an Editor for KSII Transactions on Internet and Information Systems, indexed in SCI, since 2013. He is listed in Marquis Who's Who in World since 2006.

Li-Hsin Chiang was born in Taiwan in 1965. He received the M.S. degree in computer science and information engineering from National Taipei University of Technology (TaipeiTech), Taipei in 2004. He is currently pursuing the Ph.D. degree with the Department of Electrical Engineering, TaipeiTech. His research interests include computer network, admission control, and Internet applications.

Yung-Chung Wang was born in Kinman, Taiwan in 1963. He received the M.S. and Ph.D. degrees in electrical engineering from National Tsing Hua University, Hsinchu, Taiwan in 1990 and 2000, respectively. From 1990 to 2001, he was a research engineer with the Chung-Hwa Tele- Communication Laboratory, where he was engaged in research on the development of ATM switching systems and IP switch router systems. Since 2001, he has been with the Department of Electrical Engineering, National Taipei University of Technology (TaipeiTech), Taipei, where he is a full professor. His research interests include wireless networks, optical networks, software defined networks, and queuing theory and performance evaluation of communication networks.

Printer friendly Cite/link Email Feedback | |

Author: | Tseng, Shu-Ming; Chiang, Li-Hsin; Wang, Yung-Chung |
---|---|

Publication: | KSII Transactions on Internet and Information Systems |

Article Type: | Report |

Date: | Dec 1, 2014 |

Words: | 5181 |

Previous Article: | Degrees of freedom of y channel with single-antenna users: transmission scheme and beamforming optimization. |

Next Article: | Efficient multicast routing on BCube-based data centers. |

Topics: |