MIMO wiretap channels with randomly located eavesdroppers: Large-system analysis

Maksym A. Girnyk, Frederic Gabry, Mikko Vehkaperä, L. Rasmussen, M. Skoglund
{"title":"MIMO wiretap channels with randomly located eavesdroppers: Large-system analysis","authors":"Maksym A. Girnyk, Frederic Gabry, Mikko Vehkaperä, L. Rasmussen, M. Skoglund","doi":"10.1109/ICCW.2015.7247226","DOIUrl":null,"url":null,"abstract":"Security issues in wireless networks have become a subject of growing interest in recent years due to the broadcast nature of wireless channels. In this paper, we investigate secure communication over a multi-antenna wiretap channel in the presence of randomly distributed eavesdroppers. In the fast fading environment, the overall performance of this channel is traditionally characterized by the ergodic secrecy capacity, which, in general, cannot be derived explicitly. Nevertheless, based on the assumption that the numbers of antennas at legitimate terminals and the number of eavesdroppers grow large without bound, we derive a deterministic approximation of an achievable ergodic secrecy rate for arbitrary inputs. In addition, we characterize the secrecy rates for practically relevant separate-decoding scheme at the receiver. We validate the proposed large-system approximation through numerical simulations and observe a good match with the actual secrecy rates. Finally, we also analyze some interesting behavior of the secrecy rates in the given scenario depending on the geometry of the nodes.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Workshop (ICCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2015.7247226","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Security issues in wireless networks have become a subject of growing interest in recent years due to the broadcast nature of wireless channels. In this paper, we investigate secure communication over a multi-antenna wiretap channel in the presence of randomly distributed eavesdroppers. In the fast fading environment, the overall performance of this channel is traditionally characterized by the ergodic secrecy capacity, which, in general, cannot be derived explicitly. Nevertheless, based on the assumption that the numbers of antennas at legitimate terminals and the number of eavesdroppers grow large without bound, we derive a deterministic approximation of an achievable ergodic secrecy rate for arbitrary inputs. In addition, we characterize the secrecy rates for practically relevant separate-decoding scheme at the receiver. We validate the proposed large-system approximation through numerical simulations and observe a good match with the actual secrecy rates. Finally, we also analyze some interesting behavior of the secrecy rates in the given scenario depending on the geometry of the nodes.
随机定位窃听者的MIMO窃听信道:大系统分析
由于无线信道的广播性质,无线网络的安全问题近年来日益受到关注。在本文中,我们研究了随机分布窃听者存在的多天线窃听信道上的安全通信。在快衰落环境下,该信道的总体性能传统上以遍历保密容量为特征,而遍历保密容量通常不能明确地推导出来。然而,基于合法终端天线数量和窃听者数量无限制增长的假设,我们导出了任意输入可实现的遍历保密率的确定性近似。此外,我们描述了实际相关的分离解码方案在接收端的保密率。我们通过数值模拟验证了所提出的大系统近似,并观察到与实际保密率的良好匹配。最后,我们还根据节点的几何形状分析了给定场景下保密率的一些有趣行为。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信