Performance Analysis of Adaptive Rate Scheduling Scheme for 3G WCDMA Wireless Networks with Multi-Operators

Sharing of 3G network infrastructure among operators offers an alternative solution to reducing the investment in the coverage phase of WCDMA. For radio access network (RAN) sharing method each operator has its own core network and only the RAN is shared. Without an efficient RRM, one operator can exhausts the capacity of others. This paper proposes and analyzes an efficient uplink-scheduling scheme in case of RAN sharing method. We refer to this new scheme as Multi-operators Code Division Generalized Processor sharing scheme (M-CDGPS). It employs both adaptive rate allocation to maximize the resource utilization and GPS techniques to provide fair services for each operator. The performance analysis of this scheme is derived using the GPS performance model. Also, it is compared with static rate M-CDGPS scheme. Numerical and simulation results show that the proposed adaptive rate MCDGPS scheduling scheme improves both system throughput and average delays

Performance Analysis of Adaptive Rate Scheduling Scheme for 3G WCDMA Wireless Networks with Multi-Operators

Sharing of 3G network infrastructure among operators offers an alternative solution to reducing the investment in the coverage phase of WCDMA. For radio access network (RAN) sharing method each operator has its own core network and only the RAN is shared. Without an efficient RRM, one operator can exhausts the capacity of others. This paper proposes and analyzes an efficient uplink-scheduling scheme in case of RAN sharing method. We refer to this new scheme as Multi-operators Code Division Generalized Processor sharing scheme (M-CDGPS). It employs both adaptive rate allocation to maximize the resource utilization and GPS techniques to provide fair services for each operator. The performance analysis of this scheme is derived using the GPS performance model. Also, it is compared with static rate M-CDGPS scheme. Numerical and simulation results show that the proposed adaptive rate MCDGPS scheduling scheme improves both system throughput and average delays

CPLD-PGPS scheduler in wireless OFDM systems

In this paper, we propose a new scheduler for orthogonal frequency-division multiplexing (OFDM) wireless communication systems, called Channel-Condition and Packet-Length Dependent Packet Generalized Processor Sharing (CPLD-PGPS) scheduler. Based on PGPS, the CPLD scheduler considers both the physical channel condition and the length of packets, and optimally allocates the sub-carriers to different users. The total transmit power is adaptively allocated to each subcarrier. With this scheduler, the system can achieve better system BER performance, and correspondingly superior PER performance. The system throughput is improved, the required bandwidth is guaranteed, and long term fairness for all traffic in the system is provided. In order to reduce the complexity, a simplified algorithm is proposed, which maintains the system throughput as in the original scheduler, and guarantees the system performance with properly set system parameters. The superior performance of the proposed schedulers is demonstrated by simulation with multimedia traffic. © 2006 IEEE.published_or_final_versio

GAME THEORETIC APPROACH TO RADIO RESOURCE MANAGEMENT ON THE REVERSE LINK FOR MULTI-RATE CDMA WIRELESS DATA NETWORKS

This work deals with efficient power and rate assignment to mobile stations (MSs) involved in bursty data transmission in cellular CDMA networks. Power control in the current CDMA standards is based on a fixed target signal quality called signal to interference ratio (SIR). The target SIR represents a predefined frame error rate (FER). This approach is inefficient for data-MSs because a fixed target SIR can limit the MS's throughput. Power control should thus provide dynamic target SIRs instead of a fixed target SIR. In the research literature, the power control problem has been modeled using game theory. A limitation of the current literature is that in order to implement the algorithms, each MS needs to know information such as path gains and transmission rates of all other MSs. Fast rate control schemes in the evolving cellular data systems such as cdma2000-1x-EV assign transmission rates to MSs using a probabilistic approach. The limitation here is that the radio resources can be either under or over-utilized. Further, all MSs are not assigned the same rates. In the schemes proposed in the literature, only few MSs, which have the best channel conditions, obtain all radio resources. In this dissertation, we address the power control issue by moving the computation of the Nash equilibrium from each MS to the base station (BS). We also propose equal radio resource allocation for all MSs under the constraint that only the maximum allowable radio resources are used in a cell. This dissertation addresses the problem of how to efficiently assign power and rate to MSs based on dynamic target SIRs for bursty transmissions. The proposed schemes in this work maximize the throughput of each data-MS while still providing equal allocation of radio resources to all MSs and achieving full radio resource utilization in each cell. The proposed schemes result in power and rate control algorithms that however require some assistance from the BS. The performance evaluation and comparisons with cdma2000-1x-Evolution Data Only (1x-EV-DO) show that the proposed schemes can provide better effective rates (rates after error) than the existing schemes

QoS Scheduling in IEEE 802.16 Broadband Wireless Access Networks

With the exploding increase of mobile users and the release of new wireless applications, the high bandwidth requirement has been taking as a main concern for the design and development of the wireless techniques. There is no doubt that broadband wireless access with the support of heterogeneous kinds of applications is the trend in the next generation wireless networks. As a promising broadband wireless access standard, IEEE 802.16 has attracted extensive attentions from both industry and academia due to its high data rate and the inherent media access control (MAC) mechanism, which takes the service differentiation and quality of service (QoS) provisioning into account. To achieve service differentiation and QoS satisfaction for heterogenous applications is a very complicated issue. It refers to many fields, such as connection admission control (CAC), congestion control, routing algorithm, MAC protocol, and scheduling scheme. Among these fields, packet scheduling plays one of the most important roles in fulfilling service differentiation and QoS provisioning. It decides the order of packet transmissions, and provides mechanisms for the resource allocation and multiplexing at the packet level to ensure that different types of applications meet their service requirements and the network maintains a high resource utilization. In this thesis, we focus on the packet scheduling for difficult types of services in IEEE 802.16 networks, where unicast and mulitcast scheduling are investigated. For unicast scheduling, two types of services are considered: non-real-time polling service (nrtPS) and best effort (BE) service. We propose a flexible and efficient resource allocation and scheduling framework for nrtPS applications to achieve a tradeoff between the delivery delay and resource utilization, where automatic repeat request (ARQ) mechanisms and the adaptive modulation and coding (AMC) technique are jointly considered. For BE service, considering the heterogeneity of subscriber stations (SSs) in IEEE 802.16 networks, we propose the weighted proportional fairness scheduling scheme to achieve the flexible scheduling and resource allocation among SSs based on their traffic demands/patterns. For multicast scheduling, a cooperative multicast scheduling is proposed to achieve high throughput and reliable transmission. By using the two-phase transmission model to exploit the spatial diversity gain in the multicast scenario, the proposed scheduling scheme can significantly improve the throughput not only for all multicast groups, but also for each group member. Analytical models are developed to investigate the performance of the proposed schemes in terms of some important performance measurements, such as throughput, resource utilization, and service probability. Extensive simulations are conducted to illustrate the efficient of the proposed schemes and the accuracy of the analytical models. The research work should provide meaningful guidelines for the system design and the selection of operational parameters, such as the number of TV channels supported by the network, the achieved video quality of each SS in the network, and the setting of weights for SSs under different BE traffic demands

Resource allocation in cellular CDMA systems with cross- layer Optimization

Ph.DDOCTOR OF PHILOSOPH