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.     

基于DOA估计的认知无线网络频谱感知

认知无线电技术中频谱感知性能的优劣直接影响认知通信系统的性能。针对该特点提出了认知无线电网络中基于波达方向（ DOA)估计的主用户频谱感知模型,即单主用户多次用户和多主用户多次用户的系统模型,选取基于特征分解的多重信号分类（ MUSIC)算法分析两种模型的感知性能,包括虚警概率、漏检概率、最小总错误概率、算法复杂度等,获得了闭值表达式,最后在两种模型下对算法进行了仿真。仿真结果表明：各参数主要影响虚警概率,而漏检概率几乎不受影响,验证了方法的有效性。     

基于合作形成的认知无线网络频谱共享策略

当具备不同利益的多个主网络竞争为单个次级网络提供频谱接入机会时,它们可以通过基于重复博弈模型的频谱共享机制实现对授权通信频段的合作垄断,从而最大化它们的整体数据传输效用。然而当某个主网络对未来传输效用不够重视时,它会为了获得比垄断效用更高的传输效用而偏离当前的合作垄断,从而降低了其他主网络的当前和未来数据传输效用。为此,2种新的频谱共享策略被提出以促使所有主网络形成更为灵活和可靠的频谱共享合作垄断。数值仿真表明,相比现有的触发策略,这2种新策略能够为所有主网络获得更优的整体数据传输效用。     

认知无线电网络中基于主系统有限反馈的频谱共享方案

摘 要：提出一种频谱共享方案,该方案适用于同时存在多个主用户和一对次用户的场景。各主用户依据接收机反馈的有限信道质量信息（CQI, channel quality information）分配发送功率及传输速率。次用户根据偷听到的主系统CQI有限反馈,以适当的功率及速率接入信道。次用户接入信道的行为对各主用户造成一定干扰,以致主系统传输速率遭受一定损失。本文在主系统速率损失约束条件下,研究得出了使次系统吞吐量最大化的次用户发送功率及传输速率最佳分配方案。数值结果表明,对于每个主用户仅需反馈3-4个量化比特,次系统的有效吞吐量就可堪比于主次发射端均拥有主系统链路完整CQI的情况。仿真结果显示,所提出的频谱共享方案能够满足主系统速率损失约束。     

Centralized spectrum leasing via cooperative SU assignment in cognitive radio networks

As the increasing demand of the radio spectrum, the researchers pay more attention to the technology of cognitive radio networks to improve the use of the scarce spectrum resources. Recently, cooperative communications combining with cognitive radio have been proposed in many literatures to improve the channel capacity. The primary users with poor transmission environment transmit their packets with the assistance of the secondary users (SUs) by offering them spectrum resources. This paper first raises issues in existing works, such as non‐optimal selection, selection collision, and transmission interruption. Aiming at these issues, we design a centralized system model and a cooperative relaying protocol for multiple primary user pairs to dynamically lease spectrum in exchange for the transmission assistance of SUs. Then we define 2 problems of the cooperative SU assignment to maximize total rate and maximize number of assigned SUs. We prove they are NP‐hard and propose a local search algorithm for the objective of maximize total rate and a ‐approximation algorithm for another objective. Our simulation results show that our system and algorithms can effectively improve the performance of the wireless networks.     

Spectrum management in cognitive radio ad hoc networks

The problem of spectrum scarcity and inefficiency in spectrum usage will be addressed by the newly emerging cognitive radio paradigm that allows radios to opportunistically transmit in the vacant portions of the spectrum already assigned to licensed users. For this, the ability for spectrum sensing, spectrum sharing, choosing the best spectrum among the available options, and dynamically adapting transmission parameters based on the activity of the licensed spectrum owners must be integrated within cognitive radio users. Specifically in cognitive radio ad hoc networks, distributed multihop architecture, node mobility, and spatio-temporal variance in spectrum availability are some of the key distinguishing factors. In this article the important features of CRAHNs are presented, along with the design approaches and research challenges that must be addressed. Spectrum management in CRAHNs comprises spectrum sensing, sharing, decision, and mobility. In this article each of these functions are described in detail from the viewpoint of multihop infrastructureless networks requiring cooperation among users.     

基于广义纳什议价解的CR网络子载波分配算法

在基于OFDMA的感知无线电网络中,提出了基于广义纳什议价解的动态子载波分配方案,通过在用户数目和业务需求不对等的两个从网络小区之间,实现了公平的子载波分配,仿真结果表明,方案明显优于基于最大最小公平算法的资源分配方案。     

基于能量检测的频谱感知方法研究

认知无线电是一种用于提高无线通信频谱利用率的新的智能技术,检测频谱空穴是否存在是实现认知无线电的前提和关键技术之一.首先简述认知无线电的背景和概念,针对认知无线电的频谱感知功能,介绍了基于能量检测的频谱检测方法,并在Matlab环境下进行了仿真实验,比较在相同的虚警概率情况下的检测概率与信噪比的关系.仿真实验结果表明,在相同的虚警概率时,当信噪比大的时候,检测概率越大.     

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.     

认知网络中一种基于频谱安全态势感知的路由方案

从构建准确的频谱态势图,实现频率资源充分利用的角度出发,针对目前在构建频谱态势图时没有考虑恶意用户(Malicious User,MU)存在的情况,结合克里金(Kriging)插值法估计空域内频谱干扰态势,通过地理位置检测方案识别MU,从而构建更准确、更安全的频谱态势图,并将其用于端到端的路由协议中。仿真结果表明,该方案能构建完整的频谱态势图,平均误差仅为0.106 dBm,能准确识别恶意用户,识别率高于80%;并且通过识别MU,在基于频谱态势图的路由过程中,可以减少路由跳数,增加可用频谱空间。     

Spectrum sensing scheduling for group spectrum sharing in cognitive radio networks

This paper addresses the issues on spectrum sharing in a cognitive radio network consisting of a primary user and a group of cognitive users. Each cognitive user may occupy a non‐overlapped sub‐band of the primary spectrum, but it needs to perform spectrum sensing independently before accessing the sub‐band. To reduce the complexity of spectrum sensing and thus energy consumption, this paper proposes a scheduled spectrum sensing scheme. First, we consider a single spectrum sensing scenario where only one cognitive user is elected to perform spectrum sensing, and then it broadcasts its sensing results to the other cognitive users. The scheduled spectrum sensing scheme works in both network‐centric and user‐centric ways. Next, the scheduled spectrum sensing scheme is further generalized to work in a multiple spectrum sensing scenario. The results show the effectiveness of the proposed schemes compared with the traditional schemes where all cognitive users may perform spectrum sensing at the same time. Copyright © 2010 John Wiley & Sons, Ltd.     

Spectrum sensing in cognitive radio networks: requirements, challenges and design trade-offs [cognitive radio communications]

Opportunistic unlicensed access to the (temporarily) unused frequency bands across the licensed radio spectrum is currently being investigated as a means to increase the efficiency of spectrum usage. Such opportunistic access calls for implementation of safeguards so that ongoing licensed operations are not compromised. Among different candidates, sensing-based access, where the unlicensed users transmit if they sense the licensed band to be free, is particularly appealing due to its low deployment cost and its compatibility with the legacy licensed systems. The ability to reliably and autonomously identify unused frequency bands is envisaged as one of the main functionalities of cognitive radios. In this article we provide an overview of the regulatory requirements and major challenges associated with the practical implementation of spectrum sensing functionality in cognitive radio systems. Furthermore, we outline different design trade-offs that have to be made in order to enhance various aspects of the system's performance.     

基于认知无线电网络中用户需求频谱分配算法

在认知无线电网络中,对图着色频谱分配算法进行了分析,发现只有少数已有算法考虑到用户的需求是否得到满足,导致需求低的用户分配到过多资源。为解决这个问题,根据基于用户需求的图着色论频谱分配算法,对用户的满意度设置优频谱分配优先级函数,满意度差的用户进行优先选择分配,得到一种改进算法。仿真结果表明,基于用户需求的频谱分配算法的改进算法,能够增加系统的信道效益,提高用户的需求满意程度。     

Spectrum sensing and power/rate control in CDMA cognitive radio networks

In this paper, a two‐phase algorithm for the spectrum sensing and power/rate control of a secondary user (S‐user) or cognitive radio is proposed. In the first phase, the primary base station (P‐BS), which is conscious of both the number and the data rate of primary active users (P‐user), broadcasts theitusage capacity percentage (UCP) of its cell. Since knowing only the UCP is not enough to guarantee that the total load (of P‐users and S‐users) is less than a maximum permissible load, the S‐user must measure the total interference received from both the P‐users and other S‐users. In this direction, using both the UCP and measurement of the interference received from the P‐users and the S‐users by the S‐user or secondary base station (S‐BS), we mathematically derive an equation for issuing data transmission permission, which if it is held then the second phase of the algorithm: the transmit power/rate control starts. In this phase, the S‐user and the S‐BS look for feasible values for the transmit power level and transmission rate. If there are feasible values, it starts its transmission at these feasible transmit power and rate. Since both the location of the S‐user and the channel condition vary in time, the whole algorithm is iterated periodically with a period faster than the coherence time of the channel. Furthermore, we consider the down link of the above system with cooperation among neighboring S‐users to overcome fading channels and we investigate the amount of improvement in the reliability of the issuing data transmission permission. As well, we consider the uplink of the system with multiple antennas in the S‐BS to investigate the improvement in the same parameter over spatially correlated and independent fading channels. Theoretical analysis is validated using computer simulations. Both theoretical analysis and computer simulations show that the proposed cooperative spectrum sensing algorithm performs properly at SNR = ?5dB in flat Nakagami‐m fading channels with m = 1 even in correlated fading channels. We also address the improvement of the reliability of the issuing data transmission permission in the uplink in case of using multiple antennas only in the S‐BS. Copyright © 2011 John Wiley & Sons, Ltd.     

Spectrum and energy efficiency of cooperative spectrum prediction in cognitive radio networks

In this paper, the spectrum and energy efficiency of cooperative spectrum prediction (CSP) in cognitive radio networks are investigated. In addition, the performance of cooperative spectrum prediction is evaluated using a hidden Markov model (HMM) and a multilayer perceptron (MLP) neural network. The cooperation between secondary users in predicting the next channel status employs AND, OR and majority rule fusion schemes. These schemes are compared for HMM and MLP predictors as a function of channel occupancy in term of prediction error, spectrum efficiency and energy efficiency. The impact of busy and idle state prediction errors on the spectrum efficiency is also investigated. Simulation results are presented which show a significant improvement in the spectrum efficiency of the secondary users CSP with the majority rule at the cost of a small degradation in energy efficiency compared to single spectrum prediction and traditional spectrum sensing.

     

Adaptive Online Voltage Scaling Scheme Based on the Nash Bargaining Solution

In an effort to reduce energy consumption, research into adaptive power management in real‐time systems has become widespread. In this paper, a novel dynamic voltage scaling scheme is proposed for multiprocessor systems. Based on the concept of the Nash bargaining solution, a processor's clock speed and supply voltage are dynamically adjusted to satisfy these conflicting performance metrics. In addition, the proposed algorithm is implemented to react adaptively to the current system conditions by using an adaptive online approach. Simulation results clearly indicate that the superior performance of the proposed scheme can strike the appropriate performance balance between contradictory requirements.     

基于局部拓扑控制的认知网络路由方法

针对认知网络研究一种融合主、次用户多因素优化的局部拓扑控制和路由方法。该方法综合考虑主用户频谱使用情况以及次用户对主用户干扰影响,预测认知链路的稳定性,结合链路功耗,定义一种联合链路代价,提出链路代价最小的局部认知拓扑控制路由 (LCTCR)算法,优化网络拓扑,并在优化后的拓扑上进行网络路由的选择。算法分析和仿真实验证明,在进行认知网络路径选择时,链路功耗和链路稳定性均为重要参数,需联合优化以保证选择更优的实际路由。     

On cognitive processes in cognitive radio networks

In this article we model the cognitive processes and evaluate their impact on the performance of cognitive radio networks (CRN). Operation of the cognitive radio nodes, can be characterized by two types of processes: communication processes such as packets transmission, and cognitive processes such as estimation of the network state and decision-making for dynamic resource allocation. We propose a continuous time Markov chain model of CRN that couples these processes into unified queueing framework and analyze it by means of the matrix-geometric approach. From the obtained results, we derive the performance measures of CRN such as average delay and throughput, and establish their dependencies on the underlying cognitive processes. Additionally, we design an efficient policy for accessing the vacant channels and managing the transmission-sensing trade-off, which arises when transmissions and sensing are mutually exclusive. The policy search is carried out by the stochastic optimization method of cross-entropy. The optimized policy leads to significantly enhanced performance of CRN.     

Securing cognitive radio networks

Cognitive radio is a promising technology aiming to improve the utilization of the radio electromagnetic spectrum. A cognitive radio device uses general purpose computer processors that run radio applications software to perform signal processing. The use of this software enables the device to sense and understand its environment and actively change its mode of operation based on its observations. Unfortunately, this solution entails new security challenges. Our objective in this paper is to analyze the security issues of the main recent developments and architectures of cognitive radio networks. We present vulnerabilities inherent to those systems, identify novel types of abuse, classify attacks, and analyze their impact on the operation of cognitive radio‐based systems. Moreover, we discuss and propose security solutions to mitigate such threats. Copyright © 2010 John Wiley & Sons, Ltd.     

A survey on spectrum management in cognitive radio networks [cognitive radio communications and networks]

Cognitive radio networks will provide high bandwidth to mobile users via heterogeneous wireless architectures and dynamic spectrum access techniques. However, CR networks impose challenges due to the fluctuating nature of the available spectrum, as well as the diverse QoS requirements of various applications. Spectrum management functions can address these challenges for the realization of this new network paradigm. To provide a better understanding of CR networks, this article presents recent developments and open research issues in spectrum management in CR networks. More specifically, the discussion is focused on the development of CR networks that require no modification of existing networks. First, a brief overview of cognitive radio and the CR network architecture is provided. Then four main challenges of spectrum management are discussed: spectrum sensing, spectrum decision, spectrum sharing, and spectrum mobility.