A low‐complexity resource allocation algorithm in OFDMA‐based cooperative cognitive radio networks

In this paper, we propose a low‐complexity resource allocation algorithm for the orthogonal frequency division multiplexing cooperative cognitive radio networks, where multiple primary users (PUs) and multiple secondary users (SUs) coexist. Firstly, we introduce a new concept of ‘efficiency capacity’ to represent the channel conditions of SUs by considering both of the interference caused by the PUs and the channel gains of the SUs with the assist of the relays. Secondly, we allocate the relay, subcarrier and transmission power jointly under the constraint of limiting interference caused to the PUs. Simulation results show that the proposed algorithm can achieve a high data rate with a relative low power level. Copyright © 2014 John Wiley & Sons, Ltd.     

Resource allocation in orthogonal frequency division multiple access‐based cognitive radio systems with minimum rate constraints

In this paper, resource allocation problem in orthogonal frequency division multiple access‐based cognitive radio (CR) systems to maintain minimum transmission rate constraints of CR users (CRUs) with the specified interference thresholds is investigated. Firstly, a single primary user (PU) CR system is considered, and a suboptimal resource allocation algorithm to maximize the sum transmission rate of all CRUs is proposed. Secondly, the single‐PU scenario is extended to multiple‐PU case, and an asymptotically optimal resource allocation algorithm is proposed using dual methods subject to constraints on both interference thresholds of PUs and total transmit power of all CRUs. Analysis and numerical results show that, in contrast to classical resource allocation algorithms, the proposed algorithm can achieve higher transmission rate and guarantee each CRU's minimum transmission rate in both scenarios. Copyright © 2012 John Wiley & Sons, Ltd.     

Cooperative quadrature physical layer network coding in wireless relay networks

This paper proposes a cooperative quadrature physical layer network coding (CQPNC) scheme for a dual‐hop cooperative relay network, which consists of two source nodes, one relay node and one destination node. All nodes in the network have one antenna, and the two source nodes transmit their signals modulated with quadrature carriers. In this paper, a cooperative quadrature physical layer network coded decode‐and‐forward (DF) relay protocol (CQPNC‐DF) is proposed to transmit the composite information from the two source nodes via the relay node to the destination node simultaneously to reduce the number of time slots required for a transmission. The proposed CQPNC‐DF relay protocol is compared with time‐division multiple‐access amplify‐and‐forward (TDMA‐AF), TDMA‐DF, cooperative network coded DF (CNC‐DF) and cooperative analog network coded AF (CANC‐AF) relay protocols to demonstrate its effectiveness in terms of bit error rate (BER) and system throughput under different propagation conditions. The simulation results reveal that the proposed CQPNC‐DF relay protocol can significantly improve the network performance. Compared with two TDMA schemes and CNC‐DF, the proposal can provide up to 100% and 50% throughput gains, respectively. Moreover, no matter what the scene, the proposed scheme always has the lowest BER in the low SNR region. Copyright © 2013 John Wiley & Sons, Ltd.     

Optimized in-band control channel with channel selection scheduling and network coding in distributed cognitive radio networks

This article proposes an optimized in-band control channel scheme with channel selection scheduling algorithm and network coding based transmission paradigm in the distributed cognitive radio network (...     

MIMO-OFDM接力通信系统的最优功率分配

针对两跳多入多出-正交频分复用(MIMO-OFDM)接力通信系统进行研究,每一跳传输采用奇异值分解将多载波上的MIMO信道转化为多个独立子通道,并提出最大化系统容量的最优功率分配问题,其中源节点和中继节点能够在多个子通道上进行联合功率分配;继而采用拉格朗日算法提出最优功率分配算法.由于最优算法涉及一元四次方程组,目前的数学方法不能提供其通解的闭合表达式,因此提出采用迭代过程实现最优功率分配的方法,为MIMO-OFDM接力系统提供了系统容量的上限.数值仿真结果显示,最优功率分配算法能大大提升系统容量,增强系统的传输能力.     

Combined orthogonal physical‐layer network coding over fading two‐way relay channels

This paper proposes a new physical‐layer network coding (PNC) scheme, named combined orthogonal PNC (COPNC), for fading two‐way relay channels. The scheme is based on orthogonal PNC (OPNC). In the scheme, the two source nodes employ orthogonal carriers, and the relay node makes an orthogonal combining of the two information bits rather than exclusive or (XOR), which is employed in most PNC schemes. The paper also analyzes the bit error rate (BER) performance of PNC, OPNC, and COPNC for Rayleigh fading model. Simulation results for Rayleigh and Nakagami‐m fading channels show that COPNC can provide outstanding BER performance compared with PNC and OPNC, especially when the uplink channel conditions are asymmetric. The results in Nakagami‐m channels also imply that COPNC will provide higher BER gain with more severe fading depth. Potential works about COPNC are also presented in this paper. Copyright © 2013 John Wiley & Sons, Ltd.     

Optimal energy-efficient scheme for two-way relay channel using physical layer network coding

Systems are always designed and optimized based on full traffic load in the current literatures.However,practical systems are seldom operating at full load,even at peak traffic hours.Instead of maximizing system rate to achieve the full load,an optimal energy-efficient scheme to minimize the transmit power with required rates is investigated in this article.The considered scenario is a two-way relay channel using amplify-and-forward protocol of physical layer network coding,where two end nodes exchange mess...     

Utility‐based resource allocation in uplink of OFDMA‐based cognitive radio networks

Cognitive radio makes it possible for an unlicensed user to access a spectrum opportunistically on the basis of non‐interfering to licensed users. This paper addresses the problem of resource allocation for multiaccess channel (MAC) of OFDMA‐based cognitive radio networks. The objective is to maximize the system utility, which is used as an approach to balance the efficiency and fairness of wireless resource allocation. First, a theoretical framework is provided, where necessary and sufficient conditions for utility‐based optimal subcarrier assignment and power allocation are presented under certain constraints. Second, based on the theoretical framework, effective algorithms are devised for more practical conditions, including ellipsoid method for Lagrangian multipliers iteration and Frank–Wolfe method for marginal utilities iteration. Third, it is shown that the proposed scheme does not have to track the instantaneous channel state via an outage‐probability‐based solution. In the end, numerical results have confirmed that the utility‐based resource allocation can achieve the optimal system performance and guarantee fairness. Copyright © 2009 John Wiley & Sons, Ltd.     

认知无线电中OFDM信号信噪比盲估计

针对认知正交频分复用(OFDM,orthogonal frequency division multiplexing)系统中低信噪比多径信道下传统的OFDM信号信噪比盲估计算法的估计性能差,计算复杂度高的问题,提出一种新的OFDM信号信噪比盲估计方法,该方法首先利用自相关函数的特性粗略估计出信道阶数,确定循环前缀部分中不受符号间干扰的数据区间,然后根据选定区间的数据的自相关函数值估计接收信号的信号功率,最后利用循环前缀数据为部分有用数据的复制这一特性估计出噪声功率,从而估计出接收信号的信噪比。仿真实验结果表明,提出的方法无需任何先验信息,在低信噪比多径信道下具有良好的估计性能,且计算复杂度低,更适合于认知OFDM系统。     

战术宽带网络波形物理层解决方案

分析了地面移动台( GMR)的核心波形架构和体制,结合其在军事上的应用发展趋势,给出了宽带战术组网波形物理层解决方案,并剖析了基于正交频分复用( OFDM )的物理层波形的两个核心技术。首先,在峰均比抑制方面,提出基于凸优化集理论,优化的内点算法求解方式解决了传统的迭代限幅滤波技术需要迭代次数高的问题;另一方面,采用基于非统计信息的信道估计方法替代原有的基于最小均方误差( MMSE)的一类方法,仿真结果表明其性能与MMSE基本相当,却避免了计算信道统计信息及矩阵求逆过程中的大量复杂运算。在信道模型下的仿真计算结果表明,提出的物理层方案及关键技术的解决方法具有良好的性能与实用性。     

Improving physical layer security via cooperative diversity in energy‐constrained cognitive radio networks with multiple eavesdroppers

In this paper, a scheme that exploits cooperative diversity of multiple relays to provide physical layer security against an eavesdropping attack is concerned. Relay‐based cognitive radio network (CRN) faces issues multiple issues other than the same as faced by conventional wireless communications. If the nodes in a CRN are able to harvest energy and then spend less energy than the total energy available, we can ensure a perpetual lifetime for the network. In this paper, an energy‐constrained CRN is considered where relay nodes are able to harvest energy. A cooperative diversity‐based relay and subchannel‐selection algorithm is proposed, which selects a relay and a subchannel to achieve the maximum secrecy rate while keeping the energy consumed under a certain limit. A transmission power factor is also selected by the algorithm, which ensures long‐term operation of the network. The power allocation problem at the selected relay and at the source also satisfies the maximum‐interference constraint with the primary user (PU). The proposed scheme is compared with a variant of the proposed scheme where the relays are assumed to have an infinite battery capacity (so maximum transmission power is available in every time slot) and is compared with a scheme that uses jamming for physical layer security. The simulation results show that the infinite battery‐capacity scheme outperforms the jamming‐based physical layer security scheme, thus validating that cooperative diversity‐based schemes are suitable to use when channel conditions are better employed, instead of jamming for physical layer security.     

发送功率最小化自适应MIMO—OFDM系统研究

将自适应比特功率分配技术与空间分集技术结合起来,提出了一种与空时编码结合的固定速率自适应正交频分复用(OFDM)方案。该算法在保证给定的误比特率和信息速率的情况下,使总发送功率最小化。仿真结果表明,该算法在相同误比特率的情况下比不采用自适应技术的MIMO-OFDM系统节省了发送功率。     

空时Turbo网格码的MIMO-OFDM系统性能研究

分析了OFDM基本原理并构建了MIMO-OFDM系统的模型,接着阐述了空时编码技术在OFDM中的应用,提出了在OFDM系统中采用空时Turbo网格编码的方案,详细分析了ST Turbo TC编码器和译码器原理,最后对系统进行了仿真,并分析了仿真结果。系统仿真结果表明采用Turbo网格编码的系统性能优于采用一般空时编码的MIMO-OFDM系统。     

Carrier sensing range analysis in a general IEEE 802.11 network with physical‐layer network coding

In this paper, we investigate the carrier sensing range (CSR) of a general 802.11 network with physical‐layer network coding (PNC). We aim to derive a sufficient CSR that can prevent the hidden‐node collisions in a general 802.11 PNC network. The analysis includes two steps. First, we analyze the six link‐to‐link interference cases in an 802.11 PNC network to show that the mutual interference will be most severe when each node in the network initiates a two‐hop end node link. Second, we consider the worst interference case that all concurrently transmitting links in the network are two‐hop end node links and placed in the densest manner and develop a closed‐form expression of a sufficient CSR that prevents the hidden‐node collisions in a PNC network. From the analysis results, we find that to prevent the hidden‐node collisions, the CSR in PNC network should be bigger than the one in traditional non‐network‐coding network. Furthermore, we carry out extensive simulations to find out the throughput gain of PNC scheme in a general wireless network when considering the impact of CSR. Simulation results show that compared with the non‐network‐coding scheme, PNC scheme has throughput gain when a large proportion (i.e., 90%) of links in the network are two‐hop links and the link density has little effect on the throughput gain of PNC scheme. Copyright © 2014 John Wiley & Sons, Ltd.     

Resource allocation in cognitive radio network with energy harvesting

Considering the diversity of energy harvesting capability and spectrum sensing accuracy of SU,as well as dynamic channel quality,under the constraint of energy causality,the secondary network throughput maximization problem in single-hop cognitive radio networks with energy harvesting was studied.The transmission channel selection,transmission power control and transmission time allocation of SU were jointly optimized.Since the optimization problem was non-convex,by converting it into a series of convex optimization sub-problems,the optimize transmission power and transmission time algorithm (OPTA) was obtained.Compared with the existing resource allocation algorithms,such as,hybrid differential evolution algorithm (HDEA),optimized transmission algorithm (OTA),and random assignment channel algorithm (RA),the simulation results verify the correctness and effectiveness of the proposed algorithm.For example,under the same maximum transmission power constraint,the throughput of the proposed OPTA scheme could increase by around 6%,37% and 50% than that of HDEA,OTA and RA schemes respectively.Under the same channel gain diversity,the throughput of the proposed OPTA scheme could increase by around 30%,60% and 94% than that of HDEA,OTA and RA schemes respectively.Under the same energy harvesting efficiency diversity,the throughput of the proposed OPTA scheme could increase by around 27%,50% and 92% than that of HDEA,OTA and RA schemes respectively.     

基于合作博弈的多信道认知无线网络中的频谱共享算法简

采用合作博弈对多信道认知无线网络中的频谱共享问题进行了建模分析,提出了次用户在各信道上的信干噪比乘积作为合作博弈的效用函数。次用户在各信道上保证对主用户的干扰小于一定门限的要求下,通过最大化各自效用函数的乘积来进行功率分配。由于最大化次用户效用函数的乘积问题是非凸的,通过变量替换将其转化为了一个等价的凸优化问题,利用该凸优化问题的对偶分解,提出了一种次用户间的频谱共享算法。仿真结果表明,所提算法在次用户和速率与公平性之间进行了有效折中。     

喷泉码在认知无线电网络中的应用

认知无线电网络被认为是实现动态频谱共享、缓解频谱资源紧缺的重要途径。喷泉码能有效抵抗认知无线电网络中来自主用户的突发干扰,且无需反馈重传,从而为认知无线电网络提供了一种有效的信道编码方案。首先简介了数字喷泉码以及认知无线电网络基础知识,然后综述了数字喷泉码在认知无线电网络的链路建立、认知通信以及在资源分配中的应用现状,最后指出了在这一研究领域中需要解决的问题,并展望了发展前景。     

认知无线网络中功率和信道接入的联合优化

在认知无线网络中,针对系统中所有用户能否接入同一信道进行通信的问题,提出了适用于不同情形的联合优化方案.在系统不可行的情形下,提出了联合优化功率和接入控制的方案.由于接入控制是NP问题,于是利用所提LP-PSO算法来实现优化控制,并分析和证明了所提算法的收敛性.在系统可行的情形下,提出了联合优化功率和传输速率分配的方案,通过改进拉格朗日对偶(Lagrange duality)算法来实现优化控制.数值结果分析表明,相比其他接入控制算法,虽然所提算法的时间复杂度有所增加但能够快速收敛,在有效地提高接入量的同时还能降低功率消耗,并能使传输速率得到更公平的分配.     

基于BP算法的无人机物理层网络编码研究

建立了基于置信传播(BP)算法的双向中继系统传输模型,理论推导了中继节点处物理层网络编码的映射关系,研究了不同调制方式下各种异步因素对通信系统误码率的影响规律,为无人机在实战中更广泛地应用提供理论基础.     

Sensing OFDM systems with timing and frequency offset for cognitive radio networks

In this paper, we consider the detection of orthogonal frequency division multiplexing with timing and frequency offset for cognitive radio over fast time‐varying multipath channels. By making different assumptions on the availability of the timing and frequency offset at the secondary user, we derive two algorithms based on likelihood ratio test and generalized likelihood ratio test, respectively and theoretically obtain the detection performances of them. The proposed algorithms jointly utilize energy of observations and correlation of the cyclic prefix (CP) data. The extensive simulations show that the two algorithms outperform the other CP‐based methods, perform well at very low signal to noise ratio (SNR) and are robust to the CP ratio. Copyright © 2012 John Wiley & Sons, Ltd.