基于潜在博弈的认知无线电频谱分配研究

为解决认知无线电网络中认知用户、授权用户共存情况下的频谱分配问题,提出了一种基于潜在博弈的认知无线电频谱分配模型,该模型以最小化系统总干扰水平为目标,认知用户采用避免机会浪费的改进型策略动态调整规则进行频谱选择,经过有限改进路径快速收敛到博弈的纳什均衡点。在30个认知用户和2个授权用户共存的场景下进行仿真实验,算法以较快的收敛速度实现了频谱分配的目标,证明了模型及算法的可行有效。     

认知无线多跳网中保证信干噪比的频谱分配算法

为解决无线多跳网络在固定频谱分配方式下所固有的信道冲突等问题,利用认知无线电的动态频谱分配技术,提出了一种适用于次用户组成的无线多跳网络的、underlay方式下的全分布式频谱分配算法。该算法将频谱分配问题建模成静态非合作博弈,证明了纳什均衡点的存在,并给出了一种求解纳什均衡点的迭代算法。大量仿真实验证明,该算法能实现信道与功率的联合分配,在满足主用户干扰功率限制的同时,保证次用户接收信干噪比要求。     

基于频谱数据库的分布式动态频谱接入算法

频谱数据库是一种直接获得频谱信息的方式,针对在复杂多变的网络环境中用户之间缺少信息交互,研究了数据库协助和没有数据库情况下的动态频谱接入算法。一方面,次用户通过历史感知数据估计信道的可用性而进行信道选择,另一方面,次用户通过数据库获得更加可靠的频谱信息从而做出策略。证明了用户之间的博弈是一个超模博弈,通过提出的分布式学习算法能收敛到一个纯策略纳什均衡点。仿真结果表明,提出的联合数据库感知算法和数据库协助算法比依靠感知的结果收敛更快,获得的系统吞吐量接近最大,减少了用户决策的时延,提高了频谱利用率。     

基于Stackelberg博弈的网络虚拟化资源分配方法

在网络虚拟化环境中,基于Stackelberg博弈模型提出了静态博弈算法下网络运营商对频谱的定价策略及静态和动态博弈算法下各虚拟运营商的频谱分配方法,并推导了各运营商收益最大时的纳什均衡点。该方法能同时满足网络运营商和虚拟网络运营商收益最大化的需求。仿真结果验证了算法的有效性及纳什均衡点的存在性。     

基于博弈论的多小区OFDMA系统资源分配

立足于限制条件下实现多小区OFDMA系统容量最大或总传输功率最小的优化问题,比较分析了近年来提出的多种基于博弈论的资源分配算法。分析了纳什均衡点存在和唯一的条件,通过引入定价机制或虚拟裁判机制,使得到的解收敛于纳什均衡点。最后,探讨了联合中继节点或MIMO技术的多小区OFDMA系统资源分配算法,该算法能有效提高频谱效率,将成为未来研究的热点。     

认知小蜂窝网络中基于干扰温度限制的下行能效资源分配算法

为最大化认知小蜂窝基站的能量效率,本文基于博弈论模型分析了下行联合频谱资源块和功率分配行为.在干扰受限环境下,多个基站采用分布式结构共享空闲频谱资源.为避免累加干扰损害主用户的通信,算法中引入了功率和干扰温度限制.由于具有耦合限制的分数形式的能量效用函数是非凸最优的,通过将其转化为等价的减数形式进行迭代求解.给定频谱资源块分配策略后,主博弈模型可被重新建模为便于求解发射功率的等价子博弈模型,并通过代价的形势解除耦合限制.仿真结果表明,本文所提算法能够收敛到纳什均衡,并有效提高了系统资源利用率和能量效率.     

基于排队时延及博弈分析的认知无线网络信道分配算法

提出了一种适用于认知无线网络的分布式动态频谱资源分配算法。该方法以业务分组的传输成功率作为用户的效用函数,通过优先级排队模型求解传输时延,并采用分布式博弈获得各用户的信道分配策略。与已有的算法相比,所提算法对策略迭代方式进行了改进,且采用了动态策略调整步长。各从用户根据当前感知的网络状态和其余用户的策略,不断动态调整自身的信道选择策略。所提出的算法能够使各认知用户信道选择策略更加快速地收敛到策略均衡点,有效抑制策略的振荡,减小分组丢失率。基于MATLAB对所提出的算法的性能进行了仿真,仿真结果验证了该算法的有效性。     

无线传感器网络基于容量和传输能耗的功率与信道联合博弈算法

针对无线传感器网络(WSNs)日益增大的干扰导致网络容量下降的问题,同时考虑到网络能量有限性,该文综合网络容量和链路传输能耗,构建了高容量低传输能耗的功率控制与信道分配联合博弈模型,并通过理论分析证明该模型存在最优功率和最优信道。继而采用最佳响应策略,在该博弈模型基础上提出了一种功率控制与信道分配联合优化算法(PCOA),理论证明其能收敛到纳什均衡状态,且具有较小的信息复杂度。最后,仿真结果表明,PCOA算法能够达到降低网络干扰和链路能耗,增大网络容量的目的。     

DF协作中继网络基于买者/卖者博弈的中继选择和功率分配策略

该文针对采用解码-转发(DF)协议的协作中继网络,提出了一种基于买者-卖者博弈的中继选择和功率分配策略,通过将用户建模为买者,可以以最大效用为标准选择最优中继和确定最佳的购买功率;将中继建模为卖者,可通过先市场后利润的功率价格调整策略获得最大的利润。分析了两者博弈达到平衡的条件并进行了仿真,结果验证了纳什均衡点的存在并表明,该策略计算量少,收敛速度快,实用性强,在兼顾用户和中继节点的利益的同时可以有效提高用户的传输速率,扩大基站的覆盖范围,提高功率利用效率。     

无线传感器网络中支持并行传输的信道与功率联合优化博弈算法

针对无线传感器网络中干扰日益增大引起网络容量下降、能耗增加的问题,该文建立了信道分配与功率控制联合优化博弈模型。在该模型中链路将既能保持自身成功传输又不影响其它链路传输的信道作为可选信道,以实现链路的并行传输。继而基于该模型设计了一种支持并行传输的信道分配与功率控制联合优化博弈算法(JCPGC)。该算法利用最佳响应策略对模型求解,并通过超模博弈等理论证明了JCPGC能够收敛到纳什均衡。此外,该算法充分考虑信道分配和功率控制之间独立又相互影响的关系提高了网络容量。仿真实验结果表明,JCPGC具有大容量、低干扰和低能耗的特性。     

Joint Power and Rate Control Combined with Adaptive Modulation in Cognitive Radio Networks

Efficient resource allocation is a major challenge in cognitive radio networks, especially when Cognitive Users (CUs) share the same frequency band with the Primary User. In this paper, we consider minimizing the total power consumption by combining power control, rate control and adaptive modulation. We analyze the existence, uniqueness and Pareto optimality of Nash Equilibrium (NE) in the power control game, and propose an iterative algorithm to find the NE followed by the adjustment of both the transmission rate and modulation scheme based on the convergent power. If compared with previous works, the key feature of the proposed strategy is that each CU can prolong its battery life in energy-constrained networks to support heterogenous services with different transmission rates and modulation schemes requirements. Simulation results are provided to confirm the effectiveness of the proposed method in power saving, improvement of both the transmission rate and the spectral efficiency and the simplicity of implementation.     

A power control game based on outage probabilities for multicell wireless data networks

We present a game-theoretic treatment of distributed power control in CDMA wireless systems using outage probabilities. We first prove that the noncooperative power control game considered admits a unique Nash equilibrium (NE) for uniformly strictly convex pricing functions and under some technical assumptions on the SIR threshold levels. We then analyze global convergence of continuous-time as well as discrete-time synchronous and asynchronous iterative power update algorithms to the unique NE of the game. Furthermore, we show that a stochastic version of the discrete-time update scheme, which models the uncertainty due to quantization and estimation errors, converges almost surely to the unique NE point. We finally investigate and demonstrate the convergence and robustness properties of these update schemes through simulation studies.     

Fair and stable joint beacon frequency and power control for connected vehicles

In vehicular communications, periodic one-hop broadcast of beacons allows cooperative awareness for vehicles. To avoid congestion in the shared channel used for transmission of beacons, a joint beacon frequency and power control protocol based on game theory is presented in this paper. The existence, uniqueness and stability of the Nash Equilibrium (NE) of the game is proved mathematically. An algorithm is devised to find the equilibrium point in a distributed manner and its stability and convergence has been validated using simulation. The algorithm converges to the NE from any initial frequency and power and it can provide both fairness in power and weighted fairness in frequency. The protocol has per vehicle parameters, hence, every vehicle can control its share of the bandwidth according to its dynamics or safety application requirements while the whole usage of bandwidth is controlled at a desired level.

     

分层异构网络中基于斯坦克尔伯格博弈的资源分配算法

分层异构网络中家庭基站与宏基站之间往往存在干扰,如何分配资源以获得高谱率和高容量、保证用户性能一直是研究的重点。为了解决这个问题,本文提出了一种异构蜂窝网络中基于斯坦克尔伯格博弈的家庭基站与宏基站联合资源分配算法,算法首先基于图论的分簇算法对家庭基站和宏用户进行分簇和信道分配,以减少家庭基站之间的同层干扰和家庭基站层与宏蜂窝网络的跨层干扰;然后建立了联合家庭基站发射功率以及宏用户接入选择的斯坦克尔伯格博弈,推导出达到纳什均衡时的家庭基站发射功率的表达式,并据此为宏用户选择合适的接入策略。仿真结果表明,该算法能够有效地提高宏用户的信干噪比（SINR）,家庭用户的性能也得到改善。      

Near-optimal reinforcement learning framework for energy-aware sensor communications

We consider the problem of average throughput maximization per total consumed energy in packetized sensor communications. Our study results in a near-optimal transmission strategy that chooses the optimal modulation level and transmit power while adapting to the incoming traffic rate, buffer condition, and the channel condition. We investigate the point-to-point and multinode communication scenarios. Many solutions of the previous works require the state transition probability, which may be hard to obtain in a practical situation. Therefore, we are motivated to propose and utilize a class of learning algorithms [called reinforcement learning (RL)] to obtain the near-optimal policy in point-to-point communication and a good transmission strategy in multinode scenario. For comparison purpose, we develop the stochastic models to obtain the optimal strategy in the point-to-point communication. We show that the learned policy is close to the optimal policy. We further extend the algorithm to solve the optimization problem in a multinode scenario by independent learning. We compare the learned policy to a simple policy, where the agent chooses the highest possible modulation and selects the transmit power that achieves a predefined signal-to-interference ratio (SIR) given one particular modulation. The proposed learning algorithm achieves more than twice the throughput per energy compared with the simple policy, particularly, in high packet arrival regime. Beside the good performance, the RL algorithm results in a simple, systematic, self-organized, and distributed way to decide the transmission strategy.     

Joint Algorithm of Channel Allocation and Power Control in Multi-channel Wireless Sensor Network

In the wireless sensor network, the interference incurred by another transmitter’s transmission may disturb other receivers’ correct receptions of packets, thus, the add of a new transmission must consider its effect on other transmissions. Additionally, in order to reduce the interference and increase QoS, multi-channel technology is introduced into wireless communication, but the energy cost by the channel switch increases with the interval of channels increasing. Based on the above analysis, we consider an energy efficient joint algorithm of channel allocation and power control (JCAPC) for wireless sensor network. In JCAPC, each link firstly establishes its available channel set on which the transmitter of the link can guarantee its transmission successfully and don’t disturb other receivers’ transmissions, and then each link chooses a channel from the available channel set according to the energy cost on anti-interference and channel switch. After that, we formulate power control on each channel as a non-cooperative game with utility function including Signal-to-Interference-and-Noise Ratio (SINR) price. In order to reduce the energy cost of the information exchange during the traditional game, we introduce the thought of game virtual playing, in which each link can decide its own transmission power by imitating the game among links with its once collected information. Consequently, JCAPC can not only increase the transmission efficiency but also reduce the nodes’ energy waste. Moreover, the existence of Nash Equilibrium (NE) is proven based on super-modular game theory, and it’s able to obtain the unique NE by relating this algorithm to myopic best response updates. The introduction of game virtual playing saves the energy cost of network further more by reducing the number of information exchange. Simulation results show that our algorithm can select a channel with good QoS using less energy consumption and provide adequate SINR with less transmit power, which achieves the goal of efficiently reducing energy waste.     

A stochastic game framework for joint frequency and power allocation in dynamic decentralized cognitive radio networks

Cognitive radio networks (CRNs) have been recognized as a promising solution to improve the radio spectrum utilization. This article investigates a novel issue of joint frequency and power allocation in decentralized CRNs with dynamic or time-varying spectrum resources. We firstly model the interactions between decentralized cognitive radio links as a stochastic game and then proposed a strategy learning algorithm which effectively integrates multi-agent frequency strategy learning and power pricing. The convergence of the proposed algorithm to Nash equilibrium is proofed theoretically. Simulation results demonstrate that the throughput performance of the proposed algorithm is very close to that of the centralized optimal learning algorithm, while the proposed algorithm could be implemented distributively and reduce information exchanges significantly.     

Non-Cooperative Power Control for Wireless Ad Hoc Networks with Repeated Games

One of the distinctive features in a wireless ad hoc network is lack of any central controller or single point of authority, in which each node/link then makes its own decisions independently. Therefore, fully cooperative behaviors, such as cooperation for increasing system capacity, mitigating interference for each other, or honestly revealing private information, might not be directly applied. It has been shown that power control is an efficient approach to achieve quality of service (QoS) requirement in ad hoc networks. However, the existing work has largely relied on cooperation among different nodes/links or a pricing mechanism that often needs a third-party involvement. In this paper, we aim to design a non-cooperative power control algorithm without pricing mechanism for ad hoc networks. We view the interaction among the users' decision for power level as a repeated game. With the theory of stochastic fictitious play (SFP), we propose a reinforcement learning algorithm to schedule each user's power level. There are three distinctive features in our proposed scheme. First, the user's decision at each stage is self-incentive with myopic best response correspondence. Second, the dynamics arising from our proposed algorithm eventually converges to pure Nash equilibrium (NE). Third, our scheme does not need any information exchange or to observe the opponents' private information. Therefore, this proposed algorithm can safely run in a fully selfish environment without any additional pricing and secure mechanism. Simulation study demonstrates the effectiveness of our proposed scheme.     

Reinforcement Learning Enhanced Iterative Power Allocation in Stochastic Cognitive Wireless Mesh Networks

As the scarce spectrum resource is becoming over-crowded, cognitive wireless mesh networks have great flexibility to improve the spectrum utilization by opportunistically accessing the licensed frequency bands. One of the critical challenges for realizing such network is how to adaptively allocate transmit powers and frequency resources among secondary users (SUs) of the licensed frequency bands while maintaining the quality-of-service (QoS) requirement of the primary users (PUs). In this paper, we consider the power control problem in the context of cognitive wireless mesh networks formed by a number of clusters under the total transmit power constraint by each SU as well as the mean-squared error (MSE) constraint by PUs. The problem is modeled as a non-cooperative game. A distributed iterative power allocation algorithm is designed to reach the Nash equilibrium (NE) between the coexisting interfered links. It offers an opportunity for SUs to negotiate the best use of power and frequency with each other. Furthermore, how to adaptively negotiate the transmission power level and spectrum usage among the SUs according to the changing networking environment is discussed. We present an intelligent policy based on reinforcement learning to acquire the stochastic behavior of PUs. Based on the learning approach, the SUs can adapt to the dynamics of the interference environment state and reach new NEs quickly through partially cooperative information sharing via a common control channel. Theoretical analysis and numerical results both show effectiveness of the intelligent policy.     

Joint Beamforming and Power Allocation for Cognitive MIMO Systems Under Imperfect CSI Based on Game Theory

The problem of joint beamforming and power allocation for cognitive multi-input multi-output systems is studied via game theory. The objective is to maximize the sum utility of secondary users (SUs) subject to the primary user (PU) interference constraint, the transmission power constraint of SUs, and the signal-to-interference-plus-noise ratio (SINR) constraint of each SU. In our earlier work, the problem was formulated as a non-cooperative game under the assumption of perfect channel state information (CSI). Nash equilibrium (NE) is considered as the solution of this game. A distributed algorithm is proposed which can converge to the NE. Due to the limited cooperation between the secondary base station (SBS) and the PU, imperfect CSI between the SBS and the PU is further considered in this work. The problem is formulated as a robust game. As it is difficult to solve the optimization problem in this case, existence of the NE cannot be analyzed. Therefore, convergence property of the sum utility of SUs will be illustrated numerically. Simulation results show that under perfect CSI the proposed algorithm can converge to a locally optimal pair of transmission power vector and beamforming vector, while under imperfect CSI the sum utility of SUs converges with the increase of the transmission power constraint of SUs.