Connected Barrier Coverage on a Narrow Band: Analysis and Deployment

Barrier coverage indicates the capability of a deployed wireless sensor network to detect intruders crossing the sensing field, and it has been widely studied in recent years. Most of the existing works are asymptotic and focusing on the critical conditions (sensor density, sensing radius, etc.) to achieve barrier coverage. However these results are not very useful in practice since the sensing field generally has finite region. Also, the critical conditions may not be adequate for making deployment decisions if sensor cost and deployment cost are taken into consideration. In this paper we analyze the probability of achieving connected barrier coverage on a finite narrow band while sensors with given sensing/communicating radius are randomly deployed with given density. Moreover, we apply our analytical result and propose a cost efficient deployment strategy that uses minimal number of sensors to achieve connected barrier coverage within at most k iterations. Both the correctness of the analysis and the performance of the proposed deployment strategy are evaluated via simulations.