WSNs中一种寻找最小工作节点集的覆盖算法  

Coverage algorithm for finding the minimum working sets in WSNs

作　　者：王爱民[1,2] 刘永强[1] 张婧[1] 刘衍珩[1,2] 

机构地区：[1]吉林大学计算机科学与技术学院,吉林长春130012 [2]吉林大学符号计算与知识工程教育部重点实验室,吉林长春130012

出　　处：《西安电子科技大学学报》2016年第4期141-146,共6页Journal of Xidian University

基　　金：国家自然科学基金资助项目(61073164)

摘　　要：针对现有覆盖算法存在的很多冗余节点,提出了寻找最小工作节点集的覆盖算法.该算法分为两个阶段:第1阶段运行已有的覆盖算法;第2阶段运行节点替换算法,它用更少的节点替换更多的工作节点,如此循环迭代使工作节点数不断减少.仿真实验表明,该算法比其他覆盖算法能获得更多的休眠节点,使工作节点数减少10%左右,从而延长了网络生命周期.Since the existing coverage algorithm has a lot of redundant nodes, a coverage algorithm for finding the minimum working sets in WSNs（FMWS） is proposed. The algorithm is divided into two phases： the first phase runs an existing coverage algorithm; the second phase runs an algorithm that uses fewer working nodes to replace more working nodes, with the number of working nodes continuously decreasing through iteration. Simulation shows that the proposed algorithm can obtain more sleep nodes than other algorithms. It can make the number of working nodes reduce around 10%, so as to prolong the network life.

关 键 词：无线传感器网络 覆盖 睡眠调度算法 休眠顺序 

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