CN102404752B - Frequency planning method in GSM network - Google Patents
Frequency planning method in GSM network Download PDFInfo
- Publication number
- CN102404752B CN102404752B CN201110442468.2A CN201110442468A CN102404752B CN 102404752 B CN102404752 B CN 102404752B CN 201110442468 A CN201110442468 A CN 201110442468A CN 102404752 B CN102404752 B CN 102404752B
- Authority
- CN
- China
- Prior art keywords
- frequency
- planning
- community
- carrier frequency
- region
- 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.)
- Active
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a frequency planning method in GSM network. The frequency planning method in GSM network comprises the following steps: A, infrastructure data collection and collation; B, coverage optimization; C, neighboring optimization; D, optimization of same frequency and same BSIC (Base Station Identity Code); E, measured data collection and collation; F, interference matrix building; G, frequency model judgment; H, planning object selection; I, frequency planning; and J, cutting implementation according to frequency planning results; Step B is based on data of Step A, in Step B, a comprehensive general survey on the planning network is made, an antenna of the network, a repeater, an indoor distribution system and an extension system are understood and mastered comprehensively; and then coverage is optimized; Step G is based on data of Step A, through the analysis of network mean carrier frequency configure number and density of mean carrier frequency configure per unit area, the method for optimal frequency multiplexing model is acquired; Step G is based on data of Step A, according to requirements of the planned residential areas, a region, scale and capacity, the method for planning the region is acquired. The invention has high response speed.
Description
Technical field
The present invention relates to the communications field, be specifically related to a kind of frequency planning method of GSM network.
Background technology
GSM (global system for mobile communications) has adopted the multi-access mode of TDMA and FDMA, and wherein FDMA system is based on frequency partition channel.Each user communicates by letter in a pair of channel.If while having the composition of other signal to fall in the channel band of a receiver user, by the interference causing useful signal.If frequency planning obtains bad when overall plan of network, can cause whole network to build up or dilatation after some performance index nonconforming, as neighbor cell allocation identical carrier frequency, user just may be subject to the interference of neighbor cell on same carrier frequency therein in Yi Ge community during call, cause incoming level better, but the situation that the quality of reception is poor, even causes call drop.And the current downward along with mobile communication rate, telephone traffic is increased sharply, GSM network size constantly expands, base station density and the configuration of single cell carrier are more and more higher, highly dense business building district average station distance approaches 200 meters, increase gradually 18 carrier wave allocating cells, carrier tank technology is also widely used simultaneously, the raising of traffic densification degree has proposed new requirement to frequency planning, in these regions, some traditional frequency planning methods are inapplicable, how to improve to greatest extent the availability of frequency spectrum, promote network performance, it is an important process in current network optimization work.
In prior art, main employing by extracting measured data, the measurement report that network management system gathers, the analogue data of covering, the data such as the traffic measurement of user's communication, then construct interference matrix model, and realize frequency planning by computerized algorithms such as heredity.
In the research and practice process to prior art, inventor finds at least to exist in prior art scheme following problem: compatible equipment component manufacturer data only, data format requires complicated, several data can not Conjoint Analysis, verification, the Method and Process of planning is comparatively complicated simultaneously, is not easy operation, and has deficiency for highly dense type network and regional planning and response speed, above reason makes existing technical products range of application limited, and the effect of planning is also affected.
Summary of the invention
In order to overcome the deficiencies in the prior art, the present invention proposes a kind of frequency planning method of GSM network, it can solve producer's format compatible problem, and mode of operation is various and flexible, can plan according to heterogeneous networks scale fast response time.
In order to achieve the above object, the technical solution adopted in the present invention is as follows:
A frequency planning method for GSM network, comprises the following steps:
A, basic data are compiled: the constraints information of extracting LAC, CI, BCCH frequency, TCH frequency, carrier frequency number, frequency-hopping mode, neighboring BS relationship, planning region area and the hardware of existing network community, and incorporation engineering parameter information, complete Back ground Information table, then enter respectively step B, step G and step H; Described engineering parameter information comprises longitude and latitude, deflection, angle of declination, antenna type, the repeater information of existing network community;
B, coverage optimization: according to Back ground Information table, coverage optimization is carried out in existing network community, comprise the antenna cover of existing network community is optimized, and the repeater of existing network community is covered and is optimized, enter step C;
C, Neighborhood Optimization: the neighboring BS relationship to planning region is optimized, comprise and delete redundancy adjacent area and increase the adjacent area of leaking definition, enters step D;
D, with frequently optimizing with BSIC: the same BCCH to existing network checks with BSIC community, centered by community separately, in the scope in 6 kilometers, 3 kilometers, urban district and suburb, can not occur with its with BCCH the community with BSIC, enter step e;
E, measurement data acquisition are processed: measurement data is gathered, and the measurement data of employing comprises frequency sweep data and/or webmaster measurement report and/or signaling measurement report, enters step F;
F, interference matrix build: according to measurement data, carry out co-channel interference matrix table and adjacent frequency interference matrix table that interference analysis obtains each minizone, enter step I;
G, frequency model judgement: according to the information of Back ground Information table, calculate unit are carrier frequency density, according to unit are carrier frequency density, select frequency model, select the process of frequency model to be: if unit are carrier frequency density is greater than 30 every square kilometre, to adopt 1*3 frequency model; If unit are carrier frequency density is more than or equal to 30 every square kilometre and be less than 50 every square kilometre, adopt 4*3 frequency model; If unit are carrier frequency density is more than or equal to 50 every square kilometre and be less than 65 every square kilometre, adopt MRP frequency model; If unit are carrier frequency density is greater than 65 every square kilometre, adopt dynamic multiplexing frequency model; Wherein, unit are carrier frequency density equals mean carrier frequency number divided by planning region area, and mean carrier frequency number equals to plan that total carrier frequency number of all communities in region, divided by planning Nei Zong community, region number, enters step I;
H, plan objects are selected: according to the information of Back ground Information table, determine that planning region is single plot planning or line plot planning or face plot planning, enter step I;
I, frequency planning: in conjunction with co-channel interference matrix table and adjacent frequency interference matrix table, adopt heuritic approach and/or genetic algorithm to carry out frequency planning; And according to the frequency model in step G, in heuritic approach or genetic algorithm, according to corresponding frequency model rule, carry out frequency planning; And adopt heuritic approach and/or genetic algorithm according to the planning region in step H, and if planning region is single plot planning, adopt heuritic approach, if planning region is line plot planning or face plot planning, adopt heuritic approach and/or genetic algorithm; Enter step J;
J, according to the cutover of frequency planning result, implement.
Preferably, in step F, the probability that in extraction Various types of data, Serving cell and neighbor cell signal ionization meter report difference are disturbed as same adjacent frequency, get the measurement report number of C/I<9dB as the probability of co-channel interference, get the measurement report number of C/I<-6dB as the probability of adjacent frequency interference.
The present invention has following beneficial effect:
Solve manufacturer data format compatible problem: support the input of several data form, comprise Ericsson, Huawei, Nokia, the measurement report that the distinct device producer network management systems such as Motorola are extracted, and frequency sweep drive test data, and the measurement report of signal collecting acquisition, and can automatically carry out Data Integration, increase work efficiency.
The diversity of program operation mode and flexibility: solved in prior art and can not take into account a little comprehensively, line, the problem of face, and the too complicated problem of operation, can realize planning and the optimization of the whole network/region/single website, mostly be operating in a key, efficient flexibly and easily.
The feasibility of the different scales network planning: for heterogeneous networks scale, can automatic evaluation, and provide best Frequency Design model, and can planning weight be set according to different regional characteristicses in algorithm design, to reach the frequency object that more optimal sorting is joined.
Response speed problem: adopted heuristic and genetic algorithm, can adopt the combination of algorithms of different according to different scenes, greatly improved the response speed of planning.
Accompanying drawing explanation
Fig. 1 is the flow chart of frequency planning method of the GSM network of preferred embodiment of the present invention;
Fig. 2 is the heuritic approach flow chart of preferred embodiment of the present invention;
Fig. 3 is the genetic algorithm flow chart of preferred embodiment of the present invention.
Embodiment
Below, by reference to the accompanying drawings and embodiment, the present invention is described further, so that clearer, understand the present invention's technological thought required for protection.
As shown in Figure 1 to Figure 3, a kind of frequency planning method of GSM network, comprises the following steps:
A, basic data are compiled: the constraints information of extracting LAC, CI, BCCH frequency, TCH frequency, carrier frequency number, frequency-hopping mode, neighboring BS relationship, planning region area and the hardware of existing network community, and incorporation engineering parameter information, complete Back ground Information table, then enter respectively step B, step G and step H; Described engineering parameter information comprises longitude and latitude, deflection, angle of declination, antenna type, the repeater information of existing network community.
It should be noted that, steps A is to provide basic data foundation for step B, G, tri-steps of H.Wherein step B is on the data basis of steps A, by planning network is comprehensively generally investigated, and the antenna to network, repeater, indoor distributed system, stretch system carries out comprehensively understanding and grasping, the optimization then covering.
Wherein step G is on the data basis of steps A, by network mean carrier frequency configured number, and the analysis of unit are mean carrier frequency configuration density, to obtain the way of the multiplexing model of optimum frequency.
Wherein step H is on the data basis of steps A, according to community, region, scale and the capacity requirement of planning, obtains the way in planning region.
B, coverage optimization: according to Back ground Information table, coverage optimization is carried out in existing network community, comprise the antenna cover of existing network community is optimized, and the repeater of existing network community is covered and is optimized, enter step C.
Concrete, before carrying out Data Collection, it is to guarantee the of paramount importance work of planning effect that the antenna cover of existing network is optimized, if putting in place of Coverage Control can be laid a good foundation for the guarantee of planning effect.The major tasks of coverage optimization are that those are existed to area covered, and cover irrational community and cover adjustment, reduce its interference to other communities., repeater (wireless signal multiplying arrangement) verified comprehensively, to judge whether having alms giver community (community being exaggerated) mistake, and overlay area the problem such as misfits meanwhile, for the accuracy of frequency planning provides safeguard.
the integral principle that antenna is adjusted is as follows:
(1) directivity principle, according to the situation of existing network, the direction of substantially unified community, for example: the direction by 0/120/240;
(2) equalizing traffic volume principle, when carrying out antenna adjustment, considers that community absorbs the situation of traffic, the traffic of equilibrium phase adjacent cell;
(3) community covering overlapping area is controlled in rational scope, the situation of high station area covered is reduced antenna height or increases angle of declination and control, the antenna larger to inclination angle, considers that mechanical tilt antenna pattern holds yielding situation, should consider to change into electrical tilt antenna;
(4) special circumstances special processing, is replaced with the antenna of low gain, narrow lobe or changes antenna direction the antenna of lakeside, river bank and control water surface interference around;
(5) network stabilization principle, obtains maximum network quality with the antenna adjustment of trying one's best few and improves;
(6) carrier frequency number is greater than 6, and antenna height and inclination angle are adjusted in traffic compare Gao community, and carrier number is lowered, and in order to later dilatation, use same class frequency, is unlikely to upset mould frequently;
(7) originally owing to solve covering reason, antenna arranges irregular, existing newly open station set up after covering be not a problem, but the community that antenna does not adjust is adjusted according to antenna direction uniform principles as far as possible;
(8) reduce too much antenna and cause channeling difficulty toward the radiation of same open space; ;
(9) both direction angle is greater than antenna half-wave power angle
(10), in urban district, adopt electric having a down dip to combine and avoid the excessive rear wave distortion of pure mechanical tilt angle with mechanical tilt;
(11) close quarters, uses the larger antenna in vertical lobe angle instead, and half-wave power angle is the antenna of 65 degree;
(12) direction is over against person, and an angle staggers;
(13) drive test finds to disturb compare great community at ordinary times;
(14) take new website (antenna type, deflection, angle of declination etc.) into consideration.
Aerial position adjustment mainly comprises horizontal position adjustment and upright position adjustment (being that putting position and extension are high).
(1) adjustment of horizontal level is mainly to consider according to the stopping of antenna the place ahead, coverage goal.
(2) upright position, antenna extension is high, and in the situation that base station transmitting power is certain, it is the decisive factor of determining coverage radius of cell that antenna is hung height, and adjusting principle is to adjust according to covering, cell load and disturbed condition.
According to the factor of the situation of real network and execution conditions, this is adjusted the main consideration networking initial stage and hangs Gao compare Gao community for increasing cover antenna, antenna is lowered, within being convenient to that interference is controlled to certain scope in conjunction with covering factor as far as possible.
For the antenna that will raise, the community of Main Basis on-the-spot base station investigation and Drive Test covers, and is generally that suburb or the place ahead have the base station stopping to be just added on consideration.
In conjunction with aerial position adjustment, the horizontal half-power angle that guarantees antenna is unobstructed within closely with vertical half-power angle scope, coordinate certain area internal antenna as far as possible and point to and to be consistent, then adjust antenna azimuth in conjunction with the stopping of landform, the place ahead, covering, telephone traffic.For lake region, mainly according to drive test data, judge whether to exist lake region to disturb, then make adjustment scheme.
For adjusting angle compare great community, field survey, the repeater that attention may have influence on, and after adjustment the corresponding adjacent area of additions and deletions;
Antenna downtilt Main Basis is NCS and MRR measurement report, traffic measurement, and disturbed condition and actual wireless environment, as antenna terrain clearance, surrounding environment etc. are adjusted;
Along with increasing of newly-built base station, the base station in urban district is more and more closeer, and station spacing is more and more less, and the overlay area that each community requires diminishes, and normally by increasing Downtilt, controls the coverage of community, reduces area covered, reduces and disturbs.For by the antenna of mechanical tilt, its tilt angled down should not surpass 15 degree, and tilt angled down is excessive, and serious distortion will occur the directional diagram of antenna, and the covering of community and interference control are brought to difficulty.If there is antenna need to carry out having a down dip of wide-angle, suggestion changes electrical tilt antenna into.
it is as follows that antenna model is adjusted principle:
(1) antenna gain: the gain ranging of antenna for base station is from 0dBi to 20dBi at present.The antenna gain that wherein indoor microcellulor covers is 0-8dBi, and 9dBi is to 13dBi in omnidirectional antenna gain, directional antenna gain 15dBi-18dBi.Gain 20dB is used in highway and sea covers station.
(2) antenna lobe width: the common horizontal lobe 3dB width of directional antenna has 20 °, 30 °, 65 °, 90 °, 105 °.The general gain of kind of wherein 20 °, 30 ° is higher, is used for the covering of strip or highway; 65 ° of coverings for area, dense city exemplary base station three sector configuration wide in variety (the network overwhelming majority is 65 degree at present), 90 ° of coverings for suburban areas, cities and towns exemplary base station three sector configuration wide in variety, 105 ° of coverings for scarcely populated regional exemplary base station three sector configuration wide in variety.
(3) for compact district, can consider high-gain to be changed to low gain, large field angle changes little field angle (suburb and 2 cell base stations can not changed) into, and have a down dip greatly (being greater than 12 degree) changes the having electronic antenna that has a down dip into; To the antenna in cell in specific position, according to actual conditions, antenna can be considered to change, as the antenna of river bank, lakeside, low gain can be considered to be replaced with, the antenna of narrow beam.
(4) in drive test, find that the underproof antenna of antenna performance also considers to change.
(1) alms giver community coverage optimization: according to repeater data and field test data, rectify and improve the repeater that alms giver's cell coverage area is not met to designing requirement, the community that selected coverage distance and capacity all mate is as alms giver community.
(2) for crossing the repeater optimizing cells covering: for crossing the repeater that covers or cover redundancy, according to actual measurement and prospecting result, adopt the scheme of its coverage of rectification or dismounting, make concrete analyses of concrete problems.
C, Neighborhood Optimization: the neighboring BS relationship to planning region is optimized, comprise and delete redundancy adjacent area and increase the adjacent area of leaking definition, enters step D.
Concrete, the quality of neighboring BS relationship has determined the accuracy (neighboring BS relationship switches for the community of GSM network, and the community of undefined neighboring BS relationship can not be switched) of measurement report, after completing coverage optimization, neighboring BS relationship to planning region is optimized, delete redundancy adjacent area, increase the adjacent area of leaking definition, to guarantee the accuracy of measurement report, the optimization of adjacent area is the correlation based on minizone mainly, comprise distance, direction is pointed to, measured intensity and the switching frequency.
For the work of community Neighborhood Optimization, carry out according to the following steps:
1) particular factor of all neighbor cells of calculation plot A " adjacent area tightness "
2) each adjacent area is by " adjacent area tightness " score value from low paramount sequence, and score value is lower, and the feasibility of deletion is also high, and score value is higher, and the feasibility of complementary definition is higher.
3) delete the algorithm of adjacent area, from the minimum adjacent area B of score value, carry out following inspection:
● check community B state, determine whether statistical time range exists fault or close situation, with the accuracy of determining that " adjacent area tightness " calculated.
● check the particular factor " adjacent area tightness " of all adjacent areas of community B, determine score value and the rank of community A, rank more before, the feasibility of deletion is higher.
● whether adjacent area, B community distance is more approaching.
● check road test record, judge whether necessary adjacent area, can whether must be connected community by MAPINFO information check, and judge whether to cause owing to crossing to cover.
● check site environment, determine whether that the factors such as indoor and outdoor handing-over cause the lower reason of statistic.
● check whether other specific reasons define adjacent areas, as complained stain guarantee, the guarantee of VIP place etc.
● determine after above-mentioned reason, can delete the neighboring BS relationship of B community
● according to which, repeat judgement, delete to requiring in the quantitative range of adjacent area
4) increase the algorithm of adjacent area, from the highest neighbor cell C of score value, carry out following inspection:
● check the particular factor " adjacent area tightness " of all adjacent areas of community C, determine score value and the rank of community A, rank more before, the feasibility of increase is higher.
● whether adjacent area, C community distance is more approaching.
● check road test record, judge whether necessary adjacent area, can whether must be connected community by MAPINFO information check, and judge whether to cause owing to crossing to cover.
● determine after above-mentioned reason, can consider to increase the neighboring BS relationship of C community
● according to which, repeat judgement, be increased to and require in the quantitative range of adjacent area
The algorithm of " adjacent area tightness ":
" adjacent area tightness X " is the result of OMC measurement report data statistical analysis, and every a pair of neighbor cell is calculated, and to assess the tightness degree of its neighbouring relations, its concrete grammar is as follows:
● extract the measurement report statistics of a time period, basic demand is at least one complete week, and every day, definition was no less than 3 hours.
● extract the statistics number that neighboring area signal intensity is greater than Serving cell 0dB
● add up this cell measurement to the total degree (M_ALL) of every other adjacent area
● add up this cell measurement to specific adjacent area total degree (M_N) separately
Calculate the tightness of each adjacent area: X=M_ALL/M_N.
D, with frequently optimizing with BSIC: the same BCCH to existing network checks with BSIC community, centered by community separately, in the scope in 6 kilometers, 3 kilometers, urban district and suburb, can not occur with its with BCCH the community with BSIC, enter step e.
Concrete, in the measurement report that mobile phone reports, BCCH and the BSIC information of reporting neighboring cell, and when carrying out community coupling, to mate by BCCH and the BSIC information of basic database small area, for avoiding occurring that erroneous matching community causes measurement report mistake in judgment, before carrying out measurement report collection, need the same BCCH of existing network to check with BSIC community, principle is 3 kilometers, urban district centered by community separately, can not occur with it with the same BSIC of BCCH in the scope that suburb is 6 kilometers.
E, measurement data acquisition are processed: measurement data is gathered, and the measurement data of employing comprises frequency sweep data and/or webmaster measurement report and/or signaling measurement report, enters step F.
Concrete, measurement data is the data source of structure interference matrix, and this method mainly adopts following three kinds of measurement data, according to the demand of real work, can adopt wherein any one or several combinations;
(1) frequency sweep data acquisition process: adopt high speed sweep generator, in conjunction with GPS, highly dense sweep check is carried out in needs planning planning region and periphery, be collected in enough little grid, the signal strength signal intensity of related cell, to obtain the correlation between them, after having gathered at the scene, data are carried out to analytical integration processing, and carry out the integrity checking of data, to some cell data disappearances (closing as tested base station at that time), newly open the situations such as website and carry out data amended record.
(2) webmaster measurement report: the network management platform definition measurement report of at least 72 hours in distinct device producer, the measurement report gathering is carried out to analytical integration processing, equally also need to carry out the integrity checking of data, to some cell data disappearances (closing as tested base station at that time), newly open the situations such as website and carry out data amended record.
(3) signaling measurement report: be connected signal collecting instrument in the BSC of distinct device producer mono-side A-BIS interface (base station and BSC interface) high resistant multiple connection mode, gather the measurement report of at least 72 hours, and the measurement report gathering is carried out to analytical integration processing, equally also need to carry out the integrity checking of data, to some cell data disappearances (closing as tested base station at that time), newly open the situations such as website and carry out data amended record.
Different manufacturers, different classes of data, need to be handled as follows, reached and eliminated producer's form and affect object: extracted Serving cell in Various types of data (travelling carriage resident and accept the community of broadcast) and neighbor cell (for the alternative cell of switching) signal strength measurement report difference as the probability of same adjacent frequency interference, getting the measurement report number of C/I<9dB (is the same frequency carrier/interface ratio of Serving cell as the probability of co-channel interference, equal the signal strength signal intensity of the signal strength signal intensity-neighbor cell of Serving cell, during be less than+9dB of the strength difference when Serving cell and neighbor cell, think and can produce interference when configuration same frequency), the probability that the measurement report number of getting C/I<-6dB disturbs as adjacent frequency (is the adjacent frequency carrier/interface ratio of Serving cell, equal the signal strength signal intensity of the signal strength signal intensity-neighbor cell of Serving cell, during be less than-6dB of the strength difference when Serving cell and neighbor cell, think and can produce interference when configuration side frequency).
F, interference matrix build: according to measurement data, carry out co-channel interference matrix table and adjacent frequency interference matrix table that interference analysis obtains each minizone, enter step I.
Concrete, for being to be greater than 0 natural number by n(n) network that forms of individual cell/section, its community co-channel interference table T
cIwith adjacent frequency interference table T
cArespectively a n*n matrix, matrix T
cIin element a
ijrepresent the same frequency carrier interference ratio C/I between i cell-of-origin/sector and j interfered cell/sector, matrix T
cAin element aij represent the adjacent frequency carrier interference ratio C/A between i cell-of-origin/sector and j interfered cell/sector.Wherein, i and j are the natural number that is greater than 0.
At area interference table T
cIand T
cAon basis, generate with frequency interim matrix M
cIwith adjacent frequency interim matrix M
cA.
Matrix M
cIin element a
ijexpression is according to co-channel interference requirement, is the frequency of i cell-of-origin/sector configuration and is the spacing between the frequency of j interfered cell/sector configuration, is referred to as shared channel spacing constraint.
Matrix M
cAin element a
ijexpression is according to adjacent frequency interference requirement, is the frequency of i cell-of-origin/sector configuration and is the spacing between the frequency of j interfered cell/sector configuration, is referred to as the constraint of adjacent frequency channel spacing.
According to area interference table T
cIand T
cA, according to following principle, generate community with frequency interim matrix SE
cIwith adjacent frequency interim matrix SE
cA.
If a) C/I >=9dB of 2 minizones, the channel spacing of 2 minizones is 0, can distribute identical frequency;
B) if 2 minizones-6dB≤C/I≤9dB, the channel spacing of 2 minizones is 1, can distribute adjacent frequency;
C) if the C/I of 2 minizones≤-9dB, the channel spacing of 2 minizones is at least 2;
D), to a plurality of carrier frequency in same community, in order effectively to prevent the interference of same location, the channel spacing between each carrier frequency should be greater than 3, is traditionally arranged to be 4 or 5 intervals in interim matrix.
E) if the C/A of 2 minizones >=-6dB, the channel spacing of 2 minizones is 0, can distribute identical frequency;
F) the different carrier frequency in each cell/section of same base station, at least will guarantee that 1 more than channel spacing, could effectively prevent adjacent frequency interference, are traditionally arranged to be 1 or 2 interval in interim matrix.
G, frequency model judgement: according to the information of Back ground Information table, calculate unit are carrier frequency density, according to unit are carrier frequency density, select frequency model, select the process of frequency model to be: if unit are carrier frequency density is greater than 30 every square kilometre, to adopt 1*3 frequency model; If unit are carrier frequency density is more than or equal to 30 every square kilometre and be less than 50 every square kilometre, adopt 4*3 frequency model; If unit are carrier frequency density is more than or equal to 50 every square kilometre and be less than 65 every square kilometre, adopt MRP frequency model; If unit are carrier frequency density is greater than 65 every square kilometre, adopt dynamic multiplexing frequency model; Wherein, unit are carrier frequency density equals mean carrier frequency number divided by planning region area, and mean carrier frequency number equals to plan that total carrier frequency number of all communities in region, divided by planning Nei Zong community, region number, enters step I.
Concrete, frequency model refers to the compound mode that channeling is used, multiplexingly at GSM network medium frequency be exactly, make the different region of same frequency coverage, these use the region of same frequency to need each other at intervals (being called frequency reuse distance), to meet, co-channel interference is suppressed in the index of permission, mainly contain at present 4*3,1*3,1*1, MRP, the modes such as dynamic multiplexing etc.
According to the carrier configuration of steps A data Zhong community, planning region area data, carries out analyzing and processing, and as the base data table of input, judgement draws the frequency model of the most applicable planning network operation, for the frequency-selecting algorithm of i process.
Concrete frequency model decision algorithm is according to as shown in table 1:
Table 1
Wherein the formula of unit are carrier frequency density is as follows:
Unit are carrier frequency density Y(/ square kilometre)=mean carrier frequency number/planning region area
Nei Zong community, the total carrier frequency number/planning region number of all communities in mean carrier frequency number=planning region.
H, plan objects are selected: according to the information of Back ground Information table, determine that planning region is single plot planning or line plot planning or face plot planning, enter step I.
Concrete, on the data basis of steps A, grasp the object that needs planning, as planned range, region etc., this method can be according to the needs of planning, optionally planning, solved in prior art and can not take into account a little comprehensively, line, the problem of face, and the too complicated problem of operation, can realize planning and the optimization of the whole network/region/single website, mostly be operating in a key, efficient flexibly and easily.
Single plot planning: directly click community with planning button, this device will, according to frequency model and interference matrix, be this cell allocation optimization frequency automatically.
Line or face plot planning: adopt constraints table, the community of needs planning is packed in table, constraints is set, this device will be automatically according to frequency model and interference matrix, is this region cell allocation optimization frequency.
Table 2 is constraints table sample table:
Table 2
I, frequency planning: in conjunction with co-channel interference matrix table and adjacent frequency interference matrix table, adopt heuritic approach and/or genetic algorithm to carry out frequency planning; And according to the frequency model in step G, in heuritic approach or genetic algorithm, according to corresponding frequency model rule, carry out frequency planning; And adopt heuritic approach and/or genetic algorithm according to the planning region in step H, and if planning region is single plot planning, adopt heuritic approach, if planning region is line plot planning or face plot planning, adopt heuritic approach and/or genetic algorithm; Enter step J.
Concrete, according to the difference of the scale of plan objects, this method has adopted heuristic and two kinds of algorithms of genetic algorithm as the algorithm of frequency planning, can be according to network size, and frequency model, the factors such as network-intensive degree, select planning algorithm flexibly.
The application of step G frequency model in step I: according to the court verdict of step G, adopt corresponding frequency model during plan frequency in step I, in heuritic approach and/or genetic algorithm, plan according to frequency model rule.
The application scenarios of heuritic approach: the object judgement according to step H, in definite plan objects, be " single plot planning " time, adopt heuritic approach.
The application scenarios of genetic algorithm: the object judgement according to step H, while being " line or face plot planning " in definite plan objects, optionally adopts heuritic approach or genetic algorithm, or adopt the mode of inspiration+genetic algorithm.
After determining use planning algorithm, according to corresponding algorithm and constraints, plan.
The process of heuritic approach and genetic algorithm below:
As shown in Figure 2, the Mathematical Modeling of heuritic approach:
By all frequencies with 1,2,3 ... label of m positive integer, defines a frequency point sets.
F={f
i} i≤m
Suppose that the two-dimensional matrix that can define a m * n is designated as C by n the cell mobile communication systems that community forms
mn.Mathematic(al) representation is.
C
mn=[c
ij] i≤m,j≤n
Matrix C
mnelement c
ij=1 represents j community of i frequency point allocation, c
ij=0 represents not i frequency point allocation the j community.
The vector R(that defines n dimension is called channel demands vector) represent the channel demands of each community.
R=(r
i) i≤n
I element r in demand vector R
ithe channel demands number that represents i community.
The matrix of two n * n of definition represents respectively same, the adjacent frequency interference matrix of community.
CI
nn=[c
ij] i,j≤n
CA
nn=[c
ij] i,j≤n
CI
nnelement c
ijvalue represent j the co-channel interference of community to i community.CA
nnelement c
ijvalue represent that j community disturb the adjacent frequency of i community
The interference of each community
Wherein
the co-channel interference that has represented community, j wherein represents the cell number that has identical frequency with i community,
the adjacent frequency that has represented community is disturbed, and j wherein represents the cell number that has adjacent frequency with i community.Therefore the interference summation of the whole network is:
Definition vector D
1, D
2represent that respectively co-channel interference distribution degree-of-difficulty factor and adjacent frequency interference distribute degree-of-difficulty factor,
D
1=(d
i) i∈[1,n]
D
2=(d
i) i∈[1,n]
Degree-of-difficulty factor size is expressed as the power of this area interference constraints.Distribute difficulty great community priority allocation channel, distribute allocated channel behind difficulty little community, according to degree-of-difficulty factor D
1, D
2size descending is carried out in community.
CAP problem is just converted at known F, R, CI
nnand CA
nnin situation, ask the C that has met various constraintss
mnand make the interference of minizone as far as possible little.
Function and the algorithmic descriptions of heuritic approach are as follows:
the heuristic information of using has: a) priority of community; B) product of community co-channel interference value and channel demands; C) product of community adjacent frequency interference value and channel demands;
Structure: adopt the two-dimensional matrix F of binary system n * m to represent channel assignment scheme, the row of matrix represents the number of channel, and row represent community number, and [i, j]=1 represents frequency f
jdistributed to community C
i, otherwise [i, j]=0.
(in the following describes " community same/adjacent frequency disturb and " refer to that same frequency, adjacent frequency that all Dui Gai community produces are disturbed and; Interval refers to the poor of two frequencies, if the interval of frequency 6 and 1 is 5)
1) from lane database community table, find the essential information of the community of each: title and carrier frequency number.
2) from interference table, find co-channel interference, the adjacent frequency interference of each community.
3) according to the adjacent frequency of community, disturb He Dui community to carry out descending sort.
4) according to the co-channel interference He Dui community of community, carry out descending sort.
5) according to the priority of community, descending sort is carried out in community.
6) respectively available TCH frequency and BCCH frequency are carried out to order sequence.
7), according to the order sequencing, successively TCH is for the first time carried out in each community and distributes:
A) from original TCH, can meet the frequency disturbing with location with finding frequency, and if calculate this community of this frequency point allocation, this community same/adjacent frequency disturb and.
Ru Dui community C
idistribute, first from untapped TCH frequency, find and C
iexisting frequency meets the frequency f disturbing with location
jif calculated f
jdistribute to C
i, C
isame/adjacent frequency disturb and.
B) in a), may find a plurality of frequencies, therefrom find out and produce the frequency f that same/adjacent frequency is disturbed sum minimum
m, by this frequency point allocation Gei Gai community, [i, m]=1.
C) a) b of circulation); One of condition below the condition finishing: (1) has met the TCH demand of community.(2) a) can not find and meet the frequency disturbing with location.
8) according to the order sequencing, successively community is distributed for the second time, this sub-distribution is mainly that all communities are carried out BCCH distribution and TCH demand is also carried out to TCH distribution in unsatisfied community:
A) from all TCH frequencies, find out and meet the frequency disturbing with location, and if calculate this community of this frequency point allocation, this community same/adjacent frequency disturb and.
Ru Dui community C
idistribute, from all TCH frequencies, find and C
iexisting frequency meets the frequency f disturbing with location
jif calculated f
jdistribute to C
i, C
isame/adjacent frequency disturb and.
B) in a), may find a plurality of frequencies, therefrom find out and produce the frequency f that same/adjacent frequency is disturbed sum minimum
m, by this frequency point allocation Gei Gai community, [i, m]=1.
C) a) b of circulation); One of condition below the condition finishing: the TCH frequency demand that 1) has met community.2) if can not find the frequency meeting with location interference, the spacing of cut 1 that same location is disturbed, Dui Gai community is carried out primary distribution again.If the interval of disturbing with location reduces to 2, also can not find and meet the frequency disturbing with location, the TCH that finishes Dui Gai community distributes.
D) BCCH distribution is carried out in community, first can be with both finding and meet and disturb with location frequency from BCCH, meet again the frequency of neighbor cell BCCH frequency constraint (i.e. the BCCH of two neighbor cells can not adjacent frequency), if calculated this frequency point allocation Gei Gai community, this community same/adjacent frequency disturbs sum.
E) from d) find out the frequency f that disturbs sum minimum with/adjacent frequency
n, by this frequency point allocation Gei Gai community, [i, n]=1.
9) calculate this sub-distribution and produce co-channel interference total value, relatively whether the result of this sub-distribution is better than the result of record; If so, record the result of this distribution.
10) judge whether to reach cycle-index, if so, algorithm finishes; If not, forward 11 to).
11) revise each community same/adjacent frequency interference value, cycle-index adds 1; Forward 3 to).
Illustrate:
A) initialized process is to read information and the interference table of distributing community from lane database.
B) heuristic information of using has: the 1. priority of community; 2. the product of community co-channel interference value and channel demands; 3. the product of community adjacent frequency interference value and channel demands;
As shown in Figure 3, the Mathematical Modeling of genetic algorithm:
Initialization (generation of initial population):
The method that produces initial population has two kinds conventionally, and a kind of is the method generation of completely random, and it is suitable for the situation without any priori to the solution of problem.Some priori can change one group of requirement that must meet into, then at the Xie Zhongzai that meets these requirements, chooses randomly sample, selects like this initialization population can make genetic algorithm arrive quickly optimal solution.This algorithm adopts the initial method that adds some priori.Divide timing must meet channel demands vector D and disturb with location, so relative random initializtion will improve convergence rate greatly.Detailed process is as follows:
A. first the maximum cell i 1 of channel demands number is distributed.The first step is first divided BCCH, from the available frequency section of BCCH, selects first.Second step divides TCH, if channel
Otherwise
B. then, to needing the cell i of the number of channel more than second
2carry out channel allocation.The first step is first divided BCCH, first in selection BCCH available frequency band and i
1minizone every
frequency.If channel
Time,
Otherwise
I wherein
1, i
2while having adjacent frequency to disturb,
I
1, i
2while having co-channel interference,
i
1, i
2during without any interference,
C. last, to other cell i ' carry out initialization.The first step is first divided BCCH, uses the mode of Random assignment here, and genetic algorithm process afterwards can be adjusted it again, makes to disturb minimum.Second step divides TCH.First produce a random number p, calculate centered by p, each two frequencies of left and right altogether in five frequencies with i
1, i
2the same adjacent frequency interference value and the minimum position that produce, be designated as r.Make f
i'r=1.Next from available frequency position, find out again with two that have divided (BCCH and a TCH) frequencies and meet the position of disturbing with location.Suppose to have distributed this position, calculate and its community and i before
1, i
2the same adjacent frequency interference value of community and.From these, meet the available positions that disturb with location and press interference value size ascending order and arrange, select to arrange forward, until cell i ' in the number of channel of distribution be d
i'.
After providing original scheme like this, then BCCH is once adjusted.Because BCCH and TCH distribute separately, therefore, likely there is not meeting the situation that disturb with location whole community in the place of BCCH and TCH handing-over.Find out the BCCH having violated with location interference constraints, exchange with a frequency meeting with location interference in available BCCH frequency.
Assessment:
Assessment is exactly to utilize fitness function to calculate this scheme, sees whether found optimal solution.Utilize the method for fitness function defined above, calculate the fitness value of this scheme.If this fitness value is 0, found optimal solution, export this scheme.Otherwise iterations adds 1, proceed follow-up selection, intersection, mutation operation.Finally, if iterations has reached the maximum iteration time of regulation, also do not find that to make fitness be 0 scheme, circulation finishes, and inputs this result.
Select:
Selection is to determine restructuring or intersection individuality, from this generation, selects popsize individuality and carries out the operations such as follow-up intersection, variation.Popsize is for participating in the individual amount of genetic algorithm.At this, adopt the random contest based on probability to select.Operating process is as follows:
A. calculate and select probability.According to fitness function calculate individual just when, be the needs of structure runner, will be converted to and demarcate dumpfitness, i.e. dumpfitness=1/fitness just when fitness.According to demarcating just when calculating, select probability, for demarcating just when being f
kindividuality, it selects probability for selecting Probability p
k.
(f
1, f
2for demarcate just when).
B. utilize squirrel wheel method to select pairing chromosomes p
1, p
2, p
1the probability of winning is f
1/ (f
1+ f
2) (f
1, f
2for demarcate just when), p
2for f
2/ (f
1+ f
2).The individuality of winning is added to new population.Adopt in this way, make two individualities all have an opportunity to be selected, be conducive to avoid locally optimal solution.
C. repeat b process, until select pop_size individuality.
Intersect:
Intersection is topmost hereditary computing, and it is simultaneously to two chromosome operations, and the characteristic that combines the two produces new offspring.At this, adopt fixedly crossover operator, object is to make to keep the number of fixed element constant in intersection process, thereby has realized the requirement that satisfies the demands vectorial D in whole iterative process.Adopt the method for 2 intersections.Method is to produce two random number a in (0, m * n), and b, works as a, and b, when same a line, exchanges the element of this row, otherwise, exchange a, b be expert at and between the element of row.
Variation:
Variation itself is a kind of local random search, and the gene not containing in initial population can be provided, or gives the gene of losing in selection course for change, for population provides new content, makes genetic algorithm keep the diversity of population.At this, adopt a kind of selective mutation technique.So-called selectivity variation, only will cause the element of interference value maximum to make a variation exactly.
Method is first according to aberration rate, to choose the individuality that needs variation, then to a probability of the random generation in each community in these individualities, when this probability is less than predefined probable value, the same adjacent frequency interference value of the element that the value of calculating element that in this community, each value is 1 and other community is 1 and.After position calculation that each value of Yi Ge community is 1 is complete, select maximum one, if this value is not 0, by a frequency position of this element and this row, be 0, and if distribute this frequency, that cause and same adjacent frequency interference value other community (must meet CSC with element minimum, if no, do not exchanged) exchange.
Adjust:
Through after the execution of genetic algorithm, the interference value of whole scheme is always at past little direction convergence.If Shi Tong base station, minizone, the possibility of the frequency that their distribution are same or adjacent will be very little.Because if distributed, the interference meeting causing is larger.Therefore, allow the BCCH of community of same base station, TCH interval 2, the constraint at the BCCH interval 1 of adjacent cell is placed on finally and realizes, and is the process of an adjustment.
First carry out the adjustment of TCH frequency.Using the community of same base station as one group, according to the sequence of positions in the community array that participates in planning.Using first as main plot, other community compares with the community of main plot and the same base station before it respectively.If the frequency distributing has been violated 2 the constraint of being spaced apart with base station, in other available frequency position of Ze Conggai community, select one that cause to exchange with the position of interference value minimums other all communities.This position must meet with same base station cell in front, Ji Gai community, main plot and is spaced apart 2 and the requirement of the same location constraint of itself.
Then carry out the adjustment of BCCH frequency.Using the community of adjacent cell as one group, according to the name placement in the community array that participates in planning.Using each as main plot, other community is respectively with main plot and in its adjacent cell comparison in front.If they are same base stations, need satisfied 2 the constraint that is spaced apart; If non-same base station is only adjacent cell, only need to meet to be spaced apart 1 constraint.If violated constraint, in other available frequency position of Ze Conggai community, select one that cause to exchange with the position of interference value minimums other all communities.This position must meet 1 the constraint of being spaced apart with Ji Gai community, main plot adjacent cell in front, if same base station, needs to meet and be spaced apart 2 constraint.
J, according to the cutover of frequency planning result, implement.After program results output, programme cutover is networked, different equipment manufacturers, instructs operation according to producer's explanation, at this, does not quote.
For a person skilled in the art, can make other various corresponding changes and distortion according to technical scheme described above and design, and these all changes and distortion all should belong to the protection range of the claims in the present invention within.
Claims (2)
1. a frequency planning method for GSM network, is characterized in that, comprises the following steps:
The constraints information of LAC, CI, BCCH frequency, TCH frequency, carrier frequency number, frequency-hopping mode, neighboring BS relationship, planning region area and the hardware of A, extraction existing network community, and incorporation engineering parameter information, complete Back ground Information table, then enter respectively step B, step G and step H; Described engineering parameter information comprises longitude and latitude, deflection, angle of declination, antenna type, the repeater information of existing network community;
B, according to Back ground Information table, coverage optimization is carried out in existing network community, comprise the antenna cover of existing network community be optimized, and the repeater of existing network community is covered and is optimized, enter step C;
C, the neighboring BS relationship in planning region is optimized, comprises and delete redundancy adjacent area and increase the adjacent area of leaking definition, enter step D;
D, the same BCCH of existing network is checked with BSIC community, centered by community separately, in the scope in 6 kilometers, 3 kilometers, urban district and suburb, can not occur with its with BCCH the community with BSIC, enter step e;
E, measurement data is gathered, the measurement data of employing comprises frequency sweep data and/or webmaster measurement report and/or signaling measurement report, enters step F;
F, according to measurement data, carry out co-channel interference matrix table and adjacent frequency interference matrix table that interference analysis obtains each minizone, enter step I;
G, according to the information of Back ground Information table, calculate unit are carrier frequency density, according to unit are carrier frequency density, select frequency model, select the process of frequency model to be: if unit are carrier frequency density is greater than 30 every square kilometre, to adopt 1*3 frequency model; If unit are carrier frequency density is more than or equal to 30 every square kilometre and be less than 50 every square kilometre, adopt 4*3 frequency model; If unit are carrier frequency density is more than or equal to 50 every square kilometre and be less than 65 every square kilometre, adopt MRP frequency model; If unit are carrier frequency density is greater than 65 every square kilometre, adopt dynamic multiplexing frequency model; Wherein, unit are carrier frequency density equals mean carrier frequency number divided by planning region area, and mean carrier frequency number equals to plan that total carrier frequency number of all communities in region, divided by planning Nei Zong community, region number, enters step I;
H, according to the information of Back ground Information table, determine that planning region is single plot planning or line plot planning or face plot planning, enter step I;
I, in conjunction with co-channel interference matrix table and adjacent frequency interference matrix table, adopt heuritic approach and/or genetic algorithm to carry out frequency planning; And according to the frequency model in step G, in heuritic approach or genetic algorithm, according to corresponding frequency model rule, carry out frequency planning; And adopt heuritic approach and/or genetic algorithm according to the planning region in step H, and if planning region is single plot planning, adopt heuritic approach, if planning region is line plot planning or face plot planning, adopt heuritic approach and/or genetic algorithm; Enter step J;
J, according to the cutover of frequency planning result, implement.
2. the frequency planning method of GSM network as claimed in claim 1, it is characterized in that, in step F, the probability that in extraction Various types of data, Serving cell and neighbor cell signal ionization meter report difference are disturbed as same adjacent frequency, get the measurement report number of C/I<9dB as the probability of co-channel interference, get the measurement report number of C/I<-6dB as the probability of adjacent frequency interference.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110442468.2A CN102404752B (en) | 2011-12-23 | 2011-12-23 | Frequency planning method in GSM network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110442468.2A CN102404752B (en) | 2011-12-23 | 2011-12-23 | Frequency planning method in GSM network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102404752A CN102404752A (en) | 2012-04-04 |
| CN102404752B true CN102404752B (en) | 2014-03-26 |
Family
ID=45886433
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110442468.2A Active CN102404752B (en) | 2011-12-23 | 2011-12-23 | Frequency planning method in GSM network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102404752B (en) |
Families Citing this family (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8929934B2 (en) * | 2012-04-25 | 2015-01-06 | Intel Mobile Communications GmbH | Communication devices and methods for operating a communication device |
| CN103458473B (en) * | 2012-05-29 | 2016-08-24 | 广东技术师范学院 | A kind of neighbor cell optimizing method and Neighborhood Optimization device |
| CN102870447B (en) * | 2012-06-26 | 2016-01-13 | 华为技术有限公司 | The method of Microwave Network Planning and device |
| CN102883346B (en) * | 2012-09-20 | 2015-01-07 | 北京拓明科技有限公司 | Over coverage judgment method on basis of Abis port signaling measuring report |
| CN104105115B (en) * | 2013-04-15 | 2018-02-23 | 中国移动通信集团浙江有限公司 | A kind of frequency optimization method and system |
| CN103686762B (en) * | 2013-12-18 | 2017-05-10 | 中国联合网络通信集团有限公司 | WCDMA system cell coverage evaluation method and device |
| CN103747458A (en) * | 2014-02-13 | 2014-04-23 | 方海鹰 | Method and system for correcting and optimizing mobile communication frequency |
| CN104144440B (en) * | 2014-06-13 | 2017-11-28 | 华为技术服务有限公司 | One kind gets over area's interference optimization method and device |
| CN104158551B (en) * | 2014-08-20 | 2016-03-30 | 上海交通大学 | The optimization method of double frequency-band wireless energy data transmission system coil and optimization system |
| CN104347955B (en) * | 2014-09-30 | 2017-04-26 | 北京邮电大学 | Antenna directional pattern optimization method for active antenna vertical cell splitting |
| CN104796912B (en) * | 2015-04-27 | 2018-05-11 | 中国铁路总公司 | A kind of method and system of GSM-R network frequency planning |
| CN106658591B (en) * | 2015-11-03 | 2020-12-01 | 工业和信息化部电信研究院 | Method and system for evaluating service condition of mobile communication base station |
| CN105516992B (en) * | 2015-12-14 | 2018-12-14 | 中通服建设有限公司 | A kind of PCI planing method of LTE network |
| CN108235334B (en) * | 2016-12-22 | 2020-10-16 | 中国移动通信集团公司 | Neighbor cell planning and checking method and device |
| CN108156611A (en) * | 2018-03-23 | 2018-06-12 | 上海东洲罗顿通信股份有限公司 | A kind of new PCI planning and the method for coverage optimization |
| CN108934017B (en) * | 2018-07-27 | 2021-09-14 | 中国联合网络通信集团有限公司 | Deployment method for antenna coverage adjustment part and ultra-wideband multimode equipment |
| CN110831019B (en) * | 2019-12-04 | 2020-08-25 | 中通服建设有限公司 | Base station planning method, base station planning device, computer equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2332600A (en) * | 1997-12-19 | 1999-06-23 | Motorola Ltd | Method of providing a matrix indicating interference relationships between cells of a cellular communication system |
| CN101873623A (en) * | 2010-07-09 | 2010-10-27 | 广州杰赛科技股份有限公司 | Automatic frequency optimization method based on measurement report data |
| CN102244872A (en) * | 2010-05-12 | 2011-11-16 | 普天信息技术研究院有限公司 | Frequency planning method of TD-SCDMA (Time Division Synchronization Code Division Multiple Access) cells |
-
2011
- 2011-12-23 CN CN201110442468.2A patent/CN102404752B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2332600A (en) * | 1997-12-19 | 1999-06-23 | Motorola Ltd | Method of providing a matrix indicating interference relationships between cells of a cellular communication system |
| CN102244872A (en) * | 2010-05-12 | 2011-11-16 | 普天信息技术研究院有限公司 | Frequency planning method of TD-SCDMA (Time Division Synchronization Code Division Multiple Access) cells |
| CN101873623A (en) * | 2010-07-09 | 2010-10-27 | 广州杰赛科技股份有限公司 | Automatic frequency optimization method based on measurement report data |
Non-Patent Citations (2)
| Title |
|---|
| GSM网络高密度环境下的频率规划方法;陈学信;《现代电信科技》;20081130(第11期);第44-48页 * |
| 陈学信.GSM网络高密度环境下的频率规划方法.《现代电信科技》.2008,(第11期),第44-48页. |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102404752A (en) | 2012-04-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102404752B (en) | Frequency planning method in GSM network | |
| US6487414B1 (en) | System and method for frequency planning in wireless communication networks | |
| CN105516992B (en) | A kind of PCI planing method of LTE network | |
| CN1123262C (en) | Frequency plan revision within cellular telephone system | |
| CN101409884B (en) | Method for optimizing network frequency based on measurement report | |
| CN103347261B (en) | Based on network-building method and the device of CDMA network data determination deployment of LTE network | |
| CN102387511B (en) | Optimization system and device for wireless network coverage of multi-array element antenna base station | |
| CN101076178B (en) | Method and apparatus for planning adjacent domain | |
| CN104105106A (en) | Wireless communication network intelligent-antenna-covered scene automatic classification and recognition method | |
| JP4312480B2 (en) | Method and system for wireless coverage deployment in a mobile wireless telephone network | |
| CN102625326A (en) | Method and device for multicell joint optimization under coverage of cellular mobile communication network | |
| CN102395136A (en) | Telephone traffic distribution calculation method based on neighbor cell field intensity information and system thereof | |
| US20140357281A1 (en) | Method of optimizing locations of cellular base stations | |
| CN101895898B (en) | Method and system for inspecting cell identical and adjacent frequency interference | |
| CN105657726A (en) | PCI planning based base station location method | |
| CN104080094A (en) | Method and device for adjusting antenna azimuths of cells | |
| CN111163476A (en) | Wireless transmission model-based power wireless private network coverage and interference determination method | |
| CN101304595B (en) | Method and apparatus for acquiring frequency plan | |
| CN105744548A (en) | PCI optimization method and apparatus | |
| US20140357283A1 (en) | Method of optimizing location and frequency assignment of cellular base stations | |
| CN103458434A (en) | Method and device for determining antenna feeder parameters | |
| CN202406301U (en) | Global system for mobile communications (GSM) network signal quality detection device for planning frequency of GSM network | |
| US20070270153A1 (en) | Method and System for Radio Coverage Planning With Multiple Resolution Profile Approach | |
| EP1714513B1 (en) | Method and system for radio coverage planning with local double grid approach | |
| CN110493793B (en) | Method and system for planning new station building based on capacity LTE |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 510000 Yuexiu District original road, Guangzhou, Guangzhou, Guangdong Patentee after: Zhong Tong clothing Construction Co., Ltd. Address before: 510095 Zhuang Yuan Road, Yuexiu District, Guangzhou, Guangdong 17 Patentee before: Guangdong Telecom Engineering Co.,Ltd. |