A management structure splitting method for a tree-structure network, the tree-structure network comprising a root node R and a number of child nodes, each child node comprises a list of child nodes, a counter of the number of child nodes, a list of neighbor nodes, and a parent node pointer, the method comprising: step 1), if Q is greater than a preset parameter L, proceeding to step 2); otherwise, exiting from the operation; wherein Q(x) is used to represent a function of calculating the total number of all the child nodes under a root node x in the tree with x as the root node; step 2), it is assumed that a node o is a dynamic root node, representing a list of child nodes with the node o being a parent node as P = { p 1, p 2,..., p i,...}; wherein initially the node o is the root node R; step 3), if all the next generation child nodes p i of the node o satisfy Q( p i)<Q(o)/2, aggregating all the child nodes into two classes with such an aggregation optimization objective that the difference between the total numbers of child nodes of the nodes in the two classes is minimal; and after aggregating into two classes, deploying or assigning a new node o' as a newly split management root node, making a parent node of one class of nodes in the aggregated two classes in a management structure point to the new management root node o', and ending the operation; otherwise, proceeding to step 4); step 4), for any one child node p i in the next generation of the node o, if Q( p i)=Q(o)/2, extracting p i and a subtree thereof as a new management tree, deploying a new management root node at the position of p i or a network position above p i, making p i point to the new management root node, and then ending the operation; otherwise, proceeding to step 5); and step 5), for any one child node p i in the next generation of the node o, if Q( p i)>Q(o)/2, setting the node p i to be dynamic root node o, and re-executing the step 3). step 1), if Q is greater than a preset parameter L, proceeding to step 2); otherwise, exiting from the operation; wherein Q(x) is used to represent a function of calculating the total number of all the child nodes under a root node x in the tree with x as the root node; step 2), it is assumed that a node o is a dynamic root node, representing a list of child nodes with the node o being a parent node as P = { p 1, p 2,..., p i,...}; wherein initially the node o is the root node R; step 3), if all the next generation child nodes p i of the node o satisfy Q( p i)<Q(o)/2, aggregating all the child nodes into two classes with such an aggregation optimization objective that the difference between the total numbers of child nodes of the nodes in the two classes is minimal; and after aggregating into two classes, deploying or assigning a new node o' as a newly split management root node, making a parent node of one class of nodes in the aggregated two classes in a management structure point to the new management root node o', and ending the operation; otherwise, proceeding to step 4); step 4), for any one child node p i in the next generation of the node o, if Q( p i)=Q(o)/2, extracting p i and a subtree thereof as a new management tree, deploying a new management root node at the position of p i or a network position above p i, making p i point to the new management root node, and then ending the operation; otherwise, proceeding to step 5); and step 5), for any one child node p i in the next generation of the node o, if Q( p i)>Q(o)/2, setting the node p i to be dynamic root node o, and re-executing the step 3).