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

International Conference on Communications

On cooperative jamming in wireless networks with eavesdroppers at arbitrary locations

Zhihong Liu, Jiajia Liu, Nei Kato, Jianfeng Ma, Qiping Huang

Published May 1, 2016• 6 citations
Publisher

Abstract

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.

DOI
10.1109/icc.2016.7511469

Related papers

Divide-and-conquer based cooperative jamming: Addressing multiple eavesdroppers in close proximity

Zhihong Liu, Jiajia Liu, Nei Kato +2 more

This paper investigates divide-and-conquer based cooperative jamming for physical-layer security enhancement in the presence of multiple eavesdroppers. Different from previous works, we consider a scenario where the eavesdroppers can be located anywhere inside the communication region of the source, no location information of the eavesdroppers is available and no constraint on the number of eavesdroppers is presupposed. The basic idea is to transmit the message in multiple rounds and exploit the helpful interference from the source and the destination to jam the eavesdroppers in close proximity. Stochastic geometry based analytic results as well as Monte Carlo simulations are presented to illustrate the achievable secrecy performances.

IEEE Conference on Computer Communications (INFOCOM)•Apr 1, 2016•14 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

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

Joint Decode-and-Forward and Cooperative Jamming for Secure Wireless Communications

Shuanglin Huang, Jiaolong Wei, Yang Cao +1 more

In a cooperative wireless network, we exploited node cooperation for achieving physical layer based security. In this paper, the case of one source-destination pair with the help of multiple cooperating nodes(relay nodes and jamming nodes) in the presence of one eavesdropper was considered to improve the performance of secure wireless communications. A novel cooperative scheme joint decode-and-forward and cooperative jamming(JDFCJ) was proposed. In this scheme, the relay nodes transmit a weighted version of the source signals and the jamming nodes just transmit a common weighted jamming signal to confound the eavesdropper. The novel system design is proposed to minimize the transmit power subject to a secrecy rate constraint. For JDFCJ, the optimal power allocation is obtained in closed-form in the condition of the complete nulling of jamming signals at the destination. The numerical evaluation of the transmit power results shows that the proposed scheme can significantly improve the performance of secure wireless communications, as compared to the DF scheme.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2011•8 citations

Cooperative secure transmission against collusive eavesdroppers in Internet of Things

Xin Fan, Yan Huo

As Internet of Things (IoT) has boomed in recent years, many security issues have also been exposed. Focusing on physical layer security in wireless Internet of Things network communication, a series of security methods have been widely studied. Nevertheless, cooperative jamming methods in physical layer security to fight against collusive eavesdroppers have not been thoroughly studied yet. In this article, we study a cooperative-jamming-based physical layer secure transmission scheme for Internet of Things wireless networks in the presence of collusive eavesdroppers. We design a cooperative jamming strategy without knowing the channel state information of eavesdroppers. Considering the cooperation of multiple nodes with multiple antennas, this strategy can maximize the signal-to-interference-plus-noise ratio at an actuator (legitimate receiver). Meanwhile, the generated cooperative jamming signals can reduce the signal-to-interference-plus-noise ratio at eavesdroppers. To explore the theoretical security performance of our strategy, we perform a secrecy outage probability analysis and an asymptotic analysis. In the cases of cooperative jamming and without cooperative jamming, the closed-form expressions of the secrecy outage probability are deduced, and the influence of system parameters on the secrecy outage probability becomes more intuitive through a strict mathematical asymptotic behavior analysis. In addition, considering the energy limitation of Internet of Things devices, we propose a power allocation algorithm to minimize the total transmission power given the security requirements. The numerical results show the effectiveness of our schemes and are consistent with the theoretical analysis.

International Journal of Distributed Sensor Networks•Jun 1, 2020•9 citations

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
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.
This paper investigates divide-and-conquer based cooperative jamming for physical-layer security enhancement in the presence of multiple eavesdroppers. Different from previous works, we consider a scenario where the eavesdroppers can be located anywhere inside the communication region of the source, no location information of the eavesdroppers is available and no constraint on the number of eavesdroppers is presupposed. The basic idea is to transmit the message in multiple rounds and exploit the helpful interference from the source and the destination to jam the eavesdroppers in close proximity. Stochastic geometry based analytic results as well as Monte Carlo simulations are presented to illustrate the achievable secrecy performances.
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 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.
In a cooperative wireless network, we exploited node cooperation for achieving physical layer based security. In this paper, the case of one source-destination pair with the help of multiple cooperating nodes(relay nodes and jamming nodes) in the presence of one eavesdropper was considered to improve the performance of secure wireless communications. A novel cooperative scheme joint decode-and-forward and cooperative jamming(JDFCJ) was proposed. In this scheme, the relay nodes transmit a weighted version of the source signals and the jamming nodes just transmit a common weighted jamming signal to confound the eavesdropper. The novel system design is proposed to minimize the transmit power subject to a secrecy rate constraint. For JDFCJ, the optimal power allocation is obtained in closed-form in the condition of the complete nulling of jamming signals at the destination. The numerical evaluation of the transmit power results shows that the proposed scheme can significantly improve the performance of secure wireless communications, as compared to the DF scheme.
As Internet of Things (IoT) has boomed in recent years, many security issues have also been exposed. Focusing on physical layer security in wireless Internet of Things network communication, a series of security methods have been widely studied. Nevertheless, cooperative jamming methods in physical layer security to fight against collusive eavesdroppers have not been thoroughly studied yet. In this article, we study a cooperative-jamming-based physical layer secure transmission scheme for Internet of Things wireless networks in the presence of collusive eavesdroppers. We design a cooperative jamming strategy without knowing the channel state information of eavesdroppers. Considering the cooperation of multiple nodes with multiple antennas, this strategy can maximize the signal-to-interference-plus-noise ratio at an actuator (legitimate receiver). Meanwhile, the generated cooperative jamming signals can reduce the signal-to-interference-plus-noise ratio at eavesdroppers. To explore the theoretical security performance of our strategy, we perform a secrecy outage probability analysis and an asymptotic analysis. In the cases of cooperative jamming and without cooperative jamming, the closed-form expressions of the secrecy outage probability are deduced, and the influence of system parameters on the secrecy outage probability becomes more intuitive through a strict mathematical asymptotic behavior analysis. In addition, considering the energy limitation of Internet of Things devices, we propose a power allocation algorithm to minimize the total transmission power given the security requirements. The numerical results show the effectiveness of our schemes and are consistent with the theoretical analysis.
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.