QoS-oriented access control for 4G mobile multimedia CDMA communications (original) (raw)
Related papers
QoS-oriented packet scheduling for wireless multimedia CDMA communications
IEEE Transactions on Mobile Computing, 2004
In the third-generation (and beyond) wireless communication systems, there will be a mixture of different traffic classes, each having its own transmission rate characteristics and quality-of-service (QoS) requirements. In this paper, a QoS-oriented medium access control (MAC) protocol with fair packet loss sharing (FPLS) scheduling is proposed for wireless code-division multiple access (CDMA) communications. The QoS parameters under consideration are the transmission bit error rate (BER), packet loss, and delay requirements. The MAC protocol exploits both time-division and code-division statistical multiplexing. The BER requirements are guaranteed by properly arranging simultaneous packet transmissions and controlling their transmit power levels, whereas the packet loss and delay requirements are guaranteed by proper packet scheduling. The basic idea of FPLS is to schedule the transmission of multimedia packets in such a way that all the users have a fair share of packet loss according to their QoS requirements, which maximizes the number of the served users under the QoS constraints. Simulation results demonstrate effectiveness of the FPLS scheduler, in comparison with other previously proposed scheduling algorithms.
Resource Allocation in Multimedia CDMA Communication Systems
The future wireless communication systems are expected to support a broad range of multimedia services to mobile users with guaranteed quality-of-service (QoS). With the increasing demands for wireless services, the available frequency bandwidth of the systems is very limited and should be used efficiently. In this paper, we consider a wireless code-division multiple access (CDMA) system and develop an algorithm to allocate system resources to multimedia users for QoS provisioning and for high resource utilization. We propose a medium access control (MAC) protocol which exploits both time-division and code-division multiplexing. The MAC protocol uses fair packet loss sharing (FPLS) scheduling to guarantee the QoS requirements. The FPLS scheduler uses the information of traffic rate distribution and QoS requirements of the users to assign priorities to the users and determines an efficient accommodation of the packets in the time slots of each frame, so that the number of the served ...
QoS based fair resource allocation in multi-cell TD/CDMA communication systems
IEEE Transactions on Wireless Communications, 2006
In a wireless multimedia code division multiple access (CDMA) system, the resources in terms of transmission rate and power should be efficiently distributed to each user to guarantee its quality-of-service (QoS) requirements. In this paper, a resource allocation algorithm which combines packet scheduling and power assignment is proposed to achieve efficient resource utilization under QoS constraints. The packet scheduling is based on the fair packet loss sharing (FPLS) principle, and the power assignment is determined by the received power limited (RPL) scheme. The basic idea of FPLS is to schedule the transmission of multimedia packets in such a way that all the users have a fair share of packet loss according to their QoS requirements, which maximizes the number of the served users with QoS satisfaction. The RPL scheme minimizes the received power for each packet. Given the propagation path loss, it in turn minimizes the transmitted power as well. The intercell interference from the scheduled packets is also limited in order to increase the system capacity.
A Power-Allocation-Combined Scheduling Algorithm for CDMA-Based High-Rate Packet Data Systems
Lecture Notes in Computer Science, 2004
In CDMA-based packet data systems such as HDR and HS-DPA which are designed to support high rate services, BSs transmit data packets with a maximum power based on time multiplexing mode such that only one user can be serviced at a time. In this paper, we propose a power-allocation-combined scheduling algorithm for HDR-like systems in which we adopt a code division multiplexing (CDM) transmission method in the downlink common channel in order to utilize channel orthogonality such that we can serve more than one user at a time slot specially when there exist remaining resources after serving the firstly selected user by the scheduler. Simulation results show that the proposed scheme outperforms the conventional scheme as the traffic load increases. 1 Introduction CDMA-based high-rate packet data systems, called as the 3.5 th generation CDMA systems beyond IMT-2000, such as HDR and HSDPA adopt common shared channels in the forward link in order to provide a high bit rate packet data service and an improved throughput. For example, HDR systems adopt the forward packet data channel (FPDCH)[1] while HSDPA systems use the high speed downlink shared channel (HS-DSCH)[2]. These common shared channels are capable of supporting high bit rate by employing adaptive modulation and coding with Hybrid ARQ, turbo codes and transmit diversity. One of the most distinct features of these common shared channels however is to adopt rate adaptation and to service multiple packet data users based on time multiplexing mode. In addition, a mix of services with different requirements is expected to be serviced in the context of next generation CDMA systems. In order to support the quality of various services through the common shared channels, efficient MAC protocols are needed. More specially, it is expected that a scheduling algorithm among MAC protocols plays an important role in the common shared channels since it controls the allocation of the shared resources among users and to a large extent determines the overall behavior of the system. Recently, many works have been done regarding scheduling algorithm for common shared channels in order to increase total throughput and guarantee
A new MAC protocol ensuring the multimedia traffic QoS for CDMA networks
Wireless Personal Communications, 2003
This paper describes the CDMAC, a new Medium Access Control (MAC) protocol for multimedia traffic in CDMA wireless networks. The protocol intends to extract the maximum capacity and flexibility out of the CDMA scheme and at the same time guarantee the expected QoS of different service types. CDMAC is able to maintain QoS requirements thanks to the shaping, policing and traffic differentiation performed by the scheduler. Moreover, an iterative algorithm, applied at the beginning of each frame, is used to find the optimal power vector for all mobiles present in the system, which maximize the system capacity. The basic constraint of the capacity maximization process is that the BER QoS of each connection should be fulfilled. Finally a distributed implementation, feasible in a practical scenario, is presented.
A call admission control scheme for packet data in CDMA cellular communications
IEEE Transactions on Wireless Communications, 2000
In a wireless multimedia code division multiple access (CDMA) system, the resources in terms of transmission rate and power should be efficiently distributed to each user to guarantee its quality-of-service (QoS) requirements. In this paper, a resource allocation algorithm which combines packet scheduling and power assignment is proposed to achieve efficient resource utilization under QoS constraints. The packet scheduling is based on the fair packet loss sharing (FPLS) principle, and the power assignment is determined by the received power limited (RPL) scheme. The basic idea of FPLS is to schedule the transmission of multimedia packets in such a way that all the users have a fair share of packet loss according to their QoS requirements, which maximizes the number of the served users with QoS satisfaction. The RPL scheme minimizes the received power for each packet. Given the propagation path loss, it in turn minimizes the transmitted power as well. The intercell interference from the scheduled packets is also limited in order to increase the system capacity.
International Journal of Communication Systems, 2006
In this paper, we propose a combined Multi-Class Adaptive Connection Admission Control algorithm and a new fair packet scheduling policy, based on an Enhanced Weighted Fair Queuing algorithm. It takes into account a realistic behaviour of traffic while considering the spatial variation of the system characterizing both the user mobility and the signal propagation impairments due to the surrounding effects. The proposed allocation scheme provides enhanced traffic performance in heterogeneous environments and achieves a good level of capacity gain. The new adaptive QoS oriented CAC function is proposed to meet the rapidly increasing demand for providing multimedia services with diversified quality requirements. It decides whether the connection request is to be admitted into the system, on the basis of the generated interference level and the waiting time before access. This CAC scheme, based on service class differentiation, aims at maximizing the use of available radio resource and meeting the QoS requirement of higher priority users as much as possible while maintaining the minimum requirements of lower priority users, especially when the system suffers from congestion.
Eurasip Journal on Wireless Communications and Networking, 2009
Designing scheduling algorithms at the medium access control (MAC) layer relies on a variety of parameters including quality of service (QoS) requirements, resource allocation mechanisms, and link qualities from the corresponding layers. In this paper, we present an efficient cross-layer scheduling scheme, namely, Adaptive Token Bank Fair Queuing (ATBFQ) algorithm, which is designed for packet scheduling and resource allocation in the downlink of OFDMA-based wireless 4G networks. This algorithm focuses on the mechanisms of efficiency and fairness in multiuser frequency-selective fading environments. We propose an adaptive method for ATBFQ parameter selection which integrates packet scheduling with resource mapping. The performance of the proposed scheme is compared to that of the round-robin (RR) and the score-based (SB) schedulers. It is observed from simulation results that the proposed scheme with adaptive parameter selection provides enhanced performance in terms of queuing delay, packet dropping rate, and cell-edge user performance, while the total sector throughput remains comparable. We further analyze and compare achieved fairness of the schemes in terms of different fairness indices available in literature.
Dynamic resource scheduling for variable QoS traffic in W-CDMA
1999 IEEE International Conference on Communications (Cat. No. 99CH36311)
Abstmct-W-CDMA is the strongest candidate as the air interface technology of the third generation mobile communication systems, which are expected to support multimedia services with QoS requirements. In this paper, we review the W-CDMA technology and consider the issues in multimedia support. We propose the dynamic resource scheduling mechanism for QoS provisioning in W-CDMA through optimal power assignment and code hopping. Our framework is able to carry variable QoS multimedia traffic, efficiently serving a wide range of classes with CBR, VBR, ABR and UBR characteristics. Dynamic resource scheduling improves capacity and throughput performance. Other advantages are power saving and faster convergence to the desired power level.