Energy-efficient weak-barrier coverage with adaptive sensor rotation

Abstract

Wireless sensor networks have been widely used in environment, climate, animal monitoring, the medical field, and also for surveillance. In surveillance applications, when sensors are deployed randomly along a path in order to monitor boundaries of battlefields or country borders, gaps are usually unavoidable. In this paper, we propose an energy-efficient distributed algorithm for weak-barrier coverage using event-based clustering and adaptive sensor rotation. We consider a wireless sensor network consisting of randomly deployed sensor nodes and directional border nodes deployed using a random line deployment model. When an event is detected, sensor nodes form one or more event-based clusters. Cluster heads are in charge with aggregating data from the clusters and sending them to the border nodes, which will adjust the orientation angle such that to monitor intruders crossing the barrier. We use simulations using WSNet and MatLab to analyze the performance of our algorithm and to compare it with other non-clustering gap-mending algorithms.