Modeling DoS attacks in WSNs with quantitative games
Quentin Monnet, Mathieu Sassolas, Lynda Mokdad · 2017
In this article, we propose to use game theory to model our WSN network. In this setting, the goal of the compromised node is to keep disrupting the network while remaining alive. The game studied is a two-player quantitative infinite game on a finite graph, where each transition can change some energy levels and some reward. The goal of the compromised node is hence to maximize its reward while maintaining a positive energy level. On the theoretical side, we show that solving these games is not algorithmically possible if the objective is too complex. We can however provide solutions in some restricted cases. The ultimate purpose is to demonstrate that, with the presented detection solution, a compromised node cannot “win the game”, and hence either gets detected, dies, or behaves as an normal (sane) node would.