Cognitive radio network with continuous energy‐harvesting

In this paper, the performance of a cooperative cognitive radio (CR) network is investigated under continuous energy harvesting scenario. A CR node harvests energy from both the sources: non‐radio frequency (RF) signal (ambient sources) or from RF signal (primary user signal). It harvests from non‐RF signal during sensing time of its detection cycle, and from both the sources, RF signal and non‐RF signal, during transmission time as per sensing decision. Several novel analytical expressions are developed to indicate the harvested energy, energy reward, energy cost in a detection frame, and throughput. The performance of the CR network is investigated to maximize the throughput considering energy causality constraints and collision constraints. Analytical results are validated through extensive simulation results. Copyright © 2016 John Wiley & Sons, Ltd.     

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.     

Cross‐layer optimization for full‐duplex cognitive radio network with cooperative spectrum sensing

In this paper, the cross‐layer optimal design of multihop ad hoc network employing full‐duplex cognitive radios (CRs) is investigated. Firstly, the analytical expressions of cooperative spectrum sensing performance for multihop CR networks over composite fading channels are derived. Then, the opportunistic throughput and transmit power of CRs are presented based on the derivation of false alarm and missed detection probability. Finally, a multiobjective optimization model is proposed to maximize the opportunistic throughputs and minimize the transmitting power. Simulation results indicate that Pareto optimal solution of sensing duration, decision threshold, and transmit power can be achieved by cross‐layer multiobjective optimization, it can balance the conflicts between different objective functions and reap the acceptable outcomes for multihop CR network.     

Cognitive radio network with coordinated multipoint joint transmission

Cognitive radio (CR) is considered to be a promising technology for future wireless networks to make opportunistic utilization of the unused or underused licensed spectrum. Meanwhile, coordinated multipoint joint transmission (CoMP JT) is another promising technique to improve the performance of cellular networks. In this paper, we propose a CR system with CoMP JT technique. We develop an analytical model of the received signal‐to‐noise ratio at a CR to determine the energy detection threshold and the minimum number of required samples for energy detection–based spectrum sensing in a CR network (CRN) with CoMP JT technique. The performance of energy detection–based spectrum sensing under the developed analytical model is evaluated by simulation and found to be reliable. We formulate an optimization problem for a CRN with CoMP JT technique to configure the channel allocation and user scheduling for maximizing the minimum throughput of the users. The problem is found to be a complex mixed integer linear programming. We solve the problem using an optimization tool for several CRN instances by limiting the number of slots in frames. Further, we propose a heuristic‐based simple channel allocation and user scheduling algorithm to maximize the minimum throughput of the users in CRNs with CoMP JT technique. The proposed algorithm is evaluated via simulation and found to be very efficient.     

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.     

Study the effect of PAPR on wideband cognitive OFDM radio networks

Cognitive radio (CR) technology is viewed as a novel approach for maximizing the utilization of the radio electromagnetic spectrum. Spectrum sensing methods are often used for finding free channels to be used by CR. Recently, Orthogonal Frequency Division Multiplexing system (OFDM) has been suggested as a candidate technology for multicarrier-based CR systems. However, one problem that appears in OFDM systems is the high Peak to Average Power Ratio (PAPR). In this paper, the effect of PAPR reduction of the primary signal on the performance of the multiband joint detection for wideband spectrum sensing and the profit of the primary user will be investigated. Moreover, the optimal solutions for the multi-band joint detection for the non-cooperative and cooperative schemes will be analyzed by considering the primary user’s PAPR reduction. Also, the wideband cooperative spectrum sensing to improve the signal detection with high reduction in the PAPR will be suggested. Simulation results show that the PAPR reduction decreases the total price of the primary user and the aggregate opportunistic throughput of the secondary user. The cooperative scheme is effective in improving the performance in terms of the aggregate opportunistic throughput with PAPR reduction.     

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.     

Interference‐aware spectrum handover for cognitive radio networks

Cognitive radio (CR) is a promising technique for future wireless networks, which significantly improves spectrum utilization. In CR networks, when the primary users (PUs) appear, the secondary users (SUs) have to switch to other available channels to avoid the interference to PUs. However, in the multi‐SU scenario, it is still a challenging problem to make an optimal decision on spectrum handover because of the the accumulated interference constraint of PUs and SUs. In this paper, we propose an interference‐aware spectrum handover scheme that aims to maximize the CR network capacity and minimize the spectrum handover overhead by coordinating SUs’ handover decision optimally in the PU–SU coexisted CR networks. On the basis of the interference temperature model, the spectrum handover problem is formulated as a constrained optimization problem, which is in general a non‐deterministic polynomial‐time hard problem. To address the problem in a feasible way, we design a heuristic algorithm by using the technique of Branch and Bound. Finally, we combine our spectrum handover scheme with power control and give a convenient solution in a single‐SU scenario. Experimental results show that our algorithm can improve the network performance efficiently.Copyright © 2012 John Wiley & Sons, Ltd.     

Energy‐Efficient Power Allocation for Cognitive Radio Networks with Joint Overlay and Underlay Spectrum Access Mechanism

Traditional designs of cognitive radio (CR) focus on maximizing system throughput. In this paper, we study the joint overlay and underlay power allocation problem for orthogonal frequency‐division multiple access–based CR. Instead of maximizing system throughput, we aim to maximize system energy efficiency (EE), measured by a “bit per Joule” metric, while maintaining the minimal rate requirement of a given CR system, under the total power constraint of a secondary user and interference constraints of primary users. The formulated energy‐efficient power allocation (EEPA) problem is nonconvex; to make it solvable, we first transform the original problem into a convex optimization problem via fractional programming, and then the Lagrange dual decomposition method is used to solve the equivalent convex optimization problem. Finally, an optimal EEPA allocation scheme is proposed. Numerical results show that the proposed method can achieve better EE performance.     

On energy‐efficient performance‐guaranteed channel assignment in cognitive radio‐based wireless mesh networks

In recent years, in order to make efficient use of spectrum resources, much attention has been given to solving the problem of channel assignment in cognitive radio‐based wireless mesh networks (CR‐WMNs). Current approaches focus mainly on avoiding interference in order to enhance performance in terms of throughput. WMNs are intended to provide low‐cost multimedia communication. Therefore, in order to provide low‐cost real‐time communication, channel assignment in CR‐WMNs should take into consideration not only the issue of throughput, but also energy consumption and delays. In this paper, we first define an optimization problem to maximize the end‐to‐end throughput per unit of energy consumption while minimizing, as well as guaranteeing, the delay constraint specified for a data stream. Based on this, we then propose a novel distributive heuristic channel assignment approach to solve the optimization problem in a self‐organized manner. Finally, we present the simulation results to evaluate the performance of the proposed solution in terms of end‐to‐end throughput per unit of energy consumption and delays. Copyright © 2015 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.     

Iterative optimization of detection threshold and throughput for secondary users in multiband cognitive radio systems

In cognitive radio(CR) systems,efficient spectrum sensing ensures the secondary user(SU) to successfully access the spectrum hole.Typically,the detection problem has been considered separately from the optimization of transmission strategy.However,in practice,due to non-zero probabilities of miss detection and false alarm,the sensing phase has an impact on the throughput of SUs as well as on the transmission of primary user(PU).In this paper,using energy detection,we maximize the total throughput of SUs by ...     

An analytical framework for remote sensing satellite networks based on the model predictive control with convex optimization

In this paper, we consider the problem of maximizing the throughput of remote sensing satellite networks. In such networks, the link capacities and routing matrices are varying over time. We propose a convex optimization‐based analytical framework for the problem. To maximize the network throughput under the premise of satisfying the delay constraint, we formulate the data transmission schedule into an optimization problem aiming at maximizing the delay‐constrained throughput. Considering the fact that the future link capacities cannot be accurately known in the actual situation, we propose a heuristic and distributed framework on the basis of model predictive control for approximately solving the problem. This framework can be used to design remote sensing data transmission schedules under various scenarios. We adopt a generic example to simulate and analyze the framework. The simulation results show that the proposed analytic framework can obtain the approximate solution that is very close to the optimal solution by solving the convex optimization problem step‐by‐step. The heuristic algorithm based on model predictive control can obtain the approximate solution, which is very close to the optimal solution in distributed scenario.     

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.     

Jointly optimizing sensing time and resource allocation in multichannel cognitive radio networks

Spectrum sensing is a key technique for determining the spectrum available in cognitive radio (CR) networks. In this paper, we study how to jointly optimize sensing time and resource allocation to maximize the sum transmission rate of all CR users of a multichannel CR network. We take into consideration the transmission power and interference constraints to protect primary users from harmful interference, as well as constraints of detection probability and false alarm probability. Under these constraints, we propose an asymptotically optimal resource allocation algorithm. The optimal sensing time can be obtained using the traditional one‐dimensional exhaustive search. However, owing to the high complexity of searching for the sensing time, we propose a simplified method to get the optimal sensing time under the assumption that false alarm probability is small. Simulation results show that the simplified method can obtain the optimal sensing time efficiently under strict constraint of false alarm probability. Copyright © 2012 John Wiley & Sons, Ltd.     

Fixed channel assignment algorithm for multi‐radio multi‐channel MESH networks

Recently, multi‐radio mesh technology in wireless networks has been under extensive research. This is because of its potential of overcoming the inherent wireless multi‐hop throughput, scalability and latency problems caused by the half‐duplex nature of the IEEE 802.11. The concept of deploying multiple radios in wireless network access points (APs) has shown a promising way to enhance the channel selection and the route formation while the MESH topology allows more fine‐grained interference management and topology control. Within this realm, given a set of end‐to‐end objectives, there are multiple issues that need to be identified when we consider the optimization problem for fixed multi‐channel multi‐hop wireless networks with multiple radios. This paper addresses the static channel assignment problem for multichannel multi‐radio static wireless mesh networks. We first discuss its similarities and differences with the channel assignment problem in cellular networks (WMN). Next, we present four metrics based on which mesh channel assignments can be obtained. Three of these metrics attempt to maximize simultaneous transmissions in a mesh network, either directly or indirectly. The fourth metric quantifies the ‘diversity’ of a particular assignment and can be used as a secondary criterion to the other three metrics. Related optimization models have also been developed. Copyright © 2007 John Wiley & Sons, Ltd.     

Throughput enhancement of cognitive M2M networks based on NOMA for 5G communication systems

One of the promising technologies for 5G cellular networks is machine‐to‐machine (M2M) communications. We propose a cognitive radio network (CR) that includes a primary cellular system and a secondary cognitive system. The primary cellular system has a primary client (PC) and the secondary cognitive system has M2M clients which are called secondary clients (SCs). In a conventional system of CR network based on orthogonal frequency division multiple access (CR‐OFDMA), when the primary client (PC) is absent, only one SC can obtain the idle spectrum. But, the SC must leave the spectrum when detecting the existence of the PC. So, the spectrum usage of this system is very low. This paper proposes a cooperative CR network based on nonorthogonal multiple access (CCR‐NOMA) for spectrum sensing using energy detection (ED) to allow multiple SCs to share the same frequency at the same time, but are differentiated according to the power domain or code domain, to improve spectrum efficiency of 5G communications and the transmission performance of CR network at the absence and presence of the PC. To evaluate the channel sensing performance of the ED technique in CCR‐NOMA, we derived a closed‐form expression between the achievable throughput and sensing time for the CCR‐NOMA system. The same analysis for the case of CR‐OFDMA is reproduced for the sake of comparison. The analysis showed that the CR‐NOMA system for M2M communication outperforms the CR‐OFDMA system for M2M communication for the same noncooperative and cooperative spectrum sensing and physical layer parameters.     

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

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

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.     

Distributed cross‐layer optimization for wireless regional area network‐based cognitive radio networks

This paper presents a study of a cross‐layer design through joint optimization of spectrum allocation and power control for cognitive radio networks (CRNs). The spectrum of interest is divided into independent channels licensed to a set of primary users (PUs). The secondary users are activated only if the transmissions do not cause excessive interference to PUs. In particular, this paper studies the downlink channel assignment and power control in a CRN with the coexistence of PUs and secondary users. The objective was to maximize the total throughput of a CRN. A mathematical model is presented and subsequently formulated as a binary integer programming problem, which belongs to the class of non‐deterministic polynomial‐time hard problems. Subsequently, we develop a distributed algorithm to obtain sub‐optimal results with lower computational complexity. The distributed algorithm iteratively improves the network throughput, which consists of several modules including maximum power calculation, excluded channel sets recording, base station throughput estimation, base station sorting, and channel usage implementation. Through investigating the impacts of the different parameters, simulation results demonstrates that the distributed algorithm can achieve a better performance than two other schemes. Copyright © 2011 John Wiley & Sons, Ltd.