{"title":"Optimality measures for coverage in 3D wireless sensor networks","authors":"M. Watfa, S. Commuri","doi":"10.1109/ISWPC.2006.1613653","DOIUrl":null,"url":null,"abstract":"Sensor networks are becoming increasingly important as tools for monitoring remote environments. Networking together hundreds or thousands of inexpensive sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. In this paper, contrary to existing techniques, the deployment and coverage problems in a three dimensional space are studied. A solution to the problem of optimal node 3D placement and algorithms for minimizing the number of active nodes while covering a region are presented. The minimum number of nodes will serve as optimality measures for coverage in three dimensional space.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 1st International Symposium on Wireless Pervasive Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWPC.2006.1613653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Sensor networks are becoming increasingly important as tools for monitoring remote environments. Networking together hundreds or thousands of inexpensive sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. In this paper, contrary to existing techniques, the deployment and coverage problems in a three dimensional space are studied. A solution to the problem of optimal node 3D placement and algorithms for minimizing the number of active nodes while covering a region are presented. The minimum number of nodes will serve as optimality measures for coverage in three dimensional space.