Fibonacci tiles strategy for optimal coverage in IoT networks

This paper aims to find a minimal set of nodes to optimize coverage, connectivity, and energy-efficiency for 2D and 3D Wireless Sensor Networks (WSN). This issue is denoted as a trinomial problem in our study. We propose using the paving rectangle technique, which provides a minimal number of squares based on Fibonacci’s tiles. Applying this strategy to the area coverage, connectivity, and lifetime can reduce the non-deterministic polynomial time problem (NP-Hard problem). We propose a theoretical framework to model the problem, to show the effectiveness of the method applied to the area coverage, connectivity, and lifetime on heterogeneous WSNs. The simulation results highlight the benefits of using this technique.