Distributed opportunistic scheduling for MIMO underlay cognitive radio networks

Cognitive radio networks have emerged to improve the utilization of the scarce spectrum. In this paper, we propose a distributed resource allocation algorithm that allocates resources opportunistically to the secondary users in a multiple‐input multiple‐output environment. In order to reduce the complexity and cost, antenna selection schemes are employed to allow the secondary communication using a single radio frequency chain. The proposed algorithm is proved theoretically and using simulations, to give a performance very close to that of a centralized one with lower delay and overhead. Furthermore, we introduce two techniques for the proposed algorithm based on the allowable data rates referred to as limited and maximum rates. We derive closed‐form expression for the consumed power and tight upper bounds for the average throughput achieved by each technique. A comparison between the proposed techniques is also provided. Both simulations and analytical results show that the proposed algorithm achieves high throughput with low complexity. Moreover, the results show that the tightness of the bounds improves with the diversity order. Finally, the proposed techniques are compared with two suggested random schemes to investigate their effectiveness. Copyright © 2016 John Wiley & Sons, Ltd.     

Joint sensing and transmission for cognitive amplify‐and‐forward two‐way relay networks

In this paper, we propose a cognitive transmission scheme for Amplify‐and‐Forward (AF) two‐way relay networks (TWRNs) and investigate its joint sensing and transmission performance. Specifically, we derive the overall false alarm probability, the overall detection probability, the outage probability of the cognitive TWRN over Rayleigh fading channels. Furthermore, based on these probabilities, the spectrum hole utilization efficiency of the cognitive TWRN is defined and evaluated. It is shown that smaller individual or overall false alarm probability can result in less outage probability and thus larger spectrum hole utilization efficiency for cognitive TWRN, and however produce more interference to the primary users. Interestingly, it is found that given data rate, more transmission power for the cognitive TWRN does not necessarily obtain higher spectrum hole utilization efficiency. Moreover, our results show that a maximum spectrum hole utilization efficiency can be achieved through an optimal allocation of the time slots between the spectrum sensing and data transmission phases. Finally, simulation results are provided to corroborate our proposed studies. Copyright © 2016 John Wiley & Sons, Ltd.     

Ergodic capacity of multiuser scheduling in cognitive radio networks: analysis and comparison

This paper analyzes the ergodic capacity of secondary point‐to‐multipoint communications under the outage constraint of multiple primary user receivers (PU‐Rxs) and the secondary user (SU) maximum transmit power limit. We first derive analytical expressions of the ergodic capacity for three scheduling schemes, that is, round robin, Max‐signal‐to‐interference‐plus‐noise‐ratio (Max‐SINR) and Min‐SINR, and compare their performance. Numerical examples show that when the number of SU receivers (SU‐Rxs) increases in the presence of a single PU‐Rx and at high SINR, the Min‐SINR outperforms the Max‐SINR scheme. As the number of PU‐Rxs increases, the Max‐SINR performs better than the Min‐SINR scheduling. When the number of SU‐Rxs becomes large, the system capacity is enhanced but so is the feedback load. To exploit the Max‐SINR transmission while reducing the feedback load, we assume a threshold based on the channel quality where the SU‐Rxs with the instantaneous SINR above the threshold participate in the Max‐SINR scheduling; otherwise, an SU‐Rx is selected randomly. Then, an analytical expression of the average capacity is derived. Numerical results illustrate that the capacity with limited feedback is approximately the same as for the case of Max‐SINR with full feedback when the SU threshold for feedback condition is set to low and medium values. Copyright © 2016 John Wiley & Sons, Ltd.     

Parameters optimization for cooperative sensing in multi‐channel cognitive radio networks

In this paper, we propose a relatively complete and robust optimization model under the scenario where multisecondary users cooperatively sense multi‐channels. The objective of this model is to maximize the system throughput, meanwhile aims to jointly optimize the parameters including the sensing time and the weight coefficients of the sampling results. Because this model is a nonlinear optimization model, we instead adopt a heuristic sequential parameters optimization method (SPO) to solve the model. The method begins with deriving the lower bound of the objective function of the optimization model. Then, it maximizes this lower bound by optimizing the weight coefficients through solving a series of suboptimal problems using Lagrange method. Given that the weight coefficients are found, it finally transforms the problem into another monotonic programming problem and exploits a fast‐convergent polyblock algorithm to find an optimized sensing time parameter. We finally conduct extensive experiments by simulations. The results demonstrate that, in terms of the throughput gained by the system, SPO can deliver a solution that is up to 99.3% of the optimal on average, which indicates that SPO can solve the proposed optimization model effectively. In addition, we also show the performance advantage of the proposed model on improving the system throughput by comparing with other state‐of‐the‐art optimization models. Wireless Communications and Mobile Computing. Copyright © 2012 John Wiley & Sons, Ltd.     

Resource block Filtered-OFDM for future spectrally agile and power efficient systems

Spectrum sharing is a common paradigm in future communication systems and a spectrally agile baseband waveform with minimal out-of-band emissions is a critical component. In this paper, we propose a new multicarrier modulation technique, called resource block Filtered-OFDM (RB-F-OFDM) and present the transceiver design. This waveform can be used over channels with non-contiguous spectrum fragments and exhibits very low adjacent channel interference, which is required for cognitive radio systems with multi channel carrier aggregation capabilities. As such, regulatory based very stringent adjacent channel leakage ratio (ACLR) and adjacent channel selectivity (ACS) requirements can be met. We show that the transceiver complexity may be reduced by utilizing an efficient polyphase implementation that is commonly used in the filter bank multicarrier (FBMC) modulation. In addition, some efficient peak-to-average power ratio (PAPR) reduction techniques can be naturally applied. The new design is backwards compatible with legacy OFDM based systems. Simulation results to evaluate the performance, including measured bit error rate (BER) in multipath channels, are provided.     

信号识别中的决策论分类器改进

调制方式自动识别的目的就是在尽可能少的先验知识前提下,判断出通信信号的调制方式,并估计出相应的调制参数。近年来,许多学术和军事研究机构都将兴趣集中在调制识别算法的研究和开发上。通过对Nandi A K和Azzouz E E所提出特征值的介绍、以及利用特征值对信号进行模拟信号调制方式识别的原理,提出了改进的特征值来取代传统特征值。仿真结果显示,改进的基于决策论的分类方法不但具有较高的识别率,而且相比改进前的分类器具有更快的识别速度。     

浅谈节目录制过程中交流声的产生与预防

提出了交流声的概念以及交流声对节目录制带来的影响;分析了在日常节目录制过程中所遇到的一部分能够产生交流干扰的原因及其处理方法;总结出交流声预防的方法,从多角度做到有效预防交流声的出现和减少交流声出现的几率.     

An intelligent cooperative sensing strategy with low overhead for cognitive radios

As is well known, cooperative sensing can remarkably improve the sensing accuracy by exploiting the spatial diversity of different secondary users. However, a large number of cooperative secondary users reporting their local decisions would induce great detection delay and traffic burden, which degrades the performance of secondary spectrum access. This paper proposes an intelligent cooperative sensing (ICS) strategy with selective reporting and sequential detection to enhance the sensing reliability as well as reduce the sensing overhead for cognitive radios. The tradeoff in the sensing time allocation is studied for ICS and then two novel fusion rules are developed to efficiently obtain the optimum sensing time allocation with different objectives. The performance of ICS is analyzed in terms of miss detection probability and average sensing time, where their closed‐form expressions are derived over Rayleigh fading channels. Simulation results reveal that ICS achieves higher sensing reliability with less sensing overhead than the traditional strategy. It is also shown that the miss detection probability and average sensing time of ICS can be minimized by optimizing the sensing time allocation. Copyright © 2013 John Wiley & Sons, Ltd.     

A decision tree cognitive routing scheme for cognitive radio mesh networks

Routing in a cognitive radio network operating in a dynamic environment is a complex decision problem. Diversity in the number of available spectrum bands and their stability, in addition to the secondary users' heterogeneities, affect the consequence of the routing decision. We use a decision theory framework to model the problem of routing under uncertainties involved in a cognitive radio network. A utility function is designed to capture the effect of spectrum measurement, fluctuation of bandwidth availability, and path quality. A node cognitively decides its best candidate among its neighbors by utilizing a decision tree. Each branch of the tree is quantified by the utility function and a posterior probability distribution that predicts the suitability of available neighbors. In decision tree cognitive routing (DTCR), nodes learn their operational environment and adapt their decision‐making accordingly. We compared our scheme with the optimal performance in a highly dynamic environment and local coordination‐based routing and spectrum assignment protocol [1]. Our results show that the DTCR tends to perform near optimum. It easily adapts to environmental dynamics. Copyright © 2013 John Wiley & Sons, Ltd.     

TRADE: A truthful online combinatorial auction for spectrum allocation in cognitive radio networks

Auctions have been shown to be able to tackle the problem of spectrum scarcity effectively, but most of existing works only focus on static scenarios. They cannot deal with the requests of spectrum users as they arrive and leave dynamically. Bidders can either cheat by bidding untruthfully or cheat about the arrival and departure time. In this paper, we model the radio spectrum allocation problem as a sealed‐bid online combinatorial auction and propose a truthful mechanism called TRADE. TRADE is a truthful and an individual rational mechanism with polynomial time complexity. It can prevent bidders from cheating in the auction while achieving good bidder satisfaction, spectrum utilization, and social welfare. Copyright © 2013 John Wiley & Sons, Ltd.