Performance comparison of a slotted ALOHA DS/SSMA network and amultichannel narrow-band slotted ALOHA network

Throughput, delay, and stability for two slotted ALOHA packet radio systems are compared. One system is a slotted direct-sequence spread-spectrum multiple-access (DS/SSMA) network where each user employs a newly chosen random signature sequence for each bit in a transmitted packet. The other system is a multiple-channel slotted narrow-band ALOHA network where each packet is transmitted over a randomly selected channel. Accurate packet success probabilities for the code-division multiple-access (CDMA) system are computed using an improved Gaussian approximation technique which accounts for bit-to-bit error dependencies. Average throughput and delay results are obtained for the multiple-channel slotted ALOHA system and CDMA systems with block error correction. The first exit time (FET) is computed for both systems and used as a measure of the network stability. The CDMA system is shown to have better performance than the multiple-channel ALOHA system in all three areas     

Throughput performance of slotted DS/CDMA ALOHA with packetcombining over generalised fading channels

A time diversity automatic repeat-request (ARQ) scheme is investigated for a slotted narrowband DS/CDMA wireless data network over a Nakagami fading channel. Numerical results reveal that the proposed adaptive retransmission diversity with packet combining provides a considerable advantage over the conventional slotted DS/CDMA ALOHA at the expense of a slight increase in implementation complexity     

Packet throughput in slotted ALOHA DS/SSMA radio systems withrandom signature sequences

Packet throughput figures are obtained for direct sequence spread spectrum multiple access (DS/SSMA) slotted ALOHA radio systems where all users employ random signature sequences from bit-to-bit within all transmitted packets. These calculations use an improved Gaussian approximation technique which gives accurate bit error probabilities and also incorporates the effect of bit-to-bit error dependence within each packet in the multiaccess interference environment. Numerical results are given for packets which employ varying amounts of block error control, and a comparison is made with results obtained by other methods which ignore the effects of bit-to-bit error dependence within each packet in the multiaccess interference environment. Numerical results are given for packets which employ varying amount of block error control, and a comparison is made with results obtained by other methods which ignore the effects of bit-to-bit error and/or employ less-accurate Gaussian approximations to the probability of data bit error. Maximum throughput per unit bandwidth figures are calculated which compare favorably to similar figures for narrowband signaling techniques     

Slotted ALOHA and code division multiple access techniques forland-mobile satellite personal communications

The throughput and delay characteristics of a land-mobile satellite channel are analyzed for both slotted ALOHA. And slotted direct-sequence CDMA (code division multiple access), using binary phase shift keying (BPSK) modulation and forward error correction coding (FEC). In the case of CDMA, the application of path diversity techniques-maximal ratio combining and selection diversity-is also taken into account. Packet success probabilities are derived for both slow and fast fading, in order to evaluate the throughput and delay. Numerical results are presented for arbitrary code lengths and for specific values of the number of resolvable paths. It is shown that CDMA can offer a substantial improvement over slotted ALOHA, especially when the chip time is less than the delay spread     

Maximum-likelihood decoding and code combining for DS/SSMA slottedALOHA

This paper considers the combination of multiple copies of a packet to improve the performance of a slotted direct-sequence spread-spectrum multiple-access (DS/SSMA) ALOHA packet radio system with coherent binary phase-shift keying (BPSK) modulation. Both slotted DS/SSMA ALOHA with and without forward error correction (FEC) are considered. For the case with FEC, maximum-likelihood decoding with code combining is used. Code combining allows for the combination of multiple copies of the same packet (which are typically discarded), to obtain a lower code rate for that specific packet, and therefore an improved probability of successful decoding. In both cases, combining multiple copies of the same packet results in a throughput which is an increasing function over a broad range of offered load, so that the system is more reliable from the point of view of stability. In addition, combining provides a higher throughput and a smaller time delay for packet transmission. This is illustrated by means of analytical and simulation results     

ALOHA with Multipacket Messages and ARQ-Type Retransmission Protocols--Throughput Analysis

The throughput of slotted ALOHA systems with multipacket message transmissions is evaluated. The conventional strategy of retransmitting the entire message when collisions occur results in a reduction in throughput when compared with the single packet case. However, it is proved analytically that the use of ARQ-type retransmission protocols can provide significant performance improvement. In particular, it is shown that a simple go-back-N(GBN) protocol can offer a modest throughput increase, while a selective reject (SREJ) strategy provides exactly the same throughput as a single packet slotted ALOHA system, irrespective of message length statistics. These results motivate a new scheme (referred to as unslotted selective reject (SREJ) ALOHA) for increasing the throughput of unsynchronized random access channels. It is demonstrated that unslotted SREJ ALOHA with optimized parameters can achieve typical maximum throughputs (after accounting for all overheads) at least 25-40 percent higher than conventional pure ALOHA.     

Adaptive Spatial Filtering for an FH/SSMA Packet Radio Network with Packet Combining

In this paper, packet throughput is analyzed and simulated for a show FH/SSMA packet radio network with adaptive antenna array and packet combining in a Rayleigh fading channel with shadowing. The packet throughput is defined as the average number of captured packets per slot. To enhance the throughput performance, an adaptive spatial filtering through adaptive antenna array and a packet combining scheme are employed. As a random access protocol, slotted ALOHA is considered, and synchronous memoryless hopping patterns are assumed. A packet consists of codewords from an (n, k) RS (Reed-Solomon) code. The tap weights of an adaptive processor is updated by RLS (recursive-least-square) algorithm. From the simulation results, it is shown that a pre-processing by adaptive antenna array and a post-processing by packet combining are very effective to improve reception performance of an FH/SSMA network.     

A micro-cellular CDMA system over slow and fast Rician fading radiochannels with forward error correcting coding and diversity

The microcellular radio environment is characterized by a Rician fading channel. The use of a slotted code division multiple access (CDMA) scheme is considered in single- and multi-microcell systems. The throughput and delay performance of a slotted CDMA network are analyzed for slow and fast Rician fading radio channels using differential phase shift keying (DPSK) modulation. The application of selection diversity (SD) and maximal ratio combining (MRC) improve the performance for both slow and fast fading. It is also shown that the use of forward error correcting (FEC) codes enhances the system performance. Computational results are presented for maximum rms delay spread in the order of 2 μs and data rates of 32 and 64 kbit/s. A comparative analysis of macro-, micro- and pico-cellular CDMA systems is also presented     

Random Signal Levels for Channel Access in Packet Broadcast Networks

In this paper, it is proposed to employ random multiple signal levels for channel access in packet broadcast networks. We present priority-free random access protocols that possess the advantage of capture effect. The presented schemes are applied to the slotted ALOHA, and the performance is analyzed based on a conservative capture model. Closed-form expressions for the system throughput are derived for a general two-signal level system and a generalm-signallevel system. It is shown that the maximum throughput for the twolevel system increases from 0.47 to 0.52 as the separation between the two levels increases. For them-level system, the maximum throughput increases from 0.52 to 0.66 asmincreases from three to infinity. Then a rotary-priority sure-capture random access scheme is presented, which can achieve perfect channel utilization. The time-delay characteristic and the throughput-delay tradeoff are analyzed for the simplest two-level system for which the higher level is double the lower level. The results compare favorably to those of the conventional slotted ALOHA system which employs a single signal level for packet transmission. A number of open problems are addressed.     

Throughput analysis of CDMA systems using multiuser receivers

Throughput bounds are attained for random channel access multichannel code-division multiple-access (CDMA) systems and spread slotted Aloha systems employing multiuser receivers. It is shown that the normalized throughput of these two systems reaches 1.0 exponentially fast in the region r/K<1, where, r is the average number of simultaneous users in each channel in the random channel access multichannel CDMA system and the packet arrival rate in the spread slotted Aloha system, respectively, and K is the maximum number of users which the multiuser receiver can handle at the same time. Therefore, both of the random channel access multichannel CDMA system and the spread slotted Aloha system employing multiuser receivers can achieve perfect throughput while being stable in the region r/K=1-δ, δ>0. The maximum throughput of the random channel access multichannel CDMA systems is found as K-√(1-(1/M))KlogK-O(logK), where M is the number of channels in the system. The maximum throughput is reached when the average number of simultaneous users is r_m=K-√((1-(1/M))KlogK))+O(√(K/logK)). The maximum throughput of the spread slotted Aloha systems is K-√(KlogK)-O(log K). The maximum throughput is reached when the packet arrival of Poisson distribution has the arrival rate λ_m=K-√(KlogK)+O(√(K/logK))     

Throughput of unslotted direct-sequence spread-spectrummultiple-access channels with block FEC coding

An analysis of unslotted random-access direct-sequence spread-spectrum multiple-access (DS/SSMA) channels with block forward error correction (FEC) coding is presented. Extending a methodology that was introduced in an earlier paper on unslotted packet code-division multiple access (CDMA) without coding, a procedure for calculating the error probability of an L-bit packet in the variable message length, FEC-coded, DS/SSMA environment is described. This procedure is then used in conjunction with appropriate flow equilibrium traffic models to compute channel throughput. Using BCH block coding as an example, the analytical model is exercised to obtain throughput versus channel traffic curves over a range of code rates, leading to an assessment of maximum achievable throughput and the associated optimum FEC code rate. The results show that the use of block FEC coding provides a significant improvement in the bandwidth-normalized channel throughput (utilization), approaching values competitive with those for comparable narrowband ALOHA channels     

Selection and MRC Diversity for a DS/CDMA Mobile Radio System through Nakagami Fading Channel

Spatial diversity is an attractive technology for coping with the fadingchannels encountered in mobile communications.In this paper, the bit error rate (BER) is analyzed theoretically fordiversity reception with a RAKE receiver in aNakagami fading environment using either selection or maximal ratio combining.A coherent binary phase-shiftkeying (CBPSK) direct sequence code division multiple access (DS/CDMA) systemis considered. An arbitrary branchcorrelation is also considered for any diversity order in the case ofidentical fading severity on the branches.     

A diversity combining DS/CDMA system with convolutional encodingand Viterbi decoding

Averaged diversity combining is applied to an asynchronous DS/CDMA system using convolutional encoding and Viterbi decoding. A cyclic redundancy check (CRC) code is included in the scheme to trigger retransmission requests. Multiple received packets are combined on a bit by bit basis to form a single, more reliable packet. The error correcting decoder operates on the combined packet, as opposed to the most recently received individual packet (e.g., as in a type-I hybrid ARQ protocol), substantially increasing the probability of acceptance with each additional transmission. We show that the proposed technique allows a significant increase in the CDMA system capacity, throughput, and reliability     

Throughput Analysis of a Decentralized RLAN Based on Asynchronous DS/CDMA Using Random Periodic Spreading Sequences

Packet throughput figures are obtained for a decentralized radio local area network (RLAN) which is based on asynchronous direct-sequence code-division multiple-access (DS/CDMA). Packets arrive at the receiver nodes with different power levels. Techniques are developed to derive the probability of packet success for a system employing random periodic spreading sequences. It can be shown, that this system performs far better than a network using random spreading sequences. Based on the packet error probability, throughput figures of slotted DS/CDMA-ALOHA are presented for various scenarios. The effect of applying forward error correction (FEC) is investigated. For finite user environments, additional sources of errors have to be considered. These have a major impact and reduce the overall system performance. Finally, the throughput figures of a system applying the binary exponential backoff algorithm to avoid unstable behavior is investigated. The performance figures of the various systems described in this paper show that DS/CDMA forms a valuable choice for future RLANs.     

Throughput Analysis of DS CDMA/Unslotted ALOHA Wireless Networks with Fixed Packet Length in Rayleigh Fading Finite-State Markov Channel Model

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.     

Random access with large propagation delay

Random access to a packet broadcast channel with large propagation delay is investigated. A protocol is presented that combines slotted ALOHA random access with the use of forward-error-correction (FEC) across transmitted packets. Expressions for the throughput, delay, and drift of this protocol are derived. Numerical studies and asymptotic analyses of the drift indicate that the protocol has a maximum throughput of e^-1 and exhibits bistability and saturation behavior similar to that of slotted ALOHA with immediate feedback. However, unlike ALOHA, bistability and saturation in the code protocol can be eliminated with the proper choice of protocol parameters without increasing the packet delay. It is further shown that, when compared to slotted ALOHA, the code protocol typically achieves a higher throughput and lower delay at system equilibrium with no loss in maximum throughput     

Space-time characteristics of ALOHA protocols in high-speedbidirectional bus networks

Studies the space-time characteristics of ALOHA multiple-access protocols in bidirectional bus networks where transmissions are in the form of packets of constant length. For point-to-point communications, the maximum throughput of unslotted ALOHA is known to be 1/(2e), independent of station configuration. The authors show that, with a uniform probabilistic station configuration, the maximum throughput of slotted ALOHA tends to a nonzero constant that is less than 1/(2e), when a, the end-to-end propagation delay normalized with respect to the packet transmission time, tends to infinity. However, when N stations are evenly spaced on the bus, the maximum throughput of slotted ALOHA vanishes as a tends to infinity. For broadcast communications, the maximum throughput of slotted ALOHA is well known to be 1/{e(1+a)}. For unslotted ALOHA, the authors show that, if the offered load intensity is constant along the bus, the maximum broadcast throughput achievable by a station varies along the bus and is maximized at its center. The authors also derive the optimal profile of the offered load intensity for achieving a constant throughput intensity. In both cases, the maximum broadcast throughput is greater than that derived by conventional analysis     

Transmitter-Oriented Code Assignment for Multihop Packet Radio

Quasi-orthogonal codes are assigned to transmitters in a packet radio network such that interference caused by hidden terminals is eliminated. In addition, a handshaking protocol permits random access between nodes. Simple mathematical models and simulation indicate a potential throughput advantage over slotted ALOHA and CSMA.     

Contention-based MAC protocols with erasure coding for wireless data networks

Contention-based medium access control (MAC) protocol is a key component for the success of wireless data networks. Conventional random access protocols like ALOHA and Carrier Sense Multiple Access (CSMA) suffer from packet collision which leads to low throughput. Aimed at improving the throughput performance, we propose to integrate erasure coding with contention-based MAC protocols for recovering collided packets. To demonstrate the effectiveness of this approach, we focus on combining erasure coding with slotted ALOHA and slotted non-persistent CSMA in this paper. The performances of the resulting protocols are evaluated by both analytical model and simulation. Simulation results match very well with analytical results and show that the system throughput is increased for low to medium traffic loading. Packet loss ratio is also improved considerably with our scheme when the maximum number of packet retransmission times is limited. However, the delay for our scheme is higher due to the longer waiting time in our scheme for recovering collided packets. It is also shown that delay can be significantly reduced if we choose appropriate coding parameters though throughput will be sacrificed.     

Stability and throughput analysis of unslotted CDMA‐ALOHA with finite number of users and code sharing

We consider a system comprising a finite number of nodes, with infinite packet buffers, that use unslotted ALOHA with Code Division Multiple Access (CDMA) to share a channel for transmitting packetised data. We propose a simple model for packet transmission and retransmission at each node, and show that saturation throughput in this model yields a sufficient condition for the stability of the packet buffers; we interpret this as the capacity of the access method. We calculate and compare the capacities of CDMA‐ALOHA (with and without code sharing) and TDMA‐ALOHA; we also consider carrier sensing and collision detection versions of these protocols. In each case, saturation throughput can be obtained via analysis of a continuous time Markov chain. Our results show how saturation throughput degrades with code‐sharing. Finally, we also present some simulation results for mean packet delay. Our work is motivated by optical CDMA in which “chips” can be optically generated, and hence the achievable chip rate can exceed the achievable TDMA bit rate which is limited by electronics. Code sharing may be useful in the optical CDMA context as it reduces the number of optical correlators at the receivers. Our throughput results help to quantify by how much the CDMA chip rate should exceed the TDMA bit rate so that CDMA‐ALOHA yields better capacity than TDMA‐ALOHA. This revised version was published online in June 2006 with corrections to the Cover Date.