Game theoretic secure localization in wireless sensor networks.

Susmit Jha, Stavros Tripakis, Sanjit A. Seshia, Krishnendu Chatterjee. Game theoretic secure localization in wireless sensor networks. Internet of Things (IOT), 2014


Final IOT Version at IEEE Explore Digital Library
Draft at UCB (pdf)  


Wireless sensor networks (WSNs) composed of low-power, low-cost sensor nodes are expected to form the backbone of future intelligent networks for a broad range of civil, industrial and military applications. These sensor nodes are often deployed through random spreading, and function in dynamic environments. Many applications of WSNs such as pollution tracking, forest fire detection, and military surveillance require knowledge of the location of constituent nodes. But the use of technologies such as GPS on all nodes is prohibitive due to power and cost constraints. So, the sensor nodes need to autonomously determine their locations. Most localization techniques use anchor nodes with known locations to determine the position of remaining nodes. Localization techniques have two conflicting requirements. On one hand, an ideal localization technique should be computationally simple and on the other hand, it must be resistant to attacks that compromise anchor nodes. In this paper, we propose a computationally light-weight game theoretic secure localization technique and demonstrate its effectiveness in comparison to existing techniques.


  title={Game theoretic secure localization in wireless sensor networks},
  author={Jha, Susmit and Tripakis, Stavros and Seshia, Sanjit A and Chatterjee, Krishnendu},
  booktitle={Internet of Things (IOT), 2014 International Conference on the},