Power control and scheduling for guaranteeing quality of service in cellular networks

Providing quality of service (QoS) guarantees is important in the third generation (3G) and the fourth generation (4G) cellular networks. However, large‐scale fading and non‐stationary small‐scale fading can cause severe QoS violations. To address this issue, we design QoS provisioning schemes, which are robust against time‐varying large scale path loss, shadowing, non‐stationary small scale fading, and very low mobility. In our design, we utilize our recently developed effective capacity technique and the time‐diversity dependent power control proposed in this paper. The key elements of our QoS provisioning schemes are channel estimation, power control, dynamic channel allocation, and adaptive transmission. The advantages of our QoS provisioning schemes are (1) power efficiency, (2) simplicity in QoS provisioning, (3) robustness against large‐scale fading and non‐stationary small‐scale fading. Simulation results demonstrate that the proposed algorithms are effective in providing QoS guarantees under various channel conditions. Copyright © 2006 John Wiley & Sons, Ltd.     

Utility-based adaptive radio resource allocation in OFDM wireless networks with traffic prioritization

In this letter, a joint transmit scheduling and dynamic sub-carrier and power allocation method is proposed to exploit multi-user diversity in downlink packet transmission in an OFDM wireless network with mixed real-time and non-real-time traffic patterns. To balance efficiency and fairness and to satisfy the QoS requirements of real-time users, we utilize a utility-based framework and propose a polynomial-time heuristic algorithm to solve the formulated optimization problem. The distinguishing feature of the proposed method is that it gives in one shot, the transmission scheduling, the sub-carriers assigned to each user, and the power allocated to each sub-carrier, based on a fair and efficient framework while satisfying the delay requirements of real-time users.     

Traffic Aided Uplink Opportunistic Scheduling with QoS Support in Multiservice CDMA Networks

In this letter, we address the problem of resource allocation with efficiency and quality of service (QoS) support in uplink for a wireless CDMA network supporting real‐time (RT) and non‐realtime (NRT) communication services. For RT and NRT users, there are different QoS requirements. We introduce and describe a new scheme, namely, traffic aided uplink opportunistic scheduling (TAUOS). While guaranteeing the different QoS requirements, TAUOS exploits the channel condition to improve system throughput. In TAUOS, the cross‐layer information, file size information, is used to improve fairness for NRT users. Extensive simulation results show that our scheme can achieve high system throughput in uplink wireless CDMA systems, while guaranteeing QoS requirements.     

A Dynamic Reservation-Based Call Admission Control Algorithm for Wireless Networks Using the Concept of Influence Curve

In this paper a dynamic channel reservation and call admission control scheme is proposed to provide QoS guarantees in a mobile wireless network using the concept of influence curve. The basic idea behind the proposed scheme is that a moving user, in addition to its requirements in the current cell, exerts some influence on the channel allocation in neighboring cells. Such an influence is related to the moving pattern of the users and is calculated statistically. Furthermore we developed a general analytical model to calculate the corresponding blocking probabilities for wireless networks with multiple platforms, which removes the commonly used assumption that new calls and handoff calls have same channel holding time. The numerical results demonstrate that our scheme outperforms traditional channel reservation schemes and can effectively adapt to the real time network conditions.     

An overview of scheduling algorithms in MIMO-based fourth-generation wireless systems

In this article an overview of the scheduling algorithms proposed for fourth-generation multiuser wireless networks based on multiple-input multiple-output technology is presented. In MIMO systems a multi-user diversity gain can be extracted by tracking the channel fluctuations between each user and the base station, and scheduling transmission for the "best" user. Based on this idea, several opportunistic scheduling schemes that attempt to improve global capacity or satisfy users with different QoS requirements have been proposed. Transmit beamforming procedures aimed at increasing the channel fluctuations have been proposed. The simultaneous exploitation of both spatial and multi-user diversity is not straightforward; however, it may be achieved by a refined selection of the "best" user. In addition, a multiple access gain can be obtained from a simple SDMA/TOMA system. Finally, several resource allocation schemes are discussed for this hybrid multiple access system.     

An optimal solution to resource allocation among soft QoS traffic in wireless network

Optimization theory and nonlinear programming method have successfully been applied into wire‐lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control schemes. The resource (e.g., bandwidth) allocation in a communication network has been modeled into an optimization problem: the objective is to maximize the source aggregate utility subject to the network resource constraint. However, for wireless networks, how to allocate the resource among the soft quality of service (QoS) traffic remains an important design challenge. Mathematically, the most difficult comes from the non‐concave utility function of soft QoS traffic in the network utility maximization (NUM) problem. Previous result on this problem has only been able to find its sub‐optimal solution. Facing this challenge, this paper establishes some key theorems to find the optimal solution and then present a complete algorithm called utility‐based allocation for soft QoS to obtain the desired optimal solution. The proposed theorems and algorithm act as designing guidelines for resource allocation of soft QoS traffic in a wireless network, which take into account the total available resource of network, the users’ traffic characteristics, and the users’ channel qualities. By numerical examples, we illustrate the explicit solution procedures.Copyright © 2013 John Wiley & Sons, Ltd.     

Power Allocation with Max–Min and Min–Max Fairness for Cognitive Radio Networks with Imperfect CSI

This paper consider the power allocation strategies in the cognitive radio (CR) system in the presence of channel estimation errors. As the user has different channel condition in CR systems, different amount of power resource is required to meets the QoS request. In order to guarantee the fairness of each CR user, ensure the interference from the primary user and other CR users meet the QoS requirement of the CR user and limit the interference that is caused by CR users on primary user within the range into the level that primary user can tolerate, we proposed some new power allocation schemes. The targets are to minimize the maximum power allocated to CR users, to maximize the minimum signal-to-interference-plus-noise ratio (SINR) among all CR users and to minimize the maximum outage probability over all CR users. The first power allocation scheme can be formulated using Geometric Programming (GP). Since GP problem is equivalent to the convex optimization problem, we can obtain the optimal solutions for the first scheme. The latter two power allocation schemes are not GP problems. We propose iterative algorithms to solve them. Simulation results show that proposed schemes can efficiently guarantee the fairness of CR users under the QoS constraint of the primary user and CR users.     

Simulation analyses of weighted fair bandwidth‐on‐demand (WFBoD) process for broadband multimedia geostationary satellite systems

Advanced resource management schemes are required for broadband multimedia satellite networks to provide efficient and fair resource allocation while delivering guaranteed quality of service (QoS) to a potentially very large number of users. Such resource management schemes must provide well‐defined service segregation to the different traffic flows of the satellite network, and they must be integrated with some connection admission control (CAC) process at least for the flows requiring QoS guarantees. Weighted fair bandwidth‐on‐demand (WFBoD) is a resource management process for broadband multimedia geostationary (GEO) satellite systems that provides fair and efficient resource allocation coupled with a well‐defined MAC‐level QoS framework (compatible with ATM and IP QoS frameworks) and a multi‐level service segregation to a large number of users with diverse characteristics. WFBoD is also integrated with the CAC process. In this paper, we analyse via extensive simulations the WFBoD process in a bent‐pipe satellite network. Our results show that WFBoD can be used to provide guaranteed QoS for both non‐real‐time and real‐time variable bit rate (VBR) flows. Our results also show how to choose the main parameters of the WFBoD process depending on the system parameters and on the traffic characteristics of the flows. Copyright © 2005 John Wiley & Sons, Ltd.     

A cross‐layer study for application‐aware multi‐hop cognitive radio networks

Satisfying the different requirements of applications is important in multi‐hop cognitive radio networks, because the spectrum resources change dynamically and the requirements for various applications could be very different. In this paper, we propose new schemes of channel allocation and route selection for real‐time and non‐real‐time applications to tackle this challenge. Our scheme is flexible so that it can adapt to the different application requirements, and it can provide enough throughput while maintaining the packet loss rate and transmission rate requirements. First, we give the network model in a cognitive radio network environment, and show how to calculate the capacity of the route in multi‐hop cognitive radio networks. Second, we formulate optimization problems to fulfill the rate requirements of different applications for each unicast session. We also consider the primary user activities, channel availability, interface and interference constraint. We propose the corresponding routing and channel allocation schemes for different application scenarios. Third, we propose an admission control scheme to study the impact of application requirements for multiple sessions in cognitive radio networks. Finally, we implement simulations to show the performance of our schemes and compare them with existing schemes. Copyright © 2014 John Wiley & Sons, Ltd.     

基于多门限预留机制的自适应带宽分配算法

针对异构无线网络融合环境提出了一种基于多门限预留机制的自适应带宽分配算法,从而为多业务提供QoS保证。该算法采用多宿主传输机制,通过预设各个网络中不同业务的带宽分配门限,并基于各个网络中不同业务和用户的带宽分配矩阵,根据业务k支持的传输速率等级需求和网络状态的变化,将自适应带宽分配问题转化为一个动态优化问题并采用迭代方法来求解,在得到各个网络中不同业务和用户优化的带宽分配矩阵的同时,在带宽预留门限和网络容量的约束条件下实现网络实时吞吐量的最大化,以提高整个异构网络带宽的利用效率。数值仿真结果显示,所提算法能够支持满足QoS需求的传输速率等级,减小了新用户接入异构网络的阻塞概率,提高了平均用户接入率并将网络吞吐量最大提高40%。     

A self‐organized resource allocation scheme for heterogeneous macro‐femto networks

This paper investigates the radio resource management (RRM) issues in a heterogeneous macro‐femto network. The objective of femto deployment is to improve coverage, capacity, and experienced quality of service of indoor users. The location and density of user‐deployed femtos is not known a‐priori. This makes interference management crucial. In particular, with co‐channel allocation (to improve resource utilization efficiency), RRM becomes involved because of both cross‐layer and co‐layer interference. In this paper, we review the resource allocation strategies available in the literature for heterogeneous macro‐femto network. Then, we propose a self‐organized resource allocation (SO‐RA) scheme for an orthogonal frequency division multiple access based macro‐femto network to mitigate co‐layer interference in the downlink transmission. We compare its performance with the existing schemes like Reuse‐1, adaptive frequency reuse (AFR), and AFR with power control (one of our proposed modification to AFR approach) in terms of 10 percentile user throughput and fairness to femto users. The performance of AFR with power control scheme matches closely with Reuse‐1, while the SO‐RA scheme achieves improved throughput and fairness performance. SO‐RA scheme ensures minimum throughput guarantee to all femto users and exhibits better performance than the existing state‐of‐the‐art resource allocation schemes.Copyright © 2014 John Wiley & Sons, Ltd.     

认知型飞蜂窝网络中的子信道分配与功率控制

为了解决宏蜂窝与飞蜂窝构成的两层异构网络上行干扰与资源分配问题,提出了一种在认知型飞蜂窝的双层异构网中结合子信道分配和功率控制进行资源分配的框架。通过对异构网中跨层干扰问题进行分析与建模,将求解最优子信道分配矩阵和用户发射功率矩阵作为干扰管理问题的解决方法。模型中认知型飞蜂窝网络子信道和飞蜂窝网络用户构成非合作博弈,双方利用效用函数最优值进行匹配,构成初始信道分配矩阵;再由接入控制器根据接入条件从初始信道分配矩阵中筛选用户,并优化接入用户的发射功率矩阵,得到最优子信道分配矩阵和功率矩阵。仿真结果表明,优化框架提高了双层异构网络中飞蜂窝网络用户的吞吐量和接入率,降低了异构网中跨层干扰。     

Integrating Distributed Channel Allocation and Adaptive Handoff Management for QoS-Sensitive Cellular Networks

Next generation high-speed cellular networks are expected to support multimedia applications, which require QoS provisions. Since frequency spectrum is the most expensive resource in wireless networks, it is a challenge to support QoS using limited frequency spectrum. In the literature, two orthogonal approaches are used to address the bandwidth utilization issue and the QoS provision issue; that is, channel allocation schemes have been proposed to improve bandwidth efficiency, whereas handoff management schemes, based on bandwidth reservation, have been proposed to guarantee a low connection dropping rate. However, little effort has been taken to address both issues together. In this paper, we integrate distributed channel allocation and adaptive handoff management to provide QoS guarantees and efficiently utilize the bandwidth. First, we present a complete distributed distributed channel allocation algorithm and propose techniques to reduce its message complexity and intra-handoff overhead. Second, we integrate the proposed distributed channel allocation algorithm with an adaptive handoff management scheme to provide QoS guarantees and efficiently utilize the bandwidth. Detailed simulation experiments are carried out to evaluate the proposed methodology. Compared to previous schemes, our scheme can significantly reduce the message complexity and intra-handoff overhead. Moreover, the proposed scheme can improve the bandwidth utilization while providing QoS guarantees.     

Optimal rate allocation and QoS-sensitive admission control in wireless integrated networks

The problem of Call Admission Control and rate allocation in loosely coupled wireless integrated networks is investigated. The related Radio Resource Management schemes were introduced to improve network performance in wireless integrated networks. However, these schemes did not reflect the independence and competitiveness of loosely coupled wireless integrated networks. Furthermore, given that users have different requirements for price and Quality of Service (QoS), they are able to select a network according to their preference. We consider a scenario with two competitive wireless networks, namely Universal Mobile Telecommunications System cellular networks and Wireless Local Area Networks. Users generate two types of traffic with different QoS requirements: real-time and non-real-time. We propose a scheme that exploits a mathematical model for the control of call admission and adopt a noncooperative game theory-based approach to address the rate allocation problem. The purpose is to maximize the revenue of the network providers while guaranteeing a level of QoS according to user needs. Simulation results show that the proposed scheme provides better network performance with respect to packet loss rate, packet delay time, and call-blocking probability than other schemes when the data rates are allocated to each call at the point that maximizes the revenue of network providers. We further demonstrate that a Nash equilibrium always exists for the considered games.     

Performance analysis of an opportunistic multi‐user cognitive network with multiple primary users

Consider a multi‐user underlay cognitive network where multiple cognitive users concurrently share the spectrum with a primary network with multiple users. The channel between the secondary network is assumed to have independent but not identical Nakagami‐m fading. The interference channel between the secondary users (SUs) and the primary users is assumed to have Rayleigh fading. A power allocation based on the instantaneous channel state information is derived when a peak interference power constraint is imposed on the secondary network in addition to the limited peak transmit power of each SU. The uplink scenario is considered where a single SU is selected for transmission. This opportunistic selection depends on the transmission channel power gain and the interference channel power gain as well as the power allocation policy adopted at the users. Exact closed form expressions for the moment‐generating function, outage performance, symbol error rate performance, and the ergodic capacity are derived. Numerical results corroborate the derived analytical results. The performance is also studied in the asymptotic regimes, and the generalized diversity gain of this scheduling scheme is derived. It is shown that when the interference channel is deeply faded and the peak transmit power constraint is relaxed, the scheduling scheme achieves full diversity and that increasing the number of primary users does not impact the diversity order. Copyright © 2014 John Wiley & Sons, Ltd.     

Power control for delay constrained multi‐channel communications using outdated CSI

In this paper, we study the power allocation scheme for a single user, multi‐channel system, e.g., orthogonal frequency‐division multiplexing (OFDM) systems, under time‐variant wireless fading channels. We assume the receiver feeds back perfectly estimated channel state information (CSI) to the transmitter after a processing delay. The objective of the power allocation is to maximize throughput subject to quality‐of‐service (QoS) constraint. The QoS measure of our consideration is a triplet of data rate, delay, and delay bound violation probability. A two‐step sub‐optimal power allocation scheme is proposed to address the impact of outdated CSI. In the first step, the total transmission power that can be used within one block is determined according to the summation of the channel gains of all the channels. In the second step, the total transmission power is allocated among all the channels. The proposed power control scheme is less sensitive to the feedback delay. Compared to the optimal power allocation scheme designed for the perfect CSI scenario, it has lower computational complexity while achieving comparable capacity. Copyright © 2010 John Wiley & Sons, Ltd.     

Quality of service analysis and improvement with cross layer power allocation in multirelay networks

Quality of service (QoS) guarantee is the main performance metric for designing future wireless networks. For real time applications over wireless links, statistical delay QoS guarantee is the most important QoS metrics. The main goal of this paper is studying the effects of multi‐decode‐and‐forward‐relaying transmission on delay QoS guarantee and user satisfaction. For this end, we first propose an approach to simplify the analysis of statistical delay QoS guarantee by the use of a curve named QoS analysis curve. The QoS analysis curve of any system is based on its effective capacity (EC) function. So, we derive a closed‐form expression for the EC function of a multi‐decode‐and‐forward‐relay network to reduce the computational complexity of finding this quantity. After that, for improving the QoS guarantee performance of a multi‐decode‐and‐forward‐relaying system, the EC of the system is maximized by the use of power allocation (PA) technique. At first, an adaptive PA (APA) algorithm is proposed in which the source and relays PA policies are derived analytically. Although, the overhead of this algorithm is large, it significantly improves the statistical delay QoS guarantee performance. Then, for the systems that cannot tolerate the required large overhead of APA, a fixed PA scheme is presented, which is based on particle swarm optimization algorithm. There is a tradeoff between providing the delay QoS guarantee and the required overhead, in selecting APA or fixed PA schemes. The numerical results validate our analytical outcomes and evaluate our proposed algorithms.     

A Joint Allocation, Assignment and Admission Control (AAA) Framework for Next Generation Networks

In this paper, we propose a framework for performing allocation, assignment and admission control (AAA) in next generation cellular networks. A novel heuristic method for resource allocation is proposed. The allocation is done in a semi-distributed manner consisting of central allocation and local allocation. The role of the assignment module is to estimate the amount of resources needed by a user in order to satisfy the quality of service (QoS) requirements of the application. To that end, a Markov based approach which calculates the dropping probability of packets by considering the effects of queuing in the medium access control layer and the adaptive modulation and coding in the physical layer is presented. In order to estimate the required resources, the predicted throughput and delay are calculated based on the dropping probability and the predicted values are mapped to the required ones. The admission control module is responsible for admitting or rejecting a new or handoff user and is based on a mean resource calculation. The calculation takes into account the mean number of resources used by existing users as well as the buffer conditions of the individual users. By combining the three novel contributions on AAA into the AAA framework the overall network as well as the cell-edge throughput have been improved and the number of admitted users have been increased while still guaranteeing QoS for new users as well as existing users.     

Chunk‐based and fairness‐based resource allocation in multicast distributed MISO‐OFDMA systems

The resource allocation problem for the downlink of orthogonal frequency‐division multiple access (OFDMA) wireless multicast systems is investigated. It is assumed that the base station consists of multiple antennas in a distributed antenna system (DAS), whereas each user is equipped with a single antenna. The multicasting technology is able to support several groups of users with flexible quality of service (QoS) requirements. The general mathematical formulation is provided, but achieving the optimal solution has a high computational cost. In our approach, the allocation unit is not the subcarrier, as in conventional OFDMA systems, but a set of contiguous subcarriers, which is called ‘chunk’. For practical implementation, a suboptimal but efficient algorithm is proposed in order to maximize the sum of the maximum attainable data rates of multicast groups of users, subject to total available power and proportional maximum attainable data rate constraints among multicast groups of users. Simulation and complexity analyses are provided to support the benefits of chunk‐based resource allocation to multicast OFDMA DASs, supporting that the proposed algorithm can be applied to latest‐generation wireless systems that provide QoS guarantees. Copyright © 2013 John Wiley & Sons, Ltd.     

D2D网络中信道选择与功率控制策略研究

针对D2D通信的资源分配问题,该文研究了D2D信道选择与功率控制策略。在保证蜂窝用户服务质量(QoS)的前提下,提出一种基于启发式的D2D信道选择算法,为系统内的D2D用户找到合适的信道复用资源。同时,利用拉格朗日对偶方法求解得到D2D用户最优传输功率。仿真结果表明当蜂窝用户与多对D2D用户共享信道资源时能够大幅度提升系统平均吞吐量。在相同条件下,该算法的性能要明显优于现有算法。