Handoff performance in wireless DS‐CDMA networks

This paper analyses the performance of DS‐CDMA networks in the presence of call handoffs. We show that a handoff may violate the SINR requirements for other users, and thus cause an outage in the target cell. We propose to use the probability of such events as a possible metric for quality of service in networks with multiple traffic types, and derive the corresponding QoS parameters. A two‐level admission policy is defined: in tier 1 policy, the network capacity is calculated on the basis of the bound on outage probability. However, this policy does not suffice to prevent outage events upon handoffs for various traffic types, and henceforth, we propose an extension that reserves extra bandwidth for handoff calls, thus ensuring that handoff calls will not violate the outage probability bound. The overhead imposed by the extension is negligible, as the complete two‐tier admission control algorithm is executed only when a call is admitted into the network. Once admitted, calls can freely execute handoffs using the reserved bandwidth. The modified second‐tier bandwidth reservation policy is adaptive with respect to the traffic intensity and user's mobility and we show that it can provide satisfactory call (flow) quality during its lifetime. Analytical results for the QoS have been verified by the simulations. Copyright © 2002 John Wiley & Sons, Ltd.     

Admission policies for integrated voice and data traffic in CDMApacket radio networks

The authors derive optimal admission policies for integrated voice and data traffic in packet radio networks employing code division multiple access (CDMA) with direct-sequence spread spectrum (DS/SS) signaling. The network performance is measured in terms of the average blocking probability of voice calls and the average delay and packet loss probability of data messages. The admission scheme determines the number of newly arrived voice users that are accepted in the network so that the long-term blocking probability of voice calls is minimized. In addition, new data arrivals are rejected if the mean delay or the packet loss probability of data exceeds a desirable prespecified level. A semi-Markov decision process (SMDP) is used to model the system operation. Then, a value iteration algorithm is used to derive the optimal admission control. Two models for the other-user interference of the CDMA system are considered: one based on thresholds and another based on the graceful degradation of the CDMA system performance, and their performance is compared. These admission policies find application in emerging commercial CDMA packet radio networks including cellular networks, personal communication networks, and networks of LEO satellites for global communications     

Orthogonal complementary codes for interference-free CDMA technologies

This article addresses the issues of next-generation CDMA technologies for B3G wireless communications. To engineer a CDMA system whose performance will no longer be interference-limited, many challenging issues should be tackled, such as novel CDMA code sets, efficient spreading and carrier modulation schemes, and signaling format for high-speed burst traffic. This article reviews our ongoing research on next-generation CDMA technologies. In particular, we propose a new CDMA code design methodology, real environment adapted linearization (REAL), which can generate CDMA code sets with inherent immunity against multipath interference and multiple access interference for both uplink and downlink transmissions. It is also shown that interference-free CDMA can only be implemented with the help of orthogonal complementary codes. The article goes further to reveal that cell-wise capacity for such interference-free CDMA is equal to the number of element codes assigned to each user, making OFDM a natural choice to implement interference-free CDMA. Several other issues of OCC-CDMA, such as its system implementation and performance, are also addressed in this article.     

Performance analysis of CDMA cellular networks with channel sub‐rating

This paper presents the analysis of CDMA cellular networks with channel sub‐rating. From users' point of view, our considered scheme gives higher priority to handoff calls over new calls by sub‐rating the existing connections when handoff calls find no idle channels upon their arrivals. Therefore, it is considered that the disadvantage of the soft handoff which needs more channels than the hard handoff is made up for. Handoff calls can also wait in a queue while they are in handoff areas if all channels are sub‐rated in the cell of interest. We mathematically model this scheme by applying queueing theory. Then, we analyse its performance to derive the blocking probabilities of the new and handoff calls, the probability that handoff calls leave the handoff area without getting new channels, the degradation ratio of the voice quality by sub‐rating, mean and coefficient of variation of the waiting time of handoff calls. In numerical results, the analytical results are compared with the simulation ones to validate our analytical approach. Moreover, we compare the sub‐rating scheme with full‐rating one with respect to some characteristic values to show the effect of sub‐rating. Copyright © 2005 John Wiley & Sons, Ltd.     

On the performance of TCP over a TDD‐TD/CDMA architecture

This paper determines the performance of TCP when it is employed over a TDD‐TD/CDMA architecture which supports different classes of subscribers and adopts an interference‐driven admission control policy. The blocking and the outage probability of the system users are evaluated under various traffic conditions as well as the TCP throughput that data users experience. Call blocking and TCP throughput are determined by means of a semi‐analytical approach. This work shows that when TCP is taken into account, many options come out for the system design in order to optimize radio resources. Resource assignment in the TDD‐TD/CDMA system can then be done as a function of the actual radio link quality with the goal both to serve as many users as possible and to keep the TCP throughput as high as possible. Copyright © 2003 John Wiley & Sons, Ltd.     

Distributed timeslot allocation with crossed slots in CDMA‐TDD systems

Code division multiple access system with time division duplex (CDMA‐TDD) is a promising solution to cope with traffic asymmetry of downlink (DL) and uplink (UL) in multimedia services. When a rate of asymmetry is different in each cell, CDMA‐TDD system may employ crossed slots, where a timeslot is used for different links in cells. However, it may suffer from base station (BS)‐to‐BS and mobile station (MS)‐to‐MS interference problem. Zone division scheme is an efficient way to tackle the crossed slot interference by dividing a cell into inner and outer zones and restricting communication in crossed slots only to inner zone. In this paper, we propose distributed crossed slot resource allocation with zone division in multi‐cell CDMA‐TDD system. Two conditions for crossed slot resource allocation are defined and the bound on the size of inner zone is analyzed mathematically based on the conditions. Relationship between the capacity of crossed slot and the size of inner zone is also analyzed. Then, numerical results of the mathematical analysis are presented; showing that the proposed crossed slot allocation is effective for traffic asymmetry problem. Copyright © 2009 John Wiley & Sons, Ltd.     

Enabling seamless multimedia wireless access through QoS‐based bandwidth adaptation

Effective support of real‐time multimedia applications in wireless access networks, viz. cellular networks and wireless LANs, requires a dynamic bandwidth adaptation framework where the bandwidth of an ongoing call is continuously monitored and adjusted. Since bandwidth is a scarce resource in wireless networking, it needs to be carefully allocated amidst competing connections with different Quality of Service (QoS) requirements. In this paper, we propose a new framework called QoS‐adaptive multimedia wireless access (QoS‐AMWA) for supporting heterogeneous traffic with different QoS requirements in wireless cellular networks. The QoS‐AMWA framework combines the following components: (i) a threshold‐based bandwidth allocation policy that gives priority to handoff calls over new calls and prioritizes between different classes of handoff calls by assigning a threshold to each class, (ii) an efficient threshold‐type connection admission control algorithm, and (iii) a bandwidth adaptation algorithm that dynamically adjusts the bandwidth of an ongoing multimedia call to minimize the number of calls receiving lower bandwidth than the requested. The framework can be modeled as a multi‐dimensional Markov chain, and therefore, a product‐form solution is provided. The QoS metrics—new call blocking probability (NCBP), handoff call dropping probability (HCDB), and degradation probability (DP)—are derived. The analytical results are supported by simulation and show that this work improves the service quality by minimizing the handoff call dropping probability and maintaining the bandwidth utilization efficiently. Copyright © 2006 John Wiley & Sons, Ltd.     

Admission control for variable spreading gain CDMA cellular system with imperfect power control and shadowing

Variable spreading gain (VSG) CDMA is the prime transmission scheme for supporting multiple services for the next generation cellular systems. As different services have different quality of service and data rate requirements, admission control is essential in safeguarding the performance of different services in VSG‐CDMA cellular systems in harsh wireless environment. In this paper, we propose an admission control scheme for multiple services VSG‐CDMA cellular system in a practical multi‐cell environment where there exist adverse effects due to imperfect power control and shadowing. Rather than with a fixed bound as in previous studies, the admission bound in our scheme is based on the probability distribution of total intra‐cell power (P_in) and other‐cell interference power (I_other). This is used to estimate the blocking probability by utilizing a simple and accurate approximation that incorporates the random nature of P_in and I_other. Evaluation of the impact of power control error to the mean and standard deviation of P_in and I_other, we performed and compared the blocking probability with fixed admission bound scheme in an integrated voice/data environment. Our work has enabled the calculation of the blocking probability and capacity of different mobility users having different power control errors under shadowing. Copyright © 2006 John Wiley & Sons, Ltd.     

Narrow‐band interference suppression in wavelet packets based multicarrier multicode CDMA overlay system

The wavelet packets based multicarrier (MC) multicode (MCD) code‐division multiple‐access (CDMA) transceiver consists of the MCD part, which ensures the transmission for high speed and flexible data rate; the MC part contributing to robustness to frequency‐selective fading and flexibility for handling multiple data rates; and wavelet packets (WPs) modulation technique, which contributes to the mitigation of the interference problems. As WPs have lower sidelobes compared with sinusoidal carriers, this system is very effective in reducing the problem of inter‐carrier interference. Of course, like any CDMA system, the system can suppress a given amount of interference. This paper considers an interference suppression scheme which will enhance the performance of the system. The receiver employs suppression filters to mitigate the effect of narrow‐band jammer interference. The framework for the system and the performance evaluation are presented in terms of the bit error rate and the outage probability over a Nakagami fading channel. Also, we investigate how the performance is influenced by various parameters, such as the number of taps of the suppression filter and the ratio of narrow‐band interference bandwidth to the spread‐spectrum bandwidth. Finally, the performance of the system is compared with the performance of sinusoidal based MC/MCD‐CDMA system denoted Sin‐MC/MCD‐CDMA. Copyright © 2012 John Wiley & Sons, Ltd.     

Cognitive radio CDMA networking with spectrum sensing

In this paper, the performance of cognitive radio (CR) code division multiple access (CDMA) systems is analyzed. More precisely, CR users belong to a cognitive radio network (CRN), which coexists with a primary radio network (PRN). Both CRN and PRN are CDMA‐based, with colocated base stations. Soft hand off and power control are considered in both the CRN and the PRN. Upon the development of an accurate simulator for a representative three‐cell cellular scenario, we evaluate the performance of the proposed CR system in terms of outage probability, blocking probability and average data rate of secondary users. Three different spectrum sensing techniques are. Two new schemes, based on interference limit, are proposed and compared with an existing adaptive spectrum sensing scheme. Spectrum activity measurements and spectrum sharing decisions have been considered for evaluating the performance of the three schemes. The paper proposes a new CR‐CDMA networking model and a simulation testbed for evaluating performances of secondary users and primary users in terms of outage, blocking, BER and average data rate in the presence of soft hand‐off and power control. For comparison purposes, the analysis in the absence of spectrum sensing is also investigated.Copyright © 2012 John Wiley & Sons, Ltd.     

Performance analysis of MC‐CDMA by employing the MMSE‐PIC scheme in wireless communications

From the past decade, the multicarrier code division multiple access (MC‐CDMA) transmission schemes have placed major role in wireless communications. It is providing a secured wireless communication to the users with guaranteed performance. In many situations, the performance of the MC‐CDMA is restricted due to the interference caused by multiple access interference (MAI), which also influences the frameworks of CDMA. To overcome this issue, we concentrated on developing the efficient technique for data transmission with interference cancellation for downlink MC‐CDMA. In the proposed method, the interference cancellation procedure is done by using the regeneration and subtraction of MAI from the signal. The simulation results are evaluated using the MC‐CDMA system with different decision functions. Results proved that the proposed system is efficient in reducing the MAI along with an improved bit error rate (BER).     

Design and Analysis of a Channel Assignment Scheme for CDMA/TDMA Mobile Networks

In this paper, a channel assignment scheme is proposed for use in CDMA/TDMA mobile networks carrying voice and data traffic. In each cell, three types of calls are assumed to compete for access to the limited number of available channels by the cell: new voice calls, handoff voice calls, and data calls. The scheme uses the movable boundary concept in both the code and time domains in order to guarantee the quality of service (QoS) requirements of each type. A traditional Markov analysis method is employed to evaluate the performance of the proposed scheme. Measures, namely, the new call blocking probability, the handoff call forced termination probability, the data call loss probability, the expected number of handoff and the handoff link maintenance probability are obtained from the analysis. The numerical results, which are validated by simulation, indicate that the scheme helps meet the QoS requirements of the different call types.     

On multi‐cell admission control in CDMA networks

We consider a multi‐cell (MC) code division multiple access (CDMA) system that supports multiple service classes, including peak rate allocated and elastic ones. Peak rate allocated sessions—when admitted into the system—transmit at a constant bit rate, while elastic sessions can be slowed down at the expense of increasing their residency time. Admitted sessions cause an instantaneous bit rate‐dependent interference in neighbour cells. In this rather general setting, we propose a method to calculate the class‐wise blocking probabilities as the functions of the estimated so‐called inter‐cell coupling factors. In the paper this coupling factor is the ratio between the uplink path gains to different Node‐B:s (that can be easily obtained in a CDMA system from pilot measurement reports), but our model could include other coupling measures as well. We find that when these coupling factors are underestimated, the system may get into false states (FSs) or false rate states (FRSs) that lead to violating the noise rise threshold. As traffic becomes increasingly elastic, the probability of FSs decreases, but the probability of FRSs increases. Based on numerical results, we make the point that as the traffic becomes more elastic, avoiding the underestimation of these coupling factors as well as exercising MC admission control plays an increasingly important role in guaranteeing proper service quality. Copyright © 2007 John Wiley & Sons, Ltd.     

Optimizing the QoS of high speed moving terminals in cellular networks

This paper presents a dynamic guard channel assignment technique based on a two‐layer cellular architecture which optimizes the blocking probability performance of high‐speed moving terminals (HSMT) and handoff calls of low‐speed moving terminals (LSMT), in a congested urban area. The lower layer of the proposed architecture is based on a microcellular solution, for absorbing the traffic loads of LSMT. The higher layer is based on a macro‐cell umbrella solution, for absorbing the traffic load of the HSMT. The results show that using the optimum number of channels and adjusting dynamically the number of guard channels in each layer, the blocking probability of the HSMT and the handoff blocking probability of LSMT is optimized having the minimum bad effect on the new call blocking probability of LSMT. Copyright © 2003 John Wiley & Sons, Ltd.     

On feasibility examination of DS‐CDMA systems with imperfect successive interference cancellation

In DS‐CDMA systems with the successive interference cancellation (SIC) technique, there are K! possible decoding orders for K active users and the decoding order has considerable impact on system performance. Once the constraints on the received powers of mobile stations and the bit‐energy‐to‐interference‐power‐spectral‐density ratio requirements are satisfied under some decoding order of SIC, the system is feasible. Otherwise, if the constraints are violated under all possible decoding orders, the system is infeasible. It is highly time‐consuming to examine the system feasibility directly by using the usual exhaustive search method (ESM) for a system with even moderate number of users. In this paper, we propose an efficient approach for examining the feasibility of DS‐CDMA systems with imperfect SIC. The proposed approach has significantly lower computational complexity than that of ESM and thus benefits the quick decisions of admission control and/or scheduling, which are essential for Quality of Service provisioning in DS‐CDMA systems. Furthermore, we theoretically prove that the system under the resultant decoding order obtained by the proposed approach is able to achieve the lowest outage probability among all possible decoding orders. We conduct extensive simulation experiments, and the numerical results validate our analysis and demonstrate the effectiveness of our approach. Copyright © 2010 John Wiley & Sons, Ltd.     

Spreading‐code‐dependent bit error rate and capacity analysis for finite asynchronous CDMA systems

Most CDMA systems serve only finite number of active users. Therefore, using Gaussian approximation to evaluate its performance is inappropriate. In such finite CDMA systems, the selection of spreading codes is of great importance because its performance is very much spreading‐code‐dependent. In this paper, a new algorithm based on multiple variable Bernoulli process is introduced to evaluate bit error rate due to co‐channel interference and thus the capacity of a CDMA system. The algorithm can also be used for large‐sized CDMA systems. The results show that small Kasami and Gold‐like codes offer higher capacity than the others do. Copyright © 1999 John Wiley & Sons, Ltd.     

Analysis of multi‐user detection of multi‐rate transmissions in multi‐cellular CDMA

In this paper, we address the issue of multi‐user receiver design in realistic multi‐cellular and multi‐rate CDMA systems based on performance analysis. We consider the multi‐user detection (MUD) technique, denoted interference subspace rejection (ISR), because it offers a wide range of canonic suppression modes that range in performance and complexity between interference cancellers and linear receivers. To further broaden our study, we propose a modified ISR scheme called hybrid ISR to cope better with multi‐rate transmissions. The performance analysis, which is based on the Gaussian assumption (GA) and validated by simulations, takes into account data estimation errors, carrier frequency mismatch, imperfect power control, identification errors of time‐varying multipath Rayleigh channels and intercell interference. This analysis enables us to optimize the selection of the MUD mode for multi‐rate transmissions in different operating conditions. The effectiveness of interference cancellation is indeed investigated under different mobile speeds, numbers of receiving antennas, near‐far situations, channel estimation errors, and out‐cell to in‐cell interference ratios. This investigation suggests that the out‐of‐cell interference, the residual in‐cell interference, the noise enhancement as well as low mobility favor the simplest MUD modes as they offer the best performance/complexity tradeoffs. Copyright © 2008 John Wiley & Sons, Ltd.     

Soft handoff algorithm with variable thresholds in CDMA cellularsystems

Traffic nonuniformity degrades the performance of CDMA cellular systems. The authors present a new algorithm called the variable threshold soft handoff (VTSH) which reduces the performance degradation due to traffic nonuniformity in CDMA cellular systems. Unlike the conventional fixed handoff thresholds, the proposed algorithm allows the handoff thresholds (T ADD and T DROP) to vary dynamically according to the traffic density of each cell. This algorithm has been implemented by means of computer simulation and the results show that VTSH improves the overall CDMA system performance in terms of outage probability. The VTSH algorithm can easily be applied to CDMA cellular systems without any modification     

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.     

An adaptive channel preemption model for small‐cell embedded large‐cellular networks

In this paper, we present an analytical model of adaptive channel preemption (ACP) for small‐cell embedded large‐cellular (SCELC) networks. An SCELC network consists of a fixed base station (FBS) with large coverage and many embedded base stations (EBS) with relatively small coverage. Channel capacity in an FBS cell may become insufficient when traffic is unexpectedly increased particularly in some special occasion. This paper considers two aspects of dynamically allocating channels for an SCELC network. First, by increasing one or more EBS cells within an FBS cell, the proposed ACP can reduce blocking probability of new calls. Second, to reduce dropping probability of handoff calls, the proposed ACP allows a handoff call to preempt an on‐going call, when the latter is located in an EBS cell or in the overlapping area of two adjacent FBS cells. For the purpose of performance evaluation, we build an analytical model with 4‐tuple Markov chains. Numerical results reveal that embedding one or more EBS cells inside an FBS cell needs to be done carefully since it results in a tradeoff between the reduction of new‐call blocking probability and the increase of handoff‐call dropping probability. Copyright © 2011 John Wiley & Sons, Ltd.