Guo, L.Li, D.Wang, Y.Zhang, Z.Tong, GuangmoWu, WeiliDu, Dingzhu2020-02-112020-02-112019-03-241748-1279http://dx.doi.org/10.1504/IJSNET.2019.098557https://hdl.handle.net/10735.1/7262Due 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.In 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.en©2019 Inderscience Enterprises Ltd.Sensor networks--VisualInteger Linear ProgrammingarticleGuo, 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.098557294