scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Optimizing Secrecy Performance of Trusted RF Relay against External Eavesdropping

TL;DR: This paper studies the joint optimization of relay placement and power allocation to minimize the secrecy outage probability (SOP) for a four- node cooperative system with a trusted randomize- and-forward relay in the presence of an external eavesdropper.
Abstract: In resource allocation for secure cooperative communication systems, along with power allocation, relay placement also has equal importance in improving the system performance. In this paper, we study the joint optimization of relay placement and power allocation to minimize the secrecy outage probability (SOP) for a four- node cooperative system with a trusted randomize- and-forward relay in the presence of an external eavesdropper. Initially, we derive the expression of SOP, and then formulate an optimization problem to minimize SOP under given power budget and relay placement (RP) constraints. By providing analytical insights on power allocation (PA) between source and relay, we obtain closed form expressions of optimal PA (OPA) for a given RP that minimizes the SOP. Next, we propose a low complexity algorithm to obtain the near-optimal RP (ORP) for a given PA. Finally, we obtain optimal SOP with joint RP and PA. Numerical results present validation of analytical SOP through Monte Carlo simulations, optimal PA for a given RP, optimal RP for a given PA, and joint PA and RP for a given secrecy threshold rate. Finally, we highlight the significant performance gains achieved by the joint design over the conventional scheme.
Citations
More filters
Book ChapterDOI
01 Jan 2019
TL;DR: This chapter introduces the physical layer architectures suitable for the IoT and discusses the technological challenges associated with them, and presents novel optimization techniques and smart green cooperative protocols for maximizing security.
Abstract: With the current advancements in Internet of Things (IoT) technology, which offers connectivity of the physical world with the sophisticated information processing world, the utopian vision of Smart Cities now appears to be a close reality. This, however, opens the possibility of security breaches of data at various levels, from information collection, to processing, and finally, at the actuation. Due to the presence of low-power devices as information collectors and actuators in the IoT, physical layer security is a promising solution for privacy-aware Smart Cities because of its low implementation cost, and relatively low complexity compared with computation-intensive cryptographic techniques. In this chapter, we first introduce the physical layer architectures suitable for the IoT and discuss the technological challenges associated with them. Building upon them, we present novel optimization techniques and smart green cooperative protocols for maximizing security. We conclude the chapter by discussing open research directions that need further investigation for realizing energy-efficient secure Smart Cities.

3 citations

References
More filters
Book
01 Jan 1965
TL;DR: This chapter discusses the concept of a Random Variable, the meaning of Probability, and the axioms of probability in terms of Markov Chains and Queueing Theory.
Abstract: Part 1 Probability and Random Variables 1 The Meaning of Probability 2 The Axioms of Probability 3 Repeated Trials 4 The Concept of a Random Variable 5 Functions of One Random Variable 6 Two Random Variables 7 Sequences of Random Variables 8 Statistics Part 2 Stochastic Processes 9 General Concepts 10 Random Walk and Other Applications 11 Spectral Representation 12 Spectral Estimation 13 Mean Square Estimation 14 Entropy 15 Markov Chains 16 Markov Processes and Queueing Theory

13,886 citations

Journal ArticleDOI

4,028 citations


"Optimizing Secrecy Performance of T..." refers methods in this paper

  • ...PDFs of Y1 and Y2 defined as fY1 and fY2 obtained using transformation of RVs are given as [11]:...

    [...]

Journal ArticleDOI
TL;DR: Novel system designs are proposed, consisting of the determination of relay weights and the allocation of transmit power, that maximize the achievable secrecy rate subject to a transmit power constraint, or minimize the transmit powersubject to a secrecy rate constraint.
Abstract: Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel conditions: absent feedback, they are typically feasible only when the source-destination channel is better than the source-eavesdropper channel. Node cooperation is a means to overcome this challenge and improve the performance of secure wireless communications. This paper addresses secure communications of one source-destination pair with the help of multiple cooperating relays in the presence of one or more eavesdroppers. Three cooperative schemes are considered: decode-and-forward (DF), amplify-and-forward (AF), and cooperative jamming (CJ). For these schemes, the relays transmit a weighted version of a reencoded noise-free message signal (for DF), a received noisy source signal (for AF), or a common jamming signal (for CJ). Novel system designs are proposed, consisting of the determination of relay weights and the allocation of transmit power, that maximize the achievable secrecy rate subject to a transmit power constraint, or, minimize the transmit power subject to a secrecy rate constraint. For DF in the presence of one eavesdropper, closed-form optimal solutions are derived for the relay weights. For other problems, since the optimal relay weights are difficult to obtain, several criteria are considered leading to suboptimal but simple solutions, i.e., the complete nulling of the message signals at all eavesdroppers (for DF and AF), or the complete nulling of jamming signal at the destination (for CJ). Based on the designed relay weights, for DF in the presence of multiple eavesdroppers, and for CJ in the presence of one eavesdropper, the optimal power allocation is obtained in closed-form; in all other cases the optimal power allocation is obtained via iterative algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results show that the proposed design can significantly improve the performance of secure wireless communications.

1,385 citations


"Optimizing Secrecy Performance of T..." refers background in this paper

  • ...By considering a cooperative system with multiple relays in the presence of multiple eavesdroppers, secure rate maximization subject to a total power budget constraint, and power minimization subject to a secrecy rate constraint under AF, DF and CJ have been presented in [4]....

    [...]

  • ...Secure communication in the presence of external eavesdroppers under various cooperative strategies like cooperative jamming (CJ), noise forwarding, amplify-and-forward (AF) and decode and forward (DF) have been explored in [4]....

    [...]

Journal ArticleDOI
TL;DR: This survey introduces the fundamental theories of PHy-security, covering confidentiality and authentication, and provides an overview on the state-of-the-art works on PHY-security technologies that can provide secure communications in wireless systems, along with the discussions on challenges and their proposed solutions.
Abstract: Physical layer security (PHY-security) takes the advantages of channel randomness nature of transmission media to achieve communication confidentiality and authentication. Wiretap coding and signal processing technologies are expected to play vital roles in this new security mechanism. PHY-security has attracted a lot of attention due to its unique features and the fact that our daily life relies heavily on wireless communications for sensitive and private information transmissions. Compared to conventional cryptography that works to ensure all involved entities to load proper and authenticated cryptographic information, PHY-security technologies perform security functions without considering about how those security protocols are executed. In other words, it does not require to implement any extra security schemes or algorithms on other layers above the physical layer. This survey introduces the fundamental theories of PHY-security, covering confidentiality and authentication, and provides an overview on the state-of-the-art works on PHY-security technologies that can provide secure communications in wireless systems, along with the discussions on challenges and their proposed solutions. Furthermore, at the end of this paper, the open issues are identified as our future research directions.

530 citations


"Optimizing Secrecy Performance of T..." refers background in this paper

  • ...Due to broadcast nature of radio propagation in wireless communication, these systems are extremely vulnerable to eavesdropping attacks from the perspective of security, confidentiality, authentication and privacy [1]....

    [...]

Journal ArticleDOI
TL;DR: It is shown that, as long as λe/λ = o((logn)-2), almost all of the nodes achieve a perfectly secure rate of Ω(1/√n) for the extended and dense network models.
Abstract: This paper studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities λ and λe, respectively. It is shown that, as long as λe/λ = o((logn)-2), almost all of the nodes achieve a perfectly secure rate of Ω(1/√n) for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multihop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Second, an ergodic fading model with n source-destination pairs and ne eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy precoding, each user is shown to achieve a constant positive secret rate for sufficiently large n. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized.

214 citations