Research On Wireless Sensor Network Coverage Algorithm

The research of wireless sensor network gradually gets the focus from the industry andacademia. It has a great application future in the militaryand civil area. Coverage and connectivityproblem constitute fundamental elements in wireless sensor network, and they are also the keypoints to affect network performance and QoS. So the research on coverage and connectivityboastgreatsignificance.Several typical coverage algorithms for wireless sensor network are analyzed and compared.PEASalgorithmperformanceareresearched,obtainedcoveragerateandnumberoffailurenodes.For certainty distributed network, a new method derived regular hexagonal grid plot canrealize the field covered fully and seamlessly. Two kinds of the existing grid of the wireless sensornetwork are compared, obtained energyexpression of signal transmission in regular hexagonal gridplotnetwork.Theintroductionoftheweightedaveragealgorithm,weobtainedenergyexpressionofsignal transmission in square grid plot network more accurately. By means of theoretical provingand computing, the result shows that regular hexagonal grid plot have a very outstanding lowenergy-consumingcharacteristic.For random distributed network, a new algorithm based on disjoint subsets division isproposed and the detail of this algorithm is presented in this thesis. The proposed algorithm dealswith the problem of node-choosing effectively. The disjoint division model makes it quickly andsmartly to realize the coverage request. The experimental results demonstrate that the proposedalgorithmsachievemoresubsetsthanrandomnode-choosingmodel.