Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Computer and Communications (ICCC)

Secrecy performance analysis in large-scale cellular networks via stochastic geometry

Liwei Tao, Weiwei Yang, Yueming Cai, Dechuan Chen

Published Dec 1, 2017• 5 citations
Publisher

Abstract

In this paper, we study secrecy performance of downlink transmission in large-scale cellular networks where randomly distributed Base Stations (BSs) communicate to an intended mobile user under the scenario of cooperative eavesdropping. Based on the stochastic geometry theory, we first derive the closed-form expressions of the secrecy outage probability and the average secrecy rate in the simple scenario of non-cooperative eavesdropping, where each eavesdropper decodes the messages independently. Then, the secrecy performance analysis is extended to more hazardous cooperative scenario in which all eavesdroppers freely share their observations to decode the confidential messages. Finally, our results show that the small-scale fading has a greater effect on secrecy performance in small density of eavesdroppers. Moreover, the performance difference between the scenario of non-cooperative eavesdropping and cooperative eavesdropping is more obvious, when the path loss exponent or the density of eavesdroppers is small.

DOI
10.1109/compcomm.2017.8322781

Related papers

On the physical layer security in large scale cellular networks

He Wang, Xiangyun Zhou, Mark C. Reed

This paper studies the information-theoretic secrecy performance in large-scale cellular networks based on a stochastic geometry framework. The locations of both base stations and the mobile users are modeled as independent two-dimensional Poisson point processes. We consider a key feature of the cellular network, namely, information exchange between base stations, and characterize its impact on the achievable secrecy rate of an arbitrary downlink transmission with a certain portion of the mobile users acting as potential eavesdroppers. In particular, analytical results are presented under diverse assumptions on the availability of eavesdroppers' location information at the serving base station, which captures the benefit from the exchange of mobile users' location information between base stations.

IEEE Wireless Communications and Networking Conference•Apr 1, 2013•15 citations

Physical Layer Security in Cellular Networks: A Stochastic Geometry Approach

He Wang, Xiangyun Zhou, Mark C. Reed

This paper studies the information-theoretic secrecy performance in large-scale cellular networks based on a stochastic geometry framework. The locations of both base stations and mobile users are modeled as independent two-dimensional Poisson point processes. We consider two important features of cellular networks, namely, information exchange between base stations and cell association, to characterize their impact on the achievable secrecy rate of an arbitrary downlink transmission with a certain portion of the mobile users acting as potential eavesdroppers. In particular, tractable results are presented under diverse assumptions on the availability of eavesdroppers' location information at the serving base station, which captures the benefit from the exchange of the location information between base stations.

arXiv:1303.1609•IEEE Transactions on Wireless Communications•May 2, 2013•117 citations

Secrecy Rates in Broadcast Channels with Confidential Messages and External Eavesdroppers

Giovanni Geraci, Sarabjot Singh, Jeffrey G. Andrews +2 more

In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of randomly located external eavesdroppers. Using the proposed model, we study the secrecy rates achievable with regularized channel inversion (RCI) precoding by performing a large-system analysis that combines results from stochastic geometry and random matrix theory, where the number of users K and the number of transmit antennas N both grow to infinity in a fixed ratio. We obtain explicit expressions for the probability of secrecy outage and an upper bound on the rate loss due to the presence of external eavesdroppers. We show that both these quantities scale as \fraclambda_esqrt{N} as the density of external eavesdroppers λ_e grows, irrespective of their collusion strategy. Furthermore, we derive a practical rule for the choice of the regularization parameter, which is agnostic of channel state information and location of eavesdroppers, and yet provides close to optimal performance.

IEEE Transactions on Wireless Communications•Apr 16, 2014•116 citations

Secrecy Rates in the Broadcast Channel with Confidential Messages and External Eavesdroppers

Giovanni Geraci, Sarabjot Singh, Jeffrey G. Andrews +2 more

In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of randomly located external eavesdroppers. Using the proposed model, we study the secrecy rates achievable by regularized channel inversion (RCI) precoding by performing a large-system analysis that combines tools from stochastic geometry and random matrix theory. We obtain explicit expressions for the probability of secrecy outage and an upper bound on the rate loss due to the presence of external eavesdroppers. We show that both these quantities scale as $\frac{λ_e}{\sqrt{N}}$, where $N$ is the number of transmit antennas and $λ_e$ is the density of external eavesdroppers, irrespective of their collusion strategy. Furthermore, we derive a practical rule for the choice of the regularization parameter, which is agnostic of channel state information and location of eavesdroppers, and yet provides close to optimal performance.

arXiv:1306.2101•Jun 10, 2013•4 citations

Secrecy capacity analysis in D2D underlay cellular networks: Colluding eavesdroppers

Satyanarayana Vuppala, Georges Kaddoum

This paper presents an investigation of the secrecy capacity in device-to-device (D2D) enabled cellular network under the collusion of eavesdroppers. We provide the closed-form expressions for the probability of achieving non-zero secrecy capacity of the downlink channel between cellular base-station (BS) and user in the presence of D2D nodes and eavesdroppers. Furthermore, two techniques are used for the simple yet exact evaluation of the average secrecy rate using moment generating functions with and without interference. The impact of transmission factors, path loss exponents, and node density is analysed in numerical results. In contrast to the general notion of interference-aided secure communication, it has been shown that the interference does not impact the secrecy rate under the collusion of eavesdroppers.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Oct 1, 2017•6 citations

Secrecy Outage Analysis for Downlink Transmissions in the Presence of Randomly Located Eavesdroppers

Gaojie Chen, Justin P. Coon, Marco Di Renzo

We analyze the secrecy outage probability in the downlink for wireless networks with spatially (Poisson) distributed eavesdroppers (EDs) under the assumption that the base station employs transmit antenna selection (TAS) to enhance secrecy performance. We compare the cases, where the receiving user equipment (UE) operates in half-duplex (HD) mode and full-duplex (FD) mode. In the latter case, the UE simultaneously receives the intended downlink message and transmits a jamming signal to strengthen secrecy. We investigate two models of (semi)passive eavesdropping: 1) EDs act independently and 2) EDs collude to intercept the transmitted message. For both of these models, we obtain expressions for the secrecy outage probability in the downlink for the HD and FD UE operation. The expressions for the HD systems have very accurate approximate or exact forms in terms of elementary and/or special functions for all path loss exponents. Those related to the FD systems have exact integral forms for general path loss exponents, while exact closed forms are given for specific exponents. A closed-form approximation is also derived for the FD case with colluding EDs. The resulting analysis shows that the reduction in the secrecy outage probability is logarithmic in the number of antennas used for TAS and identifies conditions, under which HD operation should be used instead of FD jamming at the UE. These performance trends and exact relations between system parameters can be used to develop adaptive power allocation and duplex operation methods in practice. Examples of such techniques are alluded to herein.

arXiv:1701.00982•IEEE Transactions on Information Forensics and Security•Jan 20, 2017•100 citations
In this paper, we study secrecy performance of downlink transmission in large-scale cellular networks where randomly distributed Base Stations (BSs) communicate to an intended mobile user under the scenario of cooperative eavesdropping. Based on the stochastic geometry theory, we first derive the closed-form expressions of the secrecy outage probability and the average secrecy rate in the simple scenario of non-cooperative eavesdropping, where each eavesdropper decodes the messages independently. Then, the secrecy performance analysis is extended to more hazardous cooperative scenario in which all eavesdroppers freely share their observations to decode the confidential messages. Finally, our results show that the small-scale fading has a greater effect on secrecy performance in small density of eavesdroppers. Moreover, the performance difference between the scenario of non-cooperative eavesdropping and cooperative eavesdropping is more obvious, when the path loss exponent or the density of eavesdroppers is small.
This paper studies the information-theoretic secrecy performance in large-scale cellular networks based on a stochastic geometry framework. The locations of both base stations and the mobile users are modeled as independent two-dimensional Poisson point processes. We consider a key feature of the cellular network, namely, information exchange between base stations, and characterize its impact on the achievable secrecy rate of an arbitrary downlink transmission with a certain portion of the mobile users acting as potential eavesdroppers. In particular, analytical results are presented under diverse assumptions on the availability of eavesdroppers' location information at the serving base station, which captures the benefit from the exchange of mobile users' location information between base stations.
This paper studies the information-theoretic secrecy performance in large-scale cellular networks based on a stochastic geometry framework. The locations of both base stations and mobile users are modeled as independent two-dimensional Poisson point processes. We consider two important features of cellular networks, namely, information exchange between base stations and cell association, to characterize their impact on the achievable secrecy rate of an arbitrary downlink transmission with a certain portion of the mobile users acting as potential eavesdroppers. In particular, tractable results are presented under diverse assumptions on the availability of eavesdroppers' location information at the serving base station, which captures the benefit from the exchange of the location information between base stations.
In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of randomly located external eavesdroppers. Using the proposed model, we study the secrecy rates achievable with regularized channel inversion (RCI) precoding by performing a large-system analysis that combines results from stochastic geometry and random matrix theory, where the number of users K and the number of transmit antennas N both grow to infinity in a fixed ratio. We obtain explicit expressions for the probability of secrecy outage and an upper bound on the rate loss due to the presence of external eavesdroppers. We show that both these quantities scale as \fraclambda_esqrt{N} as the density of external eavesdroppers λ_e grows, irrespective of their collusion strategy. Furthermore, we derive a practical rule for the choice of the regularization parameter, which is agnostic of channel state information and location of eavesdroppers, and yet provides close to optimal performance.
In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of randomly located external eavesdroppers. Using the proposed model, we study the secrecy rates achievable by regularized channel inversion (RCI) precoding by performing a large-system analysis that combines tools from stochastic geometry and random matrix theory. We obtain explicit expressions for the probability of secrecy outage and an upper bound on the rate loss due to the presence of external eavesdroppers. We show that both these quantities scale as λeN\frac{λ_e}{\sqrt{N}}N​λe​​, where NNN is the number of transmit antennas and λeλ_eλe​ is the density of external eavesdroppers, irrespective of their collusion strategy. Furthermore, we derive a practical rule for the choice of the regularization parameter, which is agnostic of channel state information and location of eavesdroppers, and yet provides close to optimal performance.
This paper presents an investigation of the secrecy capacity in device-to-device (D2D) enabled cellular network under the collusion of eavesdroppers. We provide the closed-form expressions for the probability of achieving non-zero secrecy capacity of the downlink channel between cellular base-station (BS) and user in the presence of D2D nodes and eavesdroppers. Furthermore, two techniques are used for the simple yet exact evaluation of the average secrecy rate using moment generating functions with and without interference. The impact of transmission factors, path loss exponents, and node density is analysed in numerical results. In contrast to the general notion of interference-aided secure communication, it has been shown that the interference does not impact the secrecy rate under the collusion of eavesdroppers.
We analyze the secrecy outage probability in the downlink for wireless networks with spatially (Poisson) distributed eavesdroppers (EDs) under the assumption that the base station employs transmit antenna selection (TAS) to enhance secrecy performance. We compare the cases, where the receiving user equipment (UE) operates in half-duplex (HD) mode and full-duplex (FD) mode. In the latter case, the UE simultaneously receives the intended downlink message and transmits a jamming signal to strengthen secrecy. We investigate two models of (semi)passive eavesdropping: 1) EDs act independently and 2) EDs collude to intercept the transmitted message. For both of these models, we obtain expressions for the secrecy outage probability in the downlink for the HD and FD UE operation. The expressions for the HD systems have very accurate approximate or exact forms in terms of elementary and/or special functions for all path loss exponents. Those related to the FD systems have exact integral forms for general path loss exponents, while exact closed forms are given for specific exponents. A closed-form approximation is also derived for the FD case with colluding EDs. The resulting analysis shows that the reduction in the secrecy outage probability is logarithmic in the number of antennas used for TAS and identifies conditions, under which HD operation should be used instead of FD jamming at the UE. These performance trends and exact relations between system parameters can be used to develop adaptive power allocation and duplex operation methods in practice. Examples of such techniques are alluded to herein.