By Topic

Sensor location through linear programming with triangle inequality constraints

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

1 Author(s)
C. Gentile ; Wireless Commun. Technol. Group, Nat. Inst. of Stand. & Technol., MD, USA

Interest in dense sensor networks due to falling price and reduced size has motivated research in sensor location in recent years. While many algorithms can be found in the literature, no benchmark exists and most papers fail to compare their results to other competing algorithms. To our knowledge, the algorithm which achieves the best performance in sensor location uses semidefinite relaxation of a quadratic program to solve for sensor location. We propose solving the same program, however without relaxing the constraints, but rather transforming them into linear triangle inequality constraints. Our linear program ensures a tighter solution to the problem. We benchmark ours against the competing algorithm, and provide extensive experimentation to substantiate the robustness of our algorithm even in the presence of high levels of noise.

Published in:

IEEE International Conference on Communications, 2005. ICC 2005. 2005  (Volume:5 )

Date of Conference:

16-20 May 2005