A call admission control scheme for packet data in CDMA cellular communications

In wireless cellular communication systems, call admission control (CAC) is to ensure satisfactory services for mobile users and maximize the utilization of the limited radio spectrum. In this paper, we propose a new CAC scheme for a code division multiple access (CDMA) wireless cellular network supporting heterogeneous self-similar data traffic. In addition to ensuring transmission accuracy at the bit level, the CAC scheme guarantees service requirements at both the call level and the packet level. The grade of service (GoS) at the call level and the quality of service (QoS) at the packet level are evaluated using the handoff call dropping probability and the packet transmission delay, respectively. The effective bandwidth approach for data traffic is applied to guarantee QoS requirements. Handoff probability and cell overload probability are derived via the traffic aggregation method. The two probabilities are used to determine the handoff call dropping probability, and the GoS requirement can be guaranteed on a per call basis. Numerical analysis and computer simulation results demonstrate that the proposed CAC scheme can meet both QoS and GoS requirements and achieve efficient resource utilization.     

Jointly optimal power and admission control for delay sensitive traffic in CDMA networks with LMMSE receivers

Quality-of-service (QoS) guarantees for multiclass code division multiple access networks are provided by means of cross-layer optimization across the physical and network layers. At the physical layer, the QoS requirements are specified in terms of a target signal-to-interference ratio (SIR) requirement, and optimal target powers are dynamically adjusted according to the current number of users in the system. At the network layer, the QoS requirements are the blocking probabilities and the call connection delays. The network layer guarantees that both physical layer and network layer QoS are met by employing admission control. An optimal admission control policy is proposed based on a semi-Markov decision process formulation. The tradeoff between blocking and delay is discussed for various buffer configurations. The advantage of advanced signal processing receivers is established using a comparative capacity analysis and simulation with the classical scenario in which the system uses matched filter receivers.     

Efficient channel utilization for real-time video in OVSF-CDMA systems with QoS assurance

In this paper, the utilization of real-time video service in the downlink of an orthogonal variable spreading factor code division multiple access (OVSF-CDMA) system is studied. By modeling the video traffic and wireless channel as a joint Markov modulated process, and properly partitioning the states of the Markov process, an adaptive rate allocation scheme is proposed for real-time video transmission with quality of service provisioning while achieving high channel utilization. The scheme is applicable for packet switching and frame-by-frame real-time video transmission, and incorporates both the physical layer and network layer characteristics. For QoS provisions, the closed form expressions of packet delay and loss probability are derived based on the Markov model. Analytical and simulation results demonstrate that the proposed scheme can significantly improve the channel utilization over the commonly used effective bandwidth approach.     

QoS-, Queue-and Channel-Aware Packet Scheduling for Multimedia Services in Multiuser SDMA/TDMA Wireless Systems

With the growing demand for wireless multimedia services and continuing emergence of new multimedia applications, it is necessary for the network to provide various levels of quality of service (QoS) while maximizing the utilization of channel resources. This paper presents an adaptive queuing model and a novel cross-layer packet scheduling algorithm for providing differentiated QoS and effective channel utilization in a space-division-multiple-access/time-division-multiple-access (SDMA/TDMA) system. At the medium access control (MAC) layer, we take into consideration the heterogeneous and bursty nature of multimedia traffic and provide for QoS requirements. At the physical (PHY) layer, we exploit the randomness of the physical channel by incorporating opportunistic scheduling and adopting adaptive modulation and coding (AMC). Performance results obtained by simulations show that by employing the proposed queuing model and packet scheduling algorithm, the system is able to provide for diverse QoS and achieve high throughput.     

QoS-Based Admission and Load Control Algorithm for Integrated Voice/Data Services over Wideband CDMA

In order to maximize the system capacity in third generation wireless system, efficient call admission and load control algorithms are required to handle the different services having diverse traffic patterns and Quality of Service (QoS) requirements. We propose an admission and load control algorithm that considers the network loading information, propagation conditions, and the interference level. The algorithm takes advantage of the new features of third-generation (3G) wireless system such as the reported pilot measurements, auxiliary pilot for smart antennas, and variable spreading gain. Dynamic resource allocation is employed to scale the amount of the assigned radio resources taking the network loading conditions and channel characteristics into consideration. The results show that integrating the voice service and the data service with high transmission rate (>144 Kbps) can be realized using efficient resource management.     

Delivering QoS requirements to traffic with diverse delaytolerances in a TDMA environment

The focus of this paper is on determining the call admission region and scheduling policies for a time-division multiple-access (wireless) system supporting heterogeneous real-time variable bit rate applications with distinct quality of service (QoS) requirements and traffic characteristics. The QoS is defined in terms of a maximum tolerable packet delay and dropping probability. A packet is dropped if it experiences excess delay. The call admission region is established for policies that are work-conserving (WC) and that satisfy the earliest due date (EDD) service criterion (WC-EDD policies). Such policies are known to optimize the overall system performance. In addition to the determination of the call admission region, this study leads also to the construction of scheduling policies that deliver any performance in the region established for WC-EDD policies. Finally, an upper bound on the call admission region that can be achieved under any policy (not limited to the WC-EDD policies) is determined     

Optimal Joint Session Admission Control in Integrated WLAN and CDMA Cellular Networks with Vertical Handoff

This paper considers optimizing the utilization of radio resources in a heterogeneous integrated system consisting of two different networks: a wireless local area network (WLAN) and a wideband code division multiple access (CDMA) network. We propose a joint session admission control scheme for multimedia traffic that maximizes overall network revenue with quality of service (QoS) constraints over both the WLAN and the CDMA cellular networks. The WLAN operates under the IEEE 802.11e medium access control (MAC) protocol, which supports QoS for multimedia traffic. A novel concept of effective bandwidth is used in the CDMA network to derive the unified radio resource usage, taking into account both physical layer linear minimum mean square error (LMMSE) receivers and characteristics of the packet traffic. Numerical examples illustrate that the network revenue earned in the proposed joint admission control scheme is significantly larger than that when the individual networks are optimized independently with no vertical handoff between them. The revenue gain is also significant over the scheme in which vertical handoff is supported, but admission control is not done jointly. Furthermore, we show that the optimal joint admission control policy is a randomized policy, i.e., sessions are admitted to the system with probabilities in some states     

Power control and channel allocation for real‐time applications in cellular networks

The next‐generation packet‐based wireless cellular network will provide real‐time services for delay‐sensitive applications. To make the next‐generation cellular network successful, it is critical that the network utilizes the resource efficiently while satisfying quality of service (QoS) requirements of real‐time users. In this paper, we consider the problem of power control and dynamic channel allocation for the downlink of a multi‐channel, multi‐user wireless cellular network. We assume that the transmitter (the base‐station) has the perfect knowledge of the channel gain. At each transmission slot, a scheduler allots the transmission power and channel access for all the users based on the instantaneous channel gains and QoS requirements of users. We propose three schemes for power control and dynamic channel allocation, which utilize multi‐user diversity and frequency diversity. Our results show that compared to the benchmark scheme, which does not utilize multi‐user diversity and power control, our proposed schemes substantially reduce the resource usage while explicitly guaranteeing the users' QoS requirements. Copyright © 2007 John Wiley & Sons, Ltd.     

Joint connection level, packet level, and link Layer resource allocation for variable bit rate multiclass services in cellular DS-CDMA networks with QoS constraints

An approximate analytical formulation of the resource allocation problem for handling variable bit rate multiclass services in a cellular direct sequence code-division multiple-access (DS-CDMA) system is presented. The novelty in this paper is that all grade-of-service (GoS) or quality-of-service (QoS) requirements at the connection level, packet level, and link layer are satisfied simultaneously, instead of being satisfied at the connection level or at the link layer only. The analytical formulation shows how the GoS/QoS in the different layers are intertwined across the layers. A complete sharing (CS) scheme with guard channels is used for the resource sharing policy at the connection level. The CS model is solved using a K-dimensional Markov chain. Numerical results illustrate that significant gain in system utilization is achieved through the joint coupling of connection/packet levels and link layer. This can translate to more revenues for network providers and/or lower charges for mobile users.     

Radio resource management for cellular CDMA systems supporting heterogeneous services

A novel radio resource management (RRM) scheme for the support of packet-switched transmission in cellular CDMA systems is proposed by jointly considering the physical, link, and network layer characteristics. The proposed resource management scheme is comprised of a combination of power distribution, rate allocation, service scheduling, and connection admission control. Power distribution allows individual connections to achieve their required signal-to-interference-plus-noise ratio, while rate allocation guarantees the required delay/jitter for real-time traffic and the minimum transmission rate requirement for non-real-time traffic. Efficient rate allocation is achieved by making use of the randomness and burstiness; of the packet generation process. At the link layer, a packet scheduling scheme is developed based on information derived from power distribution and rate allocation to achieve quality of service (QoS) guarantee. Packet scheduling efficiently utilizes the system resources in every time slot and improves the packet throughput for non-real-time traffic. At the network layer, a connection admission control (CAC) scheme based on the lower layer resource allocation information is proposed. The CAC scheme makes use of user mobility information to reduce handoff connection dropping probability (HCDP). Theoretical analysis of the grade of service performance, in terms of new connection blocking probability, HCDP, and resource utilization, is given. Numerical results show that the proposed RRM scheme can achieve both effective QoS guarantee and efficient resource utilization.     

Optimal call admission control under packet and call level QoS constraints and effect of buffering

For a single network switch allocating link bandwidth to connections of a single class, an optimal call admission control (CAC) policy is found by the solution of a linear programming (LP) problem. Our optimization differs from previous work in that we include the effect of an output buffer in the switch for the temporary storage of packets bound for transmittal across the link. We find a policy that is optimal in the sense of minimizing call blocking subject to a packet level quality of service (QoS) requirement that limits the packet loss ratio. Such a policy's call blocking probability, if it is small enough to satisfy a call level QoS requirement, then establishes the feasibility of satisfying both the packet and call level QoS requirements for a given call request rate. We show with a previously described example that the addition of even a small output buffer can significantly increase the range of call request rates for which there exists a feasible policy, i.e. one that satisfies both QoS requirements. Also presented is an upper bound, valid for any fixed buffer size, on the range of call request rates for which there exists a feasible CAC policy. Copyright © 2003 John Wiley & Sons, Ltd.     

Policy‐based scanning with QoS support for seamless handovers in wireless networks

Supporting seamless handovers between different wireless networks is a challenging issue. One of the most important aspects of a seamless handover is finding a target network and point of attachment (PoA). This is achieved by performing a so‐called channel scanning. In most handovers, such as between universal mobile telecommunications system (UMTS), wireless local area network (WLAN), and worldwide interoperability for microwave access (WiMAX), channel scanning causes severe service disruptions with the current PoA and degrades the quality of service (QoS) during the handover. In this paper, a new architecture for QoS supported scanning that can be generalized to different wireless networks is proposed. It employs two techniques. The first is for determining a policy‐based order for the channel scanning sequence. With this technique, depending on the network costs and user requirements, the policy engine determines the channel scanning order for different network types and sets up a scanning sequence of PoAs for a given network type. This policy‐based scanning order provides a faster discovery of the target PoA that meets the QoS demands of the user. The second technique consists of a QoS supported dynamic scanning algorithm where the scanning frequency and duration are determined based on the user QOS requirements. Most importantly, the scanning duration is scheduled to guarantee the user QoS requirements while the scan progresses. Simulation results show that the proposed mechanism achieves relatively short service disruptions and provides the desired quality to users during the scanning period. Copyright © 2009 John Wiley & Sons, Ltd.     

Resource allocation for multiple classes of DS-CDMA traffic

We consider a packet data direct-sequence code-division multiple-access (DS-CDMA) system which supports integrated services. The services are partitioned into different traffic classes according to information rate (bandwidth) and quality of service (QoS) requirements. Given sufficient bandwidth, QoS requirements can be satisfied by an appropriate assignment of transmitted power and processing gain to users in each class. The effect of this assignment is analyzed for both a single class of data users and two classes of voice and data users. For a single class of data users, we examine the relationship between average delay and processing gain, assuming that ARQ with forward error correction is used to guarantee reliability. The only channel impairment considered is interference, which is modeled as Gaussian noise. A fixed user population is assumed and two models for generation of data packets are considered: (1) each user generates a new packet as soon as the preceding packet is successfully delivered and (2) each user generates packets according to a Poisson process. In each case, the packets enter a buffer which is emptied at the symbol rate. For the second traffic model, lowering the processing gain below a threshold can produce multiple operating points, one of which corresponds to infinite delay. The choice of processing gain which minimizes average delay in that case is the smallest processing gain at which multiple operating points are avoided. Two classes of users (voice/data and two data classes) are then considered. Numerical examples are presented which illustrate, the increase in the two-dimensional (2-D) capacity region achievable by optimizing the assignment of powers and processing gains to each class     

Cross‐layer and cognitive QoS management system for next‐generation networking

Owing to limited wireless network resources, network applications must provide an adaptive quality‐guaranteed service to satisfy user requirements. Different applications are associated with different quality of service (QoS) concerns, as well as different QoS control parameters. This work presents an adaptive QoS algorithm by discussing the QoS specifications of three wireless access technologies, i.e. 3G, WiMAX and WiFi. Based on cross‐layer and cognition concepts, these environmental parameters are integrated with the sensing of spectral and received signal strength from a cognitive radio paradigm. An adaptive QoS algorithm is then proposed to select the optimal access network for services. Simulation results indicate that the proposed adaptive QoS algorithm outperforms available ones in real‐time applications. Compared with traditional algorithms, the proposed algorithm reduces not only the average delay time and jitter for VoIP services to 0.16 s and 0.09 ms, respectively, but also the packet loss ratio for high‐definition video streaming by 3.4%. Copyright © 2011 John Wiley & Sons, Ltd.     

Time-varying fair queueing scheduling for multicode CDMA based on dynamic programming

Fair queueing (FQ) algorithms, which have been proposed for quality of service (QoS) wireline/wireless networking, rely on the fundamental idea that the service rate allocated to each user is proportional to a positive weight. Targeting wireless data networks with a multicode CDMA-based physical layer, we develop FQ with time-varying weight assignment in order to minimize the queueing delays of mobile users. Applying dynamic programming, we design a computationally efficient algorithm which produces the optimal service rates while obeying 1) constraints imposed by the underlying physical layer and 2) QoS requirements. Furthermore, we study how information about the underlying channel quality can be incorporated into the scheduler to improve network performance. Simulations illustrate the merits of our designs.     

Achievable QoS in an interference/resource limited shared wirelesschannel

In this work, the region of achievable quality-of-service (QoS) is precisely described for a system of real-time heterogeneous variable bit rate (VBR) sources competing for slots (packet transmission times) of a time division multiple access (TDMA) frame. The QoS for each application is defined in terms of a maximum tolerable packet-dropping probability. Packets may be dropped due to delay violations and channel induced errors. The region of achievable QoS is precisely described for an interference/resource limited network by considering the underlying TDMA-multiple access control (TDMA-MAC) structure and the physical channel. A simple QoS-sensitive error-control protocol that combats the effects of the wireless channel while satisfying the real-time requirements is proposed and its impact on the region of achievable QoS is evaluated. The results presented here clearly illustrate the negative impact of a poor channel and the positive impact of the employed error-control protocol on the achievable QoS. The region of achievable QoS vectors is central to the call admission problem, and in this work, it is used to identify a class of scheduling policies capable of delivering any achievable performance     

Next Generation Wireless Mobile System Efficient, Fair, Class Based Packet Scheduling Algorithm

Efficient utilization of network resources is a key goal for emerging broadband wireless access systems (BWAS). This is a complex goal to achieve due to the heterogeneous service nature and diverse quality of service (QoS) requirements of various applications that BWAS support. Packet scheduling is an important activity that affects BWAS QoS outcomes. This paper proposes a novel packet scheduling mechanism that improves QoS in mobile wireless networks which exploit IP as a transport technology for data transfer between BWAS base stations and mobile users at the radio transmission layer. In order to improve BWAS QoS the new packet algorithm makes changes at both the IP and the radio layers. The new packet scheduling algorithm exploits handoff priority scheduling principles and takes into account buffer occupancy and channel conditions. The packet scheduling mechanism also incorporates the concept of fairness. Performance results were obtained by computer simulation and compared to the well known algorithms. Results show that by exploiting the new packet scheduling algorithm, the transport system is able to provide a low handoff packet drop rate, low packet forwarding rate, low packet delay and ensure fairness amongst the users of different services.     

IPv6-based dynamic coordinated call admission control mechanism over integrated wireless networks

Many wireless access systems have been developed recently to support users mobility and ubiquitous communication. Nevertheless, these systems always work independently and cannot simultaneously serve users properly. In this paper, we aim to integrate IPv6-based wireless access systems and propose a coordinated call admission control mechanism to utilize the total bandwidth of these systems to minimize the call blocking probabilities, especially the handoff call dropping probabilities. First, we propose an integrated hierarchical wireless architecture over IPv6-based networks to combine the wireless access systems including cellular systems (second-generation, General Packet Radio Service, or third-generation), IEEE 802.11 a/b/g WLAN, and Bluetooth. In the proposed architecture, mobile user can request a call with quality-of-service (QoS) requirements by any wireless network interfaces that can be accessed. When the proposed coordinated call admission control (CCAC) mechanism receives a request, it takes the QoS requirements of the incoming call and the available and reserved bandwidth of this wireless system into consideration to accept or reject this request. Besides, the mechanism can coordinate with other wireless systems dynamically to adjust the bandwidth reserved for handoff calls at each wireless system in this architecture so as to reduce the call blocking probabilities. Once the call is admitted, the mobile user is able to access heterogeneous wireless access networks via multiple interfaces simultaneously. Finally, we evaluate this system to show that the CCAC on the proposed architecture outperforms other mechanisms proposed before.     

The extended connection‐dependent threshold model for call‐level performance analysis of multi‐rate loss systems under the bandwidth reservation policy

Firstly, we reviewed two extensions of the Erlang multi‐rate loss model, whereby we can assess the call‐level QoS of telecom networks supporting elastic traffic: (i) the extended Erlang multi‐rate loss model, where random arriving calls of certain bandwidth requirements at call setup can tolerate bandwidth compression while in service; and (ii) the connection‐dependent threshold model, where arriving calls may have several contingency bandwidth requirements, whereas in‐service calls cannot tolerate bandwidth compression. Secondly, we proposed a new model, the extended connection‐dependent threshold model. Calls may have alternative bandwidth requirements at call setup and can tolerate bandwidth compression while in service. We proposed a recurrent formula for the efficient calculation of link occupancy distribution and consequently call blocking probabilities, link utilization, and throughput per service class. Furthermore, in the proposed model, we incorporated the bandwidth reservation policy, whereby we can (i) equalize the call blocking probabilities of different service classes, (ii) guarantee specific QoS per service class, and (iii) implement different maximum bandwidth compression/expansion rate per service class so that the network supports both elastic and stream traffic. The accuracy of the new model is verified by simulation. Moreover, the proposed model performs better than the existing models. Finally, we generalize the proposed model by incorporating service classes with either random or quasi‐random arrivals. Copyright © 2011 John Wiley & Sons, Ltd.