Secrecy Capacity Scaling in Large Cooperative Wireless Networks

DOI10.1109/TIT.2016.2645227MaRDI QIDQ5280875zbMATH OpenOpenAlexFDO

Authors M. Mirmohseni, Panagiotis Papadimitratos

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.3198

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Abstract: We investigate large wireless networks subject to security constraints. In contrast to point-to-point, interference-limited communications considered in prior works, we propose active cooperative relaying based schemes. We consider a network with $n_l$ legitimate nodes, $n_e$ eavesdroppers, and path loss exponent $alphageq2$. As long as $n_e^2(log(n_e){)}^{gamma}=o(n_l)$, for some positive $gamma$, we show one can obtain unbounded secure aggregate rate. This means zero-cost secure communication, given fixed total power constraint for the entire network. We achieve this result through (i) the source using Wyner randomized encoder and a serial (multi-stage) block Markov scheme, to cooperate with the relays and (ii) the relays acting as a virtual multi-antenna to apply beamforming against the eavesdroppers. Our simpler parallel (two-stage) relaying scheme can achieve the same unbounded secure aggregate rate when $n_e^{fracalpha2+1}(log(n_e){)}^{gamma+delta(fracalpha2+1)}=o(n_l)$ holds, for some positive $gamma,delta$. Finally, we study the improvement (to the detriment of legitimate nodes) the eavesdroppers achieve in terms of the information leakage rate in a large cooperative network in case of collusion. We show that again the zero-cost secure communication is possible, if $n_e^{(2+frac2alpha)}(log{n}_e{)}^{gamma}=o(n_l)$ holds, for some positive $gamma$; i.e., in case of collusion slightly fewer eavesdroppers can be tolerated compared to the non-colluding case.

Recommendations

• On Secrecy Capacity Scaling in Wireless Networks
• Secrecy in Cooperative Relay Broadcast Channels
• Secrecy Performance of Finite-Sized Cooperative Single Carrier Systems With Unreliable Backhaul Connections
• Strong Secrecy for Cooperative Broadcast Channels
• Approximate Secrecy Capacity of Gaussian Parallel Relay Networks
• The Secrecy Capacity of the MIMO Wiretap Channel
• Cooperative Encoding for Secrecy in Interference Channels
• Throughput Scaling of Covert Communication Over Wireless Adhoc Networks
• The Secrecy Capacity of Cost-Constrained Wiretap Channels
• Secrecy Outage Capacity of Fading Channels

Cited in

(1)

• Transmission protocol for secure big data in two-hop wireless networks with cooperative jamming

This page was built for publication: Secrecy Capacity Scaling in Large Cooperative Wireless Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280875)