Gentile, C.
(2005),
Sensor Location through Linear Programming with Triangle Inequality Constraints, Proceeding IEEE 2005 International Conference on Communications paper WN13-1, Seoul, , [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=150103
(Accessed December 14, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Sensor Location through Linear Programming with Triangle Inequality Constraints
Published
Author(s)
Abstract
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 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 semi-definite relaxation of a quadratic program to solve the 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.Proceedings Title
Proceeding IEEE 2005 International Conference on Communications paper WN13-1
Conference Dates
May 16-20, 2005
Conference Location
Seoul,
Pub Type
Conferences
Download Paper
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created October 1, 2005, Updated February 19, 2017