We provide in this paper three algorithms that enable the sensor nodes of a Wireless Sensor Network (WSN) to determine their location in presence of neighbor sensors that may lie about their position. Our algorithms minimize the number of trusted nodes required by regular nodes to complete their process of localization. The algorithms always work or a given number of neighbors provided that the number of liars is below a certain threshold value, which is also determined.

Additional Metadata
Keywords Network security, Secure localization, Sensor networks, Wireless security
Persistent URL dx.doi.org/10.1109/CNSR.2009.23
Conference 7th Annual Communication Networks and Services Research Conference, CNSR 2009
Citation
Alfaro, J.G., Barbea, M., & Kranakis, E. (2009). Secure localization of nodes in wireless sensor networks with limited number of truth tellers. Presented at the 7th Annual Communication Networks and Services Research Conference, CNSR 2009. doi:10.1109/CNSR.2009.23