Low-complexity medium access control protocols for QoS support in third-generation radio access networks

One approach to maximizing the efficiency of medium access control (MAC) on the uplink in a future wideband code-division multiple-access (WCDMA)-based third-generation radio access network, and hence maximize spectral efficiency, is to employ a low-complexity distributed scheduling control approach. The maximization of spectral efficiency in third-generation radio access networks is complicated by the need to provide bandwidth-on-demand to diverse services characterized by diverse quality of service (QoS) requirements in an interference limited environment. However, the ability to exploit the full potential of resource allocation algorithms in third-generation radio access networks has been limited by the absence of a metric that captures the two-dimensional radio resource requirement, in terms of power and bandwidth, in the third-generation radio access network environment, where different users may have different signal-to-interference ratio requirements. This paper presents a novel resource metric as a solution to this fundamental problem. Also, a novel deadline-driven backoff procedure has been presented as the backoff scheme of the proposed distributed scheduling MAC protocols to enable the efficient support of services with QoS imposed delay constraints without the need for centralized scheduling. The main conclusion is that low-complexity distributed scheduling control strategies using overload avoidance/overload detection can be designed using the proposed resource metric to give near optimal performance and thus maintain a high spectral efficiency in third-generation radio access networks and that importantly overload detection is superior to overload avoidance

System modeling and performance evaluation of rate allocation schemes for packet data services in wideband CDMA systems

To fully exploit the potential of a wideband CDMA-based mobile Internet computing system, an efficient algorithm is needed for judiciously performing rate allocation, so as to orchestrate and allocate bandwidth for voice services and high data rate applications. However, in existing standards (e.g., cdma2000), only a first-come-first-served equal sharing allocation algorithm is used, potentially leading to a low bandwidth utilization and inadequate support of high data rate multimedia mobile applications (e.g., video/audio files swapping, multimedia messaging services, etc.). In this paper, we first analytically model the rate allocation problem that captures realistic system constraints such as downlink power limits and control, uplink Interference effects, physical channel adaptation, and soft handoff. We then suggest six efficient rate allocation schemes that are designed based on different philosophies: rate optimal, fairness-based, and user-oriented. Simulations are performed to evaluate the effectiveness of the rate allocation schemes using realistic system parameters In our model.published_or_final_versio

Scheduling algorithms in broadband wireless networks

Scheduling algorithms that support quality of service (QoS) differentiation and guarantees for wireless data networks are crucial to the development of broadband wireless networks. Wireless communication poses special problems that do not exist in wireline networks, such as time-varying channel capacity and location-dependent errors. Although many mature scheduling algorithms are available for wireline networks, they are not directly applicable in wireless networks because of these special problems. This paper provides a comprehensive and in-depth survey on recent research in wireless scheduling. The problems and difficulties in wireless scheduling are discussed. Various representative algorithms are examined. Their themes of thoughts and pros and cons are compared and analyzed. At the end of the paper, some open questions and future research directions are addressed.published_or_final_versio