Maximisation of the Number of β-View Covered Targets in Visual Sensor Networks

Simple item page
dc.contributor.VIAF56851698 (Wu, W)
dc.contributor.VIAF288884264 (Du, D)
dc.contributor.authorGuo, L.
dc.contributor.authorLi, D.
dc.contributor.authorWang, Y.
dc.contributor.authorZhang, Z.
dc.contributor.authorTong, Guangmo
dc.contributor.authorWu, Weili
dc.contributor.authorDu, Dingzhu
dc.contributor.utdAuthorTong, Guangmo
dc.contributor.utdAuthorWu, Weili
dc.contributor.utdAuthorDu, Dingzhu
dc.date.accessioned2020-02-11T23:16:03Z
dc.date.available2020-02-11T23:16:03Z
dc.date.issued2019-03-24
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 by using the Link to Article page and contacting university Interlibrary Loan.
dc.description.abstractIn some applications using visual sensor networks (VSNs), the facing directions of targets are bounded. Therefore existing full-view coverage (all the facing directions of a target constitutes a disk) is not necessary. We propose a novel model called β-view coverage model through which only necessary facing directions of a target are effectively viewed. This model uses much fewer cameras than those used by full-view coverage model. Based on β-view coverage model, a new problem called β-view covered target maximisation (BVCTM) problem is proposed to maximise the number of β-view covered targets given some fixed and freely rotatable camera sensors. We prove its NP-hardness and transform it into an Integer Linear Programming problem equivalently. Besides, a (1 - e - 1 )-factor approximate algorithm and a camera-utility based greedy algorithm are given for this problem. Finally, we conduct many experiments and investigate the influence of many parameters on these two algorithms. © 2019 Inderscience Enterprises Ltd.
dc.description.departmentErik Jonsson School of Engineering and Computer Science
dc.identifier.bibliographicCitationGuo, L., D. Li, Y. Wang, Z. Zhang, et al. 2019. "Maximisation of the number of β-view covered targets in visual sensor networks." International Journal of Sensor Networks 29(4): 226-241, doi: 10.1504/IJSNET.2019.098557
dc.identifier.issn1748-1279
dc.identifier.issue4
dc.identifier.urihttp://dx.doi.org/10.1504/IJSNET.2019.098557
dc.identifier.urihttps://hdl.handle.net/10735.1/7262
dc.identifier.volume29
dc.language.isoen
dc.publisherInderscience Enterprises Ltd.
dc.rights©2019 Inderscience Enterprises Ltd.
dc.source.journalInternational Journal of Sensor Networks
dc.subjectSensor networks--Visual
dc.subjectInteger Linear Programming
dc.titleMaximisation of the Number of β-View Covered Targets in Visual Sensor Networks
dc.type.genrearticle

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
JECS-4209-260869.63-LINK.pdf
Size:
165.72 KB
Format:
Adobe Portable Document Format
Description:
Link to Article
Download

Collections

Du, Dingzhu‏
Wu, Weili