Rethinking the Secrecy Outage Formulation: A Secure Transmission Design Perspective

Abstract-We propose a new optimal Location-Based Beamforming (LBB) scheme for the wiretap channel, where both the main channel and the eavesdropper's channel are subject to Rician fading. In our LBB scheme the two key inputs are the location of the legitimate receiver and the location of the potential eavesdropper. Notably, our scheme does not require as direct inputs any channel state information of the main channel or the eavesdropper's channel, making it easy to deploy in a host of application settings in which the location inputs are known. Our beamforming solution assumes a multiple-antenna transmitter, a multiple-antenna eavesdropper, and a single-antenna receiver, and its aim is to maximize the physical layer security of the channel. To obtain our solution we first derive the secrecy outage probability of the LBB scheme in a closed-form expression that is valid for arbitrary values of the Rician K-factors of the main channel and the eavesdropper's channel. Using this expression we then determine the location-based beamformer solution that minimizes the secrecy outage probability. To assess the usefulness of our new scheme, and to quantify the value of the location information to the beamformer, we compare our scheme to other schemes, some of which do not utilize any location information. Our new beamformer solution provides optimal physical layer security for a wide range of location-based applications.Index Terms-Physical layer security, Rician fading, locationbased beamforming, secrecy outage probability.

show abstract

“…However, it is important to note this metric does not distinguish between reliability and security [19].…”

Section: B Secrecy Performance Of the Lbb Schemementioning

confidence: 99%

Location-Based Beamforming for Enhancing Secrecy in Rician Wiretap Channels

Yan

Malaney

2016

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…12 The p (k) t is the probability that a node in level k transmits to a GN and can be written as (18). The p (k) r is the probability that a GN in level k − 1 successfully receives data transmitted by a node in level k, and can be written as p…”

Section: A Generic Fading Channels Theorem 1 (Dns Throughput In Genementioning

confidence: 99%

“…Remark 4: Theorem 1 enables the evaluation of the DNS throughput for MWNs as a function of the CCDF of received SNRs, node spatial distribution, multilevel cluster formation, propagation medium, and communication protocol. 12 Closed form expressions can be obtained depending on the communication protocol. 13 Let ν(x) be a bounded measurable function of x ∈ Ê d .…”

Section: A Generic Fading Channels Theorem 1 (Dns Throughput In Genementioning

confidence: 99%

See 1 more Smart Citation

Distributed Network Secrecy

Lee

Conti

Rabbachin

et al. 2013

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-Secrecy is essential for a variety of emerging wireless applications where distributed confidential information is communicated in a multilevel network from sources to destinations. Network secrecy can be accomplished by exploiting the intrinsic properties of multilevel wireless networks (MWNs). This paper introduces the concept of distributed network secrecy (DNS) and develops a framework for the design and analysis of secure, reliable, and efficient MWNs. Our framework accounts for node spatial distribution, multilevel cluster formation, propagation medium, communication protocol, and energy consumption. This research provides a foundation for DNS and offers a new perspective on the relationship between DNS and network lifetime.

show abstract

“…Hence, it is important to develop relay designs that are robust to CSI errors. Works along these lines include [29][30][31][32][33][34][35] which consider the scenario with no relays and [24][25][26][27] which consider the scenario with relays. As compared with the transmission design in the former scenario, the robust secure relay design is more difficult due to noise amplification at relays.…”

Section: Introductionmentioning

confidence: 99%

Robust transmit design for secure AF relay networks with imperfect CSI

Chen

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

This paper studies robust transmit design for secure AF relay networks with imperfect channel state information (CSI). Two CSI error models, deterministically bounded error model and stochastic error model, are considered. In order to use the power at relays more efficiently, a joint cooperative relaying and jamming scheme is considered, where relays cooperate to forward the source signal and simultaneously they cooperate to send jamming signals to confuse the eavesdroppers. In this joint cooperative relaying and jamming framework, we address the robust joint optimization of the relay weights and the input covariance matrix of jamming signals for secrecy rate maximization (SRM), under both total and individual relay power constraints. Specifically, for the case of deterministically bounded error model, where the CSI error can be specified by an uncertainty set, we maximize the worst-case secrecy rate. While for the case of stochastic error model, where the probability distribution of the CSI error is Gaussian, we maximize the outage constrained secrecy rate. The challenge of these considered SRM-based optimizations lies in their non-convexity. This paper shows that such SRM-based optimization can be solved in a convex fashion and via solving a sequence of semidefinite programs (SDPs). Numerical results are presented to show the efficacy of the proposed scheme.

show abstract

Rethinking the Secrecy Outage Formulation: A Secure Transmission Design Perspective

Cited by 264 publications

References 9 publications

Location-Based Beamforming for Enhancing Secrecy in Rician Wiretap Channels

Location-Based Beamforming for Enhancing Secrecy in Rician Wiretap Channels

Distributed Network Secrecy

Robust transmit design for secure AF relay networks with imperfect CSI

Contact Info

Product

Resources

About