Please use this identifier to cite or link to this item:
Title: Antieavesdropping with selfish jamming in wireless networks : a Bertrand game approach antieavesdropping with selfish jamming in wireless networks : a Bertrand game approach
Authors: Wang, K
Yuan, L
Miyazaki, T
Guo, S 
Sun, YF
Keywords: Bertrand game
Game theory
Wireless networks
Issue Date: 2017
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on vehicular technology, 2017, v. 66, no. 7, p. 6268-6279 How to cite?
Journal: IEEE transactions on vehicular technology 
Abstract: Wireless communications are vulnerable to eavesdropping attacks due to their broadcast nature. To deal with their emerging challenge of physical layer security, in this paper, we study the antieavesdropping problem in the presence of selfish jammers, who desire to achieve maximum profit for themselves. We consider both the single-channel multijammer (SCMJ) model and the multichannel single-jammer (MCSJ) model. We investigate the interaction between the source that transmits secret information and friendly jammer nodes who assist the source by interfering with the eavesdropper. This problem is formulated as an oligopoly market consisting of a few firms and a buyer. By modeling the problem as a Bertrand game based on price competition, we obtain the optimal pricing scheme for the friendly, while for selfish jammers, the utility of those jammers is maximized. For the SCMJ model, we prove the existence of Bertrand Equilibrium by deriving a closed-form expression for the optimal price strategy. For the MCSJ model, a closed-form expression for power allocation is derived, based on which a new algorithm is designed to obtain the optimal strategy of the jammer. Finally, via simulations, we verify our theoretical analysis.
ISSN: 0018-9545
EISSN: 1939-9359
DOI: 10.1109/TVT.2016.2639827
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Citations as of May 11, 2018


Last Week
Last month
Citations as of May 20, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.