Secrecy capacity in large cooperative networks in presence of eavesdroppers with unknown locations

Hadavi, A. H ; Sharif University of Technology | 2016

300 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/IWCIT.2016.7491624
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2016
  4. Abstract:
  5. In this paper, an extended large wireless network, with a single transmitter-receiver pair, under the secrecy constraint is considered. In contrast to works which use idealized assumptions, a more realistic network situation with unknown eavesdroppers locations is investigated: the legitimate users only know their own Channel State Information (CSI), not the eavesdroppers CSI. Also, the network is analyzed by taking in to account the effects of both fading and path loss. Under these assumptions, a power efficient cooperative scheme, named stochastic virtual beamforming, is proposed. Applying this scheme, any desired pair of secure rate and outage level denoted by (Rs, ϵ) will be achievable given that the density of the legitimate users tends to infinity. Although, the derived constraints limit the density of eavesdroppers for any fixed density of legitimate users, but by tending the legitimate users density to the infinity, the tolerable density of eavesdroppers will become unbounded too. © 2016 IEEE
  6. Keywords:
  7. Communication channels (information theory) ; Information theory ; Stochastic systems ; Cooperative networks ; Cooperative schemes ; Legitimate users ; Path loss ; Power efficient ; Channel state information
  8. Source: 2016 Iran Workshop on Communication and Information Theory, IWCIT 2016, 3 May 2016 through 4 May 2016 ; 2016 ; 9781509019229 (ISBN)
  9. URL: http://ieeexplore.ieee.org/document/7491624/?reload=true