Wireless secure enhancement with cooperative jamming

Secrecy capacity of intrinsically secure communication graph (iS-Graph) can be increased by reducing the signal quality of eavesdroppers with adding controlled interferences.The transmission of secret messages over wireless channels in which the legitimate nodes were aided by cooperative jamming was studied,and a secure communication graph with jamming,jS-Graph was proposed.First,the security properties of jS-Graph was characterized.Then,jamming strategies to confuse eavesdroppers were proposed.To tackle the nearby eavesdropper problem,a two-stage cooperative jamming strategy to jam the eavesdroppers near the source or the destination was applied.The results demonstrate that,with the aid of cooperative jamming the secure communication graph can lead to secrecy gains.These results help to clarify how the presence of eavesdroppers and the cooperative jamming can influence secure connectivity in wireless networks.     

Relay Selection for Secure Cooperative Networks with Jamming

This paper deals with relay selection in cooperative networks with secrecy constraints. The proposed scheme enables an opportunistic selection of two relay nodes to increase security against eavesdroppers. The first relay operates as a conventional mode and assists a source to deliver its data to a destination via a decode-and-forward strategy. The second relay is used in order to create intentional interference at the eavesdropper nodes. The proposed selection technique jointly protects the primary destination against interference and eavesdropping and jams the reception of the eavesdropper. The new approach is analyzed for different complexity requirements based on instantaneous and average knowledge of the eavesdropper channels. In addition an investigation of an hybrid security scheme which switches between jamming and non-jamming protection is discussed in the paper. It is proven that an appropriate application of these two modes further improves security. The enhancements of the proposed selection techniques are demonstrated analytically and with simulation results.     

A Cooperative Transmission Scheme for the Secure Wireless Multicasting

In this paper, a wireless multicast scenario with secrecy constraints is considered, where the source wishes to send a common message to two intended destinations in the presence of a passive eavesdropper. One destination is equipped with multiple antennas, and all of the other three nodes are equipped with a single antenna. Different to the conventional direct transmission, we propose a cooperative transmission scheme based on the cooperation between the two destinations. The basic idea is to divide the multicast scenario into two cooperative unicast transmissions at two phases and the two destinations help each other to jam the eavesdropper in turns. Such a cooperative transmission does not require the knowledge of the eavesdropper’s channel state information. Both analytic and numerical results demonstrate that the proposed cooperative scheme can achieve zero-approaching outage probability.     

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.     

Cooperative network implementation using open-source platforms

Cooperative networking, by leveraging the broadcast nature of the wireless channel, significantly improves system performance and constitutes a promising technology for next-generation wireless networks. Although there is a large body of literature on cooperative communications, most of the work is limited to theoretical or simulation studies. To impact the next generation of wireless technologies and standards, it is essential to demonstrate that cooperative techniques indeed work in practice. This article describes two programmable cooperative communication testbeds built at Polytechnic Institute of NYU to achieve this goal. The testbeds are based on opensource platforms and enable implementation of cooperative networking protocols in both the physical and the medium access control layer. Extensive experiments carried out using the testbeds suggest not only that cooperative communication techniques can be integrated into current wireless technologies, but also that significant benefits of cooperation can be observed in terms of network throughput, delay, and video quality in real applications.     

Secrecy Analysis of Cooperative Vehicular Relaying Networks over Double-Rayleigh Fading Channels

In this paper, we investigate physical-layer security performance of the cooperative vehicular relaying networks, wherein the communication from a source vehicle to the destination vehicle is assisted by an amplify-and-forward (AF) relay vehicle in the presence of a passive eavesdropper vehicle. We assume that the communication links between the vehicles experience double-Rayleigh fading. We also consider two AF relaying protocols: (1) fixed gain relaying which requires partial channel state information (CSI), and (2) variable gain relaying which requires full CSI. Specifically, we derive the novel intercept probability and ergodic secrecy capacity expressions for both fixed and variable gain relaying in the presence of double-Rayleigh fading channels. The numerical and simulation results verify our theoretical and analytical findings, and show the impacts of channel conditions and relay and eavesdropper locations on the system secrecy performance.

     

A Store-and-Forward Cooperative MAC for Wireless Ad Hoc Networks

Cooperative communications are widely used to increase the throughput of wireless networks. It is important to select the appropriate relay nodes to enhance the performance of cooperative communications. In wireless ad hoc networks, such as IEEE802.11 WLAN, the distributed MAC is used to share the wireless channel to different nodes. In this work, a simple store-and-forward cooperative MAC (SFC-MAC) is proposed, which is fully compatible with IEEE 802.11 MAC. In SSF-MAC, the relay node just stores the packets received from the sender and forward them to the receiver after it successfully contend the channel. Furthermore, an model is built to analyze the performance of relay methods in the ideal channel and imperfect channel. We utilize throughput performance as a metric to determine whether a relay node is selected. The analysis and simulation results show that the proposed simple SSF-MAC can increase the system throughput.     

Cooperative wireless communications: a cross-layer approach

This article outlines one way to address these problems by using the notion of cooperation between wireless nodes. In cooperative communications, multiple nodes in a wireless network work together to form a virtual antenna array. Using cooperation, it is possible to exploit the spatial diversity of the traditional MIMO techniques without each node necessarily having multiple antennas. Multihop networks use some form of cooperation by enabling intermediate nodes to forward the message from source to destination. However, cooperative communication techniques described in this article are fundamentally different in that the relaying nodes can forward the information fully or in part. Also the destination receives multiple versions of the message from the source, and one or more relays and combines these to obtain a more reliable estimate of the transmitted signal as well as higher data rates. The main advantages of cooperative communications are presented.     

Source and Channel Coding for Cooperative Relaying

User cooperation is a powerful tool to combat fading and increase robustness for communication over wireless channels. Although it is doubtless a promising technique for enhancing channel reliability, its performance in terms of average source distortion is not clear since source-channel separation theorem fails under the most common nonergodic slow-fading channel assumption, when channel state information (CSI) is only available at the receiving terminals. This work sheds some light on the end-to-end performance of joint source-channel coding for cooperative relay systems in the high signal-to-noise ratio (SNR) regime. Considering distortion exponent as a figure of merit, we propose various strategies for cooperative source and channel coding that significantly improve the performance compared to the conventional scheme of source coding followed by cooperative channel coding. We characterize the optimal distortion exponent of a full-duplex relay channel for all bandwidth ratios. For the half-duplex relay channel, we provide an upper bound which is tight for small and large bandwidth ratios. We consider the effect of correlated side information on the distortion exponent as well.     

智能窃听下协作NOMA网络的性能分析

针对下行双用户NOMA (Non-Orthogonal Multiple Access)系统模型中存在智能窃听者,该窃听者可以自适应地选择被动窃听或主动干扰工作模式,在不精确了解其干扰水平的情况下,部分NOMA用户很有可能遭遇传输质量下降乃至保密中断,这将对信息安全传输构成严重威胁。另外,由于信道衰落,用户的位置对系统整体性能有很大影响,难以保证距离源节点较远用户的传输质量。为解决上述问题,本文提出了一种新型的两阶段用户协作方案。第一阶段,远用户采用全双工(full-duplex,FD)干扰智能窃听者,第二阶段,近用户可作为一个中继协助源节点转发远用户信号信息,并在接收端采用串行干扰消除（Successive Interference Cancellation, SIC）技术进行解码。使用户间达成合作,提高通信链路安全性和用户服务质量。考虑到系统中不同用户的信息接收速率与通信需求不同之间的相关性,分别推导了遍历安全容量和遍历容量的解析表达式,同时分析了功率分配因子和用户间协作发射功率等因素对性能的影响,并通过Monte-Carlo仿真验证了其正确性。      

Secrecy Performance of CCRN with an EHAF Relay under Source and Destination Jamming

In this paper, we investigate the secrecy performance of a cooperative cognitive radio network (CCRN) considering a single energy harvesting (EH) half‐duplex amplify and forward (AF) relay and an eavesdropper (EAV). Power is allocated to each node under cognitive constraints. Because of the absence of a direct wireless link, secondary source (SS) communicates with secondary destination (SD) in two time slots. The SD and the SS broadcast jamming signal to confuse the EAV in the first and in the second time slots, respectively. The relay harvests energy in the first time slot and amplifies and forwards the signal to SD in the second time slot. The EAV employs maximal ratio combining scheme to extract the information. We evaluate the performance in terms of secrecy outage probability (SOP) of the proposed CCRN. The approximate expression of SOP is obtained in integration form. Improvement in SOP is expected for the proposed CCRN because of the use of jamming signals. The secrecy performance of CCRN improves with increase in primary transmit power, peak transmit power of secondary nodes, channel mean power, and energy conversion efficiency but degrades with increase in threshold outage rate of primary receiver and threshold secrecy rate. A MATLAB‐based simulation framework has been developed to validate the analytical work.     

Amplify‐and‐forward‐based cooperative jamming strategy with power allocation for secure communication

This paper deals with the use of jamming transmission for secure amplify‐and‐forward‐based relay networks with total power constraints. An approach that the source and the relay use some of their available power to transmit jamming signals in order to create interference at the eavesdropper is investigated. Assume that the relay and destination have an a priori knowledge of the jamming signals. A power allocation policy that defines how the available power is distributed between the message signal and that of the jamming signal is presented. The results show that the proposed approach can increase the secrecy level and that a positive secrecy rate can be achieved even when the eavesdropper may be near the source. Copyright © 2014 John Wiley & Sons, Ltd.     

Secure communication via an energy-harvesting untrusted relay in the presence of an eavesdropper

This article studies a secure communication of a simultaneous wireless information and power transfer system in which an energy-constrained untrusted relay, which harvests energy from the wireless signals, helps the communication between the source and destination and is able to decode the source’s confidential signal. Additionally, the source’s confidential signal is also overheard by a passive eavesdropper. To create positive secrecy capacity, a destination-assisted jamming signal that is completely cancelled at the destination is adopted. Moreover, the jamming signal is also exploited as an additional energy source. To evaluate the secrecy performance, analytical expressions for the secrecy outage probability (SOP) and the average secrecy capacity are derived. Moreover, a high-power approximation for the SOP is presented. The accuracy of the analytical results is verified by Monte Carlo simulations. Numerical results provide valuable insights into the effect of various system parameters, such as the energy-harvesting efficiency, secrecy rate threshold, power-splitting ratio, transmit powers, and locations of the relay and eavesdropper, on the secrecy performance.     

iJam密钥产生方案的双窃听者合作攻击

iJam是一种与信道变化快慢无关、且能够快速生成物理层密钥的新技术。在iJam方案中,发送者连续发送两份相同的OFDM符号,接收者随机干扰每对采样点中的一个。合法接收者可以利用干扰信息重构密钥信息,而窃听者因不知干扰符号的位置而无法进行有效重构。然而,iJam方案的安全性与窃听者的位置紧密相关。尽管iJam采取双向交换密钥等机制克服了单窃听者的位置敏感问题,但是iJam方案的安全问题仍然存在。为攻击iJam,本文提出了一种双窃听者合作攻击方法,两个分别位于Alice、Bob端的窃听者合作对iJam进行攻击。仿真结果表明:双窃听者合作攻击方法可有效破解合法用户协商的密钥。      

能量收集系统中基于能量协同和协同干扰的保密传输方案

研究节点具备能量收集能力的中继窃听信道保密速率的优化问题,提出一种基于人工噪声协同干扰和节点间能量协同的物理层安全传输策略.各节点采用储能-发送模式工作,即先收集能量,再用于数据传输.中继节点采用放大转发方式,目的节点发送人工噪声进行协同干扰.由于中继节点所需功耗较高,目的节点将用于发送干扰之外的剩余能量转移给中继节点.给出以最大化保密速率为目标函数,优化能量吸收时间比例系数和干扰功率分配因子的两步优化算法.仿真结果表明人工噪声和能量协同的引入能有效提高系统的保密传输速率.     

Power allocation-Assisted secrecy analysis for NOMA enabled cooperative network under multiple eavesdroppers

In this work, the secrecy of a typical wireless cooperative dual-hop non-orthogonal multiple access (NOMA)-enabled decode-and-forward (DF) relay network is investigated with the impact of collaborative and non-collaborative eavesdropping. The system model consists of a source that broadcasts the multiplexed signal to two NOMA users via a DF relay, and information security against the eavesdropper nodes is provided by a helpful jammer. The performance metric is secrecy rate and ergodic secrecy capacity is approximated analytically. In addition, a differential evolution algorithm-based power allocation scheme is proposed to find the optimal power allocation factors for relay, jammer, and NOMA users by employing different jamming schemes. Furthermore, the secrecy rate analysis is validated at the NOMA users by adopting different jamming schemes such as without jamming (WJ) or conventional relaying, jamming (J), and with control jamming (CJ). Simulation results demonstrate the superiority of CJ over the J and WJ schemes. Finally, the proposed power allocation outperforms the fixed power allocation under all conditions considered in this work.     

无线协作网络中基于数据传输需求的分布式功率控制

在未来无线通信网络中,协作通信的性能依赖于通信资源的有效分配,比如中继选择和功率控制等.在本文中,我们建议了一个分布式买者和卖者博弈理论框架,以满足用户链路质量需求为基础,解决多用户协作通信中最优化中继选择和功率控制.本文联合考虑了源节点和中继节点的功率分配,进而优化源节点和中继节点的收益.这里提出的方法不仅有助于源节点找到相对位置较好的中继节点以及在源和中继之间进行最优化功率分配从而最小化源节点的支付,而且有助于相互竞争的中继节点提供优化的价格以最大化它们各自的收益.此外,这里的优化价格可以仅由局部信道状态信息和其他节点的能量价格决定.如果获得的中继节点总数增加,全网的能量消耗会更低.     

A novel relay selection algorithm using ant colony optimization with artificial noise for secrecy enhancement in cooperative networks

Cooperative communication is one of the fastest growing research areas of today. It can efficiently mitigate the effect of shadowing and fading with the help of relays and proper relay selection technique. In this paper, a novel relay selection scheme combined with artificial noise (AN) is devised to enhance the secrecy of cooperative networks with amplify‐and‐forward scheme, over Rayleigh fading channels in the presence of a passive eavesdropper. The probability of path selection of ant colony optimization algorithm is used for selecting the best relay with high end‐to‐end signal‐to‐noise ratio. The probability of choosing a path depends on the significance of channel gain (G) and fading coefficients (h). The proposed algorithm finds the best relay in the following wireless scenarios: when (i) both channel gain and fading coefficients are significant; (ii) only fading coefficients are significant; and (iii) only channel gain is significant. Because the direct links between source and destination and source and eavesdropper are considered, AN along with the information is sent by both the source and the selected relay. The performance is evaluated based on secrecy rate (R_s); for the relays randomly placed between the source and destination and for different eavesdropper's location. The results show that the proposed relay selection scheme achieves better secrecy for different wireless scenarios compared with traditional schemes. With the help of AN, the secrecy rate can be made positive even when the eavesdropper lies near to source.     

无线协作Mesh网

异构无线网络的融合是当前无线网络的发展趋势。针对融合过程中遇到的诸如传输模式选择、负载平衡、路由和切换之类的问题,文章提出了一种新的网络融合架构：无线协作Mesh网。该架构基于无线Mesh网的网络结构,并通过协作通信进一步优化其结构、提升其性能。该架构能充分发挥Mesh技术高频谱效率、动态自组织的优点和协作通信高分集增益、高能量效率的优点,可为无线网络融合提供一种有效的解决方案。     

基于能量有效性的协作节点配置问题研究

无线通信的能耗主要由功放能耗和电路能耗两部分组成。在大距离传输中,通信能耗由功放能耗主导,电路能耗往往被忽略不计。而在以短距离传输为主的传感器网络中,电路能耗成为不可忽略的一部分,甚至有可能超过功放能耗成为通信能耗的主导。本文就如何通过节点间协作降低网络的通信能耗展开研究,拟解决协作通信中的协作节点配置问题。本文将信源-协作节点间距离纳入协作通信系统模型,提出一种针对调制参数、协作中继数、信源-协作簇距离对协作通信能耗进行联合优化的策略,并在无线传感器网络环境下对该模型的能耗进行了仿真。仿真结果表明,在传输距离一定的情况下,通过协作节点的数量、调制参数和信源-协作簇距离的联合优化配置,可以更有效地提高协作传输的节能效果。