By Topic

Secure Localization of Nodes in Wireless Sensor Networks with Limited Number of Truth Tellers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Alfaro, J.G. ; Sch. of Comput. Sci., Carleton Univ., Ottawa, ON ; Barbeau, M. ; Kranakis, E.

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 for a given number of neighbors provided that the number of liars is below a certain threshold value, which is also determined.

Published in:

Communication Networks and Services Research Conference, 2009. CNSR '09. Seventh Annual

Date of Conference:

11-13 May 2009