Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Second order cone programming for sensor network localization with anchor position uncertainty

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)
Shirazi, G.N. ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada ; Shenouda, M.B. ; Lampe, L.

We consider the problem of node localization in sensor networks, and we focus on networks in which the ranging measurements are subject to errors and anchor positions are subject to uncertainty. We consider a statistical model for the uncertainty in the anchor positions and formulate the robust localization problem that finds a maximum likelihood estimation of the node positions. To overcome the non-convexity of the resulting optimization problem, we obtain a convex relaxation that is based on the second order cone programming (SOCP). We also propose a possible distributed implementation using the SOCP convex relaxation. We present numerical studies that compare the presented approach to other existing convex relaxations for the robust localization problem in terms of positioning error and computational complexity.

Published in:

Positioning Navigation and Communication (WPNC), 2011 8th Workshop on

Date of Conference:

7-8 April 2011