Multicast randomizing routing method based on virtual Stener tree

A Steiner tree and randomization technology, applied in branch offices providing special services, data exchange details, transmission systems, etc., and can solve problems such as failure of routing process, network paralysis, and algorithm infinite loop.

Inactive Publication Date: 2008-05-07
UNIV OF SCI & TECH BEIJING
View PDF0 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multicast randomizing routing method based on virtual Stener tree
  • Multicast randomizing routing method based on virtual Stener tree
  • Multicast randomizing routing method based on virtual Stener tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] Below we use a specific example to illustrate the process of multicast routing.

[0042] 1. In the figure, s creates a virtual Steiner tree, and the destination node sequence is shown in Figure 3.

[0043] 2. First, s detects that the next generation g is not in its neighbor node information table, then s forwards the data packet to a node in the neighbor node information table according to a random strategy, for example, n1 in the figure. As time goes by and the network topology changes, the probability of each node in the neighbor node information table changes dynamically, that is, the selection of the next hop of s is not unique.

[0044] 3. Assume that after n1 node receives the data packet, it extracts the sequence information of the destination node from it, and then compares g with the information in its neighbor node information table. If it finds that g is in it, it forwards it directly to g, and then transfers g from Deleted from the destination node sequenc...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/56H04L12/18H04W40/02H04W40/28
CPCY02D30/70
Inventor 周贤伟杨扬王建萍贾东耀王丽娜杨裕亮安建伟
Owner UNIV OF SCI & TECH BEIJING
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap