{"title":"异质点覆盖的传感器放置","authors":"Ravanbakhsh Akhlaghinia, S. Hashemi, B. Shadgar","doi":"10.1109/ICCNT.2010.11","DOIUrl":null,"url":null,"abstract":"Sensor placement in a wireless sensor network, that consists of a number of target points, determines number and locations of sensors required to cover the points. In this paper, we define a sensor placement problem called HPC to cover a large number of target points with various coverage requirements using a minimal number of sensors. We divide this problem into sub-problems and then design an algorithm for finding an approximate solution to this problem. Also, we develop a software tool containing the implementation of our algorithm that graphically displays network model and placement. Our evaluation experiments show the performance of the proposed algorithm.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Sensor Placement for Heterogenous Point Coverage\",\"authors\":\"Ravanbakhsh Akhlaghinia, S. Hashemi, B. Shadgar\",\"doi\":\"10.1109/ICCNT.2010.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sensor placement in a wireless sensor network, that consists of a number of target points, determines number and locations of sensors required to cover the points. In this paper, we define a sensor placement problem called HPC to cover a large number of target points with various coverage requirements using a minimal number of sensors. We divide this problem into sub-problems and then design an algorithm for finding an approximate solution to this problem. Also, we develop a software tool containing the implementation of our algorithm that graphically displays network model and placement. Our evaluation experiments show the performance of the proposed algorithm.\",\"PeriodicalId\":135847,\"journal\":{\"name\":\"2010 Second International Conference on Computer and Network Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Computer and Network Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNT.2010.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computer and Network Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNT.2010.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Sensor placement in a wireless sensor network, that consists of a number of target points, determines number and locations of sensors required to cover the points. In this paper, we define a sensor placement problem called HPC to cover a large number of target points with various coverage requirements using a minimal number of sensors. We divide this problem into sub-problems and then design an algorithm for finding an approximate solution to this problem. Also, we develop a software tool containing the implementation of our algorithm that graphically displays network model and placement. Our evaluation experiments show the performance of the proposed algorithm.