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 Journal on Selected Areas in Communications

Artificial Noise Generation from Cooperative Relays for Everlasting Secrecy in Two-Hop Wireless Networks

Dennis Goeckel, Sudarshan Vasudevan, Don Towsley, Stephan Adams, Zhiguo Ding, Kin Kwong Leung

Published Nov 21, 2011• 101 citations
Publisher

Abstract

The secure transmission of information in wireless networks without knowledge of eavesdropper channels or locations is considered. Two key mechanisms are employed: artificial noise generation from system nodes other than the transmitter and receiver, and a form of multi-user diversity that allows message reception in the presence of the artificial noise. We determine the maximum number of independently-operating and uniformly distributed eavesdroppers that can be present while the desired secrecy is achieved with high probability in the limit of a large number of system nodes. While our main motivation is considering eavesdroppers of unknown location, we first consider the case where the path-loss is identical between all pairs of nodes. In this case, a number of eavesdroppers that is exponential in the number of systems nodes can be tolerated. In the case of uniformly distributed eavesdroppers of unknown location, any number of eavesdroppers whose growth is sub-linear in the number of system nodes can be tolerated. The proposed approach significantly outperforms a power control approach based on standard multi-user diversity.

DOI
10.1109/jsac.2011.111216

Related papers

Physical layer security from inter-session interference in large wireless networks

Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik +1 more

Physical layer secrecy in wireless networks in the presence of eavesdroppers of unknown location is considered. In contrast to prior schemes, which have expended energy in the form of cooperative jamming to enable secrecy, we develop schemes where multiple transmitters send their signals in a cooperative fashion to confuse the eavesdroppers. Hence, power is not expended on “artificial noise”; rather, the signal of a given transmitter is protected by the aggregate interference produced by the other transmitters. We introduce a two-hop strategy for the case of equal path-loss between all pairs of nodes, and then consider its embedding within a multi-hop approach for the general case of an extended network. In each case, we derive an achievable number of eavesdroppers that can be present in the region while secure communication between all sources and intended destinations is ensured.

IEEE Conference on Computer Communications (INFOCOM)•Mar 1, 2012•46 citations

Exploring Relay Cooperation Scheme for Load-Balance Control in Two-hop Secure Communication System

Yulong Shen, Xiaohong Jiang, Jianfeng Ma

This work considers load-balance control among the relays under the secure transmission protocol via relay cooperation in two-hop wireless networks without the information of both eavesdropper channels and locations. The available two-hop secure transmission protocols in physical layer secrecy framework cannot provide a flexible load-balance control, which may significantly limit their application scopes. This paper proposes a secure transmission protocol in case that the path-loss is identical between all pairs of nodes, in which the relay is randomly selected from the first $k$ preferable assistant relays. This protocol enables load-balance among relays to be flexibly controlled by a proper setting of the parameter $k$, and covers the available works as special cases, like ones with the optimal relay selection ($k=1$) and ones with the random relay selection ($k = n$, i.e. the number of system nodes). The theoretic analysis is further provided to determine the maximum number of eavesdroppers one network can tolerate by applying the proposed protocol to ensure a desired performance in terms of the secrecy outage probability and transmission outage probability.

arXiv:1212.6627•Dec 29, 2012•0 citations

Cooperative jamming to improve the connectivity of the 1-D secrecy graph

Çağatay Çapar, Dennis Goeckel, Benyuan Liu +1 more

Consider a one-dimensional wireless network with n nodes uniformly and independently distributed at random in the interval. In addition, m eavesdropper nodes are uniformly and independently distributed in. For a randomly selected source-destination pair, we consider the problem of securely delivering a message from the source to the destination and we present achievable results on the number of eavesdropper nodes that can be tolerated by the network. Our constructions make use of cooperative jamming, in which nodes located close to the eavesdroppers generate artificial noise. For the one-dimensional network case, our results provide an improvement to the connectivity properties of the recently-introduced secrecy graph which is disconnected for any positive number of eavesdroppers without cooperative jamming. We consider cases of both known and unknown eavesdropper locations. For known eavesdropper locations, we show that a message can be securely delivered from the source to the destination with probability one as the number of nodes n goes to infinity, for any number of independent eavesdroppers m(n) satisfying m(n) = o(√n / log n). For unknown eavesdropper locations, we present a construction which can tolerate m(n) = o(n/log n) under the assumption of independent eavesdroppers, but which is fragile in the face of collaborating eavesdroppers.

Conference on Information Sciences and Systems•Mar 1, 2011•4 citations

Artificial Noise-Aided Secure Relay Communication With Unknown Channel Knowledge of Eavesdropper

Bin Li, Meiying Zhang, Yue Rong +1 more

In this article, a new relay-aided secure communication system is investigated, where a transmitter sends signals to a destination via an amplify-and-forward (AF) relay in the presence of an eavesdropper. We consider a general system configuration, where the source, relay, destination, and eavesdropper are all equipped with multiple antennas. In the practical scenarios of unknown eavesdropper's channel state information (CSI) and uncertainty of the eavesdropper's location, we aim to maximize the expected value of the system secrecy rate over the presumed distribution of the eavesdropper's channels, by exploiting the artificial noise (AN) transmitted by the source and relay nodes. The system design issue is formulated as a nonconvex stochastic optimization problem with a source transmission power constraint and a nonconvex relay transmission power constraint. A novel computational method is proposed to solve this challenging problem. The new method is developed based on an exact penalty function method together with a parallel stochastic decomposition algorithm. Numerical simulations are performed to study the effectiveness of the proposed scheme at various locations of the eavesdropper. Simulation results show that for most cases, secure communication can be achieved without the CSI knowledge of eavesdropper's channels, and the achievable secrecy rate follows the trend of a benchmark system where the eavesdropper's full CSI is available. In particular, the achievable system secrecy rate increases with the number of antennas at the legitimate users. Moreover, the optimal power allocated for the transmission of the AN increases with the system signal-to-noise ratio. The proposed computational method achieves a higher system secrecy rate than a conventional penalty function based approach.

IEEE Transactions on Wireless Communications•Jan 10, 2021•35 citations

Artificial Noise Aided Secrecy Enhancement in Amplify-and-Forward Relay Networks

P M Shemi, M G Jibukumar, Munsif Ali

Cooperative relaying and cooperative jamming have been used to improve the secrecy of wireless networks. In this paper, Artificial Noise (AN) based secrecy enhancement of a dual-hop wireless network consisting of ‘n’ amplify-and-forward (AF) relays in the presence of a passive eavesdropper (E) is studied. A practical setting where direct links exist between source-destination (S-D) and source-eavesdropper (S-E) is considered. The source allocates some of its available power to transmit AN in order to confuse the eavesdropper and thereby degrades its channel. The optimum power allocation factor (a) and maximum secrecy rate are estimated analytically and by simulation. The performance is evaluated based on secrecy rate (Rs) and bit error rate (BER); for the case of randomly distributed relays and for any eavesdropper location. Numerical results show the improvement of the proposed cooperative scheme over other schemes.

International Conference on Signal Processing and Integrated Networks (SPIN)•Feb 1, 2018•3 citations

Secrecy Enhancement via Cooperative Relays in Multi-Hop Communication Systems

Elham Nosrati, Xianbin Wang, Arash Khabbazibasmenj +1 more

This paper proposes using cooperative relays to improve the ergodic secrecy capacity (ESC) of a multi-hop decode-and-forward (DF) relaying system where communication takes place in the presence of multiple non-colluding eavesdroppers. The proposed scheme is based on a recent approach to generate artificial noise in which transmitter of each hop allocates a portion of its power for generating an intentional interference at the eavesdroppers. Under the assumption that the transmitters can only use limited transmit power, a power allocation strategy has been developed which maximizes the secrecy capacity by optimally distributing the power between the original signal and the artificial noise. Since the optimal solution depends on the channel state information (CSI) of the eavesdroppers, which is difficult to obtain in practice, a sub-optimal solution is also presented in which the CSI of the eavesdroppers is not needed.

IEEE Vehicular Technology Conference•May 1, 2016•3 citations
The secure transmission of information in wireless networks without knowledge of eavesdropper channels or locations is considered. Two key mechanisms are employed: artificial noise generation from system nodes other than the transmitter and receiver, and a form of multi-user diversity that allows message reception in the presence of the artificial noise. We determine the maximum number of independently-operating and uniformly distributed eavesdroppers that can be present while the desired secrecy is achieved with high probability in the limit of a large number of system nodes. While our main motivation is considering eavesdroppers of unknown location, we first consider the case where the path-loss is identical between all pairs of nodes. In this case, a number of eavesdroppers that is exponential in the number of systems nodes can be tolerated. In the case of uniformly distributed eavesdroppers of unknown location, any number of eavesdroppers whose growth is sub-linear in the number of system nodes can be tolerated. The proposed approach significantly outperforms a power control approach based on standard multi-user diversity.
Physical layer secrecy in wireless networks in the presence of eavesdroppers of unknown location is considered. In contrast to prior schemes, which have expended energy in the form of cooperative jamming to enable secrecy, we develop schemes where multiple transmitters send their signals in a cooperative fashion to confuse the eavesdroppers. Hence, power is not expended on “artificial noise”; rather, the signal of a given transmitter is protected by the aggregate interference produced by the other transmitters. We introduce a two-hop strategy for the case of equal path-loss between all pairs of nodes, and then consider its embedding within a multi-hop approach for the general case of an extended network. In each case, we derive an achievable number of eavesdroppers that can be present in the region while secure communication between all sources and intended destinations is ensured.
This work considers load-balance control among the relays under the secure transmission protocol via relay cooperation in two-hop wireless networks without the information of both eavesdropper channels and locations. The available two-hop secure transmission protocols in physical layer secrecy framework cannot provide a flexible load-balance control, which may significantly limit their application scopes. This paper proposes a secure transmission protocol in case that the path-loss is identical between all pairs of nodes, in which the relay is randomly selected from the first kkk preferable assistant relays. This protocol enables load-balance among relays to be flexibly controlled by a proper setting of the parameter kkk, and covers the available works as special cases, like ones with the optimal relay selection (k=1k=1k=1) and ones with the random relay selection (k=nk = nk=n, i.e. the number of system nodes). The theoretic analysis is further provided to determine the maximum number of eavesdroppers one network can tolerate by applying the proposed protocol to ensure a desired performance in terms of the secrecy outage probability and transmission outage probability.
Consider a one-dimensional wireless network with n nodes uniformly and independently distributed at random in the interval. In addition, m eavesdropper nodes are uniformly and independently distributed in. For a randomly selected source-destination pair, we consider the problem of securely delivering a message from the source to the destination and we present achievable results on the number of eavesdropper nodes that can be tolerated by the network. Our constructions make use of cooperative jamming, in which nodes located close to the eavesdroppers generate artificial noise. For the one-dimensional network case, our results provide an improvement to the connectivity properties of the recently-introduced secrecy graph which is disconnected for any positive number of eavesdroppers without cooperative jamming. We consider cases of both known and unknown eavesdropper locations. For known eavesdropper locations, we show that a message can be securely delivered from the source to the destination with probability one as the number of nodes n goes to infinity, for any number of independent eavesdroppers m(n) satisfying m(n) = o(√n / log n). For unknown eavesdropper locations, we present a construction which can tolerate m(n) = o(n/log n) under the assumption of independent eavesdroppers, but which is fragile in the face of collaborating eavesdroppers.
In this article, a new relay-aided secure communication system is investigated, where a transmitter sends signals to a destination via an amplify-and-forward (AF) relay in the presence of an eavesdropper. We consider a general system configuration, where the source, relay, destination, and eavesdropper are all equipped with multiple antennas. In the practical scenarios of unknown eavesdropper's channel state information (CSI) and uncertainty of the eavesdropper's location, we aim to maximize the expected value of the system secrecy rate over the presumed distribution of the eavesdropper's channels, by exploiting the artificial noise (AN) transmitted by the source and relay nodes. The system design issue is formulated as a nonconvex stochastic optimization problem with a source transmission power constraint and a nonconvex relay transmission power constraint. A novel computational method is proposed to solve this challenging problem. The new method is developed based on an exact penalty function method together with a parallel stochastic decomposition algorithm. Numerical simulations are performed to study the effectiveness of the proposed scheme at various locations of the eavesdropper. Simulation results show that for most cases, secure communication can be achieved without the CSI knowledge of eavesdropper's channels, and the achievable secrecy rate follows the trend of a benchmark system where the eavesdropper's full CSI is available. In particular, the achievable system secrecy rate increases with the number of antennas at the legitimate users. Moreover, the optimal power allocated for the transmission of the AN increases with the system signal-to-noise ratio. The proposed computational method achieves a higher system secrecy rate than a conventional penalty function based approach.
Cooperative relaying and cooperative jamming have been used to improve the secrecy of wireless networks. In this paper, Artificial Noise (AN) based secrecy enhancement of a dual-hop wireless network consisting of ‘n’ amplify-and-forward (AF) relays in the presence of a passive eavesdropper (E) is studied. A practical setting where direct links exist between source-destination (S-D) and source-eavesdropper (S-E) is considered. The source allocates some of its available power to transmit AN in order to confuse the eavesdropper and thereby degrades its channel. The optimum power allocation factor (a) and maximum secrecy rate are estimated analytically and by simulation. The performance is evaluated based on secrecy rate (Rs) and bit error rate (BER); for the case of randomly distributed relays and for any eavesdropper location. Numerical results show the improvement of the proposed cooperative scheme over other schemes.
This paper proposes using cooperative relays to improve the ergodic secrecy capacity (ESC) of a multi-hop decode-and-forward (DF) relaying system where communication takes place in the presence of multiple non-colluding eavesdroppers. The proposed scheme is based on a recent approach to generate artificial noise in which transmitter of each hop allocates a portion of its power for generating an intentional interference at the eavesdroppers. Under the assumption that the transmitters can only use limited transmit power, a power allocation strategy has been developed which maximizes the secrecy capacity by optimally distributing the power between the original signal and the artificial noise. Since the optimal solution depends on the channel state information (CSI) of the eavesdroppers, which is difficult to obtain in practice, a sub-optimal solution is also presented in which the CSI of the eavesdroppers is not needed.