Game theoretic modeling of jamming attack in wireless powered communication networks
- Authors
- Niyato D.[Niyato D.]; Wang P.[Wang P.]; Kim D.I.[Kim D.I.]; Han Z.[Han Z.]; Xiao L.[Xiao L.]
- Issue Date
- 2015
- Keywords
- constrained stochastic game; wireless jamming; Wireless powered communication networks
- Citation
- IEEE International Conference on Communications, v.2015-September, pp.6018 - 6023
- Journal Title
- IEEE International Conference on Communications
- Volume
- 2015-September
- Start Page
- 6018
- End Page
- 6023
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/48621
- DOI
- 10.1109/ICC.2015.7249281
- Abstract
- In wireless powered networks, a user can make a request and use the wireless energy transferred from an energy source for its data transmission. However, due to broadcast nature of wireless energy transfer (e.g., RF energy), a malicious node (i.e., an attacker) can also intercept the energy and use it to perform an attack by jamming the data transmission of the user. We consider such a jamming attack where the user and attacker are aware of each other. We formulate a game theoretic model to analyze the energy request and data transmission policy of the user and the attack policy of the attacker when the user and the attacker both want to maximize their own rewards. We use an iterative algorithm designed based on the best response dynamics to obtain the solution defined in terms of the constrained Nash equilibrium. The numerical results show not only the convergence of the proposed algorithm, but also the optimal reward of the user under different energy cost constraints. © 2015 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Information and Communication Engineering > School of Electronic and Electrical Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/48621)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.