CN114978921A - Network organization method and device based on binary tree - Google Patents
Network organization method and device based on binary tree Download PDFInfo
- Publication number
- CN114978921A CN114978921A CN202210418616.5A CN202210418616A CN114978921A CN 114978921 A CN114978921 A CN 114978921A CN 202210418616 A CN202210418616 A CN 202210418616A CN 114978921 A CN114978921 A CN 114978921A
- Authority
- CN
- China
- Prior art keywords
- node
- binary tree
- tree
- nodes
- tree structure
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 230000008520 organization Effects 0.000 title claims abstract description 36
- 238000004128 high performance liquid chromatography Methods 0.000 claims 1
- 238000004891 communication Methods 0.000 description 13
- 101100243024 Arabidopsis thaliana PCO1 gene Proteins 0.000 description 7
- 101150081243 STA1 gene Proteins 0.000 description 7
- 101100161473 Arabidopsis thaliana ABCB25 gene Proteins 0.000 description 6
- 101100096893 Mus musculus Sult2a1 gene Proteins 0.000 description 6
- OVGWMUWIRHGGJP-WVDJAODQSA-N (z)-7-[(1s,3r,4r,5s)-3-[(e,3r)-3-hydroxyoct-1-enyl]-6-thiabicyclo[3.1.1]heptan-4-yl]hept-5-enoic acid Chemical compound OC(=O)CCC\C=C/C[C@@H]1[C@@H](/C=C/[C@H](O)CCCCC)C[C@@H]2S[C@H]1C2 OVGWMUWIRHGGJP-WVDJAODQSA-N 0.000 description 3
- 101000988961 Escherichia coli Heat-stable enterotoxin A2 Proteins 0.000 description 3
- 230000003068 static effect Effects 0.000 description 3
- 101100243025 Arabidopsis thaliana PCO2 gene Proteins 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 101100243026 Arabidopsis thaliana PCO3 gene Proteins 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B3/00—Line transmission systems
- H04B3/54—Systems for transmission via power distribution lines
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention relates to a network organization method and a device based on a binary tree, comprising the steps of organizing a network to be organized by adopting a generalized tree structure; converting the generalized tree structure into a binary tree structure; based on a binary tree structure, searching the sequence number of the maximum terminal equipment of a designated network level, leaf nodes and leaf nodes of the highest level by adopting binary tree post-order traversal with clues, and traversing and deleting subtrees of designated nodes; and searching the parent node of the designated node by using a binary tree middle-order traversal with clues. The network organization method provided by the invention can embody the real characteristics of the network topology more simply, does not need additional information to express the relation of each node, and reduces the complexity of the data structure; the relationship among the nodes can be expressed by a highly abstract binary tree structure model, so that the memory occupancy rate is greatly reduced.
Description
Technical Field
The invention relates to the technical field of power communication, in particular to a network organization method and device based on a binary tree.
Background
High-Speed Power Line Communication (HPLC) is a novel Power Line Communication technology, and has been widely used in the field of domestic Power information collection. The method is characterized in that the HPLC + HRF dual-mode communication formed by combining high-speed wireless communication (Radio Frequency, hereinafter referred to as HRF) is realized by adding a communication channel on the basis of an HPLC communication network and fusing at a link layer; complementary networking of HPLC and HRF is realized; how to organize the device list, the routing table and the neighbor table of the link layer becomes a new problem, especially how to efficiently add, delete, modify and check data after adding one HRF channel. In the prior art, when a mesh communication network master node and a slave node organize link layer data and parameters, the data and parameter structures of an equipment list, a routing table and a neighbor table are simultaneously generated according to requirements by organizing through a static array, a continuous memory, a linked list linked dynamic memory and the like; searching in a traversal mode by adopting an inquiry mode; the occupied memory space is large and the efficiency of increasing, deleting, modifying and checking is low. Therefore, how to organize the network structure in the HPLC + HRF dual-mode communication form becomes a problem to be solved urgently.
Disclosure of Invention
Based on the above situation in the prior art, the present invention aims to provide a network organization method and device based on a binary tree, which abstract and organize link layer data of HPLC + HRF by using data structures such as a binary tree, thereby completing efficient implementation of some link layer data structure functions, effectively improving code performance, and greatly improving space complexity and time complexity.
To achieve the above object, according to an aspect of the present invention, there is provided a network organization method based on a binary tree, including:
organizing a network to be organized by adopting a generalized tree structure;
converting the generalized tree structure into a binary tree structure;
based on the binary tree structure, searching the maximum terminal equipment serial numbers of the designated network level, the leaf nodes and the leaf nodes of the highest level by adopting binary tree post-order traversal with clues, and traversing and deleting subtrees of the designated nodes; and searching the parent node of the designated node by using a binary tree middle-order traversal with clues.
Further, the method also comprises the following steps:
organizing data by using a red-black tree with a terminal equipment serial number and an MAC address as keywords;
and searching the serial number of the appointed terminal equipment and the appointed MAC address by using the keyword.
Further, the network to be organized comprises an HPLC and HRF heterogeneous network.
Further, in the generalized tree structure, the root node includes a central coordinator CCO, the next-level node of the root node includes a proxy coordinator PCO, and the next-level node of the hierarchy where the proxy coordinator is located includes a station STA.
Further, in the binary tree structure, each node has two child nodes, and converting the generalized tree structure into the binary tree structure includes:
setting a left node of the generalized tree root node as a first left node of a binary tree root node;
all other neighbor nodes under the same root node of the generalized tree are sequentially set as the right node of the node;
respectively setting left nodes of all child nodes of a first level below a generalized tree root node as left nodes of the nodes below a binary tree;
and respectively setting the right nodes of all child nodes at the first level below the generalized tree root node as the right nodes of the left nodes of the node below the binary tree.
Further, the binary tree post-order traversal with clues comprises traversal according to the order of a left sub-tree, a right sub-tree and a root node.
Further, the intermediate traversal of the binary tree with clues comprises traversing the binary tree in the order of the left sub-tree, the root node and the right sub-tree.
According to a second aspect of the present invention, a network organization apparatus based on a binary tree is provided, which includes a generalized tree structure organization module, a binary tree structure organization module, a subsequent traversal module, and a middle traversal module; wherein, the first and the second end of the pipe are connected with each other,
the generalized tree structure organizing module is used for organizing a network to be organized by adopting a generalized tree structure;
the binary tree structure organization module is used for converting the generalized tree structure into a binary tree structure;
the post-order traversal module searches the sequence number of the maximum terminal equipment of the designated network level, the leaf node and the leaf node of the highest level by adopting the post-order traversal of the binary tree with clues based on the binary tree structure, and traverses and deletes the sub-tree of the designated node;
and the middle-order traversal module searches the father node of the designated node by adopting a binary tree middle-order traversal with clues.
According to a third aspect of the present invention, there is provided an electronic device comprising a memory, a processor and executable instructions stored in the memory and executable on the processor, wherein the processor executes the program to implement the binary tree based network organization method according to the first aspect of the present invention.
According to a fourth aspect of the present invention, there is provided a computer-readable storage medium having stored thereon computer-executable instructions which, when executed by a processor, implement the binary tree based network organization method according to the first aspect of the present invention. In summary, the present invention provides a network organization method and device based on binary tree, the method includes adopting generalized tree structure to organize the network to be organized; converting the generalized tree structure into a binary tree structure; based on the binary tree structure, searching the maximum terminal equipment serial numbers of the designated network level, the leaf nodes and the leaf nodes of the highest level by adopting binary tree post-order traversal with clues, and traversing and deleting subtrees of the designated nodes; and searching the parent node of the designated node by using a binary tree middle-order traversal with clues. The network organization method based on the binary tree can embody the real characteristics of the network topology more simply without additional information to express the relation of each node, thereby reducing the complexity of the data structure; the relationship between each node can be expressed by a highly abstract binary tree structure model; the memory occupation is reduced to 40 percent of the original memory occupation; a data structure of a red and black tree is adopted to organize node information with a Terminal Equipment serial number (TEI) and a Media Access Control Address (MAC) Address as key, so that the time complexity is reduced from O (n) to O (log (n)).
Drawings
FIG. 1 is a schematic diagram of a generalized tree network topology according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a binary tree network topology according to an embodiment of the present invention;
fig. 3 is a data definition of a link layer device list.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail with reference to the accompanying drawings in conjunction with the following detailed description. It should be understood that the description is intended to be exemplary only, and is not intended to limit the scope of the present invention. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present invention.
The technical solution of the present invention will be described in detail below with reference to the accompanying drawings. According to one embodiment of the invention, a network organization method based on a binary tree is provided. For a network structure in a HPLC + HRF dual-mode communication form, if an equipment list, a routing table, and a neighbor table are organized in the prior art by using a static array, a continuous memory, a linked list linked dynamic memory, and the like, the structures such as the static array, the continuous memory, the linked list, and the like need to be traversed when performing child node search, same-level node search, and the like, and the search efficiency is low. Because the organization of data in the prior art is not directly abstract to the real network topology or the abstract degree is not high, a complex and error-prone algorithm is needed when the real network topology is accessed conditionally. Based on the above problem, embodiments of the present invention provide an organizing method for the network structure, where the model of the generalized tree of the real network structure is abstracted, and the data structure of the binary tree is used to organize the device list, so that the characteristics of the real network topology can be clearly embodied, and the routing table can be generated based on the abstract model, without consuming resource organization.
The network organization method based on the binary tree provided by the embodiment of the invention comprises the following steps:
and organizing the network to be organized by adopting a generalized tree structure. For example, a generalized tree structure is adopted to organize a structure of a link layer in an HPLC + HRF dual-mode communication form, the HPLC + HRF dual-mode communication form typically forms a generalized tree network that is associated with all stations (Station, hereinafter referred to as "STA") (e.g., a smart meter, an I-type collector communication unit, a broadband carrier II-type collector, etc.) in multiple levels by taking a Central Coordinator (hereinafter referred to as "CCO") as a center and a Proxy Coordinator (hereinafter referred to as "PCO") as a relay agent, and the topology of the generalized tree network is as shown in fig. 1. The network structure shown in fig. 1 is a real network structure, and is a generalized tree with a degree of 3, in fig. 1, a node at the next stage of a certain node is referred to as a child node of the node, and a parent node of the certain node is referred to as a parent node of the node; nodes having multiple nodes of the same parent node are referred to as neighbor nodes.
Converting the generalized tree structure to a binary tree structure. The generalized tree is abstracted to obtain a binary tree, the binary tree structure is shown in fig. 2, the binary tree can clearly embody the characteristics of the real network topology, and the routing table generated by the binary tree does not need to consume resource organization. The binary tree structure is adopted to organize the real characteristics of the network topology, the relation of each node is expressed without additional information, and the complexity of the data structure is reduced. In the binary tree structure, each node has two child nodes, namely a left node and a right node, and the step of converting the generalized tree structure into the binary tree structure can be as follows: setting a left node of the generalized tree root node as a first left node of a binary tree root node; all other neighbor nodes under the same root node of the generalized tree are sequentially set as the right node of the node; respectively setting left nodes of all child nodes of a first level below a generalized tree root node as left nodes of the nodes below a binary tree; and respectively setting the right nodes of all child nodes at the first level below the generalized tree root node as the right nodes of the left nodes of the node below the binary tree. Taking the network structures shown in fig. 1 and 2 as an example, fig. 2 sets the left node of the CCO as the CCO first child node PCO1 according to the relationship of fig. 1; the neighbor node of the PCO1 is set to the right node PCO2 of the PCO 1; the neighbor nodes of the PCO2 are sequentially set as the right PCO3 of the PCO 2; the child node of the PCO1 is set to the left node STA1 of the PCO 1; the structure of fig. 2 is regularly formed in turn. In this embodiment, a generalized tree with a degree of 3 is taken as an example, the generalized tree structure is converted into a binary tree structure, and generalized tree conversions with other degrees are similar to this, and are not described herein again.
Based on the binary tree structure, searching and counting appointed network levels, searching and counting leaf nodes, searching the maximum terminal equipment serial number of the leaf node of the highest level, and traversing and deleting sub-trees of the appointed nodes by adopting binary tree post-order traversal with clues; and searching the parent node of the designated node by using a binary tree middle-order traversal with clues. The subsequent traversal comprises traversing according to the sequence of the left sub-tree, the right sub-tree and the root node; during the subsequent traversal of the binary tree by using a recursive mode, the restrictive access to the level parameters is increased, so that the search and statistics of the specified network level can be realized; because the searching sequence is left sub-tree, right sub-tree and root node, the searching of the leaf nodes of the whole network can be preferentially searched and counted; searching and deleting algorithms are carried out on the subtrees of the designated nodes by utilizing the characteristics of firstly searching the left subtrees and the right subtrees and then searching the root nodes; the method has the characteristics of high efficiency and simplicity; and using subsequent traversal of the binary tree with the hierarchical condition to find out the leaf node of the highest hierarchy, judging the TEI of the highest node and realizing the search algorithm of the maximum TEI of the leaf node.
The middle-order traversal comprises traversing the binary tree according to the sequence of the left sub-tree, the root node and the right sub-tree; when a recursive mode is used to implement binary tree middle-sequence traversal, because the search sequence is left sub-tree, root node, right sub-tree, case 1: if the node indicates as successor node, then the successor node is its parent, case 2: and if the subsequent clue indicates a right child node, continuing searching right to the scene meeting the condition 1 and finding out a parent node of the scene.
The hierarchy traversal is only needed to be performed according to the hierarchy.
Wherein each node except the first node has one and only one direct predecessor node; each node has one and only one immediate successor node except the last node. These pointers to the immediate predecessor node and to the immediate successor node are called threads (threads), and the binary tree with threads added is called a clued binary tree. And when the left node or the right node is empty, setting the empty pointer of the left node or the right node as a front-driving clue pointer or a rear-driving clue pointer. For example, in fig. 2, STA1 may set the pointer to the predecessor thread pointer with the pointer address CCO because there is no child node and the left pointer is null.
With the following traversal of the binary tree with clues, the search order of the following traversal of the binary tree as shown in fig. 2 is: STA2- > STA1- > STA4- > STA3- > STA5- > PCO3- > PCO2- > PCO1- > CCO. The searching and counting of the leaf nodes can be realized by adopting the subsequent traversal of the binary tree with clues, and the leaf nodes are listed firstly in the sequence, so that the searching and counting of the leaf nodes are realized, and the searching efficiency is improved. The searching of the designated network level can be realized by adopting the subsequent traversal of the binary tree with clues, for example, the same level node of the node PCO1 needs to be searched, and according to the traversal order of the subsequent traversal, the left node of the root node of the node PCO1, the right node of the left node and the right node of the subsequent node are in the same level. For example, the same level node of STA1 needs to be searched, the level of STA1 is 2, STA1 is searched first, and then the right node STA2 of the subtree is the same level node of the node; according to the search sequence of the subsequent traversal, the next step is to search a level node equivalent to STA4- > STA3- > STA 5. The subsequent traversal of the sub-tree of the designated node can also be realized by adopting the subsequent traversal of the binary tree with clues, and the subsequent traversal of the left sub-tree of the designated node, for example, the traversal of the sub-nodes of the PCO1, namely the traversal of the STA1 sub-tree, is realized; according to the search sequence traversed in the subsequent sequence, STA2- > STA 1; and traversing and deleting the subtree. The searching of the maximum TEI of the leaf node of the highest level can be realized by adopting the subsequent traversal of the binary tree with clues, the leaf node can be preferentially searched according to the searching sequence of the subsequent traversal, the maximum TEI can be obtained only, and the PCO and the CCO are checked after the searching characteristic, so that the searching efficiency is improved.
When the parent node of the designated node is searched by using the intermediate traversal of the binary tree with clues, the search order of the intermediate traversal of the binary tree shown in fig. 2 is as follows: STA1- > STA2- > PCO1- > CCO- > STA3- > STA4- > PCO2- > STA5- > PCO 3. For example, it is necessary to search for the parent node of STA2, and node PCO1 is immediately followed by the parent node of STA2 according to the search order of the middle-order traversal.
The method further comprises the following steps: organizing data by using a red-black tree with a terminal equipment serial number and an MAC address as keywords; and searching the serial number of the appointed terminal equipment and the appointed MAC address by using the keyword. For example, in fig. 2 (the root node is STA or PCO) organized according to a red-black tree, TEI and MAC of the node have the following characteristics that the TEI of the node is greater than the TEI of the left child node of the node and smaller than the TEI of the right child node of the node; if the node MAC is larger than the node left child node MAC and smaller than the node right child node MAC; when searching for the specified TEI or MAC, only judging whether the searched TEI or MAC is larger than that of the root node or not, continuing to search to the left, or else, searching to the right; until eventually an equal TEI or MAC is found then it is considered found. Through abstracting the network topology tree topology type, the device list of the data link layer is organized according to a clue binary tree, and left and right pointers and color marks which are organized into a red-black tree by TEI and MAC addresses are carried. The definition of data, which is applied from dynamic memory and stored in memory, is shown in fig. 3. The link layer constructs a red-black tree with the MAC address as a key word according to the MAC address application and the memory space with the data length defined by the figure 3, and the characteristics of the red-black tree are followed by the increasing, deleting, modifying and checking of the red-black tree; after the nodes are distributed with the TEI, constructing a red-black tree taking the TEI as a key word, and modifying and checking the characteristics of the red-black tree according to the characteristics of the red-black tree; and generating a clue binary tree, wherein the searching is a middle-order searching, and the generating method of the binary tree is consistent with the generating method described above. In the binary tree with the funicular searched in the middle sequence, the left pointer points to the child node, and the right pointer points to the brother node; because the binary tree of the medium-order clues has the node relation attribute which is the same as the real network topology, the equipment list only needs to store the MAC address and the distributed TEI; the node relationships and parameters may be generated by a binary tree. The data are organized by using the red and black trees with the TEI as the key word, so that the trees are balanced as much as possible, and the data structure body corresponding to the TEI can be efficiently found out; the data are organized by using the red and black trees with the MAC address as the key word, so that the trees are balanced as much as possible, and the data structure body corresponding to the TEI can be efficiently searched.
The embodiment of the invention also provides a network organization device based on the binary tree, which comprises a generalized tree structure organization module, a binary tree structure organization module, a subsequent traversal module and a middle traversal module.
The generalized tree structure organization module is used for organizing the network to be organized by adopting a generalized tree structure;
a binary tree structure organization module for converting the generalized tree structure into a binary tree structure;
the post-order traversal module is used for searching the maximum terminal equipment serial number of the leaf node of the appointed network level, the leaf node and the leaf node of the highest level by adopting the post-order traversal of the binary tree with clues based on the binary tree structure, and traversing and deleting the subtree of the appointed node;
and the middle-order traversal module searches the father node of the designated node by adopting a binary tree middle-order traversal with clues.
The specific process of each module in the device according to this embodiment of the present invention to implement its function is the same as each step of the method provided in the foregoing embodiment of the present invention, and is not described herein again.
An embodiment of the present invention further provides an electronic device, which includes a memory, a processor, and executable instructions stored in the memory and executable on the processor, and is characterized in that the processor, when executing the program, implements the binary tree-based network organization method as described in the above embodiment of the present invention.
Embodiments of the present invention also provide a computer-readable storage medium having stored thereon computer-executable instructions, which when executed by a processor, implement the binary tree based network organization method as described in the above embodiments of the present invention.
In summary, the present invention relates to a network organization method, apparatus, electronic device and computer-readable storage medium based on binary tree, the organization method includes organizing a network to be organized by using a generalized tree structure; converting the generalized tree structure into a binary tree structure; based on the binary tree structure, searching the maximum terminal equipment serial numbers of the designated network level, the leaf nodes and the leaf nodes of the highest level by adopting binary tree post-order traversal with clues, and traversing and deleting subtrees of the designated nodes; and searching the parent node of the designated node by using a binary tree middle-order traversal with clues. The network organization method based on the binary tree can embody the real characteristics of the network topology more simply without additional information to express the relation of each node, thereby reducing the complexity of the data structure; the relationship between each node can be expressed by a highly abstract binary tree structure model; the memory occupation is reduced to 40 percent of the original memory occupation; the data structure of the red and black tree is adopted to organize the node information with TEI and MAC address as key, so that the time complexity is reduced from O (n) to O (log (n)).
It is to be understood that the above-described embodiments of the present invention are merely illustrative of or explaining the principles of the invention and are not to be construed as limiting the invention. Therefore, any modification, equivalent replacement, improvement and the like made without departing from the spirit and scope of the present invention should be included in the protection scope of the present invention. Further, it is intended that the appended claims cover all such variations and modifications as fall within the scope and boundaries of the appended claims or the equivalents of such scope and boundaries.
Claims (10)
1. A network organization method based on a binary tree is characterized by comprising the following steps:
organizing a network to be organized by adopting a generalized tree structure;
converting the generalized tree structure into a binary tree structure;
based on the binary tree structure, searching the maximum terminal equipment serial numbers of the designated network level, the leaf nodes and the leaf nodes of the highest level by adopting binary tree post-order traversal with clues, and traversing and deleting subtrees of the designated nodes; and searching the parent node of the designated node by using a binary tree middle order traversal with clues.
2. The method of claim 1, further comprising:
organizing data by using a red-black tree with a terminal equipment serial number and an MAC address as keywords;
and searching the serial number and the specified MAC address of the specified terminal equipment by using the keyword.
3. The method of claim 1, wherein the network to be organized comprises HPLC and HRF heterogeneous networks.
4. The method according to claim 1 or 2, wherein in the generalized tree structure, the root node comprises a central coordinator CCO, the next level node of the root node comprises a proxy coordinator PCO, and the next level node of the hierarchy of the proxy coordinator comprises a site STA.
5. The method of claim 1, wherein each node has two child nodes in the binary tree structure, and wherein converting the generalized tree structure into the binary tree structure comprises:
setting a left node of the generalized tree root node as a first left node of a binary tree root node;
all other neighbor nodes under the same root node of the generalized tree are sequentially set as the right node of the node;
respectively setting left nodes of all child nodes of a first level below a generalized tree root node as left nodes of the nodes below a binary tree;
and respectively setting the right nodes of all child nodes at the first level below the generalized tree root node as the right nodes of the left nodes of the node below the binary tree.
6. The method of claim 5, wherein the threaded binary tree post-order traversal comprises traversing in an order of left sub-tree-right sub-tree-root node.
7. The method of claim 6, wherein the hinted binary tree middle-order traversal comprises traversing the binary tree in an order of left sub-tree, root node, right sub-tree.
8. A network organization device based on a binary tree is characterized by comprising a generalized tree structure organization module, a binary tree structure organization module, a post-order traversal module and a middle-order traversal module; wherein, the first and the second end of the pipe are connected with each other,
the generalized tree structure organizing module is used for organizing a network to be organized by adopting a generalized tree structure;
the binary tree structure organizing module is used for converting the generalized tree structure into a binary tree structure;
the post-order traversal module searches the sequence number of the maximum terminal equipment of the designated network level, the leaf node and the leaf node of the highest level by adopting the post-order traversal of the binary tree with clues based on the binary tree structure, and traverses and deletes the sub-tree of the designated node;
and the middle-order traversal module searches the father node of the designated node by adopting a binary tree middle-order traversal with clues.
9. An electronic device comprising a memory, a processor, and executable instructions stored on the memory and executable on the processor, wherein the processor implements the binary tree based network organization method according to any one of claims 1-7 when executing the program.
10. A computer-readable storage medium having stored thereon computer-executable instructions that, when executed by a processor, implement the binary tree based network organization method of any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210418616.5A CN114978921B (en) | 2022-04-20 | 2022-04-20 | Network organization method and device based on binary tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210418616.5A CN114978921B (en) | 2022-04-20 | 2022-04-20 | Network organization method and device based on binary tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114978921A true CN114978921A (en) | 2022-08-30 |
| CN114978921B CN114978921B (en) | 2024-04-02 |
Family
ID=82977358
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210418616.5A Active CN114978921B (en) | 2022-04-20 | 2022-04-20 | Network organization method and device based on binary tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114978921B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115509996A (en) * | 2022-11-10 | 2022-12-23 | 北京搜狐新动力信息技术有限公司 | Tree structure node retrieval method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1527537A (en) * | 2003-03-03 | 2004-09-08 | ��Ϊ��������˾ | Method of managing objects in network management system |
| CN106357305A (en) * | 2016-11-04 | 2017-01-25 | 重庆邮电大学 | Self-networking method, device and system of tree structure network |
| CN106546875A (en) * | 2016-10-13 | 2017-03-29 | 华北科技学院 | Power circuit alarm method |
| US20210159700A1 (en) * | 2019-11-26 | 2021-05-27 | Schweitzer Engineering Laboratories, Inc. | Control system with load selection strategy that minimizes load overshed |
-
2022
- 2022-04-20 CN CN202210418616.5A patent/CN114978921B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1527537A (en) * | 2003-03-03 | 2004-09-08 | ��Ϊ��������˾ | Method of managing objects in network management system |
| CN106546875A (en) * | 2016-10-13 | 2017-03-29 | 华北科技学院 | Power circuit alarm method |
| CN106357305A (en) * | 2016-11-04 | 2017-01-25 | 重庆邮电大学 | Self-networking method, device and system of tree structure network |
| US20210159700A1 (en) * | 2019-11-26 | 2021-05-27 | Schweitzer Engineering Laboratories, Inc. | Control system with load selection strategy that minimizes load overshed |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115509996A (en) * | 2022-11-10 | 2022-12-23 | 北京搜狐新动力信息技术有限公司 | Tree structure node retrieval method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114978921B (en) | 2024-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100493882B1 (en) | Query process method for searching xml data | |
| US7260558B1 (en) | Simultaneously searching for a plurality of patterns definable by complex expressions, and efficiently generating data for such searching | |
| Pan et al. | Smart trend-traversal: A low delay and energy tag arbitration protocol for large RFID systems | |
| CN108829880B (en) | Method for configuration management of optical network terminal equipment | |
| GB2396991A (en) | Rapid selection of devices in a tree topology network | |
| CN108197313B (en) | Dictionary indexing method for realizing space optimization through 16-bit Trie tree | |
| CN102945249A (en) | Policy rule matching query tree generating method, matching method and device | |
| CN114978921B (en) | Network organization method and device based on binary tree | |
| Yuan et al. | Keyword search over distributed graphs with compressed signature | |
| Behnezhad et al. | Parallel graph algorithms in constant adaptive rounds: Theory meets practice | |
| CN113723548A (en) | Method and device for preprocessing decision tree rule set | |
| CN111597139A (en) | Communication method, system, equipment and medium of GPU | |
| Nekrich et al. | Optimal color range reporting in one dimension | |
| CN108616385B (en) | Query method of Simple Network Management Protocol (SNMP) agent, traversal method and system of Management Information Base (MIB) tree | |
| Lin et al. | A multi-index hybrid trie for lookup and updates | |
| Norige et al. | A ternary unification framework for optimizing TCAM-based packet classification systems | |
| CN116232894A (en) | Message processing method, message processing device and storage medium | |
| CN111858956B (en) | Knowledge graph construction method, knowledge graph construction device, network equipment and storage medium | |
| KR100256686B1 (en) | Method for searching adding and deleting a node on the management information tree using the multiple balanced tree | |
| EP3793171B1 (en) | Message processing method, apparatus, and system | |
| Xu et al. | A novel multilevel index model for distributed service repositories | |
| CN112148830A (en) | Semantic data storage and retrieval method and device based on maximum area grid | |
| CN112732933B (en) | Distributed management and query method for massive knowledge graphs | |
| Jian et al. | An efficient association rule mining algorithm in distributed databases | |
| CN117113229A (en) | Data packet classification method using multiple segmentation decision tree model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |