The PN Planning Algorithm And Application Based On Spanning Tree

With the construction of China Telecom CDMA mobile network continuously,increasing the number of base stations CDMA, PN planning and adjacent areaoptimization work difficulty and workload continues to increase. PN planning is one ofthe important link of the whole optimization process. PN planning and optimizationneeds developing daily, if by artificial planning and optimization work, very difficult tocope with the problem of massive data bring efficiency. If implemented by software,can greatly improve work efficiency. However, the realization of the software, we mustestablish a more effective algorithm. Minimum spanning tree PN re planning algorithmbased on the PN, can solve the efficiency of replanning is low, the problem of the pooreffect.In this thesis, the following work will be on the minimum spanning tree PNreplanning algorithm studying and application:The planning algorithm based on spanning tree PN replanning, will be planning toconsider the use of the district size, determined by the number of feasible scheme ofOne-Way network and Two-Way network, local pilot validation, model determine thepractical application of. The algorithm consists of3sub processes:1) The minimum spanning treeTo calculate the minimum spanning tree is actually from a point in the plot to theminimum path another point after the number of vertices, can be abstracted as aminimum spanning tree in graph theory algorithm. The labeling method is the mostbasic algorithm in graph theory.2) No solution to avoid planning algorithmThe main reason programming without solution is optional for minimum numberof small root was not detected in advance, and the priority allocation of PN. To avoidplanning no solution, it must be in every time before planning to choose an optional rootminimum number of district planning. Planning without solution detection algorithmdetermines the planning order area.3) Optimal evaluation algorithmThrough the planning of no solution to avoid algorithm to find the area of theplanning the next step and the optional PN list, optional root evaluation algorithm for optimal PN target. Each PN uniquely identifies a root, the algorithm idea for theevaluation of the area of each optional optional vertices corresponding to the PN rootreduction ratio, choose to reduce the proportion of at least one root. This is the purposeof minimizing the negative effects of the planning for future planning, let the followingareas are optional root as much as possible, and make PN reuse uniform.Finally, through the practical application of the algorithm of the software utility todo a comprehensive verification and validation of the algorithm, the functionimprovement, simplify working process of manual correction of PN programming;direct application to the present network PN replanning; the use of the algorithmefficiently completed the PN plan.