Research On Solving Method Of Coverage Area In Wireless Sensor Networks

Wireless Sensor Networks is a type of self-organized network that is used for detecting local environment which is enforced by a large number of nodes randomly placed in the target area. In the wake of the network running, some nodes will eventually become dormant because of the limited energy. Coverage hole appears as the energy of the nodes exhausted. The appearance of coverage hole hinders the monitoring of the network and makes quality going down. Calculating the coverage area of the network is very important in the purpose of studying the effect of parameters such as route and topology to the health of network.In this article, in the purpose of calculating the two-dimensional coverage area of WSNs, researches is done to find the solution to coverage area of non boundary region and boundary region separately. This paper mainly includes the following three aspects:Firstly, an algorithm based on Monte Carlo method is proposed to calculate coverage area of WSNs. Based on the theory of Monte Carlo method, the algorithm constructs a probabilistic model that accords with the objective reality. By making a large number of statistical experiments of this model, the result of the problem to be solved coincides with the statistical results.Secondly, an algorithm based on geometry is proposed to calculate coverage area of WSNs. The algorithm cut the irregular figure into several regular figure sets, and take the total sum of every part of the sets as the final result.And then, by improving the algorithm mentioned above, an improved algorithm is proposed to calculate the coverage area of boundary region. The algorithm cuts the target area into up, down, left and right part, calculates each region separately and get the summation as the answer of the algorithm.Finally, based on all the researches mentioned above, we design and implement the Real-time Temperature and Coverage Monitoring System, and simulate the situation when the number of nodes is big.