Secure localization of nodes in wireless sensor networks with limited number of truth tellers

J. G. Alfaro, M. Barbea, E. Kranakis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 7th Annual Communication Networks and Services Research Conference, CNSR 2009
Pages86-93
Number of pages8
DOIs
Publication statusPublished - 17 Jul 2009
Externally publishedYes
Event7th Annual Communication Networks and Services Research Conference, CNSR 2009 - Moncton, NB, Canada
Duration: 11 May 200913 May 2009

Publication series

NameProceedings of the 7th Annual Communication Networks and Services Research Conference, CNSR 2009

Conference

Conference7th Annual Communication Networks and Services Research Conference, CNSR 2009
Country/TerritoryCanada
CityMoncton, NB
Period11/05/0913/05/09

Keywords

  • Network security
  • Secure localization
  • Sensor networks
  • Wireless security

Fingerprint

Dive into the research topics of 'Secure localization of nodes in wireless sensor networks with limited number of truth tellers'. Together they form a unique fingerprint.

Cite this