WSN中一种基于能量效率的协同中继传输方案

本文针对分簇无线传感器网络,提出了一种基于能量效率的协同中继传输方案,该方案中源簇头根据源到邻簇头之间的信道状态信息选择最优中继节点;协同传输数据时,目的节点接收到两个时隙的信号后进行最大比合并,并根据设定的接收信噪比门限范围在确认帧中给中继节点反馈功率调整信息,以减少重传次数或降低中继节点的发射功率,在不增加开销的情况下可以减少系统总的能量消耗。文章利用概率密度函数推导了基于部分信道状态信息选择中继协同的误符号率闭式表达式,最后通过蒙特卡洛仿真进行了验证。结果表明:误符号率的理论推导值与仿真值一致,在相同的接收信噪比门限时,本文所提方案能够明显提高系统的能效性。      

放大转发中继网络中的一种中继选择方案

提出了一种放大转发网络中的中继选择方案,假设目的节点配置多个天线,源节点和所有中继节点都配置单个天线,方案选择一组中继同时在相同的频带上放大转发接收到的源节点信息以最大化接收信噪比。与只择一个最优中继的方案相比,方案在保持满分集阶数的情况下获得了更高的中断容量和更优的误符号率性能。与只选择一个最优中继的方案相比,在0.000 01的误符号率水平上,少需要发射功率1.6 dB。     

MF中继选择系统的物理层安全性能

针对合谋窃听场景下单天线多中继修改转发（MF）协作无线系统的安全性能较差问题,提出一种合谋窃听场景下联合源节点发送天线选择（TAS）和多中继选择的MF协作物理层安全系统,考虑最优的最大化主信道信噪比（SNR）和次优的最大化源节点-中继节点链路 SNR 两种中继选择方案,推导其安全中断概率（SOP）和遍历安全容量（ESC）的解析表达式。最优或次优中继选择的MF安全中继系统的SOP和ESC的数值计算结果与仿真结果相吻合,验证了上述理论分析的正确性;同时也表明源节点发射天线数和中继节点数越多、窃听节点数越少,最优或次优中继选择的MF安全中继系统的物理层安全性能越好。     

窃听环境下AF中继选择与功率分配的研究

传统的最佳中继选择方案仅参考了合法用户的信道状态信息,在实际的通信系统中由于存在窃听用户而无法保证信息的可靠传输。现有的最佳中继选择方案将窃听用户的信道状态信息纳入考虑后,系统的安全性能得到了一定改善,但是依然采用的是等功率分配。针对放大转发协议,本文在现有最佳中继选择方案的基础上,以降低系统安全中断概率为目标,在系统总功率受限的前提下,根据源节点和中继节点以及中继节点和目的节点间的信道参数引出功率分配因子,对源节点和中继节点间的功率进行适当分配。通过仿真对比,可以发现功率分配能够降低系统的安全中断概率,从而改善系统的安全性能。      

基于矩生成函数的协同中继传输误符号率性能分析

多中继协同分集技术在慢衰落无线环境下可以提供巨大的性能增益。该文从接收端平均误符号率的角度,分析了独立的瑞利衰落信道下,采用放大转发的多中继协同最大比合并检测方案和多节点侦听,单中继转发的机会中继方案的性能;并基于矩生成函数推导出两种方案下M-PSK和M-QAM调制信号平均误符号率的闭合表达式。经蒙特卡罗仿真验证,该表达式在中高信噪比下与仿真的实际结果非常吻合。同时也可以看出机会中继的分集增益与协同侦听的节点数成正比,误符号率性能优于使用最大比合并检测的多中继协同方案。     

非正交多址中继系统复数域网络编码优化设计

无线中继与网络编码是提高通信系统数据可靠性和吞吐率的重要技术手段,重点研究了单中继非正交多址系统复数域网络编码的优化设计问题.首先,在限制源节点和中继节点的总发送功率并假设各个源节点发送功率相同的条件下,证明了当源节点与中继节点发送功率相等时基于复数域网络编码的单中继非正交多址系统误符号率(SEP)性能最佳.其次,以编码增益为目标函数,提出了一种复数域网络编码的优化设计方法.与已有的复数域网络编码系数设计方法相比,此方法能满足任意源节点个数条件下复数域网络编码系数的优化设计要求,同时可以有效地避免因为网络编码系数选择不当造成信号重叠的现象,提升和改进系统的SEP性能.     

多源中继网络中协作伙伴选择策略研究

在多源中继网络环境下,采用解码转发(Decode-and-Forward,DF)协议进行协作伙伴选择策略研究。在保证每个用户的数据率要求下,此协作伙伴选择方案是从中继剩余功率与信噪比最小值的乘积中,挑出使该乘积最大的那个协作伙伴为中继,然后该中继帮助源节点协作传输,其中信噪比最小值是源到中继和中继到目的节点之间信噪比的最小值,并分析了网络寿命。仿真结果证明了此方案实现复杂度低,对于协作伙伴资源分配更具有公平性且延长了网络寿命。     

全双工窃听者主动干扰的协作NOMA网络性能分析

研究了瑞利衰落信道下协作非正交多址系统的安全性能。通信过程由一个时隙构成,源节点向中继广播叠加信号,全双工中继使用串行干扰消除技术解码信号协助用户通信。假设存在潜在全双工主动窃听者,窃听者能够从中继处截获信息并同时向用户发送人工噪声进行干扰。基于上述假设,在高信噪比条件下,推导了安全中断概率的近似表达式,分析了各节点传输信噪比与功率分配因子对系统中断概率的影响,分析结果与蒙特卡洛仿真结果吻合。     

非正交自适应多址中继系统复数域网络编码方案性能分析与优化功率分配

无线中继与网络编码是提高无线通信系统数据可靠性和吞吐率的重要技术手段。该文重点分析了单中继非正交自适应多址系统复数域网络编码问题,即在中继采用选择解码转发自适应策略下的系统可靠性能及其优化设计。首先,论文推导了非正交自适应多址系统复数域网络编码方案的误符号率性能上界、分集度和编码增益;然后,论文以系统编码增益为优化目标,讨论了最优功率分配问题。结果表明,在保证系统满分集的前提下,非正交多址中继系统采用选择解码转发自适应中继策略能以更低的系统实现复杂度获得优于中继采用链路自适应再生策略所能获得的系统性能。此外,优化源节点和中继节点的功率分配因子可以有效地增加系统编码增益、改进系统性能。     

协作分集系统中基于注水算法的功率分配方案研究

为了提高协作分集系统的信道容量,该文在多中继节点协作背景下提出了基于注水算法的中继节点功率分配方案。首先,对空时矩阵的列序号提出了一种新的映射方案,该方案能够提升中继节点发射信号间的正交性。对于采用线性正交解码算法的GABBA码,列序号重新排布后能够降低误码率。然后,通过对接收信噪比与中继节点发射功率的分析,针对信道容量最大化问题提出了一种应用注水算法的两步求解方案。该文对瑞利平坦慢衰落信道下采用GABBA码的协作分集系统进行仿真,仿真结果表明,与中继节点发射功率均分方案相比,该文提出的功率分配方案能够提升系统抗误码性能,达到满分集增益NtNr。该文提出的方案在不同的仿真条件下对信道容量均有提升,并且信道容量与min{NtNr}log2M成正比。     

Power allocations in minimum-energy SER-constrained cooperative networks

In this paper, we propose minimum power allocation strategies for repetition-based amplify-and-forward (AF) relaying, given a required symbol error rate (SER) at the destination. We consider the scenario where one source and multiple relays cooperate to transmit messages to the destination. We derive the optimal power allocation strategy for two-hop AF cooperative network that minimizes the total relay power subject to the SER requirement at the destination. Two outstanding features of the proposed schemes are that the power coefficients have a simple solution and are independent of knowledge of instantaneous channel state information (CSI). We further extend the SER constraint minimum power allocation to the case of multibranch, multihop network and derive the closed-form solution for the power control coefficients. For the case of power-limited relays, we propose two iterative algorithms to find the power coefficients for the SER constraint minimum-energy cooperative networks. However, this power minimization strategy does not necessarily maximize the lifetime of battery-limited systems. Thus, we propose two other AF cooperative schemes which consider the residual battery energy, as well as the statistical CSI, for the purpose of lifetime maximization. Simulations show that the proposed minimum power allocation strategies could considerably save the total transmitted power compared to the equal transmit power scheme.     

Cooperative Privacy Provisioning for Energy Harvesting Based Cognitive Multi-Relay Networks

In order to provide privacy provisioning for the secondary information,we propose an energy harvesting based secure transmission scheme for the cognitive multi-relay networks.In the proposed scheme,two secondary relays harvest energy to power the secondary transmitter and assist the secondary secure transmission without interfere the secondary transmission.Specifically,the proposed secure transmission policy is implemented into two phases.In the first phase,the secondary transmitter transmits the secrecy information and jamming signal through the power split method.After harvesting energy from a fraction of received radio-frequency signals,one secondary relay adopts the amplify-and-forward relay protocol to assist the secondary secure transmission and the other secondary relay just forwards the new designed jamming signal to protect the secondary privacy information and degrade the jamming interference at the secondary receiver.For the proposed scheme,we first analyze the average secrecy rate,the secondary secrecy outage probability,and the ergodic secrecy rate,and derive their closed-form expressions.Following the above results,we optimally allocate the transmission power such that the secrecy rate is maximized under the secrecy outage probability constraint.For the optimization problem,an AI based simulated annealing algorithm is proposed to allocate the transmit power.Numerical results are presented to validate the performance analytical results and show the performance superiority of the proposed scheme in terms of the average secrecy rate.     

Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers while ensuring mutual information-theoretic secrecy. That is, each receiver is kept in total ignorance with respect to the message intended for the other receiver. The secrecy level is measured by the equivocation rate at the eavesdropping receiver. In this paper, we present inner and outer bounds on secrecy capacity regions for these two communication systems. The derived outer bounds have an identical mutual information expression that applies to both channel models. The difference is in the input distributions over which the expression is optimized. The inner bound rate regions are achieved by random binning techniques. For the broadcast channel, a double-binning coding scheme allows for both joint encoding and preserving of confidentiality. Furthermore, we show that, for a special case of the interference channel, referred to as the switch channel, derived bounds meet. Finally, we describe several transmission schemes for Gaussian interference channels and derive their achievable rate regions while ensuring mutual information-theoretic secrecy. An encoding scheme in which transmitters dedicate some of their power to create artificial noise is proposed and shown to outperform both time-sharing and simple multiplexed transmission of the confidential messages.     

存在辅助节点的MIMO窃听信道安全性能研究

为了提高MIMO窃听信道的可达安全速率,提出了基于广义奇异值分解的合作干扰策略。该策略中源节点和辅助节点同时采用基于广义奇异值分解的波束形成技术,源节点发送消息信号,辅助节点发送独立于消息信号的噪声信号,噪声信号对目的节点和窃听节点都产生干扰。此外设计了源节点和辅助节点采用合作干扰策略时的联合最优功率分配算法。该算法可以实现源节点和辅助节点在总功率受限时的可达安全速率最大化。仿真结果表明,与现有的非合作最优功率分配算法相比,本文提出的合作干扰策略在大信噪比时可以显著提高系统的可达安全速率。      

Nelder‐Mead–based power optimization for secrecy enhancement in amplify‐and‐forward cooperative relay networks

Cooperative communication based on relaying nodes has been considered as a promising technique to increase the physical layer security (PLS) performance in wireless communications. In this paper, an optimal power allocation (OPA) scheme based on Nelder‐Mead (NM) algorithm is proposed for improving the secrecy rate of amplify‐and‐forward (AF) cooperative relay networks employing cooperative jamming (CJ) scheme. The proposed hybrid jamming scheme allows the source and selected relay to transmit the jamming signal along with the information to confound the eavesdropper. The path selection probability of ant colony optimization (ACO) algorithm is used for selecting the relay for transmission. The performance based on secrecy rate is evaluated for “n” trusted relays distributed dispersedly between the source and destination. Gradient‐based optimization and three‐dimensional exhaustive search methods are used as benchmark schemes for comparison of the proposed power optimization algorithm. The secrecy performance is also compared with conventional AF scheme and CJ scheme without power optimization (EPA). The impact of single and multiple relays on secrecy performance is also evaluated. Numerical results reveal that, compared with the gradient method and exhaustive search algorithm, the proposed power allocation strategy achieves optimal performance. Also, the derived OPA results show a significantly higher secrecy rate than the EPA strategy for both CJ and AF schemes.     

Joint power allocation and relay selection for decode-and-forward cooperative relay in secure communication

In this paper, we investigate the cooperative strategy with total power constraint in decode-and-forward (DF) relaying scenario, in the presence of an eavesdropper. Due to the difference of channel for each source-relay link, not all relay nodes have constructive impacts on the achievable secrecy rate. Besides, the final achieved secrecy rate depends on both source-relay and relay-destination links in DF relaying scenario. Therefore, the principal question here is how to select cooperative strategy among relays with proper power allocation to maximize the secrecy rate. Three strategies are considered in this paper. First, we investigate the cooperative jamming (CJ) strategy, where one relay with achieved target transmission rate is selected as a conventional relay forwarding signal, and remaining relays generate artificial noise via CJ strategy to disrupt the eavesdropper. Two CJ schemes with closed-form solutions, optimal cooperative jamming (OCJ) and null space cooperative jamming (NSCJ), are proposed. With these solutions, the corresponding power allocation is formulated as a geometric programming (GP) problem and solved efficiently by convex programming technique. Then, to exploit the cooperative diversity, we investigate the cooperative relaying (CR) strategy. An iterative algorithm using semi-definite programming (SDP) and GP together with bisection search method is proposed to optimize the cooperative relaying weight and power allocated to the source and relays. Furthermore, to exploit the advantages of both CR and CJ, we propose an adaptive strategy to enhance the security. Simulation results demonstrate that the efficiency of the proposed cooperative strategies in terms of secrecy rate.     

On the capacity of multiuser MIMO networks with interference

Maximizing the total mutual information of multiuser multiple-input multiple-output (MIMO) systems with interference is a challenging problem. In this paper, we consider the power control problem of finding the maximum sum of mutual information for a multiuser network with mutually interfered MIMO links. We propose a new and powerful global optimization method using a branch-and-bound (BB) framework, coupled with a novel reformulation-linearization technique (RLT). The proposed BB/RLT guarantees finding a global optimum for multiuser MIMO networks with interference. To reduce the complexity of BB/RLT, we propose a modified BB variable selection strategy to accelerate the convergence process. Numerical examples are also given to demonstrate the efficacy of the proposed solution.     

Chaotic sequence based polar code encrypted scheme in negative secrecy capacity case

A chaos based encrypted polar coding scheme,which could be applied to the negative secrecy capacity case,was proposed.Chaotic sequences were employed to encrypt the information bits and fill the frozen bits.And multi-block polar coding structure was also employed in the proposed scheme.The proposed scheme was featured as lower complexity and higher secrecy transmission rate.Corresponding mathematical analysis had been performed in terms of the error probability,security and transmission rate.The result reveals that the proposed scheme can achieve reliability,security in negative secrecy capacity case.What’s more,it has relatively low complexity and high secrecy transmission rate compared with the existing schemes.     

Bandwidth-efficient wireless OFDM

Due to ever-increasing bandwidth demands in future wireless service, the radio frequency band becomes more and more invaluable. In this paper, we address channel equalization for bandwidth-efficient wireless orthogonal frequency-division multiplexing (OFDM). First, we show that in order to be free of both interchannel interference and interblock interference, wireless OFDM has to occupy a bandwidth wider than the Nyquist rate and use insufficient statistics in symbol demodulation. Thus, the conventional OFDM gains computational efficiency using the discrete Fourier transform (DFT) in demodulation at the cost of low efficiency of bandwidth usage and degradation in symbol error performance. Then we consider the OFDM that achieves high efficiency of bandwidth usage, allows interchannel interference and interblock interference to exist, and uses sufficient statistics in symbol demodulation. A one-tap decision feedback equalizer (DFE) is proposed for equalization of the bandwidth efficient OFDM system. Simulation and numerical evaluation for an indoor wireless asynchronous transfer mode network are carried out. It is demonstrated that though occupying a narrower bandwidth, the one-tap DFE-based bandwidth-efficient OFDM system achieves lower symbol error rate and higher mutual information than the conventional DFT-based OFDM system. The proposed OFDM system presents a monotonically increasing symbol error rate, and convex-down achieved mutual information with respect to increasing efficiency of bandwidth usage     

Turbo‐coded APSK modulations design for satellite broadband communications

This paper investigates the design of power and spectrally efficient coded modulations based on amplitude phase shift keying (APSK) modulation with application to satellite broadband communications. APSK represents an attractive modulation format for digital transmission over nonlinear satellite channels due to its power and spectral efficiency combined with its inherent robustness against nonlinear distortion. For these reasons APSK has been very recently introduced in the new standard for satellite Digital Video Broadcasting named DVB‐S2. Assuming an ideal rectangular transmission pulse, for which no nonlinear inter‐symbol interference is present and perfect pre‐compensation of the nonlinearity, we optimize the APSK constellation. In addition to the minimum distance criterion, we introduce a new optimization based on the mutual information; this new method generates an optimum constellation for each spectral efficiency. To achieve power efficiency jointly with low bit error rate (BER) floor we adopt a powerful binary serially concatenated turbo‐code coupled with optimal APSK modulations through bit‐interleaved coded modulation. We derive tight approximations on the maximum‐likelihood decoding error probability, and results are compared with computer simulations. The proposed coded modulation scheme is shown to provide a considerable performance advantage compared to current standards for satellite multimedia and broadcasting systems. Copyright © 2006 John Wiley & Sons, Ltd.