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.     

Fair resource sharing for cooperative relay networks using nash bargaining solutions

This letter considers the problem of resource sharing between two selfish nodes in cooperative relay networks. In our system, each node can act as a source as well as a potential relay, and both nodes are willing to achieve an optimal signalto- noise ratio (SNR) increase by adjusting their power levels for cooperative relaying. We formulate this problem as a two-person bargaining game, and use the Nash bargaining solution (NBS) to achieve a win-win strategy for both nodes. Simulation results indicate the NBS resource sharing is fair in that the degree of cooperation of a node only depends on how much contribution its partner can make to its SNR increase.     

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.     

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.     

Bandwidth allocation for cooperative relay networks based on Nash bargaining solution

This paper is concerned with the bandwidth allocation problem for cooperative relay networks. The relay takes the roles of not only forwarding the data originated from the users but also of transmitting its own data to the access point. We focus on the interesting questions of when and how the users and the relay can both benefit from the cooperation by bandwidth allocation for relaying among the users. The bandwidth allocation problem is formulated in this paper as a Nash bargaining problem, and then the bandwidth allocation algorithm can be given on the basis of the sub‐gradient method. Simulation results illustrate that users and the relay can both obtain more profits through cooperation. Copyright ©2011 John Wiley & Sons, Ltd.     

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.     

A Stackelberg game for resource allocation in multiuser cooperative transmission networks

In this paper, we consider the problem of stimulating cooperation and resource allocation in cooperative transmission networks. We formulate this problem as a sellers' market competition where a relay is willing to share its resource with multiple users. We use a Stackelberg game to jointly consider the benefits of the relay and the users. Firstly, the relay determines the price of relaying according to the user demand. Secondly, the users purchase the optimal amount of resources to maximize their utilities. Although the Nash equilibrium, i.e., the solution of the game, can be obtained in a centralized manner, we develop a distributed algorithm to search the Nash equilibrium, which is more applicable in practical systems. Also, the convergence conditions of the algorithm are analyzed. Simulation results show, by using the distributed algorithm, the relay and the users could determine what price should ask for and how much bandwidth should buy, respectively. Copyright © 2010 John Wiley & Sons, Ltd.     

Nash Bargaining Solution for RFID Frequency Interference

We present a fair and efficient solution for selfish readers with the Nash bargaining solution (NBS) to mitigate the effects of RFID frequency interference. We compare the NBS with a solution derived by the max log‐sum scheme that maximizes total utility and show that for selfish and rational readers, the NBS brings success in bargaining on resource allocation between readers unlike the max log‐sum scheme, although the NBS has less total payoff compared to the max log‐sum scheme.     

基于议价博弈论的无线协作中继网络性能改进算法

针对自私性无线协作中继(CR)网络中的放大再中继(AF)和解码再中继(DF)协议,分别给出 公平且有效率的协作中继功率分配方案。两种方案虽然具体研究内容有差别,但有着共同 的研究策略。首先,将节点间的协作功率选择问题建模为纳什议价博弈问题(NBP);然后, 通过求取其纳什议价解(NBS)获得协作节点的共赢策略;最后,针对AF和DF协议分别给出计 算机仿真。仿真结果表明,所提出协作中继性能改进算法的效率性体现在所有协作节点在AF 和DF协议中均获得信号接收质量的提高,其公平性则体现在任意节点为其协作伙伴所贡献的 转发功率大小仅取决于对方为其带来的性能增益大小。     

虚拟两天线蜂窝网络中考虑中继公平性的协作博弈调度方法(英文)

In thsssse cellular network, Relay Stations (RSs) help to improve the system performance; however, little work has been done considering the fairness of RSs. In this paper, we study the cooperative game approaches for scheduling in the wireless relay networks with two-virtual-antenna array mode. After defining the metric of relay channel capacity, we form a cooperative game for scheduling and present the interpretation of three different utilization objectives physically and mathematically. Then, a Nash Bargaining Solution (NBS) is utilized for resource allocation considering the traffic load fairness for relays. After proving the existence and uniqueness of NBS in Cooperative Game (CG-NBS), we are able to resolve the resource allocation problem in the cellular relay network by the relay selection and subcarrier assignment policy and the power allocation algorithm for both RSs and UEs. Simulation results reveal that the proposed CG-NBS scheme achieves better tradeoff between relay fairness and system throughput than the conventional Maximal Rate Optimization and Maximal Minimal Fairness methods.     

Bandwidth allocation and admission control scheme based on Nash bargaining solution for WiMAX systems

Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access (TDMA) mode. In this article, the problem of bandwidth allocation and admission control is formulated as a Nash bargaining model. The nash bargaining solution (NBS) derived from the cooperative game is adopted to maximize the spectrum utilization. Analysis and simulation results show that there is a unique Pareto optimal bandwidth allocation solution by using NBS among various flows. Furthermore, maximum utility of the system can also be maintained by using the admission control policy with different number of connections and variable channel qualities. The total throughput of the proposed scheme is close to the maximal one, while significantly improving fairness compared to the existing solutions.     

Optimal power control for wireless cooperative relay networks: a cooperative game theoretic approach

Wireless nodes operating on batteries are always assumed to be selfish to consume their energy solely to maximize their own benefits. Thus, the two network objectives, that is, system efficiency and user fairness should be considered simultaneously. To this end, we propose two game theoretic mechanisms, that is, the signal‐to‐noise ratio (SNR) game and the data‐rate game to stimulate cooperation among selfish user nodes for cooperative relaying. Considering one node could trade its transmission power for its partner's relaying directly, the strategy of a node is defined as the amount of power that it is willing to contribute for relaying purpose. In the SNR game, selfish nodes are willing to achieve SNR increases at their receivers, while in the data‐rate game the nodes are willing to achieve data‐rate gains. We prove that each of the games has a unique Nash bargaining solution. Simulation results show that the Nash bargaining solution lead to fair and efficient resource allocation for both the cooperative partner nodes in the Pareto optimal sense, that is, both the nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance. Copyright © 2012 John Wiley & Sons, Ltd.     

Cooperative Relay‐Aware Spectrum leasing based on Nash bargaining solution in cognitive radio networks

This paper proposes a spectrum leasing strategy based on cooperative relaying for cognitive radio networks. The basic idea is to make the primary user lease a fraction of the licensed spectrum to the secondary user, which acts as a relay for the primary user in return. We formulate the spectrum leasing problem as a Nash bargaining game to avoid the ineffective solution obtained by Stackelberg game. The cooperative condition and the optimal time allocation can be obtained by solving the game. Numerical results demonstrate that both the primary user and the secondary user can obtain larger profits from the spectrum leasing based on Nash bargaining solution. Copyright © 2014 John Wiley & Sons, Ltd.     

Distributed power control for multiuser cognitive radio networks with quality of service and interference temperature constraints

One of the most challenging problems in dynamic resource allocation for cognitive radio networks is to adjust transmission power of secondary users (SUs) while quality of service needs of both SUs and primary users (PUs) are guaranteed. Most power control algorithms only consider interference temperature constraint in single user scenario while ignoring the interference from PUs to SUs and minimum signal to interference plus noise ratio (SINR) requirement of SUs. In this paper, a distributed power control algorithm without user cooperation is proposed for multiuser underlay CNRs. Specifically, we focus on maximizing total throughput of SUs subject to both maximum allowable transmission power constraint and SINR constraint, as well as interference temperature constraint. To reduce the burden of information exchange and computational complexity, an average interference constraint is proposed. Parameter range and convergence analysis are given for feasible solutions. The resource allocation is transformed into a convex optimization problem, which is solved by using Lagrange dual method. In computer simulations, the effectiveness of our proposed scheme is shown by comparing with distributed constrained power control algorithm and Nash bargaining power control game algorithm. Copyright © 2014 John Wiley & Sons, Ltd.     

OFDMA认知无线电网络中面向需求的频谱共享

从满足次网络通信需求的角度,设计一个两阶段模型,求解OFDMA 认知无线电网络中频谱租赁与分配问题。模型第1阶段,次基站收集次网络通信需求,向多个主基站租用频谱资源。运用Bertrand博弈对主、次基站的交易行为进行建模,并将纳什均衡作为最终定价方案。第2阶段,基于纳什议价方案,将次基站子载波和功率分配问题定义成非线性规划问题,并通过拉格朗日乘数法进行求解。仿真实验表明,相对于其他频谱共享方案,所提方案高效地满足每个次用户的通信需求。     

无线网络中谈判解的协作带宽分配策略

为了促使无线网络中的"自私"节点参与合作,提出了谈判解协作带宽分配(CBA)策略,解决了节点间采用交换带宽资源协作传输,彼此以多大带宽中继对方数据的问题.首先,将两个节点的协作带宽分配问题建模为合作博弈中的谈判过程;之后,采用拉格朗日乘数法得到两个用户的纳什谈判解(NBS)协作带宽分配;其次,提出了一种新的Kalai-Smorodinsky谈判解(KSBS)协作带宽分配策略;最后,对两种谈判解协作带宽分配策略的公平性进行了研究.仿真表明,KSBS协作带宽分配策略和NBS协作带宽分配策略对提升用户效用的作用基本相同,但KSBS策略比NBS策略更为公平.     

Fair Multiuser Channel Allocation for OFDMA Networks Using Nash Bargaining Solutions and Coalitions

In this paper, a fair scheme to allocate subcarrier, rate, and power for multiuser orthogonal frequency-division multiple-access systems is proposed. The problem is to maximize the overall system rate, under each user's maximal power and minimal rate constraints, while considering the fairness among users. The approach considers a new fairness criterion, which is a generalized proportional fairness based on Nash bargaining solutions and coalitions. First, a two-user algorithm is developed to bargain subcarrier usage between two users. Then a multiuser bargaining algorithm is developed based on optimal coalition pairs among users. The simulation results show that the proposed algorithms not only provide fair resource allocation among users, but also have a comparable overall system rate with the scheme maximizing the total rate without considering fairness. They also have much higher rates than that of the scheme with max-min fairness. Moreover, the proposed iterative fast implementation has the complexity for each iteration of only$O(K^2Nlog_2 N+K^4)$, where$N$is the number of subcarriers and$K$is the number of users.     

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.     

Cooperative spectrum sharing of multiple primary users and multiple secondary users

This paper proposes a multiple-input multiple-output (MIMO) based cooperative dynamic spectrum access (DSA) framework that enables multiple primary users (PUs) and multiple secondary users (SUs) to cooperate in spectrum sharing. By exploiting MIMO in cooperative DSA, SUs can relay the primary traffic and send their own data at the same time, which greatly improves the performance of both PUs and SUs when compared to the non-MIMO time-division spectrum sharing schemes. Especially, we focus on the relay selection optimization problem among multiple PUs and multiple SUs. The network-wide cooperation and competition are formulated as a bargaining game, and an algorithm is developed to derive the optimal PU-SU relay assignment and resource allocation. Evaluation results show that both primary and secondary users achieve significant utility gains with the proposed framework, which gives all of them incentive for cooperation.     

Relaying Energy Allocation Scheme Based on Multi-User SWIPT Relaying System

This paper investigates the relay energy allocation scheme based on the time switching (TS) operation strategy in multi-user simultaneous wireless information and power transfer (SWIPT) relaying system, where the relay is energy-constrained and utilizes the energy harvested in the energy harvesting mode to amplify and forward the information of the users. In the multi-user relaying system, the distances of the receivers of the users to the relay may be different. Thus, the total information rate maximization model is proposed and the corresponding energy allocation scheme is derived. After comparing the information rates of users, it is found that the information rates of users who are far from the relay are significantly lower than those of users who are close to the relay, i.e., “far-near” phenomenon. For the “far-near” problem, we propose the common information rate maximization model, and derive the corresponding energy allocation scheme. In this model, the information rates of all users are equal, which ensures the fairness of the information rate in multi-user relaying communication system. The simulation results show that the energy allocation scheme based on the common information rate maximization model can effectively solve the “far-near” problem in multi-user relaying communication system.