Minimum (k, ω)-angle barrier coverage in wireless camera sensor networks
by Biaofei Xu; Yuqing Zhu; Deying Li; Donghyun Kim; Weili Wu
International Journal of Sensor Networks (IJSNET), Vol. 21, No. 3, 2016

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.

Online publication date: Mon, 15-Aug-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com