Code-division Multiple-access Cellular System Research Articles

QUEUEING MODEL FOR SOFT HANDOFF ANALYSIS IN CDMA BASED WIRELESS CELLULAR NETWORK

The most important feature of the mobile network is mobility. Good and continuous service in cellular mobile network can be achieved by using the procedure of handoff (or handover) from one cell to another. Soft handoff is very important feature of cellular Code Division Multiple Access (CDMA) system. In CDMA system a mobile stations (MSs) within a soft handoff region use multiple radio channels and receive their signals from multiple base stations simultaneously. In CDMA cellular system, all cells can also share the same frequency. During handoff procedure, the signaling and voice information from multiple base stations are combined at the mobile switching center (MSC). During the handoff procedure, voice and signaling information must be sent to multiple base stations and the mobile station must combine the results. Within the overlapping area (which is developed by the adjacent cells) of cells, a handset can connect to multiple base stations. In this research paper, a new soft handoff scheme for CDMA cellular network is proposed and investigated. Here we introduce the concept of overlap region between adjacent cells and develop an analytical model for soft handoff in CDMA system. In developed soft handoff model, the balking and reneging behaviors of handoff calls have also considered. Different performance measures of the soft handoff model have developed.

Quality of service differentiation in heterogeneous CDMA networks: a mathematical modelling approach

Next-generation cellular networks are expected to enable the coexistence of macro and small cells, and to support differentiated quality-of-service (QoS) of mobile applications. Under such conditions in the cell, due to a wide range of supported services and high dependencies on efficient vertical and horizontal handovers, appropriate management of handover traffic is very crucial. Furthermore, new emerging technologies, such as cloud radio access networks (C-RAN) and self-organizing networks (SON), provide good implementation and deployment opportunities for novel functions and services. We design a multi-threshold teletraffic model for heterogeneous code division multiple access (CDMA) networks that enable QoS differentiation of handover traffic when elastic and adaptive services are present. Facilitated by this model, it is possible to calculate important performance metrics for handover and new calls, such as call blocking probabilities, throughput, and radio resource utilization. This can be achieved by modelling the cellular CDMA system as a continuous-time Markov chain. After that, the determination of state probabilities in the cellular system can be performed via a recursive and efficient formula. We present the applicability framework for our proposed approach, that takes into account advances in C-RAN and SON technologies. We also evaluate the accuracy of our model using simulations and find it very satisfactory. Furthermore, experiments on commodity hardware show algorithm running times in the order of few hundreds of milliseconds, which makes it highly applicable for accurate cellular network dimensioning and radio resource management.

A global optimization framework for distributed antenna location in CDMA cellular networks

In this paper, we present a set of (exact and approximate) mathematical models and algorithms for determining the set of (globally) optimal distributed antenna deployments and the supported user demand in cellular code division multiple access (CDMA) systems. We focus on the uplink (user-to-base station) formulation and assume that the base station combines all the received signals at each of the antennas using path-gain based weights. In CDMA systems, as all users occupy the system bandwidth at the same time thereby interfering with each other, this results in a complicated 0–1 mixed-integer multilinear programming problem, where the objective function maximizes the total system capacity, while ensuring that the minimum signal-to-interference-plus-noise ratio (SINR) constraints and maximum transmit power constraints for each user are satisfied. This highly nonlinear, nonconvex problem is reformulated to yield a tight mixed-integer 0–1 linear programming representation via the addition of several auxiliary variables and constraints, and a specialized algorithm is designed to determine globally optimal solutions. The computational results obtained, corresponding to different user distributions, demonstrate the efficacy of the proposed models and algorithms, and clearly exhibit the viability of both exact and approximate models.

Power Control for Cellular Communications with Time‐Varying Channel Uncertainties

AbstractPower control in a code‐division multiple access (CDMA) based cellular network is a challenging problem because the communication channels change rapidly because of multipath fading. These rapid fluctuations cause detrimental effects on the control efforts required to regulate the signal‐to‐interference plus noise ratios (SINRs) to the desired level. Thus, there is a need for power‐control algorithms that can adapt to rapid changes in the channel gain caused by multipath fading. Much of the previous work has either neglected the effects of fast fading, assumed that the fading is known, or assumed that all the link gains are known. In this paper, we model the effects of fast fading and develop practical strategies for robust power control based on SINR measurements in the presence of the fading. We develop a controller for the reverse link of a CDMA cellular system, and use a Lyapunov‐based analysis to prove that the SINR error is globally uniformly ultimately bounded. We also utilize a linear prediction filter that utilizes local SINR measurements and estimates of the Doppler frequency that can be derived from local SINR measurements to improve the estimate of the channel fading used in the controller. The power‐control algorithm is simulated for a cellular network with multiple cells, and the results indicate that the controller regulates the SINRs of all the mobile terminals (MTs) with low outage probability. In addition, a pulse‐code‐modulation technique is applied to allow the control command to be quantized for feedback to the transmitter. Simulation results indicate that the outage probabilities of all the MTs are still within the acceptable range if at least 3‐bit quantization is employed. Comparisons to a standard algorithm illustrate the improved performance of the predictive controller.

Novel approach to adjust the step size for closed-loop power control in wireless cellular code division multiple access systems under flat fading

In this article, we study the power control (PC) process in wireless cellular code division-multiple access systems under flat fading and propose a novel approach to find an optimum step size for closed-loop power control algorithms. In this approach, an optimum step size will be computed from a proposed function. This function depends on system parameters such as, the number of co-channel users, processing gain, the period of PC, Doppler frequency, channel attenuation and the order of diversity. Based on this computation, the mobile station (MS) adjusts its transmit power optimally to decrease interference for other co-channel users. Simulation results for different sets of system parameters show that the proposed algorithm decreases the bit error rate, the outage probability at the base station (BS), and increases the battery life of the MS compared with other values of the step size. The performance of the proposed algorithm is compared with the fixed-step-size power control algorithm and superiority of its performance is confirmed by simulation results. Moreover, the upper and lower bounds of the outage probability and the received signal-to-interference ratio for the proposed algorithm at the BS will be calculated.

Quasi-Synchronous CDMA Using Properly Scrambled Walsh Codes as User-Spreading Sequences

An orthogonal spreading code family based on scrambled Walsh-Hadamard (WH) sequences is proposed for quasi-synchronous (QS) code-division multiple-access (CDMA) systems. With 1 chip offset, either the top or the bottom half rows of the WH matrix remain orthogonal if they are scrambled using the proposed scrambling patterns. With quadriphase scrambling applied on a quarter row of the WH matrix, the zero-correlation zone (ZCZ) is extended to 3 chips. The proposed spreading codes satisfy the theoretical limit of code size for a given code length and ZCZ. Compared with existing spreading codes for QS-CDMA, the proposed spreading codes have several advantages: 1) A special procedure for code family construction is not needed; it only requires a simple modification to the scrambling sequence of the conventional CDMA, which employs WH sequences as user signatures. 2) Flexible code family size; the size can easily be extended for multicell applications without having to consider existing codes used. Moreover, if synchronization is guaranteed to be within 1 chip, the code size can be doubled by allocating another quarter member of the WH sequence set. 3) The benefits of long code scrambling from the conventional cellular CDMA systems are inherited, such as robustness against interception and multiaccess interference randomization.

Joint Centralized Power Control and Cell Sectoring for Interference Management in CDMA Cellular Systems in a 2D Urban Environment

The interference reduction capability of cell sectoring and power control algorithms have been considered separately as means to decrease the interference in Code Division Multiple Access (CDMA) cellular systems. In this paper, we present Switched-Beam (SB) and Rotatable Equal Sectoring (RES) techniques for CDMA cellular systems in a 2D urban environment. In the SB technique by using a number of fixed, independent, or directional antennas we increase the downlink capacity of the CDMA systems. Also in the RES method, the equal sectors of the base stations are rotating together to decrease the inter-cell and intra-cell interferences. Also in this paper we use centralized power control to overcome the near-far problem. Simulation results indicate that the proposed techniques considerably increase the capacity of the CDMA cellular systems compared to ordinary Equal Sectoring (ES) method.

Quality of service estimation for soft handoff region ratio and call admission control in CDMA cellular systems

In the operational stage of code division multiple access (CDMA) systems, the soft handoff region ratio (SHRR) is among the important parameters that guarantee the quality of service (QoS) and resource allocation. This paper analytically investigates the effects of the SHRR on QoS. In doing so, we simultaneously take into account the capacity increasing factor and traffic load variation. For this purpose, we propose a new traffic load estimation model using a semi-Markov chain in order to consider the call arrivals influenced by the SHRR under general resident time condition. We also present the calculation algorithm of the QoS measures such as the new call blocking probability (NBP) and forced termination probability (FTP) by applying the proposed model to the prioritized call admission control (CAC). The numerical result illustrates the effects of various soft handoff system parameters. Likewise, it shows that the value of SHRR has a significant impact of the QoS under the normal propagation conditions. Sensitivity analysis is also performed to show the effect of exponential cell resident time assumption. The proposed modeling is expected to provide a practical guide to improve the QoS of CDMA soft handoff systems.

The impact of code allocation on the multiple access interference in WCDMA systems

Code allocation has a significant impact on the performance of Code Division Multiple Access (CDMA) systems. For the uplink direction, in 3G Wideband CDMA (WCDMA) cellular systems, orthogonal codes are employed to differentiate the physical channels of one transmitter and Pseudo Noise (PN) sequences are used to provide mutual randomness between the users. Since the received data spread by different codes are not perfectly orthogonal, the emerged Multiple Access Interference (MAI) is a major limitation of the system capacity. In this paper, we propose a new code allocation scheme with the aim of reducing the interference by decreasing the number of non-orthogonal spreading codes used in a cell. Consequently, the new proposed scheme improves the system capacity for the uplink direction in term of accepted calls in one cell. The idea behind is to assign one scrambling code for each class of service in a cell instead of assigning one scrambling code per mobile station as in 3G WCDMA-based systems. Note that the traffic belonging to one class of service may be originated from different mobile stations. We also develop a new power control algorithm associated with the new code allocation scheme. In order to evaluate the performance, we develop analytical models for the code allocation scheme currently used in UMTS (Universal Mobile Telecommunication Systems) WCDMA-based system considered as a benchmark and for our proposed scheme. Numerical and simulation results are showing that our proposed scheme offers significant gain for the uplink capacity compared with the current scheme used in UMTS.

Uplink analysis for hierarchical CDMA systems with attenuators applied to microcell under imperfect power control

Under the signal-strength-based power control scheme, the effect of various microcell cluster locations on the uplink average signal-to-interference ratio (also called carrier-to-interference ratio, or CIR) is studied for the hierarchical code-division multiple-access cellular system with attenuators applied to each microcell base station. On the basis of the interference statistics analysis, the influence of power control errors on the uplink average bit error rate (BER) is also studied under the multipath fading and shadowing. Results show that both central macrocell and microcell uplink CIR are almost unaffected by the variations of microcell cluster locations, and that the uplink average BER is evidently affected by the imperfection of power control and the shadowing standard deviations.

Modeling and Performance Analysis for Soft Handoff Schemes in CDMA Cellular Systems

This paper investigates the features of a cellular geometry in code-division multiple-access (CDMA) systems with soft handoff and distinguishes controlling area of a cell from coverage area of a cell. Some important characteristics of the cellular configuration in soft handoff systems are used to propose a new design of efficient call admission control (CAC) in CDMA systems. Then, the paper constructs a continuous-time Markov chain (CTMC) model for CAC in CDMA with a soft handoff queue, obtains closed-form solutions, and thus develops loss formulas as performance indices such as the new blocking probability and the handoff dropping probability. In order to determine handoff traffic arrival rate, a fixed-point strategy is developed. Algorithms are also provided to stably compute loss probabilities and to determine the optimal number of guard channels. A new soft handoff scheme-eliminating pseudo handoff calls (EPHC)-is proposed to improve channel utilization efficiency based on mobility information. As an application of the loss formulas, the proposed modeling techniques are used to evaluate and compare the performance of conventional and proposed EPHC soft handoff schemes. Numerical results show the effectiveness of the proposed Markov chain models and the benefits of the new soft handoff scheme.

Pilot Interference Cancellation Technology for CDMA Cellular Networks

This paper considers the link-level and network-level performance of code division multiple access (CDMA) pilot interference cancellation (pilot IC) technology, a low-complexity advanced receiver technology being considered for use in commercial third generation (3G) CDMA cellular systems. The concept behind this technology is to estimate and cancel at the handset receiver the interference effects associated with CDMA downlink pilot signals broadcast from the base stations of the network. The canceling of interference at the receiver improves the signal-to-interference/noise ratio (SINR), which enables increased cell capacity or throughput. In this paper, we derive SINR expressions for evaluating the probability of error performance of both the RAKE and pilot IC handset receivers, under conventional random spreading code assumptions. The approach can easily and accurately model a wide variety of transmitter, channel, and receiver conditions, including the effects of channel estimation. We also utilize radio network simulations to illustrate and quantify the capacity gains available for 3G CDMA networks through the use of pilot IC handsets. Network simulations are also used to examine the reduced level of soft-handoff found to be possible in pilot IC-based networks and the increased flexibility available in setting pilot power levels. We further consider the impact of using stronger pilot signals for improving the demodulation performance of sensitive higher-order modulation constellations that are needed to support spectrally efficient high-rate data services.

Coverage expansion and capacity improvement from soft handoff for CDMA cellular systems

Previous research examining coverage expansion due to soft handoff in code division multiple access (CDMA) cellular networks did not address the relationship between the coverage expansion and the amount of carried traffic in the cell. In this paper, we first present a method to estimate reverse-link multicell coverage using a duration-outage approach. Using this, we then proceed to quantitatively analyze reverse-link coverage expansion from soft handoff as a function of the carried traffic in the cell under different propagation environments. Our results show that for modest values of carried traffic, the coverage expansion is almost constant. However, when the amount of carried traffic is large, the coverage expansion can increase dramatically. Next, we examine the dependence of the soft-handoff coverage expansion on key characteristics of the large-scale shadowing environment. Results are presented that quantify the coverage-expansion dependence on the large-scale shadowing's correlation distance (d/sub c/), variability (/spl sigma//sub Z/), path-loss exponent (K/sub 2/), and the correlation between the two-cell large-scale shadowing environments (C/sub Z/). The results indicate that realistic variations in these propagation conditions have a significant, and sometimes dramatic, effect on the coverage expansion provided by soft handoff. Finally, we analyze the capacity improvement from soft handoff and the tradeoff between capacity improvement versus coverage expansion. Understanding and managing the capacity improvement versus coverage expansion tradeoff is critical for achieving optimal CDMA cell-network performance.

Soft Handoff Analysis of Hierarchical CDMA Cellular Systems

A new soft handoff analysis for hierarchical code-division multiple-access (CDMA) cellular systems is presented. Hierarchical cellular architectures have been proposed to increase cellular system capacity and flexibility. In order to extend such architectures to CDMA-based systems, the performance of soft handoff in hierarchical architectures must be considered. We first develop an analytical method for studying the interference in hierarchical CDMA cellular systems. We then apply the obtained results to a soft handoff analysis model to study the performance of soft handoff in hierarchical architectures. It is observed that dynamic handoff parameter assignment, where parameters are dynamically adjusted according to given interference conditions, offers a more efficient handoff mechanism than fixed handoff parameter assignment.

Mobility-Based CAC Algorithm for Arbitrary Call-Arrival Rates in CDMA Cellular Systems

This paper presents a novel approach for designing a call-admission control (CAC) algorithm for code-division multiple-access (CDMA) networks with arbitrary call-arrival rates. The design of the CAC algorithm uses global information; it incorporates the call-arrival rates and the user mobilities across the network and guarantees the users' quality of service (QoS) as well as prespecified blocking probabilities. On the other hand, its implementation in each cell uses local information; it only requires the number of calls currently active in that cell. We present several cases for a nontrivial network topology where our CAC algorithm guarantees QoS and blocking probabilities while achieving significantly higher throughput than that achieved by traditional techniques. We also calculate the network capacity, i.e., the maximum throughput for the entire network, for prespecified blocking probabilities and QoS requirements.

ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE

We consider two identical parallel M/M/∞ queues. A new arrival is routed to the queue with the smaller number of customers. If both systems have equal occupancy, the arrival joins either with probability 1/2. These types of models have been used to describe CDMA (Code Division Multiple Access) cellular systems. We analyze this model both numerically and asymptotically. For the latter, we consider the limit ρ = λ/μ → ∞, where λ (resp., μ) is the arrival (resp., service) rate. An efficient numerical method is developed for computing the joint steady-state distribution of the number of customers in the two queues. We give several asymptotic formulas, valid for different ranges of the state variables, which show the qualitative structure of the joint distribution. The numerical accuracy of the asymptotic results is tested.

A New Base Station Receiver for Increasing Diversity Order in a CDMA Cellular System

A new base station receiver is proposed and analyzed for a code-division multiple-access (CDMA) cellular system. The proposed receiver can achieve remarkable diversity gain by increasing diversity order with reasonable cost and complexity. From the numerical results, it is confirmed that the proposed receiver structure can be a practical solution for enhancing reverse-link capacity and improving performance in CDMA cellular system operations. The result in the letter can find its applications to legacy IS-95/cdma2000 1x base stations with simple modifications.

Transmit Diversity for Combined 2G and 3G CDMA Systems

In this letter, we propose modifications to existing transmit-diversity techniques to provide transmit diversity in code-division multiple-access cellular systems which must support both second-generation and third-generation mobiles on a common carrier. The proposed method, which we call symmetric-sweep transmit diversity, combines phase-sweep transmit diversity (PSTD) and space-time spreading (STS) in a way that allows second-generation and non-STS-capable mobiles to obtain the full advantage of PSTD, while third-generation mobiles obtain the full advantage of STS.

Power Control, Capacity, and Duality of Uplink and Downlink in Cellular CDMA Systems

Accurate power control is an essential requirement in the design of cellular code-division multiple-access (CDMA) systems. In this paper, we contribute three main themes to the power control problem. First, we derive an efficient algorithm for computing minimal power levels for large-scale networks within seconds. Nice and intuitive conditions for the existence of feasible power solutions follow from this approach. Second, we define the capacity region of a network by the set of effective spreading gains, or data rates, respectively, which can be supplied by the network. This is achieved by bounding the spectral radius of a certain matrix containing system parameters and mutual transmission gain information. It is shown that the capacity region is a convex set. Finally, we reveal an interesting duality between the uplink and downlink capacity region. In a clear-cut analytical way, it substantiates the fact that the uplink is the more restricting factor in cellular radio networks. The same methods carry over to certain models of soft handover. In the case that the channel gains are subject to log-normal shadowing, we introduce the concept of level-/spl alpha/ capacity regions. Despite the complicated structure, it can still be shown that this set is sandwiched by two convex sets coming arbitrarily close as variance decreases.

DS-CDMA Code Acquisition in the Presence of Correlated Fading—Part I: Theoretical Aspects

This paper deals with the analysis of the code-acquisition process performed by a mobile terminal in a code-division multiple-access cellular system. The fundamental contribution is the setting of a theoretical framework for code-acquisition analysis, accounting for the presence of fading and shadowing with specified coherence time. A multidwell architecture is considered, accounting for different verification strategies. The MAX/TC detection criterion is used, and the acquisition performance is analyzed, following both the direct and flow-graph approaches. Expressions for the acquisition time probability density function under different assumptions are given, as well as closed-form expressions for the mean and variance of the acquisition time. Practical applications and numerical results are reported in the Part II companion paper.