Scaling laws for secrecy capacity in cooperative wireless networks
2014 (English)In: INFOCOM, 2014 Proceedings IEEE, 2014, 1527-1535 p.Conference paper (Refereed)
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 legitimate nodes, eavesdroppers, and path loss exponent . As long as , for some positive , 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 holds, for some positive .
Place, publisher, year, edition, pages
2014. 1527-1535 p.
, Proceedings - IEEE INFOCOM, ISSN 0743-166X
Secrecy capacity, Scaling laws, Cooperative strategies, Relaying, Large wireless networks, Information-theoretic security
IdentifiersURN: urn:nbn:se:kth:diva-137746DOI: 10.1109/INFOCOM.2014.6848088ISI: 000361544200171ScopusID: 2-s2.0-84904411004ISBN: 9781479933600OAI: oai:DiVA.org:kth-137746DiVA: diva2:679718
33rd IEEE Conference on Computer Communications, IEEE INFOCOM 2014; Toronto, ON; Canada; 27 April 2014 through 2 May 2014
QC 201506022013-12-162013-12-162015-10-29Bibliographically approved