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

Conference on Information Sciences and Systems

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

Çağatay Çapar, Dennis Goeckel, Benyuan Liu, Don Towsley

Published Mar 1, 2011• 4 citations
Publisher

Abstract

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.

DOI
10.1109/ciss.2011.5766138

Related papers

On cooperative jamming in wireless networks with eavesdroppers at arbitrary locations

Zhihong Liu, Jiajia Liu, Nei Kato +2 more

This paper investigates cooperative jamming for secure connection in wireless networks. A cooperative jamming strategy is proposed to thwart eavesdroppers anywhere in the network, even if they are located close to the source or the destination. The basic idea is to defeat eavesdroppers by a divide and conquer strategy, and exploit the helpful interference from the source and the destination to circumvent the nearby eavesdropper problem. Analysis and simulation results reveal that this strategy can enhance the secure connection probability and can tolerate any number of independent eavesdroppers provided that the number of legitimate nodes satisfies certain condition.

International Conference on Communications•May 1, 2016•6 citations

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

Dennis Goeckel, Sudarshan Vasudevan, Don Towsley +3 more

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.

IEEE Journal on Selected Areas in Communications•Nov 21, 2011•101 citations

Cooperative Jamming Aided Secrecy Enhancement in Wireless Networks with Multiple Eavesdroppers

Lin Hu, Hong Wen, Bin Wu +5 more

In this paper, we investigate cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative node (Charlie), in the presence of multiple independent eavesdroppers (Eves). In particular, cooperative jamming (CJ) is explored to enhance secure communication between Alice and Bob. We provide a transmit design to maximize the secrecy rate, subject to a secrecy outage probability (SOP) constraint. Specifically, we establish a condition under which positive secrecy rate can be guaranteed. In addition to secrecy rate performance, we also pay attention to the secure energy efficiency, defined as the ratio of secrecy rate to total power consumption. Numerical results validate the effectiveness and energy efficiency of our proposed CJ scheme.

IEEE Vehicular Technology Conference•Sep 1, 2017•0 citations

Power allocation to noise-generating nodes for cooperative secrecy in the wireless environment

Kyle Morrison, Dennis Goeckel

The wireless transmission environment opens up opportunities for an eavesdropper to intercept a secret message from the source to the legitimate destination, particularly in the case when the eavesdropper is close to the source. Cooperative jamming, where nodes that are inactive serve as noise-generating nodes to disrupt an eavesdropper, has recently been considered in wireless communication networks to improve secrecy in such scenarios. Here we consider optimal power allocation to these jamming nodes (termed “chatterers”) in the case of an eavesdropper of known location. The optimal power allocation to the chatterer nodes is achieved via water-filling that, as one would expect, favors nodes that are close to the eavesdropper but will not impact the message to the destination significantly, either because the chatterer is located at a large distance from the destination or because the chatterer's signal is significantly faded at the destination. Numerical results compare the performance of the system employing the optimal power allocation to the performance of lower overhead schemes that employ only a single jamming node.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2011•2 citations

Cooperative-Jamming-Aided Secrecy Enhancement in Wireless Networks With Passive Eavesdroppers

Lin Hu, Hong Wen, Bin Wu +3 more

This paper investigates cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative jammer (Charlie), coexisting with multiple passive eavesdroppers (Eves). In particular, by assuming knowledge of Bob's perfect channel state information (CSI) but only Eves’ statistical CSIs, secrecy beamforming with artificial noise (AN) is utilized for secure transmission, and cooperative jamming (CJ) is explored to further enhance secrecy. We first derive an accurate closed-form expression for the secrecy outage probability (SOP), and establish the condition under which positive secrecy rate is achievable. Then, we provide a secure transmit design for maximizing the SOP constrained secrecy rate. Moreover, based on a strict mathematical analysis, we characterize the impact of the main channel quality and the number of Eves on transmit design and secrecy performance. Specifically, optimal power allocation ratio between the information-bearing signal and the AN signal increases as the main channel quality improves, and decreases with the number of Eves. Numerical results confirm that our design achieves performance improvement in terms of both secrecy rate and secure energy efficiency, as compared to the approach without CJ.

IEEE Transactions on Vehicular Technology•Aug 25, 2017•78 citations

Secure Wireless Communications via Cooperative Transmitting

Toni Stojanovski, Ninoslav Marina

Information-theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to exchange a secret key with a new receiver at a random location, in the presence of passive eavesdroppers at unknown locations. Two spatial point processes, homogeneous Poisson process and independent uniformly distributed points, are used for the spatial distributions of transmitters and eavesdroppers. We analyse the impact of the number of cooperating transmitters and the number of eavesdroppers on the area fraction where secure communication is possible. Upper bounds on the probability of existence of positive secrecy between the cooperating transmitters and the receiver are derived. The closeness of the upper bounds to the real value is then estimated by means of numerical simulations. Simulations also indicate that a deterministic spatial distribution for the transmitters, for example, hexagonal and square lattices, increases the probability of existence of positive secrecy capacity compared to the random spatial distributions. For the same number of friendly nodes, cooperative transmitting provides a dramatically larger secrecy region than cooperative jamming and cooperative relaying.

arXiv:1303.2654•The Scientific World JOURNAL•Jan 1, 2014•2 citations
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.
This paper investigates cooperative jamming for secure connection in wireless networks. A cooperative jamming strategy is proposed to thwart eavesdroppers anywhere in the network, even if they are located close to the source or the destination. The basic idea is to defeat eavesdroppers by a divide and conquer strategy, and exploit the helpful interference from the source and the destination to circumvent the nearby eavesdropper problem. Analysis and simulation results reveal that this strategy can enhance the secure connection probability and can tolerate any number of independent eavesdroppers provided that the number of legitimate nodes satisfies certain condition.
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.
In this paper, we investigate cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative node (Charlie), in the presence of multiple independent eavesdroppers (Eves). In particular, cooperative jamming (CJ) is explored to enhance secure communication between Alice and Bob. We provide a transmit design to maximize the secrecy rate, subject to a secrecy outage probability (SOP) constraint. Specifically, we establish a condition under which positive secrecy rate can be guaranteed. In addition to secrecy rate performance, we also pay attention to the secure energy efficiency, defined as the ratio of secrecy rate to total power consumption. Numerical results validate the effectiveness and energy efficiency of our proposed CJ scheme.
The wireless transmission environment opens up opportunities for an eavesdropper to intercept a secret message from the source to the legitimate destination, particularly in the case when the eavesdropper is close to the source. Cooperative jamming, where nodes that are inactive serve as noise-generating nodes to disrupt an eavesdropper, has recently been considered in wireless communication networks to improve secrecy in such scenarios. Here we consider optimal power allocation to these jamming nodes (termed “chatterers”) in the case of an eavesdropper of known location. The optimal power allocation to the chatterer nodes is achieved via water-filling that, as one would expect, favors nodes that are close to the eavesdropper but will not impact the message to the destination significantly, either because the chatterer is located at a large distance from the destination or because the chatterer's signal is significantly faded at the destination. Numerical results compare the performance of the system employing the optimal power allocation to the performance of lower overhead schemes that employ only a single jamming node.
This paper investigates cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative jammer (Charlie), coexisting with multiple passive eavesdroppers (Eves). In particular, by assuming knowledge of Bob's perfect channel state information (CSI) but only Eves’ statistical CSIs, secrecy beamforming with artificial noise (AN) is utilized for secure transmission, and cooperative jamming (CJ) is explored to further enhance secrecy. We first derive an accurate closed-form expression for the secrecy outage probability (SOP), and establish the condition under which positive secrecy rate is achievable. Then, we provide a secure transmit design for maximizing the SOP constrained secrecy rate. Moreover, based on a strict mathematical analysis, we characterize the impact of the main channel quality and the number of Eves on transmit design and secrecy performance. Specifically, optimal power allocation ratio between the information-bearing signal and the AN signal increases as the main channel quality improves, and decreases with the number of Eves. Numerical results confirm that our design achieves performance improvement in terms of both secrecy rate and secure energy efficiency, as compared to the approach without CJ.
Information-theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to exchange a secret key with a new receiver at a random location, in the presence of passive eavesdroppers at unknown locations. Two spatial point processes, homogeneous Poisson process and independent uniformly distributed points, are used for the spatial distributions of transmitters and eavesdroppers. We analyse the impact of the number of cooperating transmitters and the number of eavesdroppers on the area fraction where secure communication is possible. Upper bounds on the probability of existence of positive secrecy between the cooperating transmitters and the receiver are derived. The closeness of the upper bounds to the real value is then estimated by means of numerical simulations. Simulations also indicate that a deterministic spatial distribution for the transmitters, for example, hexagonal and square lattices, increases the probability of existence of positive secrecy capacity compared to the random spatial distributions. For the same number of friendly nodes, cooperative transmitting provides a dramatically larger secrecy region than cooperative jamming and cooperative relaying.