Quick automatic neighbor planning method for related networks

Abstract

The invention relates to the field of wireless mobile communication, in particular to a quick automatic neighbor planning method for related networks. The method is characterized by comprising the following steps of: generating a weighted V graph according to network topology parameters by a network topology parameter acquisition system, a weighted Voronoi graph generating subsystem, a geomorphic feature processing system, a candidate neighbor generating system and a neighbor priority evaluation system; and determining polygons covered by each cell according to the generated weighted V graph, determining a first network neighbor list according to the adjacent relationship of a service sector and V graph polygons covered by other cells, generating a candidate neighbor list, and finally outputting a neighbor list according to the weight values of each neighbor. The method is suitable for systems of wideband code division multiple access (WCDMA), code division multiple access 2000 (CDMA 2000), time division-synchronization code division multiple access (TD-SCDMA) and global system for mobile communications (GSM) and 3G-to-2G labeled neighbor planning; and the weighted Voronoi graph data are adopted as a data source, and influences of geomorphic features and buildings on neighbor planning are consulted, so the method has the advantages of high running speed, high planning efficiency and precision and low cost.

Description

[technical field] [0001] The invention relates to the field of wireless mobile communication, in particular to a fast and automatic neighbor area planning method related to the network. [Background technique] [0002] The coverage of a cell is limited and specific, but when the user moves out of the coverage of the original cell, the call can still be made, because the wireless mobile network is continuously covered by multiple cells to form a cellular network. During the call, When a user leaves the coverage of a certain cell, the network will allow the user to switch to other adjacent cells to continue to provide business services for the user. It is precisely because of the handover mechanism between cells that multiple cells in the network can be guaranteed to provide continuous services for mobile users. The handover between network cells usually needs to configure the neighbor relationship between adjacent cells. Neighboring cell planning is the configuration of the ...

AI Technical Summary

Problems solved by technology

[0013] Chinese patent 201010001214.2 discloses a neighborhood planning method and its neighborhood planning settings. According to the topological parameters of the cell, the orientation weight value and the number of layers between the first sector and each candidate sector are calculated, and candidates are selected according to the topology score. The sector is the neighboring area of ​​the first sector. Its shortcoming is that it is impossible to define the relationship between the first sector and the second level between the first sector and other sectors. The calculation of the first to fourth angles is very complicated and needs to be The location relationship between the districts is classified and calculated, and the influence of the land features and landforms on the planning of the neighboring districts is not considered.

[0014] Chinese patent 200710129504.3 discloses a method for automatic neighborhood planning, which combines actual system switching, considers the influence of landforms and landforms on propagation signals, and performs neighborhood planning based on coverage analysis results. The shortcoming is that it completely relies on coverage analysis results. Cannot reflect the latest terrain conditions or the propagation model itself has correction accuracy problems and engineering parameter data are inaccurate, which will lead to deviations in coverage analysis accuracy, and the neighbor relationship configuration based on accuracy is far from the actual network requirements

Images