Irregular Honeycomb Network: Revolutionizing k-Coverage in Spatial Wireless Sensor Networks

Sensor deployment, and in particular coverage, is a fundamental component in the design and development of wireless sensor networks. Achieving coverage (or 1-coverage) in three-dimensional (or spatial) wireless sensor networks (WSNs), which requires that every point in a spatial field of interest (FoI), is an open challenging problem. In particular, the problem of k-coverage in spatial WSNs, where every point in a spatial FoI is k-covered (or covered by at least k sensors at the same time), is even more challenging. In this paper, we investigate the problem of connected k-coverage in spatial WSNs, where a spatial FoI is k-covered while all the sensors participating in this k-coverage process are connected to each other. Our study aims at producing an energy-efficient and optimized protocol, which helps achieve connected k-coverage in spatial WSNs with a minimum number of sensors, thus, extending the network lifespan. Precisely, this study is based on convex polyhedral space fillers that help establish an irregular hexagonal prism tessellation referred to as Irregular Honeycomb Network (IHN), which serves as a medium to achieve k-coverage in spatial WSNs. First, we propose a randomly distributed sensor placement strategy, which is designed to guarantee full k-coverage of a spatial FoI. To this end, we tile a spatial FoI with irregular hexagonal prisms, known as space fillers, which are adjacent to each other without any gaps or overlaps. Second, we exploit this tiling strategy to guarantee k-coverage of a spatial FoI. Then, we compute the spatial sensor density (i.e., number of sensors per unit volume) to k-cover a spatial FoI. Third, we determine the necessary relationship between the sensors’ communication and sensing ranges to ensure network connectivity. We corroborate our analysis with various simulation results.