Wu, WeiliZhang, ZhaoGao, ChuangenDu, HaiWang, HuaDu, Dingzhu2020-07-312020-07-312019-04-011748-1279http://dx.doi.org/10.1504/IJSNET.2019.098558https://hdl.handle.net/10735.1/8755Due to copyright restrictions and/or publisher's policy full text access from Treasures at UT Dallas is not available. UTD affiliates may be able to acquire a copy through Interlibrary Loan by using the link to UTD ILL.A set of wireless sensors is called a barrier cover if they can monitor the boundary of an area so that an intruder cannot enter the area without being found by any sensor. The quality of a barrier cover is the shortest length of path along which an intruder can enter the area from outside. We study four problems, in this paper, related to the quality of the barrier cover and give their computational complexity and algorithmic solutions.en©2019 Inderscience Enterprises Ltd.Wireless sensor networksComputational complexityAlgorithmsComputer scienceTelecommunicationarticleWu, Weili, Zhao Zhang, Chuangen Gao, Hai Du, et al. 2019. "Quality of barrier cover with wireless sensors." International Journal Of Sensor Networks 29(4): 242-251, doi: 10.1504/IJSNET.2019.098558294