A Self healing Algorithm for Communication Nodes in Wireless Sensor Networks Based on Bidirectional Hash Chains
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.
万方数据
维普
