Abstract
Unattended wireless sensor networks are susceptible to node capture attacks, where the adversary physically compromises a node, creates functional copies (clones) of it and deploys such clones back into the network, in order to impact the network’s functionality. In the absence of a centralized authority, distributed clone detection methods have been developed to mitigate this attack. In this paper, we show that the node capture attack and the network response can be modeled as a simultaneous, noncooperative, two-player game. In developing the game-theoretic framework, we consider a deterministic, linear dynamical model of the attack, as well as a general, stochastic model. For the deterministic model, we develop three games, all of which have quadratic utility for the valid network, whereas the adversary’s utility depends on the assumptions about ist abilities. For the stochastic model, we develop a game with convex utility functions. For each game, we prove the existence of a pure strategy Nash Equilibrium and present an efficient way of solving the game. These equilibria can then be used in choosing the appropriate parameters for detecting and responding to the attack. Simulations are provided to illustrate our approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andreson, B.D.O., Moore, J.B.: Optimal control: Linear Quadratic Methods. Dover Publications (2007)
Bertsekas, D.P., Gallager, R.: Data networks, 2nd edn. Prentice-Hall (1992)
Bonaci, T., Bushnell, L., Poovendran, R.: Node capture attacks in wireless sensor networks: A system theoretic approach. In: Proc. of the 49th IEEE Control and Desicion Conference, pp. 6765–6772 (2010)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)
Conti, M., Di Pietro, R., Mancini, L.V., Mei, A.: A randomized, efficient, and distributed protocol for the detection of node replication attacks in wireless sensor networks. In: Proc. of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 80–89 (2007)
Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: Proc. of the 9th ACM Conference on Computer and Communications Security, pp. 41–47 (2002)
Lazos, L., Poovendran, R.: SeRLoc: Robust localization for wireless sensor networks. ACM Trans. on Sensor Networks 1(1), 73–100 (2005)
Li, Z., Gong, G.: Randomly directed exploration: An efficient node clone detection protocol in wireless sensor networks. In: Proc. of the 6th International IEEE Conference on Mobile Adhoc and Sensor Systems, pp. 1030–1035 (2009)
Parno, B., Perrig, A., Gligor, V.D.: Distributed detection of node replication attacks in sensor networks. In: Proc. of the IEEE Symposium on Security and Privacy, pp. 49–63 (2005)
Stinson, D.R.: Cryptography: Theory and Practice. Chapman & Hall/CRC (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonaci, T., Bushnell, L. (2011). Node Capture Games: A Game Theoretic Approach to Modeling and Mitigating Node Capture Attacks. In: Baras, J.S., Katz, J., Altman, E. (eds) Decision and Game Theory for Security. GameSec 2011. Lecture Notes in Computer Science, vol 7037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25280-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-25280-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25279-2
Online ISBN: 978-3-642-25280-8
eBook Packages: Computer ScienceComputer Science (R0)