Coverage Research Based On Compound Sensing Model

In WSN (Wireless Sensor Network), how to deploy and how to schedule the sensors has a significant influence on the robustness, reliability and lifetime. Therefore, coverage is one of the most important issues and research concentrations.This paper studies the existing K-coverage algorithms based on boolean sensing model.It is found that these traditional algorithms can not conform the sensors’sensing characteristics of reality.It may bring down the network reliability or raise the cost of whole network.A new K-coverage algorithm based on sensing probability is presented and proved to have better performance in some situations by citing examples.Further more, for the underusing the capacity of sensing, the random coverage algorithms brings about too many redundant nodes, and increases the energy consuming in nodes’communication as well as the energy cost of the whole network.As a result, lifetime of the network is shortened.This paper comes up with a random coverage algorithm based on compound sensing model, in which the sensing capacity is defined as a piecewise function. Through mathematical derivation and calculate, the paper proposes a expression with the variable of coverage proportion, to figure the number of sensors that cover a given boundry. With this expression, people can easily compare the new algorithm to the existing one.The mathematics experiment result shows that the new algorithm based on compound sensing model can achieve a coverage proportion by less sensor nodes.