基于事件概率的无线传感器网络K覆盖算法

无线传感器网络在对目标区域进行K覆盖过程中易产生大量冗余节点，消耗网络中大量节点能量，并受外界环境因素制约。为此，提出一种基于事件概率的K覆盖算法。根据对监测目标区域节点关注程度的大小赋予不同概率值，通过节点之间信息交换和关联属性确定最小节点集和最大目标集，从而完成对目标区域节点K覆盖，优化网络资源，减少节点能量的消耗。仿真实验表明，该算法能够以较小的代价完成对目标区域节点K覆盖，延长网络生存周期，具有较好的实效性和稳定性。

K Coverage Algorithm of WSN Based on Event Probability

During the process of carrying out K coverage algorithm of Wireless Sensor Network（WSN） to the target area, there are some shortcomings, such as many redundancy nodes emerge, the process consumes a lot of node energy in the network at the same time, and the process is easily restricted by the outside environmental elements. This paper puts forward an event probability K coverage algorithm. By means of giving different probability value to different monitor degree of the target area nodes, and by way of information exchange and relevance nature between the nodes, the algorithm fixes the smallest nodes collection and the biggest target collection, thus effectively fulfills K coverage to target area nodes, optimizes network resources, reduces energy consumption of the nodes, and prolongs the life time of the network. Emulation experiments show that, this algorithm can fulfill K coverage to target area at small cost and increases the whole network lifetime. It has good practical result and stability.