基于概率模型的无线传感器网络优化覆盖算法

摘要

In order to better eliminate such phenomena as large amounts of redundant information and imbalanced node energy consumption in the covering process of Wireless Sensor Networks (WSN),this paper proposes an optimal covering algorithm for node energy balance.By using the subordinate relationship between the sensor nodes and destination nodes in the monito-ring area,this algorithm builds a network model and gives such dependence.Then,on the basis of the dependence and the probability theory,it solves the expected value of the sensor nodes in covering the destination nodes and then calculates the least number of sensor nodes required for covering the monitoring area.The experimental results indicate that this algorithm cannot only use the least sensor nodes to effectively cover the monitoring area,but also resist the generation of redundant infor-mation data,thus extending the network lifecycle.%为了更好地解决无线传感器网络在覆盖过程中出现大量冗余信息及节点能量消耗不均衡等现象，提出了一种节点能量均衡的最优覆盖算法。该算法利用监测区域内传感器节点与目标节点的从属关系建立网络模型，给出传感器节点与目标节点之间的从属关系；通过从属关系和概率理论，求解传感器节点对目标节点的覆盖期望值，然后计算出覆盖监测区域所需最少传感器节点数量。实验结果表明，该算法不仅可以使用最少传感器节点完成对监测区域的有效覆盖，而且抵制了冗余信息数据的产生，提高了网络生存周期。