Connected k-coverage in two-dimensional wireless sensor networks using hexagonal slicing and area stretching

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...