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 Transactions on Information Forensics and Security

Physical-Layer Security in Distributed Wireless Networks Using Matching Theory

Siavash Bayat, Raymond H. Y. Louie, Zhu Han, Branka S. Vucetic, Yonghui Li

Published Mar 6, 2013• 76 citations
Publisher

Abstract

We consider the use of physical-layer security in a wireless communication system where multiple jamming nodes assist multiple source-destination nodes in combating unwanted eavesdropping from a single eavesdropper. In particular, we propose a distributed algorithm that matches each source-destination pair with a particular jammer. Our algorithm caters for three channel state information (CSI) assumptions: global CSI, local CSI, and local CSI without the eavesdropper channel. We prove that our algorithm has many desirable properties. First, the outcome of the proposed algorithm results in a stable matching, which is important if the source and jamming nodes are selfish. Second, the secrecy rate of the proposed algorithm converges to the secrecy rate of a centralized optimal solution, if the price step-number is sufficiently small. Third, our algorithm converges only after a small number of iterations, and its overhead is relatively small. Fourth, our algorithm has a significantly lower complexity than a centralized optimal approach.

DOI
10.1109/tifs.2013.2251335

Related papers

Distributed stable matching algorithm for physical layer security with multiple source-destination pairs and jammer nodes

Siavash Bayat, Raymond H. Y. Louie, Zhu Han +2 more

In wireless communications, the physical layer security is an emerging security research area that explores the possibilities of achieving high secrecy data transmission between source-destination nodes, while malicious eavesdroppers will obtain zero information from the source nodes. In this paper we consider enhancing the security level of a network comprising of multiple source-destination pairs, multiple friendly jammers and a malicious eavesdropper. We propose a distributed algorithm to facilitate secure data transmission from each source to its corresponding destination, through the help of friendly jammers. The key idea behind the proposed algorithm is that the friendly jammers help the source nodes to increase their secrecy rates and in exchange, the source nodes provide monetary compensation to the friendly jammers. We prove that after a limited number of iterations, the proposed algorithm converges to an optimal stable matching. Numerical analysis also reveals that the distributed algorithm can achieve a performance comparable to an optimal centralized solution, but with a significantly less overhead and complexity.

IEEE Wireless Communications and Networking Conference•Apr 1, 2012•16 citations

Improved Wireless Secrecy Rate Using Distributed Auction Theory

Zhu Han, Ninoslav Marina, Merouane Abdelkader Debbah +1 more

Physical layer security is an emerging security area that explores possibilities of achieving perfect secrecy data transmission between the intended network nodes, while possible malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy rate can be improved using friendly jammers that introduce extra interference to the eavesdroppers. Here, we investigate the interaction between the multiple source-destination links and a friendly jammer who assists by ''masking" the eavesdropper. In order to obtain a distributed solution, one possibility is to introduce a distributed auction theoretic approach. The auction is defined such that the source-destination links provide bids for the jammer to interfere the eavesdropper, therefore increasing their secrecy capacities. We propose a distributed auction using the share auction and iteratively updating the bids. To compare with the performances, we construct a centralized solution and a VCG auction, which cannot be implemented in practice. Our analysis and simulation results show the effectiveness of friendly jamming and convergence of the proposed scheme. The distributed game solution is shown to have similar performances to those of the centralized ones.

International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)•Jan 1, 2009•23 citations

Physical layer security with uncoordinated helpers implementing cooperative jamming

Shuangyu Luo, Jiangyuan Li, Athina P. Petropulu

1A wireless communication network is considered, consisting of a source, a destination and an eavesdropper, each equipped with a single antenna. The communication is assisted by multiple multi-antenna helpers, which independently transmit jamming noise to confound the eavesdropper. The optimal structure of the jamming noise that maximizes the secrecy rate is derived. A suboptimal solution that results in nulling at the legitimate receiver is also considered. Unlike the optimal solution, which requires global channel information, the suboptimal solution requires local channel information only, i.e., each helper needs to know only its own channel to the destination. Although the nulling solution results in lower secrecy rate as compared to the optimal solution, simulations show that the difference is rather small, with the inexpensive and easy to implement nulling scheme performing near optimal.

arXiv:1202.6596•IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)•Jun 1, 2012•12 citations

Improved Wireless Secrecy Capacity using Distributed Auction Theory

Zhu Han, Ninoslav Marina, Merouane Abdelkader Debbah +1 more

Physical layer security is an emerging security area that explores possibilities of achieving perfect secrecy data transmission between the intended network nodes, while possible malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdroppers. Here, we investigate the interaction between the multiple source-destination links and a friendly jammer who assists by “masking” the eavesdropper. In order to obtain a distributed solution, one possibility is to introduce a distributed auction theoretic approach. The auction is defined such that the source-destination links provide bids for the jammer to interfere the eavesdropper, therefore increasing their secrecy capacities. We propose a distributed auction using the share auction and iteratively updating the bids. To compare with the performances, we construct a centralized solution and a VCG auction, which cannot be implemented in practice. Our analysis and simulation results show the effectiveness of friendly jamming and convergence of the proposed scheme. The distributed game solution is shown to have similar performances to those of the centralized ones.

•Dec 16, 2009•4 citations

Destination Assisted Cooperative Jamming for Wireless Physical-Layer Security

Yupeng Liu, Jiangyuan Li, Athina P. Petropulu

A wireless network with one source, one destination, one eavesdropper, and multiple decode-and-forward relays is considered. A two-slot cooperative relaying scheme is proposed that targets at maximizing the secrecy rate. In the first slot, the source transmits the information bearing signal, and at the same time, it cooperates with the destination in jamming the eavesdropper without creating interference at the relay. In the second slot, one optimally selected relay retransmits the decoded source signal, and at the same time, that particular relay cooperates with the source to jam the eavesdropper without creating interference at the destination. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise are proposed. It is shown that the secrecy rate of the proposed scheme scales with the total system powerP0and the number of available relaysKaccording to 1/2log2(1 +P0/8logK) - 1.6 bits/channel use . Although the proposed power allocation and relay selection assume global CSI available, the performance under imperfect relay CSI is also investigated. Also, the performance under distributed relay selection with limited feedback is demonstrated.

IEEE Transactions on Information Forensics and Security•Feb 25, 2013•195 citations

Physical Layer Security Game: Interaction between Source, Eavesdropper, and Friendly Jammer

Zhu Han, Ninoslav Marina, Merouane Abdelkader Debbah +1 more

Physical layer security is an emerging security area that achieves perfect secrecy data transmission between intended network nodes, while malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdroppers. We investigate the interaction between the source that transmits the useful data and friendly jammers who assist the source by "masking" the eavesdropper. To obtain distributed solution, we introduce a game theoretic approach. The game is defined such that the source pays the jammers to interfere the eavesdropper, therefore, increasing the secrecy capacity. The friendly jammers charge the source with a certain price for the jamming, and there is a tradeoff for the price. If too low, the profit of the jammers is low; and if too high, the source would not buy the "service" (jamming power) or would buy it from other jammers. To analyze the game outcome, we investigate a Stackelburg type of game and construct a distributed algorithm. Our analysis and simulation results show the effectiveness of friendly jamming and the tradeoff for setting the price. The distributed game solution is shown to have similar performances to those of the centralized one.

EURASIP Journal on Wireless Communications and Networking•Jan 6, 2010•116 citations
We consider the use of physical-layer security in a wireless communication system where multiple jamming nodes assist multiple source-destination nodes in combating unwanted eavesdropping from a single eavesdropper. In particular, we propose a distributed algorithm that matches each source-destination pair with a particular jammer. Our algorithm caters for three channel state information (CSI) assumptions: global CSI, local CSI, and local CSI without the eavesdropper channel. We prove that our algorithm has many desirable properties. First, the outcome of the proposed algorithm results in a stable matching, which is important if the source and jamming nodes are selfish. Second, the secrecy rate of the proposed algorithm converges to the secrecy rate of a centralized optimal solution, if the price step-number is sufficiently small. Third, our algorithm converges only after a small number of iterations, and its overhead is relatively small. Fourth, our algorithm has a significantly lower complexity than a centralized optimal approach.
In wireless communications, the physical layer security is an emerging security research area that explores the possibilities of achieving high secrecy data transmission between source-destination nodes, while malicious eavesdroppers will obtain zero information from the source nodes. In this paper we consider enhancing the security level of a network comprising of multiple source-destination pairs, multiple friendly jammers and a malicious eavesdropper. We propose a distributed algorithm to facilitate secure data transmission from each source to its corresponding destination, through the help of friendly jammers. The key idea behind the proposed algorithm is that the friendly jammers help the source nodes to increase their secrecy rates and in exchange, the source nodes provide monetary compensation to the friendly jammers. We prove that after a limited number of iterations, the proposed algorithm converges to an optimal stable matching. Numerical analysis also reveals that the distributed algorithm can achieve a performance comparable to an optimal centralized solution, but with a significantly less overhead and complexity.
Physical layer security is an emerging security area that explores possibilities of achieving perfect secrecy data transmission between the intended network nodes, while possible malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy rate can be improved using friendly jammers that introduce extra interference to the eavesdroppers. Here, we investigate the interaction between the multiple source-destination links and a friendly jammer who assists by ''masking" the eavesdropper. In order to obtain a distributed solution, one possibility is to introduce a distributed auction theoretic approach. The auction is defined such that the source-destination links provide bids for the jammer to interfere the eavesdropper, therefore increasing their secrecy capacities. We propose a distributed auction using the share auction and iteratively updating the bids. To compare with the performances, we construct a centralized solution and a VCG auction, which cannot be implemented in practice. Our analysis and simulation results show the effectiveness of friendly jamming and convergence of the proposed scheme. The distributed game solution is shown to have similar performances to those of the centralized ones.
1A wireless communication network is considered, consisting of a source, a destination and an eavesdropper, each equipped with a single antenna. The communication is assisted by multiple multi-antenna helpers, which independently transmit jamming noise to confound the eavesdropper. The optimal structure of the jamming noise that maximizes the secrecy rate is derived. A suboptimal solution that results in nulling at the legitimate receiver is also considered. Unlike the optimal solution, which requires global channel information, the suboptimal solution requires local channel information only, i.e., each helper needs to know only its own channel to the destination. Although the nulling solution results in lower secrecy rate as compared to the optimal solution, simulations show that the difference is rather small, with the inexpensive and easy to implement nulling scheme performing near optimal.
Physical layer security is an emerging security area that explores possibilities of achieving perfect secrecy data transmission between the intended network nodes, while possible malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdroppers. Here, we investigate the interaction between the multiple source-destination links and a friendly jammer who assists by “masking” the eavesdropper. In order to obtain a distributed solution, one possibility is to introduce a distributed auction theoretic approach. The auction is defined such that the source-destination links provide bids for the jammer to interfere the eavesdropper, therefore increasing their secrecy capacities. We propose a distributed auction using the share auction and iteratively updating the bids. To compare with the performances, we construct a centralized solution and a VCG auction, which cannot be implemented in practice. Our analysis and simulation results show the effectiveness of friendly jamming and convergence of the proposed scheme. The distributed game solution is shown to have similar performances to those of the centralized ones.
A wireless network with one source, one destination, one eavesdropper, and multiple decode-and-forward relays is considered. A two-slot cooperative relaying scheme is proposed that targets at maximizing the secrecy rate. In the first slot, the source transmits the information bearing signal, and at the same time, it cooperates with the destination in jamming the eavesdropper without creating interference at the relay. In the second slot, one optimally selected relay retransmits the decoded source signal, and at the same time, that particular relay cooperates with the source to jam the eavesdropper without creating interference at the destination. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise are proposed. It is shown that the secrecy rate of the proposed scheme scales with the total system powerP0and the number of available relaysKaccording to 1/2log2(1 +P0/8logK) - 1.6 bits/channel use . Although the proposed power allocation and relay selection assume global CSI available, the performance under imperfect relay CSI is also investigated. Also, the performance under distributed relay selection with limited feedback is demonstrated.
Physical layer security is an emerging security area that achieves perfect secrecy data transmission between intended network nodes, while malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdroppers. We investigate the interaction between the source that transmits the useful data and friendly jammers who assist the source by "masking" the eavesdropper. To obtain distributed solution, we introduce a game theoretic approach. The game is defined such that the source pays the jammers to interfere the eavesdropper, therefore, increasing the secrecy capacity. The friendly jammers charge the source with a certain price for the jamming, and there is a tradeoff for the price. If too low, the profit of the jammers is low; and if too high, the source would not buy the "service" (jamming power) or would buy it from other jammers. To analyze the game outcome, we investigate a Stackelburg type of game and construct a distributed algorithm. Our analysis and simulation results show the effectiveness of friendly jamming and the tradeoff for setting the price. The distributed game solution is shown to have similar performances to those of the centralized one.