Learning-based multi-relay selection for cooperative networks based on compressed sensing

Cooperative relaying is an effective technology to improve the secrecy capacity of physical-layer (PHY) security. Multiple relays can help further exploit the spatial diversity of cooperative networks. In power-limited networks, relay selection scheme is crucial important for it determines whether the optimal relay combination can be selected. This paper studies the problem of multi-relay selection in amplify-and-forward compressed sensing (AF-CS) networks, in which relays help all sources amplify and forward the signal, and the transmission matrix is used as the measurement matrix to encrypt the information. A self-organizing algorithm based on stochastic learning automata (SLA) is proposed for the AF-CS network to look for the best relay combination in a self-learning and self-optimizing way, and named “learning-based multi-relay selection algorithm” (L-MRS). In L-MRS, the destination node is self-optimizing to select the best state autonomously, and relays are self-organizing to decide whether to join the cooperation or not according to the environment feedback. Simulation studies verify the L-MRS’s is able to select the optimal relay-combination in a very stable way, and can get higher secrecy capacity compared with the coalition formation game method.

     

Coalitions in Cooperative Wireless Networks

Cooperation between rational users in wireless networks is studied using coalitional game theory. Using the rate achieved by a user as its utility, it is shown that the stable coalition structure, i.e., set of coalitions from which users have no incentives to defect, depends on the manner in which the rate gains are apportioned among the cooperating users. Specifically, the stability of the grand coalition (GC), i.e., the coalition of all users, is studied. Transmitter and receiver cooperation in an interference channel (IC) are studied as illustrative cooperative models to determine the stable coalitions for both flexible (transferable) and fixed (non-transferable) apportioning schemes. It is shown that the stable sum-rate optimal coalition when only receivers cooperate by jointly decoding (transferable) is the GC. The stability of the GC depends on the detector when receivers cooperate using linear multiuser detectors (non-transferable). Transmitter cooperation is studied assuming that all receivers cooperate perfectly and that users outside a coalition act as jammers. The stability of the GC is studied for both the case of perfectly cooperating transmitters (transferrable) and under a partial decode-and-forward strategy (non-transferable). In both cases, the stability is shown to depend on the channel gains and the transmitter jamming strengths.     

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

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

基于模拟网络编码的多用户信息交换的中断概率

与通常假定一对用户通过一个中继节点进行数据交换不同,该文考虑两对用户通过一个公共中继节点的协作进行数据交换的无线通信模型,研究了基于模拟网络编码的放大转发中继策略的中断概率。相对于传统的基于放大转发或译码转发等的、需要8个时隙实现数据交换的中继策略和传统的基于译码转发的、需要5个时隙实现数据交换的网络编码中继策略,模拟网络编码的中继策略只需要3个时隙就可以实现两对用户之间的数据交换,因而与前两种中继策略相比,基于模拟网络编码的中继策略能极大地提高系统的吞吐量（该中继策略分别提高了166％和66％的系统吞吐量）或者极大地减少中继节点的能量消耗。在所提的基于模拟网络编码中继策略下,该文进一步推导出了系统中断概率的上界和下界,数值分析结果表明该上下界比较接近,特别是当中继节点位于第一对用户节点中间时上下界非常接近。      

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.     

Cooperation and coalitional stability in decentralized wireless networks

In this paper we consider a wireless contextualization of the local routing protocol on scale-free networks embedded in a plane and analyze on the one hand how cooperation affects network efficiency, and on the other hand the stability of cooperation structures. Cooperation is interpreted on k-cliques as local exchange of topological information between cooperating agents. Cooperative activity of nodes in the proposed model changes the routing strategy at the level of the coalition group and consequently influences the entire routing process on the network. We show that the proposed cooperation model enhances the network performance in the sense of reduced passage time and jamming. Payoff of a certain node is defined based on its energy consumption during the routing process. We show that if the payoff of the nodes is the energy saving compared to the all-singleton case, basically coalitions are not stable, since increased activity within coalition increases costs. We introduce coalitional load balancing and net reward to enhance coalitional stability and thus the more efficient operation of the network. As in the proposed model cooperation strongly affects routing dynamics of the network, externalities will arise and the game is defined in a partition function form.     

协作通信网络基于能量效率的博弈模型

本文研究准静态衰落环境下多用户OFDM协作通信网络能量效率问题,分别在非协作和协作传输情形下建立了能量效率模型。引入联盟博弈理论,根据用户协作关系建立联盟,提出一种联盟合并算法,结合SQP功率分配算法,联盟能量效率能有效提高。     

Differential Relay Strategies Over Downlink Channel in Two-User Cooperative Communication System

In this paper, we propose two differential relaying strategies; Active User Strategy (AUS) and Passive Users Relaying Strategy (PURS), which could be used by the base-station to transmit data of two users over downlink channels in a two-user cooperative communication network. Differential schemes are used so the users do not require the knowledge of channel gains for decoding of their data. The performance of both schemes is evaluated for the decode-and-forward, selection relaying, and incremental relaying protocols. For the decode-and-forward protocol, the performance heavily depends upon the signal-to-noise ratio (SNR) of the link between source and relay. We propose a conditional probability of error based approach, which can be used to regulate the erroneous relaying of data. Both AUS and PURS are able to achieve performance gains as compared to the direct transmission differential scheme in the case of selection relaying and incremental relaying protocols at high SNRs. The proposed schemes perform better than their counterpart of the amplify-and-forward differential relaying proposed previously.     

Cooperative communications with multilevel/AES-SD4-CPFSK in wireless sensor networks

In this paper, a new joint multilevel data encryption and channel coding mechanism is proposed, which is called ??multilevel/advanced encryption standard?Csystematic distance 4?Ccontinuous phase frequency shift keying?? (ML/AES-SD4-CPFSK). In the proposed scheme, we have not only taken advantage of spatial diversity gains but also optimally allocated energy and bandwidth resources among sensor nodes as well as providing high level of security and error protection for cooperative communications in wireless sensor networks. Relay protocols of cooperative communications, such as amplify-and-forward and decode-and-forward with/without adversary nodes, have been studied for 4CPFSK, 8CPFSK, and 16CPFSK of ML/AES-SD4-CPFSK. We have evaluated the error performances of multilevel AES for data encryption, multilevel SD-4 for channel coding, and various CPFSK types for modulation utilizing cooperative communications in wireless sensor networks. According to computer simulation results, significant diversity gain and coding gain have been achieved. As an example, bit error rate (BER) performance of 10^?5 value has been obtained at a signal-to-noise ratio (SNR) of ?6?dB for SD-4-CPFSK scheme in a compared related journal paper, whereas in our proposed system, we have reached the same BER value at a SNR of ?23?dB with amplify-and-forward with direct path signal protocol in 16-level AES, two-level SD-4 coded 16CPFSK, and at the same time, we have reached the same BER value at a SNR of ?22?dB with amplify-and-forward without direct path signal protocol in 16-level AES, two-level SD-4 coded 16CPFSK.     

能量收集中继安全传输网络的在线功率控制算法

针对源节点和中继节点均采用收集能量供电的放大转发中继网络,考虑两个目的节点之间信息相互保密的场景,该文提出最大化长期时间平均保密速率的源节点和中继节点发送功率联合优化算法。由于能量到达和信道状态是随机过程,该问题是一个随机优化问题。利用Lyapunov优化框架将电池操作和能量使用约束下的长期优化问题转化为每时隙的“虚队列漂移加惩罚”最小化问题,并求解。仿真结果显示该文提出的算法在长期平均保密速率上相较于对比算法具有显著的优势,同时算法仅依赖于当前的电池状态和信道状态信息做出决策,是一种实用的、低复杂度的算法。     

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.     

Game theory-based attack and defense analysis in virtual wireless networks with jammers and eavesdroppers

Dynamic spectrum sharing and cognitive radio networks were proposed to enhance the Radio Frequency (RF) spectrum utilization. However, there are several challenges to realize them in real systems, such as sensing uncertainty causing issues to licensed users, business models for licensed service providers. Wireless virtualization is regarded as a technology that leverages service level agreements to sublease unused or underutilized RF spectrum that addresses aforementioned issues and helps to significantly enhance the utilization of the RF spectrum, offer improved coverage and capacity of networks, enhance network security and reduce energy consumption. With wireless virtualization, wireless networks' physical substrate is shared and reconfigured dynamically between virtual wireless networks through Mobile Virtual Network Operations (MVNOs). Wireless virtualization with dynamic configurable features of Wireless Infrastructure Providers (WIPs), virtualized wireless networks are vulnerable to a multitude of attacks, including jamming attacks and eavesdropping attacks. This paper investigates a means of defense through the employment of coalition game theory when jammers try to degrade the signal quality of legitimate users, and eavesdroppers aim to reduce secrecy rates. Specifically, we consider a virtual wireless network where MVNO users' job is to improve their Signal to Interference plus Noise Ratio (SINR) while the jammers target to collectively enhance their Jammer Received Signal Strength (JRSS), and an eavesdropper's goal is to reduce the overall secrecy rate. Numerical results have demonstrated that the proposed game strategies are effective (in terms of data rate, secrecy rate and latency) against such attackers compared to the traditional approaches.     

Secure opportunistic access control in D2D-enabled cellular network

The mutual interference between cellular links and D2D links can bring the secrecy gain to cellular users in D2D-enable cellular networks.To make full use of them,a cooperative secrecy transmission scheme was proposed based on wireless channels.The channel direction information and gains depict the interference from D2D links to cellular links and other D2D links in the proposed scheme.Firstly,only the D2D users which meet the limited interference conditions were accessed to cellular networks to ensure their reliable communications.It was assumed that legitimate users and eavesdroppers were independent two-dimensional homogeneous Poisson point processes (PPP) distribution.Then the security outage probability (SOP) was derived for cellular users and the connection outage probability (COP) for D2D users,and the impacts of interference thresholds were discussed on their performances.Next,an optimization model was given to minimize D2D users’ COP while ensuring the secrecy performance requirements of cellular users,thus achieving the optimal performance.Finally,simulation results verify the validity of the proposed scheme.     

Coalitional game‐based behavior analysis for spectrum access in cognitive radios

The core of cognitive radio paradigm is to introduce cognitive devices able to opportunistically access the licensed radio bands. The coexistence of licensed and unlicensed users prescribes an effective spectrum hole‐detection and a non‐interfering sharing of those frequencies. Collaborative resource allocation and spectrum information exchange are required but often costly in terms of energy and delay. In this paper, each secondary user (SU) can achieve spectrum sensing and data transmission through a coalitional game‐based mechanism. SUs are called upon to report their sensing results to the elected coalition head, which properly decides on the channel state and the transmitter in each time slot according to a proposed algorithm. The goal of this paper is to provide a more holistic view on the spectrum and enhance the cognitive system performance through SUs behavior analysis. We formulate the problem as a coalitional game in partition form with non‐transferable utility, and we investigate on the impact of both coalition formation and the combining reports costs. We discuss the Nash Equilibrium solution for our coalitional game and propose a distributed strategic learning algorithm to illustrate a concrete case of coalition formation and the SUs competitive and cooperative behaviors inter‐coalitions and intra‐coalitions. We show through simulations that cognitive network performances, the energy consumption and transmission delay, improve evidently with the proposed scheme. Copyright © 2016 John Wiley & Sons, Ltd.     

A Noise Reduction Amplify-and-Forward Relay Protocol for Distributed Spatial Diversity

Amplify-and-forward transmission has been shown to be a viable transmission protocol for wireless networks incorporating distributed spatial diversity. A drawback of this relatively simple transmission protocol is identified. In addition to signal amplification, perpendicular noise at the relay is also amplified. A method to reduce the noise at the relay prior to amplification is proposed. To demonstrate the improvement of this protocol, we consider single-user single-relay transmission and show that by eliminating perpendicular noise at the relay, the outage region boundaries are reduced. Perpendicular noise elimination is inherent in decode-and-forward relaying. Hence, Fair comparisons of amplify-and-forward relaying with decode-and-forward relaying are based on noise reduced amplify-and-forward relaying     

Coalition-based downlink resource allocation for LTE system with divide-and-conquer approach

To take advantage of the multiuser diversity resulted from the variation in channel conditions among the users,it has become an interesting and challenging problem to efficiently allocate the resources such as subcarriers,bits,and power.Most of current research concentrates on solving the resource-allocation problem for all users together in a centralized way,which brings about high computational complexity and makes it impractical for real system.Therefore,a coalitional game framework for downlink multi-user resource allocation in long term evolution(LTE) system is proposed,based on the divide-and-conquer idea.The goal is to maximize the overall system data rate under the constraints of each user’s minimal rate requirement and maximal transmit power of base station while considering the fairness among users.In this framework,a coalitional formation algorithm is proposed to achieve optimal coalition formation and a two-user bargaining algorithm is designed to bargain channel assignment between two users.The total computational complexity is greatly reduced in comparison with conventional methods.The simulation results show that the proposed algorithms acquire a good tradeoff between the overall system throughout and fairness,compared to maximal rate and max-min schemes.     

基于保密度的OFDMA中继网络资源分配研究

考虑到异构双向中继网络中存在窃听者的安全资源分配问题,为了提高中继安全性,该文研究了受限于子信道分配和功率约束的用户安全保密度问题模型,与传统的保密容量模型相比,安全保密度模型更侧重于反映用户本身的安全程度。基于此保密度模型,该文进一步考虑了不同用户的安全服务质量(Quality of Service, QoS)需求和网络公平性,联合优化功率分配、子信道分配、子载波配对,并分别通过约束型粒子群、二进制约束型粒子群优化算法和经典的匈牙利算法找到最优解,实现资源的最优分配,提高网络中合法用户的保密度。仿真结果验证了所提算法的有效性。     

面向6G物联网的分布式译码技术

随着5G商业化和标准化的逐步推进,对6G技术的研究也提上了日程。由于其在6G无线通信系统中的巨大应用前景,物联网(IoT)技术引起了人们广泛的兴趣。面向6G的物联网网络需要允许大量设备接入并支持海量数据传输,其鲁棒性和可扩展性至关重要。在物联网中,所述“事物”(用户)可以通过采用各种多功能无线传感器实时收集环境数据。通常来说,收集的数据将反馈到中央单元以进行进一步处理。但是这一机制依赖于中央单元的正常工作,鲁棒性较差。该文提出一种分布式译码算法,该算法通过让各用户之间互相协作,交换信息来实现在各个用户处完成译码。利用分布式译码算法,每个用户可以得到与中心化处理相似的译码性能,从而提高了网络的鲁棒性和可扩展性。同时,相比传统分布式译码算法,该算法不需要每个用户了解网络的拓扑结构,因此为面向6G的高动态物联网提供了技术支撑。     

基于演化博弈机制的物理层安全协作方法

在无线网络中,当利用经典博弈机制研究物理层安全时,能量受限的发送端为了最大化自身安全速率,趋向于选择非协作策略,造成网络的安全速率降低。针对这一问题,该文提出一种基于演化博弈机制的物理层安全协作方法。首先,根据演化博弈机制定义策略(发送人工噪声或信号)和收益(不同策略组合下的安全速率);然后,发送端根据当前网络状态以及协作收益与平均期望收益的差值,不断进行策略调整以最大化收益;最后,通过求解获得使发送端达到协作稳定策略的条件,使网络从不稳定状态向协作稳定状态演化,从而提高了系统的安全速率。仿真和分析结果表明,在高斯信道条件下,相比经典博弈方法,该方法的发送端策略稳定在协作状态,网络安全速率可提高1 bit/(s Hz)。     

Relay selection schemes for secure transmission in cognitive radio networks

The security in cognitive radio networks (CRNs) has been attracting continuously growing attention due to the open and dynamic nature of cognitive radio architecture. In this paper, we propose new relay selection schemes to improve the physical layer security in CRNs. A trusted decode-and-forward relay is selected to help the secondary user (SU) transmission and improve the secrecy rate in the presence of multiple eavesdroppers and multiple primary users (PUs). The secrecy rate of the SU is characterized under both its own transmit power constraint as well as a set of interference power constraints imposed at each PU, in order to preserve its quality of service. The performance of the proposed schemes is analyzed in terms of the achievable secrecy rate and the intercept probability. Closed form expressions for the asymptotic intercept probability at high source-relays channel variances are also derived. Moreover, new derivations of some existing traditional schemes are presented and compared. The performance comparison of the proposed schemes with the schemes proposed in the literature reveals the superior of the proposed schemes.