Congestion control for fair resource allocation in networks with multicast flows

We consider the problem of congestion control in networks which support both multirate multicast sessions and unicast sessions. We present a decentralized algorithm which enables the different rate-adaptive receivers in different multicast sessions to adjust their rates to satisfy some fairness criterion. A one-bit ECN marking strategy to be used at the nodes is also proposed. The congestion-control mechanism does not require any per-flow state information for unicast flows at the nodes. At junctions nodes of each multicast tree, some state information about the rates along the branches at the node may be required. The congestion-control mechanism takes into account the diverse user requirements when different receivers within a multicast session have different utility functions, but does not require the network to have any knowledge about the receiver utility functions.     

Power allocation and temporal fair user group scheduling for downlink NOMA

Non-Orthogonal Multiple Access (NOMA) has been proposed as a new radio access technique for cellular networks as an alternative to OMA (Orthogonal Multiple Access) in which the users of a group (pairs or triples of users in a group are considered in this paper) are allowed to use the wireless channel simultaneously. In this paper, for downlink single-input single-output SISO-NOMA, a heuristic power allocation algorithm within a group is first proposed which attempts to ensure that the users of a group benefit from simultaneous transmission equally in terms of achievable throughput. Moreover, a user group scheduling algorithm is proposed for downlink NOMA systems by which a user group is to be dynamically selected for transmission while satisfying long term temporal fairness among the individual contending users. The effectiveness of the proposed power allocation method along with the temporal fair scheduling algorithm for downlink NOMA is validated with simulations and the performance impact of the transmit power and the coverage radius of the base station as well as the number of users are thoroughly studied.

     

An uplink resource allocation scheme for OFDMA‐based cognitive radio networks

Cognitive radio makes it possible for an unlicensed user to access a spectrum unoccupied by licensed users. In cognitive radio networks, extra constraints on interference temperature need to be introduced into radio resource allocation. In this paper, the uplink radio resource allocation is investigated for OFDMA‐based cognitive radio networks. In consideration of the characteristics of cognitive radio and OFDMA, an improved water‐filling power allocation scheme is proposed under the interference temperature constraints for optimal performance. Based on the improved water‐filling power allocation, a simple subcarrier allocation algorithm for uplink is proposed. The subcarrier allocation rules are obtained by theoretical deduction. In the uplink subcarrier allocation algorithm, the subcarriers are allocated to the users with the best channel quality initially and then adjusted to improve the system performance. A cursory water‐filling level estimation method is used to decrease the complexity of the algorithm. Asymptotic performance analysis gives a lower bound of the stability of the water‐filling level estimation. The complexity and performance of the proposed radio resource allocation scheme are investigated by theoretical analysis and numerical results. Copyright © 2008 John Wiley & Sons, Ltd.     

Joint scheduling and resource allocation in uplink OFDM systems for broadband wireless access networks

Orthogonal Frequency Division Multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and LTE (Long Term Evolution) for 3GPP. However, scheduling and resource allocation in an OFDM system is complicated, especially in the uplink due to two reasons: (i) the discrete nature of subchannel assignments, and (ii) the heterogeneity of the users' subchannel conditions, individual resource constraints and application requirements. We approach this problem using a gradient-based scheduling framework. Physical layer resources (bandwidth and power) are allocated to maximize the projection onto the gradient of a total system utility function which models application-layer Quality of Service (QoS). This is formulated as a convex optimization problem and solved using a dual decomposition approach. This optimal solution has prohibitively high computational complexity but reveals guiding principles that we use to generate lower complexity sub-optimal algorithms. We analyze the complexity and compare the performance of these algorithms via extensive simulations.     

Joint resource allocation,routing and CAC for uplink OFDMA networks with cooperative relaying

In this paper, we propose a joint resource allocation, routing, and connection admission control (CAC) scheme for uplink transmission in orthogonal frequency division multiple access (OFDMA) relay networks with cooperative relaying. For cooperative relaying, relay station can relay uplink data from mobile station (MS) to base station with cooperation of the MS using transmit diversity. Transmit diversity can be achieved by virtual MISO via distributed space–time coding. The proposed scheme jointly allocates OFDMA resources and selects path for each user with CAC to maximize the upink throughput of cooperative OFDMA relay networks. The basic OFDMA resource unit is considered as a resource element which is one subcarrier over one OFDMA symbol. An efficient multi-choice multi-dimensional knapsack (MMKP) algorithm is presented for the proposed scheme. The proposed MMKP algorithm provides a unified framework which is applicable to OFDMA networks with and without cooperative relaying. We evaluate the performance of the proposed scheme with and without cooperative relaying in a hilly terrain with heavy tree density by using OPNET-based simulation. We show that the cooperative relaying improve the uplink system throughput compared with non-cooperative relaying, and the proposed scheme outperforms the conventional link quality-based scheme in both cooperative and non-cooperative relay networks.     

Fairness based resource allocation for uplink OFDMA systems

This article investigates two fairness criteria with regard to adaptive resource allocation for uplink orthogonal frequency division multiple access （OFDMA） systems. Nash bargaining solution （NBS） fairness and proportional fairness （PF） are two suitable candidates for fairness consideration, and both can provide attractive trade-offs between total throughput and each user＇s capacity. Utilizing Karush-Kuhn- Tucker （KKT） condition and iterative method, two effective algorithms are designed, to achieve NBS fairness and proportional fairness, respectively. Simulation results show that the proposed resource allocation algorithms achieve good tradeoff between the overall rate and fairness, with little performance loss from the total capacity.     

Optimal resource allocation in uplink SC-FDMA systems

We present algorithms for resource allocation in Single Carrier Frequency Division Multiple Access (SC-FDMA) systems, which is the uplink multiple access scheme considered in the Third Generation Partnership Project-Long Term Evolution (3GPP-LTE) standard. Unlike the well-studied problem of Orthogonal Frequency Division Multiple Access (OFDMA) resource allocation, the "subchannel adjacency" restriction, whereby users can only be assigned multiple subchannels that are adjacent to each other, makes the problem much harder to solve. We present a novel reformulation of this problem as a pure binary-integer program called the set partitioning problem, which is a well studied problem in operations research. We also present a greedy heuristic algorithm that approaches the optimal performance in cases of practical interest. We present simulation results for 3GPP-LTE uplink scenarios.     

Proportional-fairness resource allocation for uplink OFDM-based cognitive radio systems

This paper has proposed a proportional-fairness resource allocation algorithm, including both subcarrier assignment algorithm and power allocation algorithm, for uplink orthogonal frequency division multiplexing (OFDM)-based cognitive radio (CR) systems. First, to get a better performance in the proposed system model, the influence factor (a,b,c) was introduced to realize the assignment of the subcarriers. Second, the transmit power of the secondary users (SUs) was allocated to the corresponding subcarriers in order to maximize the uplink capacity of the SUs subject to both power and interference constraints. With the appropriate influence factor in the subcarrier assignment, the loss of transmitted data rate arising from the fairness was minimized. Simulation results showed that the proposed algorithm can achieve a perfect fairness among the SUs while maximizing the system capacity simultaneously, and is of a low computation complexity.     

Joint downlink and uplink resource allocation for multi-carrier SWIPT system

A multi-carrier simultaneous wireless information and power transfer (SWIPT) communication system including one base station (BS) and one user was investigated,where both uplink and downlink adopt orthogonal frequency division multiplexing (OFDM).In the downlink,the BS transmited information and power to the user simultaneously.In the uplink,the user transmited information to the BS by using the power harvested from the BS in the downlink.The weighted sum of the downlink and uplink achievable rates by jointly optimizing subcarrier allocation and power allocation of the uplink and downlink were aimed to maximized.An optimal algorithm to solve the joint resource allocation problem was proposed,which was based on the Lagrange duality method and the ellipsoid method.Finally,the result shows the performances of the proposed algorithm by computer simulations.     

Ambient BackCom in beyond 5G NOMA networks: A multi-cell resource allocation framework

The research of Non-Orthogonal Multiple Access (NOMA) is extensively used to improve the capacity of networks beyond the fifth-generation. The recent merger of NOMA with ambient Backscatter Communication (BackCom), though opening new possibilities for massive connectivity, poses several challenges in dense wireless networks. One such challenge is the performance degradation of ambient BackCom in multi-cell NOMA networks under the effect of inter-cell interference. Driven by providing an efficient solution to the issue, this article proposes a new resource allocation framework that uses a duality theory approach. Specifically, the sum rate of the multi-cell network with backscatter tags and NOMA user equipment is maximized by formulating a joint optimization problem. To find the efficient base station transmit power and backscatter reflection coefficient in each cell, the original problem is first divided into two subproblems, and then the closed form solution is derived. A comparison with the Orthogonal Multiple Access (OMA) ambient BackCom and pure NOMA transmission has been provided. Simulation results of the proposed NOMA ambient BackCom indicate a significant improvement over the OMA ambient BackCom and pure NOMA in terms of sum-rate gains.     

Joint resource allocation and interference management in the D2D uplink underlaying cellular networks

This paper investigates the problem of joint interference management and resource allocation in device-to-device (D2D) uplink underlaying cellular networks. To improve the D2D system sum throughput, an overlapping coalition formation game (OCFG) is proposed to achieve resource allocation. In the game, a novel initialization in term of the priority sequence is proposed to rapidly form the initial coalitions. During the coalition formation, the merging and splitting sequences are adopted to guide the order that D2D users merge in or split from the coalition. Here the splitting sequences are formed according to cross-tier interference strength and the merging sequence is based on matching theory. Besides, a power control scheme is formulated to optimize the power allocation. The performance of the proposed algorithm is analyzed and verified through simulations.

     

Energy-efficient power allocation for NOMA heterogeneous networks with imperfect CSI

In this paper, an optimal user power allocation scheme is proposed to maximize the energy efficiency for downlink non-orthogonal multiple access (NOMA) heterogeneous networks (HetNets). Considering channel estimation errors and inter-user interference under imperfect channel state information (CSI), the energy efficiency optimization problem is formulated, which is non-deterministic polynomial (NP)-hard and non-convex. To cope with this intractable problem, the optimization problem is converted into a convex problem and address it by the Lagrangian dual method. However, it is difficult to obtain closed-form solutions since the variables are coupled with each other. Therefore, a Lagrangian and sub-gradient based algorithm is proposed. In the inner layer loop, optimal powers are derived by the sub-gradient method. In the outer layer loop, optimal Lagrangian dual variables are obtained. Simulation results show that the proposed algorithm can significantly improve energy efficiency compared with traditional power allocation algorithms.     

Energy-efficient resource allocation scheme for device-to-device communication underlaying LTE-A uplink

To cope with the co-channel interference between cellular links and device-to-device (D2D) links concurrently transmitting with the long term evolution-advanced (LTE-A) uplink spectrum,a joint resource allocation scheme was pro-posed to maximize the global energy efficiency of D2D links.The above problem can be decomposed into the power control subproblem and the channel assignment subproblem.Specifically,the power control subproblem can be optimally solved with the help of Dinkelbach method and Lagrange duality.Based on the above results,the channel assignment subproblem turns out to be the set packing problem which was generally NP-hard problem,Therefore,a heuristic algo-rithm was further devised to achieve a tradeoff between performance and complexity.Simulations show that the proposed joint resource allocation scheme outperforms the ones where only single resource variable is optimized,and it achieves the polynomial-time complexity at only minor performance loss when compared to the global optimum.     

NOMA增强型D2D通信的资源分配算法

传统蜂窝网络中,多址接入技术起着尤为关键的作用,与正交多址(Orthogonal Multiple Access,OMA)技术相比,非正交多址(Non-Orthogonal Multiple Access,NOMA)能够支持的用户数量远远超过可用正交资源的数量,可以达到更高的频谱效率和用户公平性.因此,为提高异构蜂窝网...     

An optimal energy resource allocation framework for cellular networks with power grid interruptions

Wireless Networks - In this paper, we investigate the problem of optimal allocation of renewable energy resources to power base stations (BSs) in cellular networks while accounting for possible...     

Prioritized resource allocation for stressed networks

Overloads that occur during times of network stress result in blocked access to all users, independent of importance. These overloads can occur because of degraded resource availability or abnormally high demand. Public broadband networks must dynamically recognize some multimedia connections as having greater importance than others and allocate resources accordingly. A new approach to connection admission control is proposed that uses an upper limit policy to optimize the admission of connections based on the weighted sum of blocking across traffic classes. This results in a simple algorithm suitable for multimedia and packet networks. This work is also the first to demonstrate that the use of an upper limit policy is superior to traditional approaches of adding extra capacity or partitioning capacity, both in terms of the amount of resources required and sensitivity to load variations. An upper limit policy can also be deployed much faster when a large overload occurs from a disaster event     

Resource allocation for NOMA based D2D underlaid cellular networks

This paper puts forward a user clustering and power allocation algorithm for non-orthogonal multiple access (NOMA) based device-to-device (D2D) cellular system. Firstly, an optimization problem aimed at maximizing the sum-rate of the system is constructed. Since the optimization problem is a mixed-integer non-convex optimization, it is decomposed into two subproblems, namely user clustering and power allocation subproblem. In the subproblem of user clustering, the clustering algorithms of cellular user and D2D pair are proposed respectively. In the power allocation subproblem, the gradient assisted binary search (GABS) algorithm and logarithmic approximation in successive convex approximation (SCA) are used to optimize the power of subchannel (SC) and D2D transmitted power respectively. Finally, an efficient joint iterative algorithm is proposed for the original mixed inter non-convex non-deterministic polynomial (NP)-hard problem. The simulation results show that the proposed algorithm can effectively improve the total system rate and the larger the ratio of cellular users (CUs) to total users, the larger the total system rate.     

Analysis of resource allocation with macroscopic diversity for uplink OFDMA systems

This paper describes a framework of link capacity analysis for interference mitigation of uplink Orthogonal Frequency Division Multiple Access systems. A Macroscopic Diversity Oriented Resource Allocation (MDORA) is performed via inter-cell coordination based on the location of Mobile Stations (MSs) by exploiting macroscopic diversity in the uplink transmission. In the numerical analysis, the Inter-Cell Interference is derived as a closed form over a multi-cell environment. Subsequent numerical results demonstrate that MDORA offers an efficient inter-cell interference mitigation and a throughput expansion. Moreover, when up-link sectorization is adopted, the MDORA scheme presents a lower inter-cell interference, a reduced outage probability and an improved throughput.     

Throughput-based fair bandwidth allocation in OBS networks

Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed.