Regular sensor deployment patterns for p-coverage and q-connectivity in wireless sensor networks

In this paper, we study the regular sensor deployment patterns to achieve p-coverage and q-connectivity (q ≤ 6) under different ratios of sensor nodes communication range (r
_c
) to their sensing range (r
_s
) for wireless sensor networks. In particular, we propose the triangular lattice, square grid, and hexagon deployment patterns to achieve p-coverage and q-connectivity. To form such regular deployment patterns for given p and q values, we present the distance between sensor nodes as well as the relationship between r
_c
and r
_s
. We will get this information by using the inverse method of the proposed theorems which estimate the coverage level of the target region when sensors are deployed. We also compare the efficiency of the proposed regular deployment patterns in terms of the number of sensors needed to provide p-coverage and q-connectivity.