@COMMENT This file was generated by bib2html.pl version 0.94
@COMMENT written by Patrick Riley
@COMMENT This file came from Sanjit Seshia's publication pages at http://www.eecs.berkeley.edu/~sseshia
@InProceedings{jha-iot14,
author = {Susmit Jha and Krishnendu Chatterjee and Sanjit A. Seshia and Stavros Tripakis},
title = {Game-Theoretic Secure Localization in Wireless Sensor Networks},
booktitle = {Proceedings of the 4th International Conference on the Internet of Things (IoT)},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {2014},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
month = {October},
OPTorganization = {},
OPTpublisher = {},
OPTannote = {},
abstract={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.},
}