arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.05084cs.GTcs.ITmath.IT
收藏

利用私有干扰器的安全组播通信

Secure Multicast Communications with Private Jammers

Kanapathippillai Cumanan, Zhiguo Ding, Mai Xu, H. Vincent Poor

摘要:

本文研究了多播网络的保密率优化问题,在该网络中,一个发射机在存在多个窃听者的情况下向多个合法用户广播相同的信息。为了提高可达到的保密率,私人干扰机被用来产生干扰来迷惑窃听者。这些私人干扰器根据窃听者收到的干扰量向合法发射机收取干扰服务费用。因此,这个保密率最大化的问题被制定为一个Stackelberg游戏,其中私人干扰机和发射机的领导者和追随者的游戏,分别。首先考虑一个固定的干扰价格的情况下,其中一个封闭的形式的解决方案是来自干扰机产生的最佳干扰量,以最大限度地提高合法发射机的收入。基于这个解决方案,Stackelberg均衡的建议的游戏,在合法的发射机和私人干扰机实现其最大收益,然后得出。仿真结果也验证了这些理论推导。

英文摘要:

This paper investigates secrecy rate optimization for a multicasting network, in which a transmitter broadcasts the same information to multiple legitimate users in the presence of multiple eavesdroppers. In order to improve the achievable secrecy rates, private jammers are employed to generate interference to confuse the eavesdroppers. These private jammers charge the legitimate transmitter for their jamming services based on the amount of interference received at the eavesdroppers. Therefore, this secrecy rate maximization problem is formulated as a Stackelberg game, in which the private jammers and the transmitter are the leaders and the follower of the game, respectively. A fixed interference price scenario is considered first, in which a closed-form solution is derived for the optimal amount of interference generated by the jammers to maximize the revenue of the legitimate transmitter. Based on this solution, the Stackelberg equilibrium of the proposed game, at which both legitimate transmitter and the private jammers achieve their maximum revenues, is then derived. Simulation results are also provided to validate these theoretical derivations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑