Smart Jammer and LTE Network Strategies in An Infinite-Horizon Zero-Sum Repeated Game with Asymmetric and Incomplete Information

04/25/2019
by   Farhan M. Aziz, et al.
0

LTE/LTE-Advanced networks are known to be vulnerable to denial-of-service and loss-of-service attacks from smart jammers. In this article, the interaction between a smart jammer and LTE network is modeled as an infinite-horizon, zero-sum, asymmetric repeated game. The smart jammer and eNode B are modeled as the informed and the uninformed player, respectively. The main purpose of this article is to construct efficient suboptimal strategies for both players that can be used to solve the above-mentioned infinite-horizon repeated game with asymmetric and incomplete information. It has been shown in game-theoretic literature that security strategies provide optimal solution in zero-sum games. It is also shown that both players' security strategies in an infinite-horizon asymmetric game depend only on the history of the informed player's actions. However, fixed-sized sufficient statistics are needed for both players to solve the above-mentioned game efficiently. The smart jammer uses its evolving belief state as the fixed-sized sufficient statistics for the repeated game. Whereas, the LTE network (uninformed player) uses worst-case regret of its security strategy and its anti-discounted update as the fixed-sized sufficient statistics. Although fixed-sized sufficient statistics are employed by both players, optimal security strategy computation in λ-discounted asymmetric games is still hard to perform because of non-convexity. Hence, the problem is convexified in this article by devising `approximated' security strategies for both players that are based on approximated optimal game value. However, `approximated' strategies require full monitoring. Therefore, a simplistic yet effective `expected' strategy is also constructed for the LTE network that does not require full monitoring. The simulation results show that the smart jammer plays non-revealing and misleading strategies.

READ FULL TEXT
research
07/02/2018

Zero-determinant strategies in repeated incomplete-information games: Consistency of payoff relations

We derive zero-determinant strategies for general multi-player multi-act...
research
11/07/2017

Security Strategies of Both Players in Asymmetric Information Zero-Sum Stochastic Games with an Informed Controller

This paper considers a zero-sum two-player asymmetric information stocha...
research
09/03/2019

Zero-sum Stochastic Games with Asymmetric Information

A general model for zero-sum stochastic games with asymmetric informatio...
research
07/09/2022

Efficient Stackelberg Strategies for Finitely Repeated Games

We study the problem of efficiently computing optimal strategies in asym...
research
09/28/2016

Approachability of convex sets in generalized quitting games

We consider Blackwell approachability, a very powerful and geometric too...
research
09/28/2020

Zero Knowledge Games

Zero-knowledge strategies as a form of inference and reasoning operate u...
research
02/10/2020

On the effect of symmetry requirement for rendezvous on the complete graph

We consider a classic rendezvous game where two players try to meet each...

Please sign up or login with your details

Forgot password? Click here to reset