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

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

Prediction‐based MAC‐layer sensing in cognitive radio networks

We consider a cognitive radio network which coexists with multiple primary users (PUs) and secondary users (SUs) transmit over time‐varying channels. In this scenario, one problem of the existing work is the poor performances of throughput and fairness due to variances of SUs' channel conditions and PUs' traffic patterns. To solve this problem, we propose a novel prediction‐based MAC‐layer sensing algorithm. In the proposed algorithm, the SUs' channel quality information and the probability of the licensed channel being idle are predicted. Through the earlier predicted information, we schedule the SUs to sense and transmit on different licensed channels. Specifically, multiple significant factors, including network throughput and fairness, are jointly considered in the proposed algorithm. Then, we formulate the prediction‐based sensing scheduling problem as an optimization problem and solve it with the Hungarian algorithm in polynomial time. Simulation results show that the proposed prediction‐based sensing scheduling algorithm could achieve a good tradeoff between network throughput and fairness among SUs. Copyright © 2014 John Wiley & Sons, Ltd.     

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.     

Simultaneous spectrum sensing,data transmission and Energy harvesting in multi‐channel cognitive sensor Networks with imperfect signal cancellation

In multichannel cognitive sensor networks, the sensor users which have limited energy budgets sense the spectrum to determine the activity of the primary user. If the spectrum is idle, the sensor user can access the licensed spectrum. However, during the spectrum sensing, no data transmits. For improving the network throughput and saving more energy consumption, we propose the simultaneous spectrum sensing and data transmission scheme where the sensor receiver decodes the received signal, and from the remaining signal, the status of the channel (idle/busy) is determined. We also consider that the sensor users are powered by a radio‐frequency (RF) energy harvester. In this case, energy harvesting, data transmission, and spectrum sensing are done simultaneously. On the other hand, we select the proper sensor users for spectrum sensing and energy harvesting. We also allocate the best channels for data transmission simultaneously so that the network throughput maximizes and the constraints on the energy consumption and the detection performance are satisfied for each band. We formulate the problem and model it as a coalition game in which sensors act as game players and decide to make coalitions. Each coalition selects one of the channels to sense and transmit data, while the necessary detection probability and false alarm probability and also the energy consumption constraints are satisfied. The utility function of a coalition is proposed based on the energy consumption, false alarm probability, detection probability, and the network throughput. This paper proposes an efficient algorithm to reach a Nash‐stable coalition structure. It is demonstrated that the proposed method maximizes the network throughput and reduces the energy consumption while it provides sufficient detection quality, in comparison to other existent methods.     

Throughput optimization using simultaneous sensing and transmission in energy harvesting cognitive radio networks

A three‐dimensional continuous‐time Markov model is proposed for an energy harvesting cognitive radio system, where each secondary user (SU) harvests energy from the ambient environment and attempts to transmit data packets on spectrum holes in an infinite queuing buffer. Unlike most previous works, the SU can perform spectrum sensing, data transmission, and energy harvesting simultaneously. We determine active probability of the SU transmitter, where the average energy consumption for both spectrum sensing and data transmission should not exceed the amount of harvested energy. Then, we formulate achievable throughput of secondary network as a convex optimization problem under average transmit and interference energy constraints. The optimal pair of controlled energy harvesting rate and data packet rate is derived for proposed model. Results indicate that no trade‐off is available among harvesting, sensing/receiving, and transmitting. The SU capability for self‐interference cancelation affects the maximum throughput. We develop this work under hybrid channels including overlay and underlay cases and propose a hybrid solution to achieve the maximum throughput. Simulation results verify that our proposed strategy outperforms the efficiency of the secondary network compared to the previous works.     

多信道合作感知中基于信道可用概率的感知信道集合选择算法

首先分析了在给定感知信道集合和相应的可用概率集合条件下认知无线网络最大吞吐量的求解算法,接着给出了授权信道可用概率的估计方法,并在此基础上提出了一种基于授权信道可用概率估计的感知信道集合的次优选择算法。从分析结果与仿真结果可知,该次优选择算法与最优选择算法的性能差别不大,但是复杂度却大大降低了,另外该算法与已有算法相比可以得到更高的系统吞吐量。     

Cluster‐based adaptive multispectrum sensing and access in cognitive radio networks

Spectrum sensing and access have been widely investigated in cognitive radio network for the secondary users to efficiently utilize and share the spectrum licensed by the primary user. We propose a cluster‐based adaptive multispectrum sensing and access strategy, in which the secondary users seeking to access the channel can select a set of channels to sense and access with adaptive sensing time. Specifically, the spectrum sensing and access problem is formulated into an optimization problem, which maximizes the utility of the secondary users and ensures sufficient protection of the primary users and the transmitting secondary users from unacceptable interference. Moreover, we explicitly calculate the expected number of channels that are detected to be idle, or being occupied by the primary users, or being occupied by the transmitting secondary users. Spectrum sharing with the primary and transmitting secondary users is accomplished by adapting the transmission power to keep the interference to an acceptable level. Simulation results demonstrate the effectiveness of our proposed sensing and access strategy as well as its advantage over conventional sensing and access methods in terms of improving the achieved throughput and keeping the sensing overhead low. Copyright © 2012 John Wiley & Sons, Ltd.     

优化的最佳中继协作频谱感知

在基于中继的协作频谱感知中,尽管通过引入认知中继可有效提高协作频谱感知性能,然而认知中继的引入也会带来额外的系统开销及复杂度增加问题。为了节约系统开销,本文在前期取得研究成果的基础上,进一步提出了一种基于删余的最佳中继协作频谱感知方案,只有当次用户检测到主用户信号且目标次用户的报告信道衰落严重时,才申请认知中继的协作传输,同时目标次用户将其检测到的感知信息发送到认知中继;最后,分别从检测性能和次系统可获得的容量角度对所提方案下的协作频谱感知性能进行了理论分析。分析和仿真结果表明,所提方案可以有效提高检测性能,当确保主用户受到足够保护的前提下,利用所提方案可以获得更高的次系统容量。      

最优认知用户配对与协作感知算法研究

针对协作算法频谱感知和时隙消耗方面的不足,提出一种最优用户配对与协作感知算法。采用接收信噪比最优的认知用户为感知用户且以接收信噪比次优的认知用户为其中继的配对准则,获得最佳频谱感知性能。通过优化设置协作门限,选择性地采用非协作或协作模式,获得更低的时隙消耗。同时,推导了在瑞利平坦衰落环境下该算法的频谱检测概率下界与时隙消耗。数值计算结果表明,与原有算法相比,该算法不仅检测概率更高且时隙消耗更低。     

Overhead-Throughput Tradeoff Under a Novel Frame Structure in Centralized Cooperative Cognitive Networks

Cooperative spectrum sensing plays an important role in cognitive radio networks since it improves the detection performance by exploiting spatial diversity. However, the cooperation among terminals also brings additional communication overhead. In this paper, overhead-throughput tradeoff issues are investigated in four scenarios namely (1) identical sensing channel and perfect reporting channel, (2) identical sensing channel and imperfect reporting channel, (3) different sensing channel and perfect reporting channel, (4) different sensing channel and imperfect reporting channel of each secondary user (SU). Taking the reporting overhead into consideration, a novel frame structure consisting of an initial subframe and M consecutive subframes, is proposed to maximize the achievable throughput of the secondary network. And for each scenario, the overhead-throughput tradeoff is formulated as an optimization problem with respect to the number of reporting SUs. A brute-force approach is then used to resolve such optimization problem. Given the optimal number of reporting SUs, a set of candidate SUs is then selected according to the probability of detection, the probability of false alarm and the probability of reporting error. Numerical results show that an optimal overhead-throughput tradeoff is achieved given the optimal number of reporting SUs. In addition, the probability of false alarm is shown to be the most important factor affecting the performance of achievable throughput within the secondary network because the lower probability of false alarm corresponds to the case that the secondary network can use the channel with a higher chance.     

Effects of imperfect channel sensing and estimation on the performance of cognitive radio systems

In realistic scenarios of cognitive radio (CR) systems, imperfect channel sensing may occur due to false alarms and miss detections. Channel estimation between the secondary user transmitter and another secondary user receiver is another challenge in CR systems, especially for frequency‐selective fading channels. In this context, this paper presents a study of the effects of imperfect channel sensing and channel estimation on the performance of CR systems. In particular, different methods of channel estimation are analyzed under channel sensing imperfections. Initially, a CR system model with channel sensing errors is described. Then, the expectation maximization (EM) algorithm is implemented in order to learn the channel fading coefficients. By exploiting the pilot symbols and the detected symbols at the secondary user receiver, we can estimate the channel coefficients. We further compare the proposed EM estimation algorithm with different estimation algorithms such as the least squares (LS) and linear minimum mean square error (LMMSE). The expressions of channel estimates and mean squared errors (MSE) are determined, and their dependencies on channel sensing uncertainty are investigated. Finally, to reduce the complexity of EM algorithm, a sub‐optimal algorithm is also proposed. The obtained results show that the proposed sub‐optimal algorithm provides a comparable bit error rate (BER) performance with that of the optimal one yet with less computational complexity.     

Distributed and Centralized Schemes for Channel Sensing Order Setting in Multi-user Cognitive Radio Networks

Channel sensing order setting is crucial for efficient channel exploration and exploitation in cognitive radio (CR) networks. This paper investigates the sensing order setting problem in multi-channel multi-user CR networks for both distributed scenario and centralized scenario. As the optimal solution is too complicated, two suboptimal greedy search algorithms with much less computational complexities are proposed. The channel availability, channel achievable rate, multi-user diversity and collisions among CR users are considered comprehensively in our proposed methods. For the distributed scenario, a novel potential function is proposed to represent the relative advantage of a channel used by a user among multi channels and multi users, based on which each user can get its own sensing order. For the centralized scenario, a sensing matrix is obtained by a coordinator for all the users. It is shown that, CR users’ average throughput increases and collision probability decreases with the number of channels due to increased transmission opportunities. The total network throughput increases with the number of user pairs due to multi-user diversity. Simulation results validate the efficacy of the proposed schemes in elevating CR users’ throughput and decreasing the probability of collision, and show the performance improvement of the proposed schemes by comparisons with existing works.     

Exploiting Multichannel Diversity in Spectrum Sharing Systems Using Optimal Stopping Rule

This letter studies the problem of exploiting multichannel diversity in a spectrum sharing system, where the secondary user (SU) sequentially explores channel state information on the licensed channels with time consumption. To maximize the expected achievable throughput for the SU, we formulate this problem as an optimal stopping problem, whose objective is to choose the right channel to stop exploration based on the observed signal‐to‐noise ratio sequence. Moreover, we propose a myopic but optimal rule, called one‐stage look‐ahead rule, to solve the stopping problem.     

Optimization of Time-Domain Combining Cooperative Spectrum Sensing in Cognitive Radio Networks

In cognitive radio networks, the secondary users take chances to access the spectrum without causing interference to the primary users so that the spectrum access is dynamic and somewhat opportunistic. Therefore, spectrum sensing is of significant importance. In this paper, we propose a novel time-domain combining cooperative spectrum sensing framework, in which the time consumed by reporting for one secondary user is also utilized for other secondary users’ sensing. We focus on the optimal sensing settings of the proposed sensing scheme to maximize the secondary users’ throughput and minimize the average sensing error probability under the constraint that the primary users are sufficiently protected. Some simple algorithms are also derived to calculate the optimal solutions. Simulation results show that fundamental improvement of the achievable throughput and sensing performance can be obtained by optimal sensing settings. In addition, our proposed scheme outperforms the general frame structure on either achievable throughput or the performance of average sensing error probability.     

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.     

Sensing throughput trade‐off for an energy efficient cognitive radio network under faded sensing and reporting channel

The trade‐off between sensing time and throughput is investigated in the context of an energy‐efficient cognitive radio network considering both the sensing and reporting channels are Rayleigh faded, while the existing literature considered the fading in sensing channel only. In this paper, such a trade‐off is re‐examined under Rayleigh faded sensing as well as reporting channel. Novel analytical expressions for overall detection probability and false alarm probability are developed under such scenario. The performance is investigated in terms of detection probability, false alarm probability, throughput and energy efficiency of the network for different sensing parameters such as sensing time, number of samples, sensing channel signal‐to‐noise ratio and reporting channel signal‐to‐noise ratio. Our analysis shows that the quality of the reporting channel significantly affects the trade‐off performance of the network. Copyright © 2015 John Wiley & Sons, Ltd.     

Energy harvesting,cooperative spectrum sensing,and data transmission improvement in energy‐efficient multichannel cognitive sensor networks

In this paper, we investigate the energy harvesting capability in a multichannel wireless cognitive sensor networks for energy‐efficient cooperative spectrum sensing and data transmission. Spectrum sensors can cooperatively scan the spectrum for available channels, whereas data sensors transmit data to the fusion center (FC) over those channels. We select the sensing, data transmission, and harvesting sensors by setting the sensing time, data transmission time, and also harvesting time to maximize the network data transmission rate and improve the total energy consumption in the multichannel network under global probability of false alarm and global probability of detection constraints. We formulate our optimization problem and employ the convex optimization method to obtain the optimal times and nodes for spectrum sensing, data transmission, and harvesting energy in each subchannel for multiband cognitive sensor networks. Simulation results show that in our proposed algorithm, the network data transmission rate is improved while more energy is saved compared with the baseline methods with equal sensing time in all subchannels.     

Dynamic control approaches of spectrum sensing in multi-band cognitive radio networks

In this paper,the dynamic control approaches for spectrum sensing are proposed,based on the theory that prediction is synonymous with data compression in computational learning. Firstly,a spectrum sensing sequence prediction scheme is proposed to reduce the spectrum sensing time and improve the throughput of secondary users. We use Ziv-Lempel data compression algorithm to design the prediction scheme,where spectrum band usage history is utilized. In addition,an iterative algorithm to find out the optimal number of spectrum bands allowed to sense is proposed,with the aim of maximizing the expected net reward of each secondary user in each time slot. Finally,extensive simulation results are shown to demonstrate the effectiveness of the proposed dynamic control approaches of spectrum sensing.     

Efficient secondary access with intelligent spectrum sensing in cognitive radio networks

In cognitive radio networks, cooperative sensing can significantly improve the performance in detection of a primary user via secondary users (SUs) sharing their detection results. However, a large number of cooperative SUs may induce great sensing delay, which degrades the performance of secondary transmissions. In this paper, we jointly consider cooperative sensing and cognitive transmission in cognitive radio networks, aiming to achieve efficient secondary access with low sensing overhead under both the sensing time and reporting power limitations, where primary users are guaranteed to be sufficiently protected. We first propose an adaptive sensing scheme to lower the detection time while not degrading the detection probability. Then, based on the proposed adaptive sensing scheme, an efficient cognitive transmission protocol is well designed, which improves the throughput of secondary transmissions while ensuring the QoS of primary transmissions. We analyze the performance for the proposed secondary access framework in terms of misdetection probability, average detection time and normalized secondary throughput, respectively, and derive their closed‐form expressions over Rayleigh fading channels with considering the reporting errors accordingly. We also study the problems of optimizing the number of cooperative SUs to minimize the misdetection probability and average detection time, and maximize the normalized secondary throughput for proposed framework. Simulation results reveal that the proposed framework outperforms the traditional case significantly. Copyright © 2013 John Wiley & Sons, Ltd.     

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.