DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2013.30
Nicola Basilico , University of California, Merced
Nicola Gatti , Politecnico di Milano, Milan
Mattia Monga , UniversitÓ degli Studi di Milano, Milan
Sabrina Sicari , UniversitÓ degli Studi dell'Insubria, Varese
Most applications of Wireless Sensor Networks rely on the positions of sensor nodes, which are not necessarily known beforehand. Several localization approaches have been proposed but most of them omit to consider that WSNs could be deployed in adversarial settings. Verifiable Multilateration (VM) was proposed to cope with this problem by leveraging on a set of trusted landmark nodes that act as verifiers. Although VM is able to recognize reliable localization measures, it allows for regions of undecided positions that can amount to the 40% of the monitored area. We studied VM as a non-cooperative two-player game where the first player employs a number of verifiers to do VM computations and the second player controls a malicious node. The verifiers aim at localizing malicious nodes, while malicious nodes strive to masquerade and to pretend false positions. Thanks to game theory, the potentialities of VM are analyzed with the aim of improving the defender's strategy. We found that the best placement for verifiers is an equilateral triangle with edge equal to the power range $R$, and maximum deception in the undecided region is approximately 0.27R. Moreover, we characterized in terms of the probability of choosing an unknown node to examine further the strategies of the players.
Games, Monitoring, Robustness, Wireless sensor networks, Electronic mail, Game theory, Intelligent agents, Physical security, Artificial Intelligence
N. Basilico, N. Gatti, M. Monga and S. Sicari, "Security Games for Node Localization through Verifiable Multilateration," in IEEE Transactions on Dependable and Secure Computing.