Convex Polyhedral Space-Fillers Based Connected k-Coverage in Three-Dimensional Wireless Sensor Networks

The problem of coverage in three-dimensional (3D) wireless sensor networks is challenging and hard. In this paper, we focus on the problem of k-coverage of a 3D field of interest (FoI), where every point is covered by at least k sensors. First, we propose three sensor placement strategies to guarantee k-coverage of a 3D FoI. Second, we compute the corresponding sensor density. Third, we investigate the ratio of the radius of the communication range of the sensors to the radius of their sensing range. Our study is based on polyhedral convex spacefillers. It shows that the great rhombicuboctahedron is the best 3D space-filler with respect to the coverage quality metric. We corroborate our analysis with various simulation results.