Abstract

Background: Barrier Coverage in Wireless Sensors Networks has been an active research area. Maximizing number of barriers formed after initial random deployment depends on deployment strategies used.

Methods: Where existing works rely on sensor relocation after initial random deployment to maximize barrier coverage, authors in this article proposed a novel Minimum Radius Algorithm (MRA), a first of its kind where no two nodes, will be deployed within the non-overlap radius (OR).

Results: The simulation results of the proposed algorithm proves that, MRA outperforms its counterpart not only in the case of maximizing barrier count but also in case convergence time required by network to form barriers. Extensive simulations are carried for all network sizes to show the effectiveness of proposed algorithm.

Conclusions: This work aims at proposing a pre- deployment strategy that can maximize number of barriers.

Keywords: Barrier coverage, sensor relocation, number of barriers, DDABC, MobiBar, AHVGB, DBarrier, termination time. energy efficiency.

Graphical Abstract