{"title":"一种优化传感器布置的迭代离散化方法","authors":"M. Moumni, H. Zahaf, Lakhdar Loukil, A. Benyamina","doi":"10.1109/EDiS57230.2022.9996475","DOIUrl":null,"url":null,"abstract":"The technology of the internet of things (IoT) describes wireless sensor network devices able to quantify physical phenomena in a digital data format and send them to a base station to analyze. Their performance, however, is highly reliant on the problem of sensor node placement. An efficient deployment approach is required to improve network performance. In this paper, we suggest a novel deployment approach using a regular square grid pattern. The suggested method reduces iteratively the scale of dis-cretization until it gets to the scale that can be used to solve the problem. The suggested method considers the coverage problem. We compared our suggested strategy to the standard way of solving the problem. According to simulation findings, our method outperforms the existing workflow in terms of time to solve the problem while lowering the number of deployed nodes.","PeriodicalId":288133,"journal":{"name":"2022 3rd International Conference on Embedded & Distributed Systems (EDiS)","volume":"83 22","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Toward an iterative discretization approach for optimal sensor placement\",\"authors\":\"M. Moumni, H. Zahaf, Lakhdar Loukil, A. Benyamina\",\"doi\":\"10.1109/EDiS57230.2022.9996475\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The technology of the internet of things (IoT) describes wireless sensor network devices able to quantify physical phenomena in a digital data format and send them to a base station to analyze. Their performance, however, is highly reliant on the problem of sensor node placement. An efficient deployment approach is required to improve network performance. In this paper, we suggest a novel deployment approach using a regular square grid pattern. The suggested method reduces iteratively the scale of dis-cretization until it gets to the scale that can be used to solve the problem. The suggested method considers the coverage problem. We compared our suggested strategy to the standard way of solving the problem. According to simulation findings, our method outperforms the existing workflow in terms of time to solve the problem while lowering the number of deployed nodes.\",\"PeriodicalId\":288133,\"journal\":{\"name\":\"2022 3rd International Conference on Embedded & Distributed Systems (EDiS)\",\"volume\":\"83 22\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 3rd International Conference on Embedded & Distributed Systems (EDiS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDiS57230.2022.9996475\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 3rd International Conference on Embedded & Distributed Systems (EDiS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDiS57230.2022.9996475","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Toward an iterative discretization approach for optimal sensor placement
The technology of the internet of things (IoT) describes wireless sensor network devices able to quantify physical phenomena in a digital data format and send them to a base station to analyze. Their performance, however, is highly reliant on the problem of sensor node placement. An efficient deployment approach is required to improve network performance. In this paper, we suggest a novel deployment approach using a regular square grid pattern. The suggested method reduces iteratively the scale of dis-cretization until it gets to the scale that can be used to solve the problem. The suggested method considers the coverage problem. We compared our suggested strategy to the standard way of solving the problem. According to simulation findings, our method outperforms the existing workflow in terms of time to solve the problem while lowering the number of deployed nodes.