认知Ad Hoc网络能量有效频谱接入策略

针对认知无线Ad Hoc网络中次用户能量受限问题,提出一种基于能量有效性的机会频谱接入策略。联合考虑信道状态的时变性和次用户的频谱感知准确性,基于部分可观测马尔科夫决策过程（POMDP）建立了一种最大化能量有效性的分析架构,指导次用户选择能效最佳信道,并根据信念状态、信道增益和检测概率,自适应控制传输功率。仿真结果表明,该策略能够有效提高次用户传输的能量有效性,通过对传输功率的有效控制,实现了传输性能和能量开销的有效折中。      

CVANET中基于POMDP模型的频谱接入算法

针对认知车载Ad Hoc网络(CVANET)信道的动态特性,以部分可观测马尔科夫决策过程(POMDP)为模型对认知车辆用户的频谱感知和频谱接入过程进行研究,提出基于POMDP模型的分布式机会频谱接入算法,并通过贪心算法降低POMDP算法计算量,最后通过仿真研究影响认知车辆用户吞吐量的主要因素,并验证算法的可行性。仿真分析结果表明,认知车辆用户通过本算法接入吞吐量得到有效提高,降低了交通中广播风暴的可能,并且降低了计算量。     

异构网络中多无线电多信道环境下信道状态预测算法研究

该文针对异构网络环境未知性的特点,基于部分可测马尔科夫(POMDP)模型,结合认知无线电频谱侦测技术,提出了一种新的多无线电多信道环境下信道状态预测算法。该算法通过对信道状态历史信息的分析,推导出信道信念状态(belief state)的初始分布和转移概率,并以此选择出具有最佳回报的信道以供接入,从而达到提高信道利用率的目的。仿真结果表明算法性能要优于传统算法。     

认知 mesh 网络服务区分的动态频谱接入策略

动态频谱接入策略是实现认知无线电网络高效利用频谱的关键。与传统认知无线电网络不同,认知mesh网络中不同QoS需求的多类型业务共同接入,为适应这一特点,提出服务区分的动态频谱接入策略。策略依据业务的QoS需求确立优先级,针对不同优先级业务采取不同的信道接入方案,实时业务依据最优传输延迟期望选择接入信道集合,在减小传输延迟的同时降低数据传输过程授权用户出现的概率,普通业务选择最优理想传输成功概率的信道,降低信道切换概率。理论与实验结果表明,与传统的认知网络频谱接入策略相比,提出的策略能提供不同业务的服务区分,满足实时业务的低延迟需求,降低数据传输的中断率,同时在授权信道空闲率与网络负载较大时吞吐量性能较优。     

认知网络中基于用户带宽需求的频谱接入策略

针对认知网络中的频谱接入问题,基于多类用户不同带宽需求提出了一种新的频谱接入策略,即基于用户带宽的动态信道接入策略(BRDSA)。首次提出考虑拥有不同带宽需求的主用户和次用户利用频谱聚合技术进行频谱接入,而频谱聚合技术能够提高次用户对离散频谱的利用率。根据相关网络模型,利用排队理论和马尔科夫模型对整个系统状态进行了分析。仿真结果表明这种动态频谱接入策略极大地提高了频谱利用率。     

一种基于信道质量的鲁棒机会频谱接入策略

为了提高分等级网络中次用户通过机会频谱接入获得的有效吞吐率,提出了一种基于信道质量的鲁棒机会频谱接入策略.该策略利用信道质量信息和信道占用信息做出传输决策,使得次用户在信道感知结果为空闲和占用时分别以不同的信道质量门限选择传输机会发起传输,充分利用了信道质量好的传输机会.结合该策略,建立了以对主用户的干扰为约束条件,最大化次用户有效吞吐率的优化问题,并考虑到了信道传播特性统计参数存在不准确估计的情况,对该接入策略的门限进行了鲁棒性设计.仿真结果表明:所提出的鲁棒机会频谱接入策略能够显著提高次用户的有效吞吐率.     

异构频谱环境下基于协商的机会频谱接入策略

文章在异构频谱环境下的分布式认知无线网络中,提出了一种基于协商（可用频谱信息交互）的机会频谱接入策略,对该策略的原理作了详细阐述。仿真结果表明,相比于随机信道选择接入机制,该频谱接入策略在吞吐量性能上有明显提升。     

瑞利衰落环境中一种能量有效的多无线电信道搜索机制研究

针对当前频谱搜索机制在能量有效方面的不足,该文提出了一种在瑞利衰落条件下基于部分可测马尔科夫决策过程(POMDP)的多无线电信道搜索机制MRCSS。该机制通过对瑞利衰落环境中信道状态建立POMDP模型来分析和推导出能效最佳信道,并以此指导用户的信道选择。仿真结果表明该机制能较传统搜索机制更有效地减少感知时间和节省能耗,从而达到提高频谱感知性能的目的。     

基于动态控制信道的认知无线电网络MAC协议

在认知无线电网络中,MAC协议主要用于信道资源的感知、选择以及接入控制从而保证公平性和有效的资源共享。针对认知无线电网络基于控制信道的研究现状,文中在认知无线电网络分布式多信道MAC(CR-MMAC)协议的基础上,引入同步机制,不等待传输机制和不重申机制,提出一种基于动态公共控制信道的认知无线电网络MAC(CR-DCMAC)协议。它能够减少信道资源开支,降低控制信道上的控制分组量。仿真结果表明,CR-DCMAC协议能提高系统总吞吐量和空闲频谱资源的利用率,综合性能优于CR-MMAC协议。     

感知不确定下卫星认知无线网络多频谱接入优化策略

针对卫星认知无线网络频谱感知不确定性较大导致传统频谱接入机制效率降低的问题,该文提出一种基于动态多频谱感知的信道接入优化策略。认知LEO卫星根据频谱检测概率与授权用户干扰门限之间的关系,实时调整不同频谱感知结果下的信道接入概率。在此基础上以系统吞吐量最大化为目标,设计了一种基于频谱检测概率和虚警概率联合优化的判决门限选取策略,并推导了最佳感知频谱数量。仿真结果表明,认知用户能够在不大于授权用户最大干扰门限的前提下,根据授权信道空闲状态动态选择最佳频谱感知策略,且在检测信号信噪比较低时以更加积极的方式接入授权频谱,降低了频谱感知不确定性对信道接入效率的影响,提高了认知系统吞吐量。     

Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework

We propose decentralized cognitive MAC protocols that allow secondary users to independently search for spectrum opportunities without a central coordinator or a dedicated communication channel. Recognizing hardware and energy constraints, we assume that a secondary user may not be able to perform full-spectrum sensing or may not be willing to monitor the spectrum when it has no data to transmit. We develop an analytical framework for opportunistic spectrum access based on the theory of partially observable Markov decision process (POMDP). This decision-theoretic approach integrates the design of spectrum access protocols at the MAC layer with spectrum sensing at the physical layer and traffic statistics determined by the application layer of the primary network. It also allows easy incorporation of spectrum sensing error and constraint on the probability of colliding with the primary users. Under this POMDP framework, we propose cognitive MAC protocols that optimize the performance of secondary users while limiting the interference perceived by primary users. A suboptimal strategy with reduced complexity yet comparable performance is developed. Without additional control message exchange between the secondary transmitter and receiver, the proposed decentralized protocols ensure synchronous hopping in the spectrum between the transmitter and the receiver in the presence of collisions and spectrum sensing errors     

Joint Design and Separation Principle for Opportunistic Spectrum Access in the Presence of Sensing Errors

Opportunistic spectrum access (OSA) that allows secondary users to independently search for and exploit instantaneous spectrum availability is considered. The design objective is to maximize the throughput of a secondary user while limiting the probability of colliding with primary users. Integrated in the joint design are three basic components: a spectrum sensor that identifies spectrum opportunities, a sensing strategy that determines which channels in the spectrum to sense, and an access strategy that decides whether to access based on potentially erroneous sensing outcomes. This joint design is formulated as a constrained partially observable Markov decision process (POMDP), and a separation principle is established. The separation principle reveals the optimality of myopic policies for the design of the spectrum sensor and the access strategy, leading to closed-form optimal solutions. Furthermore, it decouples the design of the sensing strategy from that of the spectrum sensor and the access strategy, and reduces the constrained POMDP to an unconstrained one. Numerical examples are provided to study the tradeoff between sensing time and transmission time, the interaction between the physical layer spectrum sensor and the MAC layer sensing and access strategies, and the robustness of the ensuing design to model mismatch.     

Algorithms for Dynamic Spectrum Access With Learning for Cognitive Radio

We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperatively tries to exploit vacancies in primary (licensed) channels whose occupancies follow a Markovian evolution. We first consider the scenario where the cognitive users have perfect knowledge of the distribution of the signals they receive from the primary users. For this problem, we obtain a greedy channel selection and access policy that maximizes the instantaneous reward, while satisfying a constraint on the probability of interfering with licensed transmissions. We also derive an analytical universal upper bound on the performance of the optimal policy. Through simulation, we show that our scheme achieves good performance relative to the upper bound and improved performance relative to an existing scheme. We then consider the more practical scenario where the exact distribution of the signal from the primary is unknown. We assume a parametric model for the distribution and develop an algorithm that can learn the true distribution, still guaranteeing the constraint on the interference probability. We show that this algorithm outperforms the naive design that assumes a worst case value for the parameter. We also provide a proof for the convergence of the learning algorithm.      

基于POMDP的认知无线电自适应频谱感知算法

针对如何建立适合毫秒级频谱空洞场景的频谱感知机制这一问题,推导出最佳次级用户单次数据传输时间长度,解决了数据传输量最大化的问题;其次提出一种基于部分可观测马尔科夫决策过程（POMDP,partially observable Markov decision process）的自适应频谱感知算法,解决了快速接入毫秒级频谱空洞的问题。该算法根据上一决策时段的信念向量和感知结果自适应确定在当前决策时段内进行频谱感知或数据传输行为。仿真结果表明,该自适应频谱感知算法能够有效控制次级用户和主用户的冲突概率并增加频谱利用率。     

Application layer QoS optimization for multimedia transmission over cognitive radio networks

In cognitive radio (CR) networks, the perceived reduction of application layer quality of service (QoS), such as multimedia distortion, by secondary users may impede the success of CR technologies. Most previous work in CR networks ignores application layer QoS. In this paper we take an integrated design approach to jointly optimize multimedia intra refreshing rate, an application layer parameter, together with access strategy, and spectrum sensing for multimedia transmission in a CR system with time varying wireless channels. Primary network usage and channel gain are modeled as a finite state Markov process. With channel sensing and channel state information errors, the system state cannot be directly observed. We formulate the QoS optimization problem as a partially observable Markov decision process (POMDP). A low complexity dynamic programming framework is presented to obtain the optimal policy. Simulation results show the effectiveness of the proposed scheme.     

利用组稀疏特性的宽带压缩频谱感知

基于认知无线电的动态频谱接入需对宽带信道进行频谱感知,而越来越高的采样速率日益成为宽带频谱感知的瓶颈。压缩感知作为一种新的信号获取技术为亚奈奎斯特采样速率下的宽带频谱感知提供了一种可行方案。在相关应用场景中,如果能够挖掘相关先验信息并在重构算法中整合这些信息,将大幅提高压缩感知的性能。本文基于压缩感知技术,利用信道的划分信息及宽带信号的组稀疏特性,提出了一种组稀疏贪婪算法GOMP。该方法在成熟的贪婪算法基础上,利用子信道内多频点的组测量信息,根据组测量的概率分布特性来识别宽带信道的活动子信道。这种组测量识别方式使算法能以较少的观测数据实现对宽带信道的快速准确感知,极大地降低了宽带频谱感知所需的采样速率。实验结果表明:该算法比传统的OMP算法及BP算法不仅具有更好的重构效果及频谱检测性能,而且具有更好的压缩性能及实时性能。      

A joint sensing and transmission power control policy for RF energy harvesting cognitive radio networks

We consider a radio frequency energy harvesting cognitive radio network in which a secondary user (SU) can opportunistically access channel to transmit packets or harvest radio frequency energy when the channel is idle or occupied by a primary user. The channel occupancy state and the channel fading state are both modeled as finite state Markov chains. At the beginning of each time slot, the SU should determine whether to harvest energy for future use or sense the primary channel to acquire the current channel occupancy state. It then needs to select an appropriate transmission power to execute the packet transmission or harvest energy if the channel is detected to be idle or busy, respectively. This sequential decision‐making, done to maximize the SU's expected throughput, requires to design a joint spectrum sensing and transmission power control policy based on the amount of stored energy, the retransmission index, and the belief on the channel state. We formulate this as a partially observable Markov decision process and use a computationally tractable point‐based value iteration algorithm. Section 5 illustrate the significant outperformance of the proposed optimal policy compared with the optimal fixed‐power policy and the greedy fixed‐power policy.