By Topic

Geometric algorithms for target localization and tracking under location uncertainties in wireless 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

2 Author(s)
Khuong Vu ; Dept. of Comput. Sci., Univ. of Houston, Houston, TX, USA ; Rong Zheng

Since the onset of wireless sensor networks, target localization and tracking have received much attention in a wide range of applications including battle field surveillance, wildlife monitoring and border security. However, little work has been done that addresses the realistic considerations of uncertainties in sensor locations and evaluates their impacts on the accuracy of target localization and tracking. In this paper, we carry out a rigorous study of these problems using a computational geometry approach. We introduce the geometric structures of order-k max and min Voronoi Diagrams (VDs) and propose an algorithm to construct these diagrams. Based on order-k max and min VDs, efficient algorithms are developed to evaluate the likelihood of noisy sensor readings and kNN queries, which serve as building blocks in target localization and tracking under sensor location uncertainties.

Published in:

INFOCOM, 2012 Proceedings IEEE

Date of Conference:

25-30 March 2012