期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 58, 期 5, 页码 3000-3015出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2012.2184692
关键词
Capacity scaling; information theoretic security; network information theory; secure throughput; wireless networks
资金
- National Science Foundation [CCF-07-28762, 08-31919, 09-16664, 10-54738]
- Los Alamos National Laboratory
- Qatar National Research Fund
- Ohio State University
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [1054738] Funding Source: National Science Foundation
This paper studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities lambda and lambda(e), respectively. It is shown that, as long as lambda(e)/lambda = 0 ((log n)(-2)), almost all of the nodes achieve a perfectly secure rate of Omega(1/root n) for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multihop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Second, an ergodic fading model with n source-destination pairs and n(e) eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy precoding, each user is shown to achieve a constant positive secret rate for sufficiently large n. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据