能量收集认知无线电网络下的多接入用户信息年龄研究

针对信道资源有限的多接入信道无线传感器网络场景,实时信息的传送需要考虑信道环境和信息新鲜度问题。该文基于认知无线电物联网（Cognitive Radio-Internet of Things, CR-IoT）系统,构建了一个具有频谱访问权限的主用户（Primary User, PU）和两个可共享PU频谱次用户（Secondary User, SU）的网络模型。在考虑PU工作状态和SU数据队列稳定的条件下,提出了一个以最小化节点平均AoI为目标的优化问题。其次使用两种策略进行优化,包括概率随机接入策略（Probabilistic Random Access Policy, PRA）,该策略下两个SU节点根据相应的概率分布做出独立的传输决策;以及基于李雅普诺夫优化框架优化时隙内调度决策的漂移加罚策略（Drift Plus Penalty Policy, DPP）。仿真结果可知,DPP策略下得到的平均AoI的值要明显低于PRA策略,表明使用DPP策略对平均AoI的优化更加显著,可以有效提升数据包的时效性和新鲜度。      

基于无人机中继的星地认知网络波束成形算法

针对基于无人机中继的星地认知网络,提出了两种波束成形（beamforming, BF）算法,通过对各种干扰进行抑制,实现系统间的频谱共享。具体而言,在基于无人机中继的卫星网络作为次级网络、地面网络作为主网络的情况下,以无人机最大发射功率和主用户所受干扰为约束条件,建立次级用户信干噪比最大化准则的优化问题;接下来在已知次级用户统计信道状态信息的条件下,提出一种基于迭代的BF算法对优化问题进行求解;更进一步,为了降低迭代算法的实现复杂度,提出了一种基于迫零的BF算法。最后,计算机仿真验证了所提两种波束成形方案的正确性与有效性。     

Underlay协同频谱共享系统中基于SDF-DZFB的物理层安全传输

协同中继传输不仅能改善认知用户的传输可靠性,而且也能增强认知用户物理层安全性。针对Underlay模式下多中继协同频谱共享认知无线网络,本文设计了基于选择译码转发和分布式迫零波束成形（SDF-DZFB）的物理层安全传输方案,其中,假设存在单个被动窃听节点窃听中继节点的发送信号,在认知用户发送端同时考虑峰值干扰温度约束和最大发射功率约束,中继和认知用户目的端都受到主用户干扰。在此情况下,分析了认知用户发送端分别到目的端（称为主链路）和到窃听节点（称为窃听链路）的等效信干噪比的统计特性,进而推导出系统安全中断概率性能的闭式表达式。为了揭示所提物理层安全传输方案的安全分集度性能,本文进一步分析了高信噪比条件下安全中断概率的渐近表达式。计算机仿真验证了本文的理论分析结果。      

一种基于感知信任度的加权协作感知算法

基于非协作感知的不确定性,协作频谱感知方法具有更高的可靠性.在传统的加权数据融合的基础上,根据无线电通信环境次用户(Secondary User,SU)的信任度不同,引入信任度函数及其信任度因子,提出了一种基于次用户信任度的自适应数据融合算法.仿真结果表明,该算法可以提高主用户(Primary User,PU)的检测概率,具有一定的可靠性和有效性,其检测性能优于传统的加权数据融合准则,同时还适应感知用户的拓扑变化.     

基于随机矩阵理论的DET合作频谱感知算法

针对认知无线电系统中的频谱感知问题,该文采用随机矩阵理论(Random Matrix Theory, RMT)对多认知用户(Secondary User, SU)接收信号采样协方差矩阵的最大特征值的分布特性进行了分析和研究,提出了一种新的基于双特征值判决门限(Double Eigenvalue Threshold, DET)的合作频谱感知算法。由该算法感知性能的理论分析可知:DET合作感知算法无需主用户(Primary User, PU)发射机信号的先验知识,也不需要预先知道信道背景噪声功率。仿真结果表明,与传统的频谱感知方法相比,该方法只需较少的认知用户就能获得较高的感知性能,并且对噪声的不确定性具有较强的鲁棒性。     

Equation Chapter 1 Section 1基于中继的协作频谱感知性能分析及优化

提出了一种基于目标的中继协作频谱感知方案,证明了SU到SR链路上的信道条件对系统性能有较大的影响;鉴于此,提出了一种优化的最佳中继协作频谱感知(optimized BRCSS)方案,通过联合考虑目标SU到SR链路上的信道条件和 SR 到 FC 链路上的信道条件选择最佳认知中继;最后,从更实际的应用场景考虑,为了节约系统开销,进一步提出了一种自适应的最佳中继协作频谱感知方案（A-BRCSS）,即 SU 根据其信道条件,自适应地选择是否需要认知中继的协作传输。分析和仿真结果均表明,相比传统最佳中继协作频谱感知方案, Optimized BRCSS方案可以实现更高的感知性能;所提A-BRCSS方案可以实现几乎最佳的感知性能。     

认知无线网络中信道选择算法研究

研究认知无线网络中认知用户（secondary user,SU）的信道选择策略。在每个信道上,由于主用户（primary user,PU）返回的概率不相同,因此SU需要接入一个成功传输概率最大的信道,以尽量避免与PU发生冲突。提出了一个基于EWA学习的信道选择算法,仿真结果表明,SU通过学习历史信道选择的经验,能自适应地选择可用性最好的信道,从而最小化与PU发生冲突的概率,有效地降低了SU进行信道切换的可能性。     

基于信道质量干扰比量化准则的有限反馈波束形成

波束形成技术是MIMO无线通信系统的关键技术之一,它能够使系统有效性与可靠性都得到显著地提高,但它需要系统所有在线用户反馈其全部瞬时变化的信道状态信息,这将使拥挤的无线频谱资源更加紧张.为了降低系统所需的反馈量,本文结合LTE系统MIMO下行链路环境,将采用DFT基码本对信道状态信息进行量化,仅需要用户给基站反馈其最优码本索引;同时本文也首次提出基于信道质量干扰比为量化准则的一种新波束形成方案,并给出了质量干扰比的详细计算公式.此量化准则能够兼顾到量化信道的质量信息和子信道之间的互干扰信息,比传统的量化准则更具优良的性能.仿真结果表明,本文提出方案不仅可以明显降低系统反馈量,而且其性能超过随机波束形成,尤其在低信噪比场景下甚至优于特征波束形成的系统性能.理论分析和仿真验证表明本文方案是一种比较好的波束形成方案.     

基于信号空间对齐的网络编码方案北大核心

在多用户协同中继系统中,受共信道干扰的影响,系统性能下降严重。提出了一种融合多源信号空间对齐和网络编码的方案,每个用户通过中继向其他的用户发送不同的信息,同时也通过中继接收其他用户的不同信息。整个过程可分为多址接入信道(MAC)和广播信道(BC)两个阶段。在MAC阶段,利用信号空间对齐技术在中继形成较少的信息量、抑制多用户干扰。在BC阶段,通过中继的网络编码,设计简单的预编码算法,有效降低了用户译码的复杂度。整个系统的完成只需要两个时隙,能有效地抑制干扰和提高系统自由度。     

基于信号空间对齐的网络编码方案

在多用户协同中继系统中,受共信道干扰的影响,系统性能下降严重。提出了一种融合多源信号空间对齐和网络编码的方案,每个用户通过中继向其他的用户发送不同的信息,同时也通过中继接收其他用户的不同信息。整个过程可分为多址接入信道(MAC)和广播信道(BC)两个阶段。在MAC阶段,利用信号空间对齐技术在中继形成较少的信息量、抑制多用户干扰。在BC阶段,通过中继的网络编码,设计简单的预编码算法,有效降低了用户译码的复杂度。整个系统的完成只需要两个时隙,能有效地抑制干扰和提高系统自由度。     

Joint routing and channel assignment using online learning in cognitive radio networks

Cognitive radio networks (CRNs) are the solution for the problem of underutilizing the licensed spectrum for which there are more requests in the last couple of decades. In CRNs, Secondary users (SUs) are permitted to access opportunistically the licensed spectrum owned by primary users (PUs). In this paper, we address the problem of joint routing and channel assignment for several flows generated by source SUs to a given destination. We consider a more realistic model based on Markov modulated Poisson process for modeling the PUs traffic at each channel and the SUs try to exploit short lived spectrum holes between the PUs packets at the selected channel. The SUs want to cooperatively minimize the end-to-end delay of source SUs flows meanwhile the quality of service requirements of the PUs would be met. To consider partial observation of SUs about PUs activity at all channels and quick adaptation of SUs decisions to environment changes and cooperative interaction of SUs, we use decentralized partially observable markov decision process for modeling the problem. Then, an online learning based scheme is proposed for solving the problem. Simulation results show that the performance of the proposed method and the optimal method is close to each other. Also, simulation results show that the proposed method greatly outperforms related works at control of interference to the PUs while maintains the end-to-end delay of SU flows in a low level.

     

Dynamic spectrum sharing in cognitive radio networks using truthful mechanisms and virtual currency

In cognitive radio networks, there are scenarios where secondary users (SUs) utilize opportunistically the spectrum originally allocated to primary users (PUs). The spectrum resources available to SUs fluctuates over time due to PUs activity, SUs mobility and competition between SUs. In order to utilize these resources efficiently spectrum sharing techniques need to be implemented. In this paper we present an approach based on game-theoretical mechanism design for dynamic spectrum sharing. Each time a channel is not been used by any PU, it is allocated to SUs by a central spectrum manager based on the valuations of the channel reported by all SUs willing to use it. When an SU detects a free channel, it estimates its capacity according to local information and sends the valuation of it to the spectrum manager. The manager calculates a conflict-free allocation by implementing a truthful mechanism. The SUs have to pay for the allocation an amount which depends on the set of valuations. The objective is not to trade with the spectrum, but to share it according to certain criteria. For this, a virtual currency is defined and therefore monetary payments are not necessary. The spectrum manager records the credit of each SU and redistributes the payments to them after each spectrum allocation. The mechanism restricts the chances of each SU to be granted the channel depending on its credit availability. This credit restriction provides an incentive to SUs to behave as benefit maximizers. If the mechanism is truthful, their best strategy is to communicate the true valuation of the channel to the manager, what makes possible to implement the desired spectrum sharing criteria. We propose and evaluate an implementation of this idea by using two simple mechanisms which are proved to be truthful, and that are tractable and approximately efficient. We show the flexibility of these approach by illustrating how these mechanisms can be modified to achieve different sharing objectives which are trade-offs between efficiency and fairness. We also investigate how the credit restriction and redistribution affects the truthfulness of these mechanisms.     

Cooperative bargaining solution for efficient and fair spectrum management in cognitive wireless networks

This paper studies the fairness among the primary users (PUs) and the secondary users (SUs) for resource allocation in cognitive radio systems. We propose a novel co‐opetition strategy based on the Kalai–Smorodinsky bargaining solution to balance the system efficiency and the fairness among users. The strategy formulates the spectrum sharing problem as a nonlinear and integral sum utility maximization subject to a set of constraints describing the co‐opetition among the PUs and the SUs. Then, we solve the maximization problem by proposing a heuristical method that consists of four steps: multi‐PU competition, PU's subcarrier contribution, multi‐SU competition, and SU's subcarrier contribution. Extensive simulation results are presented by comparing the co‐opetition strategy with several conventional ones, including the Kalai–Smorodinsky bargaining solution, sum rate maximization as well as the Max–Min. Results indicate that the co‐opetition strategy can jointly balance the system efficiency and fairness in multiuser resource allocation, as it is able to support more satisfied users and in the meanwhile improve the utility of those unsatisfied. Moreover, the co‐opetition can help enable the coexistence of the PUs and the SUs in cognitive radio systems. Copyright © 2013 John Wiley & Sons, Ltd.     

Sensing-Throughput Tradeoff in Cluster-Based Cooperative Cognitive Radio Networks with A TDMA Reporting Frame Structure

This paper proposes clustering schemes to solve the sensing throughput tradeoff problem in cooperative cognitive radio networks (CCRNs). The throughput of CCRNs extremely depends on the spectrum sensing performance and data transmission time. In CCRNs, the more secondary users (SUs) for cooperation, the better performance of spectrum sensing. However, the overhead consumption increases as the quantity of cooperative SUs becomes huge, which will lead to less time for data transmission. In this paper, we propose a frame structure that takes the sensing results reporting time into consideration. In order to reduce the reporting time consumption, a centralized cluster-based cooperative cognitive radio system model is created based on the frame structure. The sensing-throughput tradeoff problem under both the perfect reporting channel and imperfect reporting channel scenarios are formulated. The proposed clustering schemes reduce the reporting time consumption and ensure the maximum transmission time of each SU. Numerical results show that the proposed clustering schemes achieve satisfying performance.     

Multiuser two‐way relay processing and power control methods for cognitive radio networks

We consider a cognitive radio system where a secondary network shares the spectrum band with a primary network. Aiming at improving the frequency efficiency of the secondary network, we set a multiantenna relay station in the secondary network to perform two‐way relaying. Three linear processing schemes at the relay station based on zero forcing, zero forcing‐maximum ratio transmission, and minimum mean square error criteria are derived to guarantee the quality of service of primary users and to suppress the intrapair and interpair interference among secondary users (SUs). In addition, the transmit power of SUs is optimized to maximize the sum rate of SUs and to limit the interference brought to PUs. Numerical results show that the proposed multiuser two‐way relay processing schemes and the optimal power control policies can efficiently limit the interference caused by the secondary network to primary users, and the sum rate of SUs can also be greatly improved. Copyright © 2011 John Wiley & Sons, Ltd.     

Joint power allocation and beamforming with users selection for cognitive radio networks via discrete stochastic optimization

Cognitive radio is a promising technique to dynamic utilize the spectrum resource and improve spectrum efficiency. In this paper, we study the problem of mutual interference cancellation among secondary users (SUs) and interference control to primary users (PUs) in spectrum sharing underlay cognitive radio networks. Multiple antennas are used at the secondary base station to form multiple beams towards individual SUs, and a set of SUs are selected to adapt to the beams. For the interference control to PUs, we study power allocation among SUs to guarantee the interference to PUs below a tolerable level while maximizing SUs?? QoS. Based on these conditions, the problem of joint power allocation and beamforming with SUs selection is studied. Specifically, we emphasize on the condition of imperfect channel sensing due to hardware limitation, short sensing time and network connectivity issues, which means that only the noisy estimate of channel information for SUs can be obtained. We formulate the optimization problem to maximize the sum rate as a discrete stochastic optimization problem, then an efficient algorithm based on a discrete stochastic optimization method is proposed to solve the joint power allocation and beamforming with SUs selection problem. We verify that the proposed algorithm has fast convergence rate, low computation complexity and good tracking capability in time-varying radio environment. Finally, extensive simulation results are presented to demonstrate the performance of the proposed scheme.     

Spectrum sharing in multi-channel cooperative cognitive radio networks: a coalitional game approach

In this paper, we study a coalitional game approach to resource allocation in a multi-channel cooperative cognitive radio network with multiple primary users (PUs) and secondary users (SUs). We propose to form the grand coalition by grouping all PUs and SUs in a set, where each PU can lease its spectrum to all SUs in a time-division manner while the SUs in return assist PUs’ data transmission as relays. We use the solution concept of the core to analyze the stability of the grand coalition, and the solution concept of the Shapley value to fairly divide the payoffs among the users. Due to the convexity of the proposed game, the Shapley value is shown to be in the core. We derive the optimal strategy for the SU, i.e., transmitting its own data or serving as a relay, that maximizes the sum rate of all PUs and SUs. The payoff allocations according to the core and the Shapley value are illustrated by an example, which demonstrates the benefits of forming the grand coalition as compared with non-coalition and other coalition schemes.     

Interference‐aware spectrum handover for cognitive radio networks

Cognitive radio (CR) is a promising technique for future wireless networks, which significantly improves spectrum utilization. In CR networks, when the primary users (PUs) appear, the secondary users (SUs) have to switch to other available channels to avoid the interference to PUs. However, in the multi‐SU scenario, it is still a challenging problem to make an optimal decision on spectrum handover because of the the accumulated interference constraint of PUs and SUs. In this paper, we propose an interference‐aware spectrum handover scheme that aims to maximize the CR network capacity and minimize the spectrum handover overhead by coordinating SUs’ handover decision optimally in the PU–SU coexisted CR networks. On the basis of the interference temperature model, the spectrum handover problem is formulated as a constrained optimization problem, which is in general a non‐deterministic polynomial‐time hard problem. To address the problem in a feasible way, we design a heuristic algorithm by using the technique of Branch and Bound. Finally, we combine our spectrum handover scheme with power control and give a convenient solution in a single‐SU scenario. Experimental results show that our algorithm can improve the network performance efficiently.Copyright © 2012 John Wiley & Sons, Ltd.     

Fair and Efficient Spectrum Splitting for Unlicensed Secondary Users in Cooperative Cognitive Radio Networks

In cooperative cognitive radio networks (CCRNs), a licensed primary-user (PU) is allowed to leverage several unlicensed secondary-users (SUs) to relay its traffic. In this paper, a staged dynamic spectrum allocation (DSA) scheme is proposed for CCRNs. In the first stage, the network is uncongested. A simple pricing based DSA scheme is proposed for the PUs to lease their idled frequency bands to the SUs. And, hence, the initial quality of service (QoS) demands (in terms of the minimum rate requirements) of the PUs and the SUs are both satisfied through direct transmission on the allocated frequency bands. In the second stage, the network reaches the full-loaded situation. Therefore, a cooperative relaying based DSA scheme is proposed to stimulate the PUs to split more extra frequency bands to fulfill the increased QoS demands of the SUs, on condition that the QoS of the PUs are well maintained. By applying the cooperative bargaining game theory in the proposed cooperative relaying based DSA, on the one hand, the SUs can get fairness rate-rewards from the PUs according to the level of contribution that they can make to compensate the PUs for the rate-losses. Hence, the increased QoS demands of the SUs can be accommodated in short term. On the other hand, the PUs could retain the SUs successfully to obtain the long-term revenue, on condition that their QoS constraints are still satisfied. Finally, the analysis results of the proposed bargaining game theoretic DSA scheme (in the second stage) are testified through computer simulations.     

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.