{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
