Original paper
Connected k-coverage in two-dimensional wireless sensor networks using hexagonal slicing and area stretching
Abstract
The problem of coverage in two-dimensional (2D) wireless sensor networks is challenging and is still open. Precisely, determining the minimum sensor density (i.e, minimum number of sensors per unit area) that is required to cover a 2D field of interest (FoI), where every point in the field is covered by at least one sensor, is still under investigation. The problem of 2D k-coverage, which requires that every point in a 2D FoI be covered by at...
Paper Details
Title
Connected k-coverage in two-dimensional wireless sensor networks using hexagonal slicing and area stretching
Published Date
Jul 1, 2021
Volume
153
Pages
89 - 109
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History