A wireless sensor network dynamic clustering routing method and device

Abstract

The invention discloses a dynamic clustering routing method and device for a wireless sensor network, which uses an energy clustering graph to construct an energy-available node graph, and then calculates the minimum number of path conversions required to complete transmission on this basis; The required multicast tree is obtained on the basis of the node graph, and the source node is the wireless sensor network node for data collection, which greatly improves the speed and reliability of the data transmission of the entire wireless sensor network, without affecting the clustering in each cluster area. Under the service of the nodes, the clustering characteristics of the wireless sensor network are further utilized to ensure that the overall data transmission stability of the wireless sensor network can still run normally in the case of abnormal transmission in some clustered cluster areas in the wireless sensor network , the routing update cost is small, which effectively prolongs the life of wireless sensor network nodes.

Description

technical field [0001] The present disclosure relates to the technical field of sensor network communication, and in particular, to a wireless sensor network dynamic cluster routing method and device. Background technique [0002] In wireless sensor networks, the number of various sensor nodes is increasing, which puts forward new requirements for the complexity of communication systems. At present, the network structures of common bus topology, star topology, ring topology and tree topology can no longer meet the requirements. Therefore, the topology of sensor networks is becoming more and more complex. Many important real-time data are exchanged through the routing path of the sensor network. Once the connection of the sensor network is faulty or a sensor node fails, the data of the entire sensor network may not be exchanged because there is no corresponding data backup path. When the wireless sensor network is initialized, the LEACH algorithm and the HEED algorithm are r...

AI Technical Summary

Problems solved by technology

[0002] In the wireless sensor network, the number of various sensor nodes is constantly increasing, which puts forward new requirements for the complexity of the communication system. At present, the common bus topology, star topology, ring topology, and tree topology network structure can no longer meet the requirements. demand, so the topology of the sensor network is becoming more and more complex

A lot of important real-time data are exchanged through the routing path of the sensor network. Once there is a problem with the connection of the sensor network or a sensor node fails, the entire sensor network data may not be able to be exchanged because there is no corresponding data backup path. transmission, causing the sensor network to fail to work normally. When the wireless sensor network is initialized, the routing of the initial topology is clustered and optimized by running the LEACH algorithm and the HEED algorithm.

Images