基于网络编码的无线多播速率选择机制

在无线多播通信系统中,每个接收节点与源节点(例如基站)之间的信道状态不相同。因此,过高或者过低的多播速率都会导致较大的传输延迟。而且,信道状态随节点运动而变化,仅仅基于当前信道状态信息(CSI)和接收节点已接收数据状态信息(DSI)的多播速率选择机制无法达到最优性能。该文根据节点CSI和DSI提出了一种基于信道预测多播速率选择算法(MDCP)来最小化传输延迟,并结合网络编码提高数据重传效率。仿真结果表明,与基于最差信道状态节点的多播速率选择算法和没有信道预测的基于最大延迟节点的多播速率选择算法相比,MDCP能够获得10%-20%延迟增益。     

基于最优化的多媒体多播速率控制

传输多媒体流的一种有效方法是采用多速率多播,但多速率多播的速率控制面临许多挑战,如异构性、公平性、实时性及服务质量(QoS)等。提出了一种两阶段优化的策略进行多媒体多播速率控制。把问题公式化为求系统效用最大化的最优化问题,推导出有效的算法。方法综合考虑了服务质量、异构性等,且满足协议间的公平性和多播会晤内各接收者间的公平性。仿真实验表明算法的有效性,与现有的算法相比系统总效用大大提高。     

基于分层多播的视频传输拥塞控制算法研究

分层多播以多速率方式解决了多播接收者异构性问题,对于提高网络服务质量具有重要意义。本文分析了分层多播传输特性,通过提取MPEG视频流中的I帧、P帧、B帧组成3个帧流,分别放到分层多播的基层、增强层1和增强层2上传输,并在中间节点采用优先级队列机制,提出了一种面向视频流传输的分层多播拥塞控制(VLMCC)算法。仿真实验表明,本文提出的VLMCC算法能够适应视频多播接收者的异构性,大大提高了视频多播传输质量。     

多播传输模式下的卫星通信安全波束成形算法

与地面无线通信系统相比,卫星通信的广域覆盖特性使得信息安全传输问题成为该领域更具挑战性的研究课题.为了提升多播传输模式下卫星通信系统的物理层安全性能,本文针对不同信道状态信息(Channel State In-formation,CSI)研究了两种安全波束成形(Beamforming,BF)算法.在合法用户和窃听者CS...     

莱斯衰落中多用户大规模MIMO系统的安全通信

研究了莱斯衰落信道中多用户集中式大规模多输入多输出(Multiple-Input Multiple-Output,MIMO)系统的安全通信问题。基站利用上行训练获取信道状态信息,之后利用最大比传输波束成形算法进行下行数据传输。基于随机矩阵理论,分别分析了合法用户和窃听者的信息速率表达式,从而得到了遍历安全速率的闭合表达式。基于获得的结果,进一步分析了极端莱斯K因子和无限发送数据功率下系统的极限安全性能。最后,通过不同条件下的实验仿真设计,验证了系统的安全性能,同时证实了所得结果的正确性。     

一种基于多载波的多播系统物理层安全方案

受限于发送方天线数目,无线多播系统整体信道通常不存在零空间,无法利用传统的物理层安全技术保证其安全传输。针对这一问题,该文提出一种基于多载波的多播系统物理层安全方案。首先,建立了多载波多播系统物理层安全通信模型;之后,通过分配载波产生合法用户的信道零空间,在零空间内引入人工噪声保证系统的安全传输;最后,以最大化保密传输速率为目标,在系统总功率受限情况下,利用Kuhn-Tucher条件对各子载波功率进行了优化。仿真结果表明:该方案不受限于发送方天线数目,并且所提功率分配方法的系统保密传输速率比等功率分配方法提升约2 bit/(s Hz)。     

协作多组多播认知无线网络的资源优化配置

考虑到无线电频谱资源日益紧缺,提出了一种基于组间组内协作传输的多播组新机制,涉及多个多播组并使用同一频谱资源以协作方式传输信息。基于认知无线网络中该机制,研究了系统的资源优化配置,理论分析得出了功率分配方案,进而讨论了系统加权总传输速率的优化,同时考虑了主用户和认知用户之间信号干扰及功率限制对传输速率的影响,最优化用户性能。仿真结果表明,优化方案下多播组传输速率随用户人数的增加而上升,达到最优化用户服务质量;当功率限制时,通过设置加权因子,能够保证主用户拥有良好的通信性能。     

IP网络安全多播控制机制的设计与实现

多播的安全问题不单单只包括多播分组数据的安全性。利用多播的安全隐患发起拒绝服务攻击现象在网络环境中越来越多。多播的安全隐患根源是多播的开放组模式。通过研究现有多播控制协议的安全问题，总结恶意攻击的特性并提出一种多播安全控制的解决方案，用于缓解多播安全漏洞对多播传输造成的危害。该方案可以使网络管理员按照网络应用的具体要求有效的控制和管理多播分组。并且在Linux平台下实现了该方案。     

多源多目的模型中网络编码的时延性能分析

研究表明基于无线信道的广播特性,网络编码技术能够显著降低多播通信中的传输时延。多源多播模型中,在任一源节点已知其他源节点信息的条件下,现有传输方案能够确保系统时延最小化。本文在其他源节点信息未知时,对现有多源多目的单中继模型应用网络编码后的时延性能进行分析,并将该模型推广到多中继模型,提出了基于网络编码和机会中继选择策略的MR-OPP-NC方案,并在译码转发机制下,利用中断概率量化了应用网络编码前后的时延性能,仿真表明本文所提MR-OPP-NC方案与未使用网络编码的机会中继方案相比较,能获得显著的时延增益。      

防内外部窃听的多播物理层安全算法

针对无线多播系统同时存在内、外部窃听者的复杂情况,提出随机化干扰的物理层多播安全传输算法。该算法基于收发天线构成信道的代数空间进行设计:一方面在内部窃听者的信道代数空间方向上不发送信息,另一方面在合法用户信道的正交方向上引入随机干扰信号。这样直接使得内部窃听者接收的信号受到能量削减的同时,非合法用户受到随机化干扰,最终实现了物理层多播信息的安全传输。理论分析和仿真结果表明,算法可同时保证系统内、外部窃听者极高的误码率,从而无法获取信息。     

A physical layer security scheme for full-duplex communication systems with residual self-interference and non-eavesdropping CSI

We discuss the physical layer security scheme in the Full-Duplex (FD) MIMO point-to-point two-way communication system with residual self-interference, in which legitimate nodes send confidential information and null space Artificial Noise (AN) while receiving information. Because the Channel State Information (CSI) of the eavesdropper is unavailable, we optimize the covariance matrices of the information signal as well as the allocation of the antenna for transmitting and receiving to minimize the signal power consumption under the target rate constraint. As a result, the power of AN is maximized within the limit of total power, so the interception capability of the eavesdropper is suppressed as much as possible. Since self-interference cannot be completely eliminated, the optimization process of one legitimate node depends on the optimization result of the other. By substituting self-interference power in the secrecy rate formula with its average value, the joint optimization process at the two nodes is transformed into two separate and solvable optimization processes. Then, the Water-Filling Algorithm (WFA) and bisection algorithm are used to get the optimal covariance matrices of the signal. Furthermore, we derive the theoretical lower bound of ergodic achievable secrecy rate under rayleigh channels to evaluate the performance of the scheme. The simulation results show that the theoretical derivation is correct, and the actual achievable rate is very close to the target rate, which means that the approximation in the optimization is feasible. The results also show that secrecy transmission can be realized because a considerable secrecy rate can be achieved.     

Towards the Secrecy Capacity of the Gaussian MIMO Wire-Tap Channel: The 2-2-1 Channel

We find the secrecy capacity of the 2-2-1 Gaussian MIMO wiretap channel, which consists of a transmitter and a receiver with two antennas each, and an eavesdropper with a single antenna. We determine the secrecy capacity of this channel by proposing an achievable scheme and then developing a tight upper bound that meets the proposed achievable secrecy rate. We show that, for this channel, Gaussian signalling in the form of beam-forming is optimal, and no pre-processing of information is necessary.      

Secrecy Trade-off at the Physical Layer over Mixed Fading Multicast Channels Employing Antenna Diversity

This paper deals with the secrecy performance analysis of a multicast network over mixed fading scenarios in which a cluster of passive eavesdroppers is trying to overhear the secret transmission. Our key contribution is to prevent this malicious attack of the illegitimate receivers. Rayleigh/ Rician mixed fading channels are considered to model alternately the multicast/ eavesdropper and eavesdropper/ multicast channels as such mixed fading scenarios are often encountered in cellular communication where only one link (either multicast or eavesdropper) undergo a line-of-sight propagation path. At first, we derive the probability density functions for the single-input-multiple-output multicast scenarios and then the secrecy analysis is carried out by obtaining closed-form expressions for the performance matrices such as the probability of non-zero secrecy multicast capacity, ergodic secrecy multicast capacity, and secure outage probability for multicasting. The derived expressions are beneficial to investigate how the antenna diversity can combat the detrimental impact of fading as well as the number of multicast users and eavesdroppers, and improve the secrecy level to the acceptable limit. Moreover, the best secure scenario in terms of the secrecy parameters is obtained when the multicast channels undergo Rician fading whereas the eavesdropper channels experience Rayleigh fading. Finally, the analytical expressions are justified via the Monte-Carlo simulations.

     

无人机辅助物理层安全下的保密性能优化

信息安全是影响物联网(IoT)应用的关键因素之一,物理层安全是解决物联网信息通信安全问题的有效技术。该文针对物联网中带有主动攻击的全双工窃听者,利用无人机(UAV)辅助发射人工噪声的方法,提升系统物理层安全性能。为了跟踪窃听者位置移动,首先采用贝叶斯测距和最小二乘法迭代估计窃听者位置,然后提出基于Q-learning的无人机轨迹优化算法,以达到在窃听者移动情况下系统保密性能最优。仿真结果表明,该算法能快速收敛,并且无人机能够跟踪窃听者移动来确定自身最佳位置,对窃听信道实施有效干扰,从而保证系统可达安全速率最大。     

Artificial noise–aided secure communication in a bidirectional relaying network

An artificial noise strategy is proposed for amplify‐and‐forward bi‐directional relay network where the eavesdropper can wiretap the relay channels in both hops. Artificial noise is used to confuse the eavesdropper and improve its secrecy. Specifically, the source and the relay are allowed to split their available transmit power into 2 parts: a useful information portion and a jamming portion to transmit a jamming signal. The mathematical model is established for 2‐way relay network with an eavesdropper. The secrecy rate achieved by using artificial jamming is derived from the above model. The optimal power allocation with individual power constraint is obtained via sequential quadratic programming to maximize the secrecy sum rate, and 2 special cases are investigated. Furthermore, the benchmark is provided for the purpose of performance comparison. Simulation results show that the proposed strategy can significantly improve the secrecy sum rate by using artificial noise to jam the eavesdropper.     

Enhancing secrecy rates in a wiretap channel

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding ensures a security constraint and reliability, but results in a decrease of achievable rate. To mitigate the loss in secrecy rate, we propose a coding scheme in which we use sufficiently old messages as key and prove that multiple messages are secure with respect to all the information possessed by the eavesdropper. We also show that we can achieve security in the strong sense. Next, we study a fading wiretap channel with full channel state information of the eavesdropper's channel and use our coding/decoding scheme to achieve a secrecy capacity close to the Shannon capacity of the main channel (in the ergodic sense). Finally, we study a case where the transmitter does not have instantaneous information of the channel state of the eavesdropper, but only its distribution.     

Cooperative Decode‐and‐Forward Relaying for Secure Multicasting

In this paper, secure multicasting with the help of cooperative decode‐and‐forward relays is considered for the case in which a source securely sends a common message to multiple destinations in the presence of a single eavesdropper. We show that the secrecy rate maximization problem in the secure multicasting scenario under an overall power constraint can be solved using semidefinite programing with semidefinite relaxation and a bisection technique. Further, a suboptimal approach using zero‐forcing beamforming and linear programming based power allocation is also proposed. Numerical results illustrate the secrecy rates achieved by the proposed schemes under secure multicasting scenarios.     

基于AF策略的高斯正交不信任中继信道的最优资源分配

本文研究了高斯正交中继窃听信道,中继节点同时作为窃听者的情况,源节点同中继节点和目的节点在信道1上传输信号,中继节点同目的节点在信道2上传输信号,信道1和信道2在频率上是正交的。通过分析,在总的信道资源受限的情况下,通过优化功率及信道带宽获得最大的安全速率。本文给出了在高斯正交信道下,当只考虑功率或带宽时,存在唯一的功率或带宽使得安全速率达到最大,并且通过仿真结果说明了采用最优资源分配可得到比等资源分配更大的安全速率。     

Achievable rate region with secrecy constraints for secure communication in two‐way relay networks

In this paper, we consider a two‐way relay network consisted of two sources and multiple relays in the presence of an eavesdropper, where the cooperative beamforming strategy is applied to exploit the cooperative diversity to support the secure communication as illustrated in Figure 1. Naturally, we are interested in the beamforming strategy and power allocation to maximize the achievable sum secrecy rate. However, the corresponding problem is equivalent to solve a product of three correlated generalized Rayleigh quotients problem and difficult to solve in general. Because of the openness of wireless medium, the information rate leakage to the eavesdropper cannot be canceled perfectly. To some extent, ‘almost perfect secrecy’, where the rate leakage to the eavesdropper is limited, is more interesting from the practical point of view. In this case, we concern ourself mainly the achievable rate region for general case where the rate at the eavesdropper is regarded as the measurement of secrecy level. Two beamforming approaches, optimal beamforming and null space beamforming, are applied to investigate the achievable rate region with total power constraint and the rate constraint at the eavesdropper, which can be obtained by solving a sequence of the weighted sum inverse‐signal‐to‐noise‐ratio minimization (WSISM) problem. Because of the non‐convexity of WSISM problem, an alternating iteration algorithm is proposed to optimize the relay beamforming vector and two sources' transmit power, where two subproblems need to be solved in each iteration. Meanwhile, we provide the convergence analysis of proposed algorithm. Through the numerical simulations, we verify the effectiveness of proposed algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

On the Secrecy Capacity of Fading Channels

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full channel state information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI of the legitimate receiver is known at the transmitter, which is characterized next. In each scenario, the perfect secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average signal-to-noise ratio (SNR) goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Overall, channel fading has a positive impact on the secrecy capacity and rate adaptation, based on the main channel CSI, is critical in facilitating secure communications over slow fading channels.