最小的传感器完整性传感器网格

Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997) Pub Date : 2002-07-08 DOI:10.1109/ICIF.2002.1020915

R. Kannan, S. Sarangi, S. Ray, S. S. Iyengar

{"title":"最小的传感器完整性传感器网格","authors":"R. Kannan, S. Sarangi, S. Ray, S. S. Iyengar","doi":"10.1109/ICIF.2002.1020915","DOIUrl":null,"url":null,"abstract":"We define the problem of maximal sensor integrity placement, that of locating sensors in n-dimensional grids with minimal vulnerability to enemy attack or sensor faults. We show a polynomial time algorithm for computing sensor integrity exists for sensors with unbounded ranges deployed over a 1D grid of points. We then present an integer linear programming (ILP) formulation for computing sensor integrity for unbounded range sensors over higher dimension grids.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Minimal sensor integrity in sensor grids\",\"authors\":\"R. Kannan, S. Sarangi, S. Ray, S. S. Iyengar\",\"doi\":\"10.1109/ICIF.2002.1020915\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We define the problem of maximal sensor integrity placement, that of locating sensors in n-dimensional grids with minimal vulnerability to enemy attack or sensor faults. We show a polynomial time algorithm for computing sensor integrity exists for sensors with unbounded ranges deployed over a 1D grid of points. We then present an integer linear programming (ILP) formulation for computing sensor integrity for unbounded range sensors over higher dimension grids.\",\"PeriodicalId\":399150,\"journal\":{\"name\":\"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)\",\"volume\":\"188 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIF.2002.1020915\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIF.2002.1020915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们定义了最大传感器完整性放置问题，即在n维网格中定位传感器，使其对敌人攻击或传感器故障的脆弱性最小。我们展示了一种多项式时间算法，用于计算在一维点网格上部署的无界范围传感器的完整性。然后，我们提出了一个整数线性规划(ILP)公式，用于计算高维网格上无界距离传感器的传感器完整性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Minimal sensor integrity in sensor grids

We define the problem of maximal sensor integrity placement, that of locating sensors in n-dimensional grids with minimal vulnerability to enemy attack or sensor faults. We show a polynomial time algorithm for computing sensor integrity exists for sensors with unbounded ranges deployed over a 1D grid of points. We then present an integer linear programming (ILP) formulation for computing sensor integrity for unbounded range sensors over higher dimension grids.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)

自引率

0.00%

发文量