Skip to content
2000
Volume 11, Issue 2
  • ISSN: 2210-3279
  • E-ISSN: 2210-3287

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.

Loading

Article metrics loading...

/content/journals/swcc/10.2174/2210327910999200606230721
2021-02-01
2025-07-15
Loading full text...

Full text loading...

/content/journals/swcc/10.2174/2210327910999200606230721
Loading
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test