Abstract
We consider a user’s communication with a receiver in presence of a jammer, in the most competitive situation for user and jammer when they do not have access to complete information on channel gains of each other although they could have access to exact information on their own channel gains. The problem is modeled as a Bayesian power control game between user and jammer as players. Incomplete information is modeled as statistical data over possible channel gains (also referred as channel states). Since channel gain is a function on the distance to the receiver, this also covers scenarios where the user and jammer could know its own location via global positioning system (GPS), but none of them know the exact location of the other. A novel approach is suggested to derive equilibrium of such problems in closed form for two communication metrics: signal-to-interference-plus-noise ratio (SINR) metric, reflecting regular data transmission, and latency metric, reflecting emergency data transmission. In particular, it is shown that the user’s equilibrium strategies corresponding to the latency metric is more sensitive to the a priori statistical information, as compared to the SINR metric. This reflects an advantage of implementing latency metric in case of availability of exact information on network parameters, and an advantage of implementing SINR metric in case of lack of such its availability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
We use bold font in vector’s notations.
References
Altman, E., Avrachenkov, K., Garnaev, A.: Generalized \(\alpha \)-fair resource allocation in wireless networks. In: Proceedings of 47th IEEE Conference on Decision and Control, pp. 2414–2419 (2008)
Altman, E., Avrachenkov, K., Garnaev, A.: Jamming in wireless networks under uncertainty. Mobile Netw. Appl. 16, 246–254 (2011)
Aziz, F., Shamma, J., Stuber, G.L.: Jammer type estimation in LTE with a smart jammer repeated game. IEEE Trans. Veh. Technol. 66, 7422–7431 (2017)
Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Boston, MA (1991)
Gao, Y., Xiao, Y., Wu, M., Xiao, M., Shao, J.: Game theory-based anti-jamming strategies for frequency hopping wireless communications. IEEE Trans. Wirel. Commun. 17, 5314–5326 (2018)
Garnaev, A., Hayel, Y., Altman, E.: A Bayesian jamming game in an OFDM wireless network. In: Proceedings of 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WIOPT), pp. 41–48 (2012)
Garnaev, A., Petropulu, A., Trappe, W., Poor, H.V.: A power control game with uncertainty on the type of the jammer. In: Proceedings of IEEE Global Conference on Signal and Information Processing (GlobalSIP) (2019)
Garnaev, A., Petropulu, A., Trappe, W., Poor, H.V.: A jamming game with rival-type uncertainty. IEEE Trans. Wirel. Commun. 19, 5359–5372 (2020)
Garnaev, A., Petropulu, A., Trappe, W., Poor, H.V.: A multi-jammer game with latency as the user’s communication utility. IEEE Commun. Lett. 24, 1899–1903 (2020)
He, G., Debbah, M., Altman, E.: \(k\)-player Bayesian waterfilling game for fading multiple access channels. In: Proceedings of 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), pp. 17–20 (2009)
Inaltekin, H., Wicker, S.B.: Random access games: Selfish nodes with incomplete information. In: Proceedings of IEEE Military Communications Conference (MILCOM) (2007)
Li, Y., Xiao, L., Liu, J., Tang, Y.: Power control Stackelberg game in cooperative anti-jamming communications. In: Proceedings of 5th International Conference on Game Theory for Networks, pp. 1–6 (2014)
Sagduyu, Y.E., Berry, R., Ephremides, A.: MAC games for distributed wireless network security with incomplete information of selfish and malicious user types. In: Proceedings of International Conference on Game Theory for Networks (2009)
Scalabrin, M., Vadori, V., Guglielmi, A.V., Badia, L.: A zero-sum jamming game with incomplete position information in wireless scenarios. In: Proceedings of 21th European Wireless Conference, pp. 1–6 (2015)
Wang, K., Yuan, L., Miyazaki, T., Chen, Y., Zhang, Y.: Jamming and eavesdropping defense in green cyber-physical transportation systems using a stackelberg game. IEEE Trans. Industr. Inf. 14, 4232–4242 (2018)
Xiao, L., Xie, C., Chen, T., Dai, H., Poor, H.V.: A mobile offloading game against smart attacks. IEEE Access 4, 2281–2291 (2016)
Xu, Y., Ren, G., Chen, J., Luo, Y., Jia, L., Liu, X., Yang, Y., Xu, Y.: A one-leader multi-follower Bayesian-Stackelberg game for anti-jamming transmission in UAV communication networks. IEEE Access 6, 21697–21709 (2018)
Yang, D., Xue, G., Zhang, J., Richa, A., Fang, X.: Coping with a smart jammer in wireless networks: A Stackelberg game approach. IEEE Trans. Wirel. Commun. 12, 4038–4047 (2013)
Yang, D., Zhang, J., Fang, X., Richa, A., Xue, G.: Optimal transmission power control in the presence of a smart jammer. In: Proceedings of IEEE Global Communications Conference (GLOBECOM), pp. 5506–5511 (2012)
Yu, L., Wu, Q., Xu, Y., Ding, G., Jia, L.: Power control games for multi-user anti-jamming communications. Wirel. Netw. 25, 2365–2374 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
Proof of Proposition 1: Since \(v_{J,m}(\boldsymbol{P},J_m)\) is concave in \(J_m\), and \(v_{U,k}(P_k,\boldsymbol{J})\) is linear in \(P_k\), and set of feasible strategies of each player is compact, the result follows from Nash theorem [4].\(\blacksquare \)
Proof of Proposition 2: By (3), \(v_{U,k}(P_k,\boldsymbol{J})\) is linear in \(P_k\). Then, (12) follows from (3) and (7). By (5), we have that
Since \(v_{J,m}(\boldsymbol{P},J_m)\) is concave in \(J_m\), by (8) and (49), we have that
Substituting (49) into (50) and taking into account (6) and (14) imply (13).\(\blacksquare \)
Proof of Proposition 3: By (1) and (12), for a fixed \(\boldsymbol{J}\) there exists an unique \(\tilde{k}(\boldsymbol{J})\in \{0,1,\ldots ,K,K+1\}\) such that
Thus, user’s types equilibrium strategies have to have the form \(\boldsymbol{P}(x)\) given by (18) with an \(x\in [\tilde{k}(\boldsymbol{J})\overline{P}, (\tilde{k}(\boldsymbol{J})+1)\overline{P}).\) To derive an equation to find such x, note that, by (9), \(\boldsymbol{P}(x)\) is user’s types equilibrium strategies if and only if
By (4), (13) and (20), we have that
with \(I_0(x)\triangleq \left\{ m\in \mathcal {M}:\mathcal {H}(x)\le A_m \right\} \), \(I(x)\triangleq \left\{ m\in \mathcal {M}: A_m<\mathcal {H}(x)< B_m\right\} \) and \(\overline{I}(x)\triangleq \left\{ m\in \mathcal {M}: B_m\le \mathcal {H}(x)\right\} .\) By (25) and (26) these sets \(I_0(x)\), I(x) and \(\overline{I}(x)\) can be present in equivalent form given by (22)–(24). Then substituting (12) and (53) into right side of fixed point equation (52), and (18) into its right side imply (19), and the result follows. \(\blacksquare \)
Proof of Theorem 1: Let \(\boldsymbol{P}(x)\) be an equilibrium. Then, by Proposition 3, there are \(\tilde{k}\) and \(x\in [\tilde{k}\overline{P},(\tilde{k}+1)\overline{P})\) such that
with
and
Note that, by (20),
Thus, by (56), if (27) holds then \(x=0,\) and (a) follows. If (28) holds then \(x=K\overline{P},\) and (b) follows. Let (27) and (28) do not hold. Let user’s types equilibrium strategies are given by the right formula in (54). Then, by (55), \(x=\tilde{k}\overline{P},\) and, thus, by (56), (29) holds, and (c-i) follows.
Let user’s types equilibrium strategies are given by the left formula in (54). Then, by (55), \(\tilde{k}\overline{P}<x<(\tilde{k}+1)\overline{P}\), and by (56), \(\mathcal {T}(x)=C_P/h_{\tilde{k}}.\) This equation has a root in \([\tilde{k}\overline{P},(\tilde{k}+1)\overline{P}]\) if and only if (30) holds, and (c-ii) follows. \(\blacksquare \)
Proof of Proposition 4: It is clear that \(v^L_{U,k}(P_k,\boldsymbol{J})\) is concave in \(P_k\) and \(v^L_{J,m}(\boldsymbol{P},J_m)\) is linear in \(J_m\). Thus, by Nash theorem [4], equilibrium exists.\(\blacksquare \)
Proof of Proposition 5: By (34), \(v^L_{J,m}(\boldsymbol{P},J_m)\) is linear in \(J_m\). Then, (37) follows from (34). Further, by (34), we have that
Since \(v^L_{U,k}(P_k,\boldsymbol{J})\) is concave in \(P_k\) and \(v^L_{U,k}(0,\boldsymbol{J})=-\infty \) we have that
Substituting (58) into (59) implies (36). By (34), \(v^L_{J,m}(\boldsymbol{P},J_m)\) is linear in \(J_m\), and, then, (37) immediately follows from (34). \(\blacksquare \)
Proof of Proposition 6: By (2) and (37), for a fixed \(\boldsymbol{P}\) there exists an unique \(\tilde{m}(\boldsymbol{P})\in \{0,1,\ldots ,M,M+1\}\) such that
Thus, jammer’s types equilibrium strategies have to have the form \(\boldsymbol{J}(y)\) given by (39) with \(y\in [\tilde{m}(\boldsymbol{P})\overline{J}, (\tilde{m}(\boldsymbol{P})+1)\overline{J}).\) To derive an equation to find such y, note that, \(\boldsymbol{J}(y)\) is jammer’s types equilibrium strategies if and only if
By (35), (36) and (41)–(43), we have that \(R\left( \text{ BR}_U(\boldsymbol{J}(y))\right) =\mathcal {R}(y). \) Then this, (37), (39) and (61) and (39) imply (40), and the result follows.\(\blacksquare \)
Proof of Theorem 2: By (33) and (39), \(W(\boldsymbol{J}(y))\) is strictly decreasing in \([0,M\overline{J}],\) by (41)–(43), \(\mathcal {R}(y)\) is either constant or strictly increasing in \([0,M\overline{J}].\) Then the result follows from Proposition 6.\(\blacksquare \)
Rights and permissions
Copyright information
© 2024 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Garnaev, A., Trappe, W. (2024). An Anti-jamming Game When None Player Knows Rival’s Channel Gain. In: Kalyvianaki, E., Paolieri, M. (eds) Performance Evaluation Methodologies and Tools. VALUETOOLS 2023. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 539. Springer, Cham. https://doi.org/10.1007/978-3-031-48885-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-48885-6_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-48884-9
Online ISBN: 978-3-031-48885-6
eBook Packages: Computer ScienceComputer Science (R0)