NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
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 Arrival Angle Constraints
Published
Author(s)
Camillo Gentile, J Shiu
Abstract
In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Besides providing greater accuracy compared to other techniques, linear programs in particular suit large networks since they can be solved efficiently through distributed computing over the nodes without compromising the optimality of the objective function. This work extends our framework to determine sensor location from measured arrival angles instead. An extensive simulation suite substantiates the performance of the algorithm according to several network parameters, including noise up to 15% the maximum error; the proposed algorithm reduces the error up to 84% depending on the noise level.
Conference Location
, USA
Conference Title
IEEE Conference on Information Sciences and Systems
Gentile, C.
and Shiu, J.
(2007),
Sensor Location through Linear Programming with Arrival Angle Constraints, IEEE Conference on Information Sciences and Systems, , USA, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=51155
(Accessed October 2, 2025)