Multicast randomizing routing method based on virtual Stener tree

Abstract

The present invention provides a multicast randomized routing method based on virtual stettner tree and relates to the multicast transmission of radio sensor network data. The present invention adopts a multicast route started by the source and driven by the requirement and introduces probability routing method in the process of choosing route; in this way, the infinite loop of algorithm can be effectively avoided; the node with the maximum probability is chosen as the next hop to ensure a robust route, which guarantees the smooth route and the smooth transmission of data and at the same time greatly prolongs the lifecycle of the network. The present invention is characterized by effective data transmission and long network lifecycle and is especially fit for dangerous environment where people are hard to enter; once the sensor nodes are configurated through a certain measure, the energy replacement in the pattern of battery or other patterns can not be realized and people can only implement the remote control at the base station or management center.

Description

Technical field: [0001] The invention relates to a wireless sensor network multicast routing method, through which the network energy is balanced, the robustness of the multicast tree is increased, and the life cycle of the network is extended. Background technique: [0002] At present, the most common way to implement multicast routing is to construct a tree-shaped routing structure from a source node to a group of destination nodes. Information can be sent along the path determined by this tree, which reduces the delay of information transmission, and information replication is only in It is performed at the tree right, which can save network bandwidth resources. [0003] The core problem in tree-based routing protocols is the Steiner tree problem. The Steiner tree problem refers to the problem of the minimum tree length connecting a given point, and its optimal solution is called Steiner Minimum Tree (SMT). The research on the Steiner problem in graph theory can be trac...

AI Technical Summary

Problems solved by technology

[0007] This method introduces the idea of ​​a virtual Steiner tree, which reduces the time complexity of the multicast tree formation algorithm to a certain extent. However, when this method selects the next hop, there may be multiple points closest to the next generation. , which may lead to an infinite loop of the algorithm, making the routing process unable to proceed smoothly; in addition, after the routing is established, during the data transmission process, the concentration of traffic may lead to the rapid death of nodes, resulting in the paralysis of the entire network

Images