Loading...

Secrecy capacity scaling in large cooperative wireless networks

Mirmohseni, M ; Sharif University of Technology | 2017

608 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/TIT.2016.2645227
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2017
  4. Abstract:
  5. We investigate large wireless networks subject to security constraints. In contrast to point-to-point, interferencelimited communications considered in prior works, we propose active cooperative relaying-based schemes. We consider a network with nl legitimate nodes, ne eavesdroppers, and path loss exponent α ≥ 2. As long as n2e (log(ne))γ = o(nl ), for some positive γ , we show that 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: 1) the source using Wyner randomized encoder and a serial (multi-stage) block Markov scheme, to cooperate with the relays and 2) 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α/2+1 e ( log(ne))γ+δ(α/2+1) = o(nl ) holds, for some positive γ, δ. Finally, we study the improvement (to the detriment of legitimate nodes) that the eavesdroppers achieve in terms of the information leakage rate in a large cooperative network in the case of collusion. We show that again the zero-cost secure communication is possible, if n(2+2/α) e (log ne)γ = o(nl ) holds, for some positive γ ; that is, in the case of collusion slightly fewer eavesdroppers can be tolerated compared with the non-colluding case. © 1963-2012 IEEE
  6. Keywords:
  7. Cooperative strategies ; Informationtheoretic security ; Large wireless networks ; Relaying ; Scaling laws ; Aggregates ; Cooperative communication ; Relay control systems ; Secure communication ; Wireless networks ; Colluding eavesdroppers ; Cooperative strategy ; Information-theoretic security ; Secrecy capacity ; Network security
  8. Source: IEEE Transactions on Information Theory ; Volume 63, Issue 3 , 2017 , Pages 1923-1939 ; 00189448 (ISSN)
  9. URL: https://ieeexplore.ieee.org/document/7797441