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 Sensors Letters

A Small-Scale Wireless Distributed Cooperative Secure Communication Network Design Using Graph FIR Filters

Venugopalachary Kotha, Vijay Kumar Chakka

Published Mar 23, 2021• 6 citations
Publisher

Abstract

This letter presents a small-scale wireless distributed cooperative secure-communication network (WDCSN) design using a novel spectral graph FIR filter to achieve desired secrecy capacity at the intended receiver in the presence of single and multiple eavesdroppers. An undirected weighted graphG(V,E, W), with relays, eavesdroppers, source, and destination are as nodes (V), and circularly symmetric complex Gaussian random variables as edge weights (W) are considered to represent the WDCSN. A graph Laplacian is used as a graph shift operator to design the proposed filter. Filter coefficients are calculated by using the least squared error as a criterion. Simulations are conducted for a two-way WDCSN to achieve the desired secrecy capacity using different graph structures considered for WDCSN. The proposed filter design's performance is quantified by using the secrecy outage probability metric. The results show that desired secrecy capacity with SOP of $10^{-2}$ is achievable using the proposed methodology, irrespective of graph structures with variable complexity. An SOP performance gain of (60-80)% is achieved over the SOP reported in the literature.

DOI
10.1109/lsens.2021.3068047

Related papers

Node Selection for Physical Layer Security Using Graph-Based Vertex-Frequency Representation

Venugopalachary Kotha, Vijay Kumar Chakka, Shaik Basheeruddin Shah +1 more

In multi-hop multi-relay cooperative wireless communication systems, node selection for physical layer security (PLS) is an important problem. By defining secrecy capacity based on localized vertex spectrum (LVS), three optimization problems namely i) the best destination for a given eavesdropper, ii) the upper and lower bounds of secrecy capacity for a given destination and iii) the joint optimal destination-eavesdropper pair which maximizes the secrecy capacity are proposed. The performance of the proposed methods have been shown in terms of secrecy outage probability (SOP) by performing simulations and the enhanced PLS is benchmarked with existing literature.

IEEE International Conference on Acoustics Speech and Signal Processing•Mar 12, 2025•0 citations

Improving Wireless Physical Layer Security via Cooperating Relays

Lun Dong, Zhu Han, Athina P. Petropulu +1 more

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.

IEEE Transactions on Signal Processing•Dec 11, 2009•1,366 citations

Graph Theory Based Cooperative Transmission for Physical-Layer Security in 5G Large-Scale Wireless Relay Networks

Chensi Zhang, Jianhua Ge, Zeyu Xia +1 more

In this paper, multi-hop cooperative techniques are adopted to improve the physical-layer security in 5G large-scale decode-and-forward relay networks with massive relays and eavesdroppers. The utilization of graph theory is investigated to relieve the burden of massive nodes and ease the cooperative anti-eavesdropping transmission designs. In particular, a secrecy weighted graph is first established according to the network topology. Three scenarios associated with different levels of wiretapping capability are taken into account. Accordingly, secrecy measurements are converted into the weight of each edge and three efficient cooperative anti-eavesdropping strategies are then proposed for physical-layer security enhancement based on the shortest path algorithm, respectively. It is verified that the proposed cooperative anti-eavesdropping strategies have the property of low complexity and are more attractive for large-scale networks. Simulation results highlight the efficiency and effectiveness of our designs. It has been shown that two-hop transmission does not always promise performance gain in terms of secrecy gain. On the contrary, the proposed strategies are able to provide considerable improvement for different cases, emphasizing the necessity of adopting multi-hop cooperative anti-eavesdropping techniques to improve the physical-layer security.

IEEE Access•Jan 1, 2017•14 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

Link Selection for Secure Cooperative Networks with Buffer-Aided Relaying

Ji He, Jia Liu, Yulong Shen +1 more

This paper investigates the secure communication in a two-hop cooperative wireless network, where a buffer-aided relay is utilized to forward data from the source to destination, and a passive eavesdropper attempts to intercept data transmission from both the source and relay. Depending on the availability of instantaneous channel state information of the source, two cases of transmission mechanisms, i.e., adaptive-rate transmission and fixed-rate transmission are considered. To enhance the security of the system, novel link selection policies are proposed for both cases to select source-to-relay, relay-to-destination, or no link transmission based on the channels qualities. Closed-form expressions are derived for the end-to-end secrecy outage probability (SOP), secrecy outage capacity (SOC), and exact secrecy throughput (EST), respectively. Furthermore, we prove the condition that EST reaches its maximum, and explore how to minimize the SOP and maximize the SOC by optimizing the link selection parameters. Finally, simulations are conducted to demonstrate the validity of our theoretical performance evaluation, and extensive numerical results are provided to illustrate the efficiency of the proposed link selection polices for the secure communication in two-hop cooperative networks.

arXiv:1802.06538•Feb 19, 2018•2 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
This letter presents a small-scale wireless distributed cooperative secure-communication network (WDCSN) design using a novel spectral graph FIR filter to achieve desired secrecy capacity at the intended receiver in the presence of single and multiple eavesdroppers. An undirected weighted graphG(V,E, W), with relays, eavesdroppers, source, and destination are as nodes (V), and circularly symmetric complex Gaussian random variables as edge weights (W) are considered to represent the WDCSN. A graph Laplacian is used as a graph shift operator to design the proposed filter. Filter coefficients are calculated by using the least squared error as a criterion. Simulations are conducted for a two-way WDCSN to achieve the desired secrecy capacity using different graph structures considered for WDCSN. The proposed filter design's performance is quantified by using the secrecy outage probability metric. The results show that desired secrecy capacity with SOP of 10−210^{-2}10−2 is achievable using the proposed methodology, irrespective of graph structures with variable complexity. An SOP performance gain of (60-80)% is achieved over the SOP reported in the literature.
In multi-hop multi-relay cooperative wireless communication systems, node selection for physical layer security (PLS) is an important problem. By defining secrecy capacity based on localized vertex spectrum (LVS), three optimization problems namely i) the best destination for a given eavesdropper, ii) the upper and lower bounds of secrecy capacity for a given destination and iii) the joint optimal destination-eavesdropper pair which maximizes the secrecy capacity are proposed. The performance of the proposed methods have been shown in terms of secrecy outage probability (SOP) by performing simulations and the enhanced PLS is benchmarked with existing literature.
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.
In this paper, multi-hop cooperative techniques are adopted to improve the physical-layer security in 5G large-scale decode-and-forward relay networks with massive relays and eavesdroppers. The utilization of graph theory is investigated to relieve the burden of massive nodes and ease the cooperative anti-eavesdropping transmission designs. In particular, a secrecy weighted graph is first established according to the network topology. Three scenarios associated with different levels of wiretapping capability are taken into account. Accordingly, secrecy measurements are converted into the weight of each edge and three efficient cooperative anti-eavesdropping strategies are then proposed for physical-layer security enhancement based on the shortest path algorithm, respectively. It is verified that the proposed cooperative anti-eavesdropping strategies have the property of low complexity and are more attractive for large-scale networks. Simulation results highlight the efficiency and effectiveness of our designs. It has been shown that two-hop transmission does not always promise performance gain in terms of secrecy gain. On the contrary, the proposed strategies are able to provide considerable improvement for different cases, emphasizing the necessity of adopting multi-hop cooperative anti-eavesdropping techniques to improve the physical-layer security.
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.
This paper investigates the secure communication in a two-hop cooperative wireless network, where a buffer-aided relay is utilized to forward data from the source to destination, and a passive eavesdropper attempts to intercept data transmission from both the source and relay. Depending on the availability of instantaneous channel state information of the source, two cases of transmission mechanisms, i.e., adaptive-rate transmission and fixed-rate transmission are considered. To enhance the security of the system, novel link selection policies are proposed for both cases to select source-to-relay, relay-to-destination, or no link transmission based on the channels qualities. Closed-form expressions are derived for the end-to-end secrecy outage probability (SOP), secrecy outage capacity (SOC), and exact secrecy throughput (EST), respectively. Furthermore, we prove the condition that EST reaches its maximum, and explore how to minimize the SOP and maximize the SOC by optimizing the link selection parameters. Finally, simulations are conducted to demonstrate the validity of our theoretical performance evaluation, and extensive numerical results are provided to illustrate the efficiency of the proposed link selection polices for the secure communication in two-hop cooperative networks.
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.