Authors: Biaofei Xu; Yuqing Zhu; Deying Li; Donghyun Kim; Weili Wu
Addresses: School of Information, Renmin University of China, Beijing 100872, China ' Department of Computer Science, California State University, Los Angeles, CA 90032, USA ' School of Information, Renmin University of China, Beijing 100872, China ' Department of Mathematics and Physics, North Carolina Central University, Durham, NC 27707, USA ' Department of Computer Science, University of Texas at Dallas, Richardson TX 75080, USA
Abstract: Barrier coverage is an important issue in wireless sensor networks, which guarantees to detect any intruder attempting to cross a barrier or penetrating a protected region monitored by sensors. However, the barrier coverage problem in wireless camera sensor networks (WCSNs) is different from that in scalar sensor networks. In this paper, based on (k, ω)-angle coverage, we study the minimum (k, ω)-angle barrier coverage problem in WCSNs. We first present the technique to deploy minimum number of camera sensors to form a (k, ω)-angle barrier. Then propose a novel method to select the minimum number of camera sensors from an arbitrary deployment to form a (k, ω)-angle barrier. Though our simulation, we confirm that our algorithms reduce the number of sensors required comparing to the state-of-art algorithm.
Keywords: camera sensors; data collection; barrier construction; (k; omega)-angle coverage; wireless sensor networks; WSNs; barrier coverage; wireless camera sensor networks; WCSNs; simulation; WCNs; wireless camera networks.
International Journal of Sensor Networks, 2016 Vol.21 No.3, pp.179 - 188
Available online: 15 Aug 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article