By Topic

Location Verification Algorithms forWireless Sensor Networks

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
$31 $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)
Yawen Wei ; Iowa State Univ. Ames, Ames, IA ; Zhen Yu ; Guan, Yong

Because the knowledge of sensors' locations is very important to many location-based applications proposed for wireless sensor networks, many secure localization and location verification schemes have been proposed to provide robust location estimations for sensors. We propose two lightweight location verification algorithms, namely, greedy filtering by matrix (GFM) and trustability indicator (TI). Unlike other schemes, our algorithms do not require any specialized hardware or deployment knowledge. In GFM algorithm, the verification center(VC) calculates several matrices based on sensors' estimated locations and their neighborhood observations, and uses these matrixes to identify and revoke inconsistent locations. In TI algorithm, VC calculates trustability indicators for the sensors and reject those whose indicators are below a threshold. Simulation results demonstrated the effectiveness of both algorithms in detecting abnormal location and their robustness under attacks.

Published in:

Distributed Computing Systems, 2007. ICDCS '07. 27th International Conference on

Date of Conference:

25-27 June 2007