分布式WSN联合概率覆盖节点调度算法  

Joint probabilistic coverage based distributed node scheduling algorithm for wireless sensor network

作　　者：田莹[1] 韩建群[1] 刘宴涛[1] 

机构地区：[1]渤海大学工学院,辽宁锦州121000

出　　处：《计算机工程与应用》2014年第7期15-19,34,共6页Computer Engineering and Applications

基　　金：国家自然科学基金(No.51277011)

摘　　要：利用概率覆盖探测模型,提出了一种分布式的基于联合概率覆盖的节点调度算法。节点在本地通过与其一跳邻节点的信息交互,获取本地节点所在区域的所有覆盖匹配集,根据邻节点的工作状态判断本地所在区域被概率覆盖情况;最后,节点将根据判断结果调度本地节点进入工作状态或休眠状态。仿真结果表明,该算法执行效率高于CCP和DPCP算法,能够在保证网络概率覆盖前提下,关闭大量冗余节点,保证网络工作节点数目稳定,延长了网络寿命。Using probabilistic detection model, a distributed node scheduling algorithm which is based on the joint proba-bilistic coverage method is proposed. The node obtains all the coverage match sets of its region by communicating with its neighbor nodes, and then judges the probabilistic coverage state of its region by the obtained information. At last, the node will schedule itself by the judgment result into active state or sleep state. Simulation results show that, this algorithm is more effective than CCP and DPCP, on the condition of preserving network probabilistic coverage, and can turn of lots of redundant nodes and insure the number of active nodes being steady in order to prolong the network lifetime.

关 键 词：无线传感网络 联合概率覆盖 分布式 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]