Quality of Barrier Cover with Wireless Sensors

Simple item page
dc.contributor.authorWu, Weili
dc.contributor.authorZhang, Zhao
dc.contributor.authorGao, Chuangen
dc.contributor.authorDu, Hai
dc.contributor.authorWang, Hua
dc.contributor.authorDu, Dingzhu
dc.contributor.utdAuthorWu, Weili
dc.contributor.utdAuthorDu, Dingzhu
dc.date.accessioned2020-07-31T13:34:33Z
dc.date.available2020-07-31T13:34:33Z
dc.date.issued2019-04-01
dc.descriptionDue 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.
dc.description.abstractA 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.
dc.description.departmentErik Jonsson School of Engineering and Computer Science
dc.identifier.bibliographicCitationWu, 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.098558
dc.identifier.issn1748-1279
dc.identifier.issue4
dc.identifier.urihttp://dx.doi.org/10.1504/IJSNET.2019.098558
dc.identifier.urihttps://hdl.handle.net/10735.1/8755
dc.identifier.volume29
dc.language.isoen
dc.publisherInderscience Enterprises Ltd
dc.rights©2019 Inderscience Enterprises Ltd.
dc.source.journalInternational Journal of Sensor Networks
dc.subjectWireless sensor networks
dc.subjectComputational complexity
dc.subjectAlgorithms
dc.subjectComputer science
dc.subjectTelecommunication
dc.titleQuality of Barrier Cover with Wireless Sensors
dc.type.genrearticle

Files

Collections

Du, Dingzhu‏
Wu, Weili