Optimization Algorithm to Eliminate Solitary Point in the Tree Network

In order to eliminate the lone points in the tree network, improve network performance, the paper proposes a centralized tree topology construction algorithm. After coordinator neighbor gets relations between all nodes, you can determine the upper and lower bounds of the depth of the tree network. Given a depth ceiling, finding a minimum annihilator nodes tree topology that contains all the nodes is an NP-Hard problem. So this paper proposed an approximation algorithm to solve the problem, thus achieving the elimination of isolated nodes and improvement of network performance. Finally, we perform o analysis for the time complexity and approximate degree of approximation algorithm performance. The approximate degree results show that, despite the increase in the depth of network constraints, the algorithm is still able to solve the problem without depth constraints.