Sensor Location through Linear Programming with Arrival Angle Constraints

C. Gentile, John Shiu
{"title":"Sensor Location through Linear Programming with Arrival Angle Constraints","authors":"C. Gentile, John Shiu","doi":"10.1109/CISS.2007.4298378","DOIUrl":null,"url":null,"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.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 41st Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2007.4298378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

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.
基于到达角约束的线性规划传感器定位
在之前的工作中,我们建立了一个线性规划框架,通过测量网络中相邻节点之间的链路距离来确定传感器的位置。除了提供比其他技术更高的准确性之外,线性规划特别适合大型网络,因为它们可以通过节点上的分布式计算有效地解决,而不会损害目标函数的最优性。这项工作扩展了我们的框架,以确定传感器的位置,而不是从测量的到达角度。广泛的仿真套件根据几个网络参数证实了该算法的性能,包括噪声高达最大误差的15%;该算法对噪声水平的误差最大可达84%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信