A study on one‐dimensionalk‐coverage problem in wireless sensor networks
Lei Li, Baoxian Zhang, Jun Jia Zheng · Wireless Communications and Mobile Computing · 2011
ABSTRACT In this paper, we study the one‐dimensional coverage problem in a wireless sensor network (WSN) and consider a network deployed along a one‐dimensional line according to a Poisson distribution. We analyze three important parameters that are related to the problem, i.e.,expected k‐coverage proportion, full k‐coverage probability, and partial k‐coverage probability, and derive mathematical models that describe the relationships between the node density in the network and these parameters. The purpose is to calculate or estimate the node density required for achieving a given coverage probability, which is useful in the deployment of a one‐dimensional network for many applications. We first analyze the expectedk‐coverage proportion, then analyze the fullk‐coverage probability fork = 1 and the lower bound to the fullk‐coverage probability fork > 1, and finally analyze the partialk‐coverage probability fork = 1 and give a brief discussion of the partialk‐coverage probability fork > 1. The mathematical models are validated through simulation. Copyright © 2011 John Wiley & Sons, Ltd.