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     

Throughput analysis of DS/SSMA unslotted ALOHA system with fixedpacket length

Throughput analysis of direct-sequence spread spectrum multiple access (DS/SSMA) unslotted ALOHA with fixed packet length is presented. As the levels of multi-user interference fluctuate during the packet transmission, we calculate the packet error probability and the throughput by considering not only the number of overlapped packets but also the amount of time overlap. On the assumption that packet generation is Poisson, the system can be thought as the queueing system M/D/∞. With Gaussian approximation of multi-user interference, we obtain the throughput as the function of the number of chips in a bit, the packet length, and the offered load of the system. We also analyze the channel load sensing protocol (CLSP), and obtain the optimum threshold of CLSP     

Analysis of unslotted direct-sequence spread spectrum multipleaccess network with packet combining

A packet combining scheme is investigated for an unslotted random access code division multiple access network over a frequency selective Rayleigh fading channel. It is shown that this simple diversity combining mechanism is highly advantageous for systems which can both tolerate a certain delay and operate over highly time-varying channels     

Performance analysis of DS/SSMA unslotted ALOHA system withvariable length data traffic

We analyze the throughput of a direct-sequence spread spectrum multiple access (DS/SSMA) unslotted ALOHA system with variable length data traffic. The system is analyzed for two cases: (1) systems without a channel load sensing protocol (CLSP) and (2) systems with a CLSP. The bit-error probability and the throughput are obtained as a function of the signal-to-noise ratio (SNR) during message transmission, considering the number of overlapped messages and the amount of time overlap. We assume that the generation of data messages is Poisson distributed and that the messages are divided into packets before transmission. The system is modeled as a Markov chain under the assumption that the number of packets in a message is geometrically distributed with a constant packet length. The throughput variance of the DS/SSMA unslotted ALOHA system with variable length data traffic is obtained as the Reed-Solomon code rate varies. Results show that a significant throughput improvement can be obtained by using an error-correcting code     

非时隙CDMA分组网络吞吐量性能分析:统一的方法

CDMA分组网络性能主要受限于信道中同时传输的其它分组的干扰.与时隙CDMA分组网络相比,非时隙CDMA分组网络所受到的干扰情况更加复杂.本文提出了一种非时隙CDMA分组网络的干扰分析模型,并采用递归方式建立了网络吞吐量性能分析的统一方法.在此基础上,分析了网络节点突发固定长度分组和突发可变长度分组两种情况下的网络吞吐量性能,并讨论了扩频增益和分组传输方式对网络性能的影响,给出了相应的数值结果.文章最后进一步讨论了吞吐量的上下界问题.与前人提出的马尔可夫模型相比,采用本文提出的方法可以得到更为准确的吞吐量性能.     

Throughput of DS‐CDMA/unslotted ALOHA radio networks with Markovian arrival processes

Previous works on the throughput analysis of the direct sequence‐code division multiple access/unslotted ALOHA radio network all used the Poisson arrival process (PAP). However, the interarrival times of PAP are independent, so it is not suited to model today's Internet and multimedia traffic, which have correlated interarrival times. We are motivated to use the Markovian arrival process (MAP), a more general input traffic model that captures the correlation of interarrival times. We are the first to analyze the throughput of the direct sequence‐code division multiple access/unslotted ALOHA radio network with MAP. We propose the use of MAP, which encompasses the PAP as a special case. The new MAP model basically generalizes the current traffic and queuing models of multimedia in wireless networks. Copyright © 2011 John Wiley & Sons, Ltd.     

The performance of continuous-phase-coded DS/SSMA communications

A class of spread-spectrum systems with continuous-phase spreading signals is proposed. We present a characterization of the spectral-spreading signals that allows computation of various measures of the system performance, such as the signal-to-noise ratio (SNR), spectral density, and average bit-error probability. The error probability can be evaluated if the distributions of the multiple-access interferences (MAIs) are available. We obtain the conditional distributions of random variables that characterize the MAI given the time delays. These conditional distributions are used to compute vectors, allowing the average bit-error probability to be computed with arbitrary accuracy. Since most of the computations only involve array additions and multiplications, these operations can be performed efficiently on array processors     

Throughput performance of an FHMA system with variable rate coding

We compare throughput bounds for a frequency-hopped multiple-access (FHMA) system employing variable rate as well as fixed rate coding (FRC). Nonfading as well as Rayleigh-fading channels are explored. The throughput bounds for the variable rate coding (VRC) schemes are based on the assumption that the number of active users in the system, m, is known at any time while the bounds for the FRC scheme assumes that the fixed code rate is optimized for the user population mean, λ, where the population is assumed to be Poisson distributed. We present bounds for theoretical “perfect” codes which achieve the capacity as well as bounds for Reed-Solomon (RS) codes of practical block lengths. Finally, we show the dependence of a VRC scheme upon the accuracy of the estimates of m and present a general comparison of the gains of using VRC versus a realistic FRC scheme     

The performance of optical fiber direct-sequence spread-spectrummultiple-access communications systems

Because of the random nature of the photodetection process and the multiple-user interference, an exact analysis of avalanche photodiode (APD)-based optical code division multiple-access (CDMA) communications systems is intractable and quite often, Monte Carlo (MC) simulations which yield exact estimates of system performance in terms of bit error rates (BERs) require a prohibitive computational burden. A quick and accurate MC method for simulating APD-based optical CDMA systems is presented. In particular, a performance analysis of optical CDMA systems employing optical orthogonal and prime sequence codes is undertaken     

Average bit-error-rate performance of band-limited DS/SSMA communications

Direct-sequence spread-spectrum multiple-access (DS/SSMA) communications, strictly band-limited transmitter chip waveforms with excess bandwidth in the interval between zero and one, pseudo-random spreading sequences, an additive white Gaussian noise channel, and matched filter receivers are considered. First, a new expression for the average bit error rate (BER) is derived for systems with quaternary phase-shift keying (QPSK) spreading, the conventional matched filter receiver, a coherent detector for binary phase-shift keying (BPSK) data symbols, and chip waveforms that result in no interchip interference. The expression consists of a well known BER expression based on the standard Gaussian approximation to multiple-access interference and a few correction terms. It enables accurate BER evaluations without any numerical integration for various choices of system parameters of interest. The accuracy of the expression is guaranteed as long as the conditional Gaussian approximation to the cross-correlation coefficients between the desired user's spreading sequence and the interfering users' spreading sequences is valid. The expression well reflects the effect of filtering on the system performance. Extensions of the expression are discussed for systems with QPSK spreading and different detection schemes, systems with BPSK spreading, and systems with different transmit and receive filters. Monte Carlo simulation results are also provided to verify the accuracy.     

Throughput performance of an adaptive ARQ scheme in Rayleigh fading channels

Using a simulation study we analyze the throughput performance of Yao's adaptive ARQ scheme in time-varying channels. The simulation takes into account the Rayleigh amplitude and the fast or the slow fading characteristics of a wireless channel, under a representative M-FSK modulation and Reed-Solomon coding scheme. We show that, for a specific set of design parameters, Yao's adaptive procedure works well for all channel fading rates, except for moderately slow rates. By observing variations of packet error rates at a specified SNR we provide an explanation for these varied behaviors under different channel fading rates.     

Packet admission control in a direct-sequence spread-spectrum LEOsatellite communications network

The effect of multiple-access interference on the throughput performance of a direct-sequence spread-spectrum low-Earth-orbiting satellite communications network is discussed. To recognize the effect of interference when their sources are either inside or outside the service area of a satellite, we develop a stochastic model for the location of users. We show that the effect of interference on the performance degradation from users with large propagation distance to their connecting satellites is the dominant factor. Hence, to improve the performance of the system, we propose a method in which the transmissions of packets are controlled according to their distances to connecting satellites as well as the traffic distribution     

Optimum transmission ranges in a direct-sequence spread-spectrummultihop packet radio network

The authors obtain the optimum transmission ranges to maximize throughput for a direct-sequence spread-spectrum multihop packet radio network. In the analysis, they model the network self-interference as a random variable which is equal to the sum of the interference power of all other terminals plus background noise. The model is applicable to other spread-spectrum schemes where the interference of one user appears as a noise source with constant power spectral density to the other users. The network terminals are modeled as a random Poisson field of interference power emitters. The statistics of the interference power at a receiving terminal are obtained and shown to be the stable distributions of a parameter that is dependent on the propagation power loss law. The optimum transmission range in such a network is of the form CK^α where C is a constant, K is a function of the processing gain, the background noise power spectral density, and the degree of error-correction coding used, and α is related to the power loss law. The results obtained can be used in heuristics to determine optimum routing strategies in multihop networks     

Optimizing information efficiency in a direct-sequence mobile packet radio network

We consider a direct-sequence multihop packet radio network using slotted ALOHA in a Rayleigh fading environment. We are interested in optimally choosing the transmission range, code rate, and slotted ALOHA transmission probability to be used by each node. We use a new performance measure, information efficiency, to analyze the network and show that the information efficiency of the low-cost mobile packet radio network can be improved approximately 20 fold by using the optimum parameters. We suggest a practical trellis-coded modulation scheme which comes close to realizing the theoretic limits found.     

Throughput performance of memory ARQ schemes

We present a throughput analysis for the memory automatic repeat request (ARQ) schemes with self-decodable frame retransmissions, taking into account frame header and frame acknowledgment failure probability. A lower bound on the throughput is obtained for a very general class of schemes which encompasses many of those proposed in the literature. Numerical results are given for several example systems, and suitable header and acknowledgment forward error correction (FEC) encodings are determined     

Multi-user performance of direct-sequence CDMA using combinedbinary PPM/orthogonal modulation

A new modulation format is proposed for cellular code-division multiple-access (CDMA) communications where binary pulse position modulation (PPM) is embedded in the chip waveform and combined with orthogonal modulation using Walsh/Hadamard codes. Compared to the conventional CDMA using orthogonal codes, this scheme allows reduction in receiver complexity by lowering the modulation level for the second-stage orthogonal modulation. The staggered (half-chip) quadrature direct-sequence signaling is adopted to uniformly distribute the transmit power and allow noncoherent detection at the receiver because carrier phase tracking is not feasible because of the binary PPM, suitable for the reverse link in cellular networks. Statistics of inter-user interferences are characterized, and then derive the symbol error probability for the proposed M-ary modulation format. It is shown that the advantage in view of receiver complexity can be achieved without deteriorating the multi-user performance in terms of the number of users affordable at a specified error rate     

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 analysis of IEEE 802.15.4 network under IEEE 802.11 network interference

This paper evaluates throughput of IEEE 802.15.4 network under the interference of a saturated IEEE 802.11 network using an analytic method. Packet losses due to both collisions among IEEE 802.15.4 and mutual interference between IEEE 802.15.4 and 802.11 are considered for throughput analysis. To include the interference from IEEE 802.11, we modified the state transition probabilities of IEEE 802.15.4 two-state Markov process model. Simulation results closely match the theoretical expressions confirming the effectiveness of the proposed model.     

Accurate performance evaluation of time-hopping and direct-sequence UWB systems in multi-user interference

An exact analysis is derived for precisely calculating the bit error probability of time-hopping and direct-sequence ultra-wideband systems with multi-user interference in an additive white Gaussian noise environment. The analytical expressions are validated by simulation and used to assess the accuracy of the Gaussian approximation proposed for estimating the performance of ultra-wideband communication systems. The Gaussian approximation is shown to be inaccurate for predicting the bit error rate for medium and large signal-to-noise ratio values. The performances of time-hopping and direct-sequence modulation schemes are accurately compared for different numbers of users and frame widths. It is shown that direct-sequence binary phase-shift keying outperforms time-hopping binary phase-shift keying for medium and large values of signal-to-noise ratio, which contradicts some previous results obtained using a Gaussian approximation.     

Tracking performance of digital chip synchronisation algorithms for bandlimited direct-sequence spread-spectrum communication

Chip synchronisation for direct-sequence spread-spectrum communication with bandlimited instead of rectangular chip pulses is investigated and described. The tracking error variances of several coherent and noncoherent digitally implementable chip synchronisation algorithms are evaluated and compared.<>