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

CRC Press eBooks

Ascending Clock Auction for Physical Layer Security

Xiangyun Zhou, Lingyang Song, Yan Zhang

Published Nov 7, 2013• 3 citations
Publisher

Abstract

Physical layer security is an emerging security research area that explores the possibilities of achieving perfect secrecy data transmission between sources and intended destinations, while possible malicious eavesdroppers who intend to eavesdrop the communication links obtain zero information. However, such a security is determined by the wireless channel conditions: if the channel between source and destination is worse than the channel between source and eavesdropper, the secrecy rate is typically zero. To overcome this limitation, cooperative jamming is considered as a promising approach where selected jammers can transmit jamming signals to interfere with the malicious eavesdroppers and thus the secrecy capacity can be effectively improved. In this chapter, we consider the jamming power allocation issue in a jammer-assisted cooperative wireless network. The secrecy rate of the source-destination links can be optimized utilizing a well-chosen amount of jamming power from the friendly jammer, and thus each source that can benefit intends to obtain an optimal jamming power to maximize its secrecy rate for data transmission. Then, the problem comes to how to effectively allocate the limited jamming power owned by the friendly jammer among the sources in demand to achieve an optimized system performance. By considering the friendly jammer as the auctioneer and the sources as the bidders, we formulate this power allocation problem as an auction game model, and introduce three distributed auction-based power allocation schemes, i.e., Power allocation scheme based on Single object pay-as-bid Ascending Clock Auction (P-ACA-S), Power allocation scheme based on Traditional Ascending Clock Auction (P-ACA-T), and Power Allocation Scheme based on Alternative Ascending Clock Auction (P-ACA-A). In addition, we investigate some basic properties of the proposed three auction-based power allocation schemes, i.e., convergence, cheat-proof property, and social welfare maximization.

DOI
10.1201/b15496-15

Related papers

Improve physical layer security in cooperative wireless network using distributed auction games

Rongqing Zhang, Lingyang Song, Zhu Han +1 more

In this paper, we investigate a cooperative wireless network with jamming-based secure communications, where a friendly jammer can transmit jamming signals to interfere the malicious eavesdropper. We find that the secrecy rate of the source-destination link can be effectively improved with the help of the friendly jammer, and each source intends to obtain optimal jamming power from the friendly jammer to maximize its secrecy rate for data transmission. We then formulate this power allocation problem as an auction game and propose two distributively auction-based power allocation schemes, which are power allocation using Traditional Ascending Clock Auction (ACA-T) and power allocation using Alternative Ascending Clock Auction (ACA-A), considering the friendly jammer as the auctioneer and the sources as the bidders. In addition, we prove that both the proposed schemes can converge in a finite number of iterations. We also prove that the ACA-A scheme is cheat-proof while the ACA-T scheme is not. Finally, simulation results are presented to demonstrate the efficiency of the proposed auction-based schemes in improving secrecy rate of wireless networks.

IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)•Apr 1, 2011•42 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

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

Physical layer security for multiuser two-way relay using distributed auction game

An Wang, Yueming Cai, Xinrong Guan +1 more

In this paper, we investigate jamming power allocation to improve physical layer security in a multiuser two-way relay network, where several communication pairs, one untrusted relay and one friendly jammer are involved. The untrusted relay helps these pairs to forward information and tries to eavesdrop simultaneously. In order to deteriorate the eavesdropping link and to improve physical layer security, we introduce a friendly jammer to impose interference on the relay. We formulate the jamming power allocation as an ACA-A game, where the friendly jammer is modeled as the auctioneer and the pairs are regarded as the bidders. The convergence and the cheat-proof property of the proposed auction are analyzed and proved. Finally, we also carry out some numerical results to validate the effectiveness of the proposed ACA-A based power allocation algorithm.

IEEE International Conference on Information Science and Technology (ICIST)•Mar 1, 2013•5 citations

Stackelberg game in physical security when friendly jammers using beamforming

Zhaoye Xu, Lu Ruimin

To improve the physical layer security in the wireless communication network with an eavesdropper and a friendly jammer, this paper make use of beamforming to aim the jamming signal's main lobe to the eavesdropper and to diminish the jamming signal to the destination node, improving the efficiency of jamming power usage. On this basis, we propose a power auction model, in which we regard the source node as the buyer and the destination node as the seller and build corresponding utility function respectively. Then by using a distributed algorithm, Stackelberg equilibrium can be reached, maximizing the system utility and obtaining the corresponding secrecy capacity.

International Conference on Electronics Instrumentation & Information Systems (EIIS)•Jun 1, 2017•1 citation

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 is an emerging security research area that explores the possibilities of achieving perfect secrecy data transmission between sources and intended destinations, while possible malicious eavesdroppers who intend to eavesdrop the communication links obtain zero information. However, such a security is determined by the wireless channel conditions: if the channel between source and destination is worse than the channel between source and eavesdropper, the secrecy rate is typically zero. To overcome this limitation, cooperative jamming is considered as a promising approach where selected jammers can transmit jamming signals to interfere with the malicious eavesdroppers and thus the secrecy capacity can be effectively improved. In this chapter, we consider the jamming power allocation issue in a jammer-assisted cooperative wireless network. The secrecy rate of the source-destination links can be optimized utilizing a well-chosen amount of jamming power from the friendly jammer, and thus each source that can benefit intends to obtain an optimal jamming power to maximize its secrecy rate for data transmission. Then, the problem comes to how to effectively allocate the limited jamming power owned by the friendly jammer among the sources in demand to achieve an optimized system performance. By considering the friendly jammer as the auctioneer and the sources as the bidders, we formulate this power allocation problem as an auction game model, and introduce three distributed auction-based power allocation schemes, i.e., Power allocation scheme based on Single object pay-as-bid Ascending Clock Auction (P-ACA-S), Power allocation scheme based on Traditional Ascending Clock Auction (P-ACA-T), and Power Allocation Scheme based on Alternative Ascending Clock Auction (P-ACA-A). In addition, we investigate some basic properties of the proposed three auction-based power allocation schemes, i.e., convergence, cheat-proof property, and social welfare maximization.
In this paper, we investigate a cooperative wireless network with jamming-based secure communications, where a friendly jammer can transmit jamming signals to interfere the malicious eavesdropper. We find that the secrecy rate of the source-destination link can be effectively improved with the help of the friendly jammer, and each source intends to obtain optimal jamming power from the friendly jammer to maximize its secrecy rate for data transmission. We then formulate this power allocation problem as an auction game and propose two distributively auction-based power allocation schemes, which are power allocation using Traditional Ascending Clock Auction (ACA-T) and power allocation using Alternative Ascending Clock Auction (ACA-A), considering the friendly jammer as the auctioneer and the sources as the bidders. In addition, we prove that both the proposed schemes can converge in a finite number of iterations. We also prove that the ACA-A scheme is cheat-proof while the ACA-T scheme is not. Finally, simulation results are presented to demonstrate the efficiency of the proposed auction-based schemes in improving secrecy rate of wireless networks.
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.
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.
In this paper, we investigate jamming power allocation to improve physical layer security in a multiuser two-way relay network, where several communication pairs, one untrusted relay and one friendly jammer are involved. The untrusted relay helps these pairs to forward information and tries to eavesdrop simultaneously. In order to deteriorate the eavesdropping link and to improve physical layer security, we introduce a friendly jammer to impose interference on the relay. We formulate the jamming power allocation as an ACA-A game, where the friendly jammer is modeled as the auctioneer and the pairs are regarded as the bidders. The convergence and the cheat-proof property of the proposed auction are analyzed and proved. Finally, we also carry out some numerical results to validate the effectiveness of the proposed ACA-A based power allocation algorithm.
To improve the physical layer security in the wireless communication network with an eavesdropper and a friendly jammer, this paper make use of beamforming to aim the jamming signal's main lobe to the eavesdropper and to diminish the jamming signal to the destination node, improving the efficiency of jamming power usage. On this basis, we propose a power auction model, in which we regard the source node as the buyer and the destination node as the seller and build corresponding utility function respectively. Then by using a distributed algorithm, Stackelberg equilibrium can be reached, maximizing the system utility and obtaining the corresponding secrecy capacity.
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.