Dynamic subcarrier and power allocation based on cooperative game theory in symmetric cooperative OFDMA networks

In order to improve the efficiency and fairness of radio resource utilization,a scheme of dynamic cooperative subcarrier and power allocation based on Nash bargaining solution(NBS-DCSPA) is proposed in the uplink of a three-node symmetric cooperative orthogonal frequency division multiple access(OFDMA) system.In the proposed NBS-DCSPA scheme,resource allocation problem is formulated as a two-person subcarrier and power allocation bargaining game(SPABG) to maximize the system utility,under the constraints of each user’s maximal power and minimal rate,while considering the fairness between the two users.Firstly,the equivalent direct channel gain of the relay link is introduced to decide the transmission mode of each subcarrier.Then,all subcarriers can be dynamically allocated to the two users in terms of their selected transmission mode.After that,the adaptive power allocation scheme combined with dynamic subcarrier allocation is optimized according to NBS.Finally,computer simulation is conducted to show the efficiency and fairness performance of the proposed NBS-DCSPA scheme.     

Optimal resource allocation scheme for cognitive radio networks with relay selection based on game theory

In this paper,we present a non-transferable utility coalition graph game(NTU-CGG) based resource allocation scheme with relay selection for a downlink orthogonal frequency division multiplexing(OFDMA) based cognitive radio networks to maximize both system throughput and system fairness.In this algorithm,with the assistance of others SUs,SUs with less available channels to improve their throughput and fairness by forming a directed tree graph according to spectrum availability and traffic demands of SUs.So this scheme can effectively exploit both space and frequency diversity of the system.Performance results show that,NTU-CGG significantly improves system fairness level while not reducing the throughput comparing with other existing algorithms.     

OFDMA分布式无线接入网络中基于共享标准的资源分布研究

Distributed radio access network (DRAN) is a novel wireless access architecture and can solve the problem of the available spectrum scarcity in wireless communications. In this paper, we investigate resource allocation for the downlink of OFDMA DRAN. Unlike previous exclusive criterion based algorithms that allocate each subcarrier to only one user in the system, the proposed algorithms are based on shared criterion that allow each subcarrier to be allocated to multiple users through different antennas and to only one user through same antenna. First, an adaptive resource allocation algorithm based on shared criterion is proposed to maximize total system rate under each user’s minimal rate and each antenna’s maximal power constraints. Then we improve the above algorithm by considering the influence of the resource allocation scheme on single user. The simulation results show that the shared criterion based algorithm provide much higher total system rate than that of the exclusive criterion based algorithm at the expense of the outage performance and the fairness, while the improved algorithm based on shared criterion can achieve a good tradeoff performance.     

Stackelberg game theoretic pricing algorithm for bandwidth allocation in cooperative access

Cooperative access among user devices by sharing wireless access bandwidth opens a new paradigm in heterogeneous networks.However,how to stimulate cooperative relay nodes forwarding service data for others and allocating corresponding bandwidth to support it are two key issues in the cooperative access.This paper proposes a Stackelberg game based framework which is benefit participants including relay nodes and client nodes.This framework generalizes the pricing based bandwidth allocation algorithm by the Stackelberg game model,which optimizes the profit of the cooperative relay nodes while guaranteeing the bandwidth requirements of client nodes.We transform the profit maximization problem into a convex problem and solve it using the convex optimization method.The simulation results demonstrate that the proposed framework and corresponding algorithms outperform the bidding weight proportional fairness and fixed value bandwidth allocation ones significantly.     

Generalized Maximum Likelihood Noncoherent Block Detection for Decode-and-Forward Relay Systems

This paper considers noncoherent cooperative decode-and-forward （DF） half- duplex multi-branch relay systems. Each relay branch is modeled as a probabilistic transition system at the last hop, and thus it can be considered as a relaying chain comprising multi-hop relays. An approximation to the generalized maximum likelihood （ML） noncoherent block detection is derived for uncoded M-ary modulation in a faded noisy environment. In particular, the derived noncoherent block detection in a noiseless case is equivalent to a multichannel reception with full diversity. Furthermore, the generalized detection is extended specifically to block coded M-ary phase shift keying （MPSK） modulation. For a DF three node relay system using block coded quadrature phase shift keying （QPSK）, simulation results are provided to examine the end-to-end error performance of the noncoherent detection with considering the effects of network geometry and power allocation, respectively. It is shown that under a fixed power allocation, a proper relay placement can yield near full diversity for large signal-to-noise ratio.     

Inter-domain traffic balancing with co-channel interference management in multi-domain heterogeneous network for LTE-A

Heterogeneous network(Het-Net) is part of the long-term evolution advanced(LTE-A) study item and represents cellular deployments with a mixture of cells of different overlapping coverage areas,e.g.,a number of relay and pico cells overlaid by a macro cell in the same frequency.Traffic balancing and interference management are required in Het-Net design for LTE-A to maintain system performance.In this paper,we propose an inter-domain cooperative traffic balancing scheme focusing on reducing the effective resource cost and mitigating the co-channel interference in multi-domain Het-Net.We first set up the conception of multi-domain in Het-Net and incorporate the co-channel interference into the proposed traffic balancing scheme.Then we model the traffic balancing issue as a multi-domain traffic resource optimization problem for minimizing the effective resource cost.The detailed implementation for the proposed traffic balancing scheme is designed.In the numerical evaluation,the genetic algorithm(GA) as an optimization method is used to demonstrate that the total effective resource cost is significantly reduced through our proposed inter-domain traffic balancing scheme,comparing with the intra-domain traffic balancing scheme.The 43% of the resource cost is saved.In the system level simulation,the performance results of signal interference noise ratio(SINR) and throughput demonstrate that the proposed scheme has great advantages in interference management in Het-Net.     

Coalition-based downlink resource allocation for LTE system with divide-and-conquer approach

To take advantage of the multiuser diversity resulted from the variation in channel conditions among the users,it has become an interesting and challenging problem to efficiently allocate the resources such as subcarriers,bits,and power.Most of current research concentrates on solving the resource-allocation problem for all users together in a centralized way,which brings about high computational complexity and makes it impractical for real system.Therefore,a coalitional game framework for downlink multi-user resource allocation in long term evolution(LTE) system is proposed,based on the divide-and-conquer idea.The goal is to maximize the overall system data rate under the constraints of each user’s minimal rate requirement and maximal transmit power of base station while considering the fairness among users.In this framework,a coalitional formation algorithm is proposed to achieve optimal coalition formation and a two-user bargaining algorithm is designed to bargain channel assignment between two users.The total computational complexity is greatly reduced in comparison with conventional methods.The simulation results show that the proposed algorithms acquire a good tradeoff between the overall system throughout and fairness,compared to maximal rate and max-min schemes.     

Downlink CoMP Resource Allocation Based on Limited Backhaul Capacity

Coordinated Multi-Point(CoMP) transmission is put forward in the Long Term Evolution-Advanced(LTE-A) system to improve both average and cell-edge throughput. In this paper, downlink CoMP(DL-CoMP) resource allocation scheme based on limited backhaul capacity is designed to take a tradeoff between system throughput and fairness. Resource allocation of proportional fairness based on querying table is proposed. It updates RB allocation matrix when center cell has completed resource allocation and delivers the matrix to adjacent cells for their own RB allocation. Furthermore, Water-Filling algorithm based on adaptive water level(AWF) is used for power allocation to boost system fairness. In this paper, performance of downlink CoMP based on limited backhaul capacity and single-point transmission is contrasted, and results indicate that CoMP dramatically enhances system throughput and spectral efficiency. Moreover, AWF power allocation scheme obtains higher system fairness than conventional Water-Filling(WF) algorithm, although it gets slightly lower system throughput. Finally, this paper discussed that the system performance is partially affected by the percentage of CoMP resource.     

Joint resource allocation with QoS provisioning in K-tier heterogeneous cellular networks

In this paper, the joint resource allocation （RA） problem with quality of service （QoS） provisioning in downlink heterogeneous cellular networks （HCN） is studied. To fully exploit the network capacity, the HCN is modeled as a K-tier cellular network where each tier＇s base stations （BSs） have different properties. However, deploying numbers of low power nodes （LPNs） which share the same frequency band with macrocell generates severe inter-cell interference. Enhancement of system capacity is restricted for inter-cell interference. Therefore, a feasible RA scheme has to be developed to fully exploit the resource efficiency. Under the constraint of inter-cell interference, we formulate the RA problem as a mixed integer programming problem. To solve the optimization problem we develop a two-stage solution. An integer subchannel assignment algorithm and Lagrangian-based power allocation algorithm are designed. In addition, the biasing factor is also considered and the caused influence on system capacity is evaluated. Simulation results show that the proposed algorithms achieve a good tradeoff between network capacity and interference. Moreover, the average network efficiency is highly improved and the outage probability is also decreased.     

Decentralized beamforming design and power allocation for limited coordinated multi-cell network

Multi-cell processing （MCP） is capable of providing significant performance gain, but this improvement is accompanied by dramatic signaling overhead between cooperative base stations. Therefore, balancing the performance gain and overhead growth is crucial for a practical multi-base cooperation scheme. In this paper, we propose a decentralized algorithm to jointly optimize the power allocation and beamforming vector with the goal of maximizing the system performance under the constraint of limited overhead signal and backhaul link capacity. In particular, combined with calculating the transmission beamforming vector according to the local channel state information, an adaptive power allocation is presented based on the result of sum capacity estimation. Furthermore, by utilizing the concept of cell clustering, the proposed framework can be implemented in a practical cellular system without major modification of network architecture. Simulation results demonstrate that the proposed scheme improves the system performance in terms of the sum capacity and cell-edge capacity.     

Fair and Efficient Spectrum Resource Allocation and Admission Control for Multi-user and Multi-relay Cellular Networks

This paper studies the joint relay selection and spectrum allocation problem for multi-user and multi-relay cellular networks, and per-user fairness and system efficiency are both emphasized. First, we propose a new data-frame structure for relaying resource allocation. Considering each relay can support multiple users, a \(K\) -person Nash bargaining game is formulated to distribute the relaying resource among the users in a fair and efficient manner. To solve the Nash bargaining solution (NBS) of the game, an iterative algorithm is developed based on the dual decomposition method. Then, in view of the selection cooperation (SC) rule could help users achieve cooperation diversity with minimum network overhead, the SC rule is applied for the user-relay association which restricts relaying for a user to only one relay. By using the Langrangian relaxation and the Karush–Kuhn–Tucker condition, we prove that the NBS result of the proposed game just complies with the SC rule. Finally, to guarantee the minimum rate requirements of the users, an admission control scheme is proposed and is integrated with the proposed game. By comparing with other resource allocation schemes, the theoretical analysis and the simulation results testify the effectiveness of the proposed game scheme for efficient and fair relaying resource allocation.     

Proportional fair scheduling with superposition coding in a cellular cooperative relay system

Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on superposition coding (SC) which maximizes the achievable sum-rate under a proportional fairness constraint. Unlike most relaying schemes where users are allocated orthogonally, our scheme serves the two users simultaneously on the same time-frequency resource unit by superposing their messages into three SC layers. The optimal power allocation parameters of each SC layer are derived by analysis. Next, we consider the general multi-user case in a cellular relay system, for which we design resource allocation algorithms based on proportional fair scheduling exploiting the proposed SC-based scheme. Numerical results show that the proposed algorithms allowing simultaneous user allocation outperform conventional schedulers based on orthogonal user allocation, both in terms of throughput and proportional fairness. These results indicate promising new directions for the design of future radio resource allocation and scheduling algorithms.     

Orthogonal frequency division multiple access resource allocation in mobile multihop relay networks using an adaptive frame structure

For wireless mobile multihop relay (MMR) networks, we have chosen orthogonal frequency division multiple access (OFDMA) and time division duplex as a multiple access scheme and a duplex communication technique, respectively. We have also selected nontransparent relay stations (nt‐RSs) as relay nodes to extend the MMR network coverage. Through the nt‐RSs, far‐off subscriber stations (SSs) or hidden SSs can communicate with a base station (BS) that is connected to backhaul networks. In these MMR networks, the way in which a BS and nt‐RSs use OFDMA resources (e.g., OFDMA symbols and subcarriers) and share them might reduce system capacity and network throughput. Therefore, we proposed a new adaptive OFDMA frame structure for both the BS and the nt‐RSs. The proposed scheme is the first approach that incorporates the adaptive technique for wireless MMR networks. Based on the proposed adaptive OFDMA frame structure, an adaptive OFDMA resource allocation for SSs within a BS as well as nt‐RSs was proposed. To derive the maximum OFDMA resource that nt‐RSs can be assigned and to synchronize access zones and relay zones between a superior station and its subordinate nt‐RSs, three properties are introduced: a data relay property, a maximum balance property, and a relay zone limitation property. In addition, we propose max‐min and proportional fairness schemes of the proposed adaptive frame structure. Our numerical analysis and simulations show that the proposed OFDMA allocation scheme performs better than the nonadaptive allocation scheme in terms of network throughput and fairness especially in the asymmetric distribution of subscriber stations between access zones and relay zones in the MMR networks. Copyright © 2011 John Wiley & Sons, Ltd.     

Joint Opportunistic Spectrum Sharing and Dynamic Full Frequency Reuse in OFDMA Cellular Relay Networks

This paper considers the problem of spectrum sharing in orthogonal frequency division multiple access cellular relay networks. Firstly, a novel dynamic full frequency reuse scheme is proposed to improve the spectral efficiency. Different from the conventional full frequency reuse scheme which only allows the base station (BS) reusing the subcarriers in the specific regions, an improved full frequency reuse scheme is proposed to allow the BS reusing all the subcarriers in the whole BS coverage region to exploit additional multiuser diversity gain. In order to dynamically reuse the frequency resource among the BS and relay stations (RSs) to further improve the spectral efficiency, the adaptive subcarrier scheduling is introduced into the improved full frequency reuse scheme to obtain more multi-user diversity gain, which forms the proposed novel dynamic full frequency reuse scheme. Secondly, in order to further increase the system throughput, the opportunistic spectrum sharing scheme is introduced to allow the RSs selectively reusing the subcarriers among each other, which joint with the proposed dynamic full frequency reuse scheme to intelligently allocates the subcarriers originally reused by the BS and a RS to another suitable RS which can best improve the system performance after considering the additional interference. Thirdly, in order to select The optimal reusing combination scheme of BS and RSs to exploit more potential system performance, a heuristic approach based on genetic algorithm is proposed to search the optimal BS and RSs combination to opportunistically share the frequency resource. Simulation results show that the proposed dynamic full frequency reuse scheme can obtain high spectral efficiency, fine fairness and low outage probability compared to the conventional full frequency reuse scheme. Furthermore, the system performance can be improved when considering the opportunistic spectrum sharing among RSs. Finally, after adopting the genetic algorithm, the system performance can be greatly improved by the frequency reusing among the optimal BS and RSs combination.     

Incentive Mechanism for Multiuser Cooperative Relaying in Wireless Ad Hoc Networks: A Resource-Exchange Based Approach

This paper studies the resource allocation (RA) and the relay selection (RS) problems in cooperative relaying (CR) based multiuser ad hoc networks, and a multiuser cooperative game is proposed to stimulate selfish user nodes to participate in the CR. The novelty of the game scheme lies in that it takes explicit count of that a wireless user can act as a data-source as well as a potential relay for other users. Consider a user has the selfish incentive to consume his/her spectrum resource solely to maximize his/her own data-rate and the selection cooperation (SC) rule which restricts relaying for a user to only one relay is explicitly imposed. To stimulate user nodes to share their energy and spectrum resource efficiently in the Pareto optimal sense, first, we formulate the RA problem for multiuser CR as a bargaining game. By solving the Nash bargaining solution of the game, Pareto optimal RA for cooperative partners can be achieved. Next, to implement the SC-rule imposed RS, a simple heuristic is proposed with the main method being to maintain the long-term priority fairness for cooperative partner selection for each selfish user. The proposed RS with RA (RS-RA) algorithm has a low computational complexity of $O(K^{2})$ , where $K$ is the number of users in a network. Simulation results demonstrate the system efficiency and fairness properties of the proposed bargaining game theoretic RS-RA scheme.     

Joint relay selection and resource allocation in cooperative device-to-device communications

Device-to-device (D2D) communications allow proximate cellular user equipments (UEs) to communicate with each other directly under the control of base station (BS). In this paper, considering the selection relaying (SR) rule which allows a subset of potential relays to forward the source’s data to the corresponding destination, we first establish a multi-relay system model where a D2D UE can act as not only a source but also a potential relay for another D2D link, and then analyze the cooperation behaviors among selfish UEs. Next a simple strategy is proposed to deal with the relay selection problem, and then the fair and efficient resource sharing problem among cooperating D2D UEs is formulated as a bargaining game. Since the game function is non-convex, we turn to an iterative method by introducing an auxiliary function to get the proportional fair resource allocation results. The system efficiency and fairness are proved by numeral simulation results.     

Resource Allocation Schemes for the Heterogeneous OFDMA System with Multiple Ad Hoc Relays

In this paper, we present a heterogeneous network framework involved an orthogonal frequency division multiple access (OFDMA) network with an out-of-band Ad Hoc network, which maybe a promising architectural upgrade and has not been studied so far. In the heterogeneous system, the mobile stations (MSs) are dual-mode with both cellular OFDMA and Ad Hoc radios. And MSs communicate with the base station by cellular OFDMA mode, while they communicate with each other by Ad Hoc mode. An active MS can choose multiple inactive MSs as its relay stations (RSs). And each RS operates in a full duplex mode, that is, it can receive data through Ad Hoc network in the first hop and transmit data through the OFDMA network in the second hop, simultaneously. Based on this heterogeneous system, the problem of joint relay selection, subcarrier and power allocation with the objective of maximizing the system capacity under individual rate and transmit power constraints is addressed. We propose a dual-based resource allocation scheme to solve the problem fairly and efficiently, and then we propose a fully distributed resource allocation scheme to decrease the computational complexity. Simulation results show that the performance of the proposed dual-based resource allocation scheme, in terms of the system capacity and the outage probability, is better than that of the fully distributed resource allocation scheme. However, the performance improvement is at the expense of a high computational complexity.     

基于合作中继的OFDM蜂窝网络的QoS感知资源调度算法

针对基于中继的OFDM蜂窝网络,该文考虑具有不同QoS要求的混合业务场景,引入合作传输机制,提出了一种基于合作中继的QoS感知资源调度算法,解决了合作中继节点选取,子载波分配以及功率控制等问题。以最大化系统效用为目标,在考虑QoS业务的速率要求与基站功率约束的同时,针对中继结构引入了中继节点的功率约束。为降低计算复杂度,将原非线性组合优化问题分解为子载波分配与功率控制两个子问题。仿真结果表明,该文所提算法在能量节约、系统效用,吞吐量等性能方面都有显著优势。     

中继增强的无线蜂窝多小区系统的联合调度与功率控制算法

针对采用全局频率复用的中继增强的无线蜂窝多小区系统,该文考虑多种通信模式并存的混合场景,提出了一种干扰感知的联合资源分配策略。以最大化系统总吞吐量为目标,同时考虑小区间干扰对中继节点与移动站点的影响,以及基站与中继节点各自的发射功率约束。为了降低计算复杂度,针对用户与中继节点配对问题提出了一种基于小区间干扰的调度算法;针对功率控制问题分别提出了一种基于符号规划的最优功率分配算法和一种次优的最小能耗功率分配算法。仿真结果表明,该文所提算法逼近最优资源分配,在系统吞吐量与能量效率等性能方面具有显著优势。