基于非理想感知的认知无线电系统感知时间与频谱分配联合优化算法

针对非理想感知情况下感知时间与频谱分配联合优化问题,同时考虑漏检与主用户重新占用频谱两种场景所造成的主次用户碰撞,并通过量化主用户对认知用户的干扰,给出有无主用户存在时认知系统可获得的吞吐量。在总传输功率约束以及对主用户的最大干扰功率约束两个限制条件下,以最大化系统平均吞吐量为优化目标,给出感知时间与频谱分配联合优化算法。算法首先通过折半法搜索最优感知时间,在既定的感知时间下,将子信道分配给能获得最大平均吞吐量的认知用户,在此基础上,利用凸优化相关理论求得最优功率分配。仿真结果表明,本文所提算法相比于传统频谱分配算法系统平均吞吐量性能提升了10%左右。     

认知网中感知时间和功率控制的联合优化机制

针对认知无线网中为了最大化认知用户的吞吐量问题,提出了一种感知时间和功率控制的联合优化机制。该机制保证认知系统在低于一定干扰限制下,将认知用户吞吐量描述成为一个多约束优化问题,从理论上分析了最优功率分配方案与最优感知时间分配方案。根据理论分析结果,设计了联合迭代机制通过确定合适的感知参数从而达到最大化认知用户吞吐量的目的。仿真结果表明：提出的联合优化机制复杂度较低,并且该方案的认知吞吐量性能最接近理论最优方案的性能。     

全双工中继协作下的认知MIMO系统吞吐量最大化研究

本文研究了全双工中继协作下的认知MIMO系统的平均吞吐量最大化问题。与传统的中继协作认知无线电系统不同的是,该系统模型中的双工中继节点既能协助认知用户源节点进行多天线频谱感知以提高频谱检测性能,也能解码转发认知用户源节点的发送信号以获得更大的系统吞吐量。为使系统平均吞吐量最大,首先,本文以认知用户能获得的最大平均频谱空洞被发现的概率为目标,对系统的帧结构进行优化以获得最佳的感知时间,接着对多个发送天线进行优化以选择出最佳的发送天线,并推导出了在总的发送功率和对主用户干扰受限条件下的认知用户源节点和双工中继节点的最佳功率分配方案。最后的仿真结果表明本文提出的系统模型和优化方案相比传统的双工等功率分配方案以及单工功率分配方案能够获得更大的系统平均吞吐量。      

频谱异构认知无线电中基于吞吐量降的空时频谱机会感知

在认知无线电(CR)中,频谱感知是实现动态频谱接入的关键技术之一。为适当保护主用户并最大化次级用户的性能,目前大部分相关工作均是用虚报概率和漏检概率作为感知度量来确定最佳感知参数的。但这种度量是用主次用户的碰撞概率来衡量次级用户对主用户的影响的,没有考虑干扰强度的影响,仅适合同构频谱环境;在不同位置次级用户有不同接入机会的异构频谱环境中,并不能最大化频谱利用率。为此,该文首先定义了吞吐量降,并提出在异构频谱环境下采用吞吐量降作为一种新的感知度量。吞吐量降是指由于次级用户占用授权频谱而导致主用户吞吐量下降的百分比。在衡量次级用户对主用户的影响时,它综合了主次用户的碰撞概率和干扰强度两个因素;其次,研究了以吞吐量降为约束的次级用户吞吐量优化问题。最后,数值仿真证实了该方案比目前几种传统方案的频谱利用率显著提高。     

认知无线电多时隙联合频谱感知方法及优化

为了降低认知无线电中次用户对主用户的干扰,提出了次用户通过多个时隙的能量感知联合检测主用户的频谱感知方法。每个传输帧被分成若干个时隙,次用户在每个时隙的开始进行能量感知,通过合并多个时隙的感知结果,提高次用户对主用户的检测性能。为了最大化次用户的频谱效率,将主用户状态建模为二维马尔科夫随机过程,并根据该过程优化单时隙频谱感知时间。仿真结果表明：相比Liang的“先听后传”频谱感知方法,提出方法仅牺牲14％的频谱效率,却使干扰概率降低了28％;随着信噪比增加,提出方法的最大频谱效率逐渐接近“先听后传”频谱感知方法。     

基于能量收集驱动和信道感知的CRN

针对能量采集器供电的认知无线电网络进行了研究。首先,在采用离散时间马尔可夫链的建模基础上,通过分析认知用户在收集到的能量包和电池容量的限制下有效地利用能量,以最大化当前时隙的吞吐量。然后,找到多个信道的最优感知顺序和对应于该感知顺序下信道的最优传输能量集,得到使认知无线电网络在多个时隙的预期吞吐量最大化的递归表达式。最后提出了一种基于该递归表达式实现最大化预期吞吐量的算法。仿真实验结果表明,所提出的方案相比于其他方案,不仅提高了认知无线电网络的吞吐量,而且降低了主信道上的平均碰撞比。     

基于认知无线电的双向中继网络的资源分配

针对认知无线电中的双向中继网络,研究了基于非完美感知的频谱机会式接入和频谱共享接入下的资源分配问题.与传统基于认知的双向中继的资源分配方法不同,提出的算法联合考虑了感知时间和次级系统的发射功率.在感知时间和发射功率满足条件的情况下,使次级系统的吞吐量最大.为了有效地保护主用户不受干扰,在每一跳都考虑了平均干扰功率约束,同时考虑次级系统总的功率约束.在非完美感知的频谱机会式接入和频谱共享接入机制下,新算法能够获得最优的感知时间和功率分配.最后,仿真比较了两种方案的性能,验证了新算法的有效性.     

主用户活跃性下的多功率分配策略

考虑到认知用户在信息传输过程中主用户的状态可能随时变化,提出了一种新的功率分配模式——多功率分配策略。在基于频谱感知的系统模型中,以认知系统的吞吐量为目标函数,得出了主用户感知过程的多种状态,并分配三种不同的功率,最大化认知系统的容量。仿真结果表明,随着主用户活跃指数的逐渐提高,所提新模型的功率分配策略要优于传统方法。同时分析了新的功率分配下平均干扰功率与主用户接收端的信噪比对系统吞吐量和最优感知时间的影响,进一步验证了所提出新策略的有效性。 〖HT5H〗关键词：〖HT5K〗认知无线电;主用户活跃;频谱感知分配;多功率分配;吞吐量最大化     

主用户活跃性对新的认知无线电系统容量的影响

在机会频谱接入认知无线电系统中,认知用户只有在通过感知确定信道空闲时才可以接入授权信道,因此频谱感知对于系统性能影响非常重要。本文提出了基于新帧结构的四元频谱感知模型,考虑主用户活跃性对认知网络吞吐量的影响,采用可同时最大化感知和数据传输时间的新帧结构模型,不需要考虑感知和吞吐量的均衡。理论分析新模型下感知时间,主用户活跃性,目标检测概率,主用户接收信噪比对系统吞吐量的影响,并与传统模型进行对比。     

认知无线电多信道下的感知时间优化

主要研究了认知无线电中多信道连续感知结构下,多个感知时隙和单个传输时隙的感知时间优化问题。首先在信道的空闲概率已知的条件下,当信道的信噪比保持不变时,经证明最佳感知时间是存在的;其次在信道的空闲概率未知的条件下,提出了一种单时隙感知时间的次优方法,逐步的计算出来各个时隙中下一个时隙的最优化感知时间。仿真实验证明,提出的方法优于固定感知时间的感知方法,同时降低了算法的复杂度,且在不同的条件下,此方法吞吐量性能接近于理论上的最佳感知时间吞吐量性能,并优于固定感知时间方法的吞吐量。     

Throughput Maximization in Cognitive Radio System with Transmission Probability Scheduling and Traffic Pattern Prediction

In this paper, we propose a novel transmission probability scheduling (TPS) scheme for the opportunistic spectrum access based cognitive radio system (OSA-based CRS), in which the secondary user (SU) optimally schedules its transmission probabilities in the idle period of the primary user (PU), to maximize the throughput of the SU over a single channel when the collision probability perceived by the PU is constrained under a required threshold. Particularly, we first study the maximum achievable throughput of the SU when the proposed TPS scheme is employed under the assumption that the distribution of the PU idle period is known and the spectrum sensing is perfect. When the spectrum sensing at the SU is imperfect, we thoroughly quantify the impact of sensing errors on the SU performance with the proposed TPS scheme. Furthermore, in the situation that the traffic pattern of the PU and its parameters are unknown and the spectrum sensing is imperfect, we propose a predictor based on hidden Markov model (HMM) for the proposed TPS scheme to predict the future PU state. Extensive simulations are conducted and show that the proposed TPS scheme with the HMM-based predictor can achieve a reasonably high SU throughput under the PU collision probability constraint even when the sensing errors are severe.     

Optimization algorithm of periodical cooperative spectrum sensing in cognitive radio

To decrease the interference to the primary user (PU) and improve the detected performance of cognitive radio (CR), a single‐band sensing scheme wherein the CR periodically senses the PU by cooperative spectrum sensing is proposed in this paper. In this scheme, CR first senses and then transmits during each period, and after the presence of the PU is detected, CR has to vacate to search another idle channel. The joint optimization algorithm based on the double optimization is proposed to optimize the periodical cooperative spectrum sensing scheme. The maximal throughput and minimal search time can be respectively obtained through the joint optimization of the local sensing time and the number of the cooperative CRs. We also extend this scheme to the periodical wideband cooperative spectrum sensing, and the joint optimization algorithm of the numbers of the sensing time slots and cooperative CRs is also proposed to obtain the maximal throughput of CR. The simulation shows that the proposed algorithm has lower computational quantity, and compared with the previous algorithms, when SNR = 5 dB, the throughput and search time of the proposed algorithm can respectively improve 0.3 kB and decrease 0.4 s. The simulation also indicates that the wideband cooperative spectrum sensing can achieve higher throughput than the single‐band cooperative spectrum sensing. Copyright © 2012 John Wiley & Sons, Ltd.     

Sensing‐throughput tradeoff for cooperative multiple‐input single‐output cognitive radio

In this paper, we propose a new cooperative multiple‐input single‐output (MISO) cognitive radio (CR) system, which can use some of the antennas to transmit its data and the others to help to transmit the data of the primary user (PU) by performing cooperative communication if the presence of the PU is detected through the cooperative spectrum sensing. A new cooperative sensing‐throughput tradeoff model is proposed, which maximizes the aggregate rate of the CR by jointly optimizing sensing time and spatial sub‐channel power, subject to the constraints of the aggregate rate of the PU, the false alarm and detection probabilities, the aggregate interference to the PU and the aggregate power of the CR. Simulation results show that compared with the conventional scheme, the proposed cooperative scheme can achieve the larger aggregate rate of the CR, while keeping the aggregate rate of the PU invariable with the increasing of the interference. Copyright © 2013 John Wiley & Sons, Ltd.     

Optimal Sensing Interval Considering Per-primary Transmission Protection in Cognitive Radio Networks

Sufficient protection of primary user is a challenging issue in cognitive radio networks. The probability of detection and the interference ratio (probability of collision) have been considered as the main constraints for primary protection in the literature. Based on the sensing parameters designed to comply with these constraints, secondary users are often considered to be able to use licensed bands without giving harmful interference to primary users. However, satisfying these constraints might not guarantee that each primary transmission (i.e., each busy period) is sufficiently protected. Obviously, if a large fraction of a busy period is interfered, the busy period may be subject to the useless transmission potentially degrading the quality of service of primary users. We suggest that the busy period impaired more than a certain ratio of so-called required per-transmission interference ratio (PTIR) is subject to the primary transmission failure (PTF), which has not been considered in the literature. As the first attempt, with the assumption of perfect sensing, the effect of sensing interval on the PTIR and PTF is investigated. The probability of PTF is derived as a function of sensing interval given the required PTIR. Then, given the required PTIR and probability of PTF, the optimal sensing interval that maximizes the throughput for secondary users is derived. Performance evaluation shows that primary users can be more protected with the optimal sensing interval obtained by using the proposed constraint.     

Opportunistic Scheduling with QoS Constraints for Multiclass Services HSUPA System

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long‐term quality of service (QoS) constraints for non‐realtime data users and short‐term QoS constraints for realtime multimedia users in multiclass service high‐speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi‐constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.     

A new sensing‐throughput tradeoff scheme in cooperative multiband cognitive radio network

A conventional cognitive radio network (CRN) uses the spectrum of the licensed primary network (PN) on the premise of detecting the absence of the PN by the spectrum sensing of the sensor node (SN). In this paper, a cooperative multiband CRN is considered, wherein the SNs are allowed to use some time of the transmission slot to relay PN data by cooperative communication, while using the remaining time of the transmission slot to forward its own data, over multiple sub‐bands during each frame, if the presence of PN is detected by cooperative spectrum sensing of the SNs in the sensing slot. A new sensing–throughput tradeoff scheme is formulated as a multi‐variable optimization problem, which maximizes the average aggregate throughput of the CRN over all the sub‐bands by jointly optimizing spectrum sensing time and sub‐band transmission power, subject to the constraints on the average aggregate throughput of the PN, the maximal aggregate power of each SN, and the false alarm and detection probabilities of each sub‐band. The bi‐level optimization method is adopted to obtain the optimal solution by dividing the multi‐variable optimization problem into two convex single‐variable sub‐optimization problems. The simulations show that there exists the optimal sensing time and sub‐band transmission power that maximize the average aggregate throughput of the CRN and, compared with the conventional scheme, the throughput obtained by the proposed scheme is outstanding. Copyright © 2014 John Wiley & Sons, Ltd.     

支持紧急通信的无线认知网络频谱接入方法

提出了支持应急通信的无线认知网络机会频谱接入模型。首先按照离散时间完全和限定(k=1)服务两级轮询策略实现主用户和次用户对频谱的共享。其次,通过在数据确认中捎带轮询列表信息方式实现数据传输和用户调度的并行处理,减少用户切换造成的时延浪费。通过建模分析得出网络吞吐量及用户平均等待时延的精确解析,结果表明本方案能有效抑制次用户对主用户通信质量的影响,又能增加网络吞吐量并为通信业务提供时延保障。     

Radio resource management for cellular CDMA systems supporting heterogeneous services

A novel radio resource management (RRM) scheme for the support of packet-switched transmission in cellular CDMA systems is proposed by jointly considering the physical, link, and network layer characteristics. The proposed resource management scheme is comprised of a combination of power distribution, rate allocation, service scheduling, and connection admission control. Power distribution allows individual connections to achieve their required signal-to-interference-plus-noise ratio, while rate allocation guarantees the required delay/jitter for real-time traffic and the minimum transmission rate requirement for non-real-time traffic. Efficient rate allocation is achieved by making use of the randomness and burstiness; of the packet generation process. At the link layer, a packet scheduling scheme is developed based on information derived from power distribution and rate allocation to achieve quality of service (QoS) guarantee. Packet scheduling efficiently utilizes the system resources in every time slot and improves the packet throughput for non-real-time traffic. At the network layer, a connection admission control (CAC) scheme based on the lower layer resource allocation information is proposed. The CAC scheme makes use of user mobility information to reduce handoff connection dropping probability (HCDP). Theoretical analysis of the grade of service performance, in terms of new connection blocking probability, HCDP, and resource utilization, is given. Numerical results show that the proposed RRM scheme can achieve both effective QoS guarantee and efficient resource utilization.     

Wide-band TD-CDMA MAC with minimum-power allocation and rate- and BER-scheduling for wireless multimedia networks

A wide-band time-division-code-division multiple-access (TD-CDMA) medium access control (MAC) protocol is introduced in this paper. A new minimum-power allocation algorithm is developed to minimize the interference experienced by a code channel such that heterogeneous bit-error rate (BER) requirements of multimedia traffic are satisfied. Further, from analysis of the maximum capacity of a time slot, it is concluded that both rate and BER scheduling are necessary to reach a maximum capacity. Based on the new minimum-power allocation algorithm as well as on rate and BER scheduling concepts, a new scheduling scheme is proposed to serve packets with heterogeneous BER and quality of service (QoS) requirements in different time slots. To further enhance the performance of the MAC protocol, an effective connection admission control (CAC) algorithm is developed based on the new minimum-power allocation algorithm. Simulation results show that the new wide-band TD-CDMA MAC protocol satisfies the QoS requirements of multimedia traffic and achieves high overall system throughput.     

Defense against primary user emulation attacks from the secondary user throughput perspective

The maximization of Secondary user (SU) throughput has been studied extensively in honest cooperative spectrum sensing (CSS). However, when primary user emulation attacks (PUEAs) are launched, the model of CSS changes. This also necessitates the redesigning of the SU throughput maximisation scheme. In this paper, such redesigning of the SU throughput maximisation scheme under PUEAs has been carried out. Our objective is to suppress the damages caused by the PUEAs on the SU throughput. To serve this purpose, an optimally weighted CSS has been proposed. The optimal weights are obtained by maximising the SU throughput while protecting the primary user (PU) from interference in a network facing the PUEAs. Considering the significance of simplicity and speed in CSS, we apply the Nelder Mead Simplex Algorithm to solve the problem. The experiments carried out endorse the effectiveness of the proposed scheme compared to the existing combination schemes.