传感技术学报2024，Vol.37Issue(12)：2119-2124,6.DOI:10.3969/j.issn.1004-1699.2024.12.015
基于双向Hash链的无线传感网络通信节点自愈算法
A Self healing Algorithm for Communication Nodes in Wireless Sensor Networks Based on Bidirectional Hash Chains
摘要
Abstract
With the increasing of the number of nodes in wireless sensor networks,the probability of node failures has increased,which affects the efficiency of data transmission and can lead to secondary node failures.To address this issue,a self-healing algorithm for wireless sensor network communication nodes based on bidirectional hash chains is proposed.A model for determining node failures is constructed by analyzing network traffic overload,and the faulty nodes are identified.The centroid algorithm is used to determine the specific locations of the failed nodes.By combining the bidirectional hash chain and node failure decision model,the self repair of failed nodes is achieved.The WSN topology structure is constructed,and simulation tests are conducted to compare the results.The average node topology movement distance is 63.5 m,the average network traffic export bandwidth value is 583 Mbyte/s,and the average self-healing time of nodes is 14.2 s,demonstrating that the proposed method has high self-healing efficiency,ensuring the optimal self-healing effect and the strongest self-healing ability for failed nodes.关键词
网络通信/通信节点自愈/双向hsh链/节点失效/质心算法/流量过载Key words
network communication/communication node self-healing/bidirectional hash chain/node failure/centroid algorithm/flow overload分类
信息技术与安全科学引用本文复制引用
李晓薇,李翔宇..基于双向Hash链的无线传感网络通信节点自愈算法[J].传感技术学报,2024,37(12):2119-2124,6.基金项目
山西省教育科学规划课题项目(GH-17136) （GH-17136）
