{'fraction_non_alphanumeric': 0.015513126491646777, 'fraction_numerical': 0.0, 'mean_word_length': 4.950354609929078, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Jamming in wireless networks with cooperative jammers

The problem of jamming plays a very important role in ensuring the quality and security of wireless communications, especially now when wireless networks are quickly becoming ubiquitous. Since jamming phenomenon can be considered as a game where a player (say, jammer) is playing against a user (transmitter), game theory is an appropriate tool for dealing with the jamming problem. In this paper we study how increasing number of jammers impacts the game. Namely, we consider plots with M jammers and as an objective function to the user we consider SINR and Shannon capacity. For both objective functions we have shown that the jammers employ time sharing strategies to bring the maximal harm and we produce a finite step algorithm allowing to find the saddle point in closed form.