检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘洋 王军[1,2] 吴云鹏 LIU Yang;WANG Jun;WU Yun-peng(Suzhou University of Science and Technology,Suzhou Jiangsu 215009,China;Changchun Institute of Optics,Fine Mechanics and Physics,Chinese Academy of Sciences,Changchun Jilin 130033,China)
机构地区:[1]苏州科技大学,江苏苏州215009 [2]中国科学院长春光学精密机械与物理研究所,吉林长春130033
出 处:《计算机仿真》2022年第9期425-430,440,共7页Computer Simulation
基 金:“十三五”江苏省重点学科项目(20168765);江苏省研究生科研创新项目(KYCX17_2060)。
摘 要:针对无线传感器网络(wireless sensor network, WSN)在实际应用中网络拓扑易失效和传感器节点易故障的瓶颈问题,提出了一种基于分簇的分布式容错算法。算法协同运用节点能耗和路径损耗模型进行能耗控制,并通过簇首(cluster head, CH)竞选模型,将传感器网络内的节点分为节点级和CH级,首先在节点级,通过与邻居节点进行数据聚合比较和自身状态感知,可以诊断节点内的硬件组件故障;另外,在CH级,通过与簇内节点的信息交互,则可以对节点进行故障检测和故障恢复。仿真结果表明,与同类型经典算法相比,分布式容错算法在检测精度、故障节点容错率、能量消耗和节点生存率等方面具有一定优势。Aiming at the bottleneck problem of wireless sensor network(wireless sensor network, WSN) in the practical application of network topology failure and sensor node failure, a distributed fault-tolerant algorithm based on clustering is proposed. The algorithm uses the node energy consumption and path loss models to control energy consumption, and uses the cluster head(cluster head, CH) election model to divide the nodes in the sensor network into node-level and CH-level. The node performs data aggregation and comparison and its own state awareness, which can diagnose hardware component failures in the node;in addition, at the CH level, through the information interaction with the nodes in the cluster, the node can be fault detected and recovered. The simulation results show that compared with the classic algorithms of the same type, the distributed fault-tolerant algorithm has certain advantages in detection accuracy, fault-tolerant rate of faulty nodes, energy consumption and node survival rate.
关 键 词:无线传感器网络 分布式容错 簇首 硬件故障 故障恢复
分 类 号:TP393.04[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7