Deployment patterns for k-coverage and l-connectivity in Wireless Sensor Networks

In this paper, the patterns for k-coverage (2≤k≤4) based on optimal /-connectivity (3≤/≤6) patterns are deeply discussed and a series of deployment patterns for k-coverage and I-connectivity are proposed under different ratios of sensor communication range (denoted by R
_c
) over sensing range (denoted by R
_s
) for Wireless Sensor Networks (WSNs). The patterns proposed are based on regular graphs and have precise thresholds that discriminate different k-coverage and I-connectivity when R
_c
/R
_s
≤1. Also, the mathematical operations of MAPN (Maximum Area per Node) in all patterns are described in the paper. In the end, comparison graphs of coverage rate for each pattern are illustrated and different values of k and I in k-coverage and I-connectivity's coverage varying rates could be observed.