CN100391294C - Method for optimizing network - Google Patents
Method for optimizing network Download PDFInfo
- Publication number
- CN100391294C CN100391294C CNB200410070805XA CN200410070805A CN100391294C CN 100391294 C CN100391294 C CN 100391294C CN B200410070805X A CNB200410070805X A CN B200410070805XA CN 200410070805 A CN200410070805 A CN 200410070805A CN 100391294 C CN100391294 C CN 100391294C
- Authority
- CN
- China
- Prior art keywords
- base station
- district
- sub
- current
- polygon
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention discloses a method for optimizing a network. The method comprises the following steps: a, the coverage area of districts administrated by each base station is divide into polygons which have adjacency relation; b, the divided polygons of the districts are sent to a system for display; whether the configuration parameters of the network are correct or not is analyzed according to the displayed polygons of the districts for optimizing the network. The method provided by the present invention can bring great convenience for network optimization personnel to optimize the network; the method can also enhance the expressive force of the analysis result of the network optimization.
Description
Technical field
The present invention relates to cellular network technologies, particularly relate to a kind of method of cellular network being carried out the network optimization.
Background technology
In recent years, along with developing rapidly of cellular telecommunication art, cellular network is widely used.In cellular network, shortcomings such as because the influence of equipment fault, network parameter unreasonable allocation or geographical environment, making cellular network exist and can't be operated in optimum state, coverage is less and communication effect is relatively poor.In order to solve this kind shortcoming of cellular network, then need cellular network is carried out network optimization work.
The network optimization is meant carries out parameter acquisition and data analysis to cellular network, find out the reason that influences network running quality, then by adjusting parameter and taking other relevant art means, make network reach optimal operational condition, obtain optimum efficiency, and to the maintenance and the planning construction of network provide reasonable proposal from now on.
In cellular network, the base station is placed in specific place, and mutual geographical position, base station concerns very big to the parameter influence of configurating base station and jurisdiction district thereof.Therefore, when carrying out the network optimization and analyze, must consider the mutual alignment relation of each base station and sub-district, in checking network, also need to check the situation of its neighbor cell during the signal intelligence of certain sub-district.The network optimization personnel can determine the mutual alignment relation of each minizone that system demonstrates when therefore, just requiring to carry out network optimization analysis.
At present, carry out having adopted when the network optimization is analyzed GIS-Geographic Information System (GIS) technology to come physics and chemistry ground, ground to show the distribution situation of each sub-district in the cellular network.
Fig. 1 is the schematic diagram of the cellular cell drawn of prior art.Referring to Fig. 1, when adopting the GIS technology to come physics and chemistry ground, ground to draw the distribution situation of each sub-district, the way of prior art is: the direction according to antenna in cell is drawn an arrow or the little fan-shaped sub-district of representing, and adopts the result who the sub-district method of colouring is represented the network optimization operation.
As seen from Figure 1,
The sub-district profile that shows when 1, prior art is carried out the network optimization is smaller, and the network optimization personnel choose very inconvenience of operation such as sub-district.The sub-district that shows when 2, prior art is carried out the network optimization disperses very much, can't demonstrate the position relation of minizone, make the network optimization personnel from the figure that shows, to find the neighbor cell of certain sub-district, thereby bring great difficulty for the network optimization personnel carry out analytical work.When 3, the network optimization operating result is represented in the sub-district that shows,, can make that shown network optimization operating result visual effect is relatively poor when carrying out the network optimization by prior art, lack expressive force such as being that unusual sub-district color.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of method of carrying out the network optimization, makes it can make things convenient for the network optimization personnel to carry out network optimization work.
In order to achieve the above object, technical scheme of the present invention is achieved in that
A kind of method of carrying out the network optimization may further comprise the steps:
A, the perpendicular bisector of other each base station line in current base station S and the network is intersected the polygon of formed area minimum, be defined as the polygon of described current base station S overlay area;
B, in the polygon of described current base station S overlay area, the overlay area of each sub-district that described current base station S has jurisdiction over is divided into the polygon that has syntople, specifically comprise:
B1, described current base station S is had jurisdiction over each sub-district form the sub-district cyclic sequence according to the azimuthal size order of antenna in cell;
The bisector of the antenna direction angle of the previous sub-district of B2, the antenna direction of determining the current area of overlay area to be determined in the cyclic sequence of described sub-district and described current area, determine the polygonal intersection point of described bisector and described current base station S overlay area, with the line segment between described intersection point and the described current base station S, be defined as the common edge of described current area and described previous sub-district, the polygonal intersection point of described common edge and current base station S overlay area be defined as the end vertex of the initial vertex and the described previous sub-district of described current area;
B3, with the next sub-district of current area described in the cyclic sequence of described sub-district current area as overlay area to be determined, carry out described step B2, the initial vertex and the end vertex of all sub-districts in having determined described sub-district cyclic sequence;
B4, determine on the polygon of S overlay area, described base station, on the initial vertex of each sub-district and the polygonal summit, overlay area of the described base station S between the end vertex;
B5, the initial vertex according to described each sub-district that necessarily is linked in sequence, end vertex, described initial vertex and polygonal summit between the end vertex and base station S in this sub-district obtain the polygon of described base station each cell coverage area that S has jurisdiction over respectively;
C, the polygon of described base station each cell coverage area that S has jurisdiction over is transferred to shows in the display system, whether correct according to the polygon phase-split network configuration parameter of the cell coverage area that demonstrates, carry out the network optimization.
Described steps A comprises:
The nearest base station S ' of current base station S of A1, definite distance overlay area to be determined;
A2, will be except that current base station S and S ' other base station and the intersection point of the perpendicular bisector of the perpendicular bisector of current base station S line and line segment SS ' in, the point nearest apart from the mid point of SS ' is defined as the current summit of current base station S overlay area;
A3, with the base station of fixed current summit correspondence as the nearest base station S ' of distance current base station S; In the intersection point of the perpendicular bisector of other base station that will be except that current base station S and S ' and the perpendicular bisector of current base station S line and line segment SS ', the nearest point of the vertex distance of determining with the last time is defined as the current summit of current base station S overlay area; Continue to carry out described steps A 3, identical up to current definite base station S ' with the base station S ' that determines first;
A4, fixed all summits that are linked in sequence obtain the polygon of current base station S overlay area.
Further comprised before described steps A 1: drawing a border rectangle that covers all base stations, is perpendicular bisector with the four edges of this border rectangle, obtains four adjacent virtual base stations of current base station S respectively;
Described except that current base station S base station S ' and other base station in comprise four adjacent virtual base stations that obtained;
After described steps A, and further comprise before the described step B: four adjacent virtual base stations of deletion gained.
Further comprised before described step B1: whether the number of judging S jurisdiction district, described base station is 1, if be 1, then with the polygon of this base station coverage area polygon as its jurisdiction district; If be not 1, execution in step B1 then.
When the sub-district cyclic sequence is formed according to antenna azimuth order from small to large in the jurisdiction district of current base station S described in the step B1, described in the step B5 be: according to the initial vertex of anticlockwise each sub-district that is linked in sequence, end vertex, definite described initial vertex and polygon vertex between the end vertex and base station site S in this sub-district according to the initial vertex of each sub-district that necessarily is linked in sequence, end vertex, definite described initial vertex and the polygon vertex between the end vertex and base station site S in this sub-district.
When being the different lane place coding LAC of cell configuration in the diverse location district, and when being the different show tags of different LAC configuration, whether correct step according to the sub-district polygon phase-split network configuration parameter that demonstrates and that carry out the network optimization comprise described in the step C:
With the sub-district polygon corresponding district of the inner different show tags that exist in same position district,, and revise the LAC of this sub-district as the sub-district of LAC parameter configuration mistake.
When being the neighbor cell configuration show tags of current area, whether correct step according to the sub-district polygon phase-split network configuration parameter that demonstrates and that carry out the network optimization comprise described in the step C:
With display system show do not have institute's show tags that dispose and for the actual adjacent polygon corresponding district of current area polygon as, there is the sub-district of configuration error in the parameter of sign neighbouring relations, and revises the parameter of its sign neighbouring relations.
As seen, the present invention has the following advantages:
The sub-district profile that shows when 1, the present invention carries out the network optimization is bigger, and the network optimization personnel choose operation such as sub-district very convenient.
The base station and the sub-district that show when 2, the present invention carries out the network optimization are more concentrated, can clearly show the mutual alignment relation of minizone, make the network optimization personnel to find the neighbor cell of certain sub-district fast, thereby bring great convenience for the network optimization personnel carry out analytical work according to the figure that shows.
The network optimization operating result is represented in the sub-district that shows when 3, carrying out the network optimization by the present invention, such as being that the different districts zone different colours, can make shown network optimization operating result good visual effect, thereby strengthen the expressive force of network optimization analysis result greatly.
Description of drawings
Fig. 1 is the schematic diagram of the cellular cell drawn of prior art.
Fig. 2 is the distribution schematic diagram of base station in cellular network.
Fig. 3 draws the polygonal flow chart in base station in the present invention.
Fig. 4 draws the polygonal flow chart in sub-district in the present invention.
Fig. 5 draws the polygonal schematic diagram in sub-district when comprising a plurality of sub-district in the present invention in the base station.
Fig. 6 is the polygonal schematic diagram in sub-district that the present invention draws.
Fig. 7 adopts the shown neighbor cell design sketch of the inventive method.
Fig. 8 is the subdistrict position district coding distribution map that adopts the inventive method shown.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with drawings and the specific embodiments.
In cellular network, because administration sub-district, base station, therefore, in order accurately to draw out the overlay area of each sub-district, the present invention at first draws the overlay area of base station, draws cell coverage area then in the base station coverage area of drawing out.
The principle that the present invention draws base station coverage area is fair the division, and two promptly adjacent geographically base stations respectively account for half of space between the two.The present invention realizes regional dividing equally between the base station by the perpendicular bisector that is adjacent the base station line as the base station.Like this, when drawing the overlay area of a target BS, perpendicular bisector between the target BS of being done and its all adjacent base station can intersect, and forms the polygon of a plurality of sealings, and the present invention gets the overlay area of the polygon of area minimum wherein as target BS.
Thus, can get the definition L of base station coverage area:
The overlay area of a base station is by the crossing formed minimum polygon of the perpendicular bisector of other each base station line in this base station and the network.
According to definition L, the detailed process of drawing base station coverage area is described below.
Fig. 2 is the distribution schematic diagram of base station in cellular network.Referring to Fig. 2, in cellular network, the base station may be distributed in the border district of network, such as base station A
1, also may be respectively in the non-border district of network, such as base station A
2For the base station that is in the non-border district of network,, therefore, can directly draw its polygon and get final product according to definition L because all there is adjacent sites in all directions around it.For the base station that is in network edge, some direction does not have adjacent sites around it, such as for base station A
1, there is not adjacent sites in its left direction, is drawing base station A according to definition L so
1Polygon the time, then can't draw A
1With the perpendicular bisector of its left direction adjacent sites, thereby can't determine A
1Polygon.In order to address this problem, the present invention adopts the method for adding virtual website to make the base station site in network edge area all have adjacent sites on all directions, thereby can determine the polygon of network edge area base station site according to definition L.But, in actual applications, determine whether the website in the network is that edge site is very difficult.Therefore, whether the present invention does not distinguish the base station in drawing the polygonal process in each base station be edge site, but directly add virtual website for all base station sites in the network.For the base station site that is in the non-border district of network, even added virtual website since the present invention selected be the polygon of area minimum, so can not influence the polygonal drafting in base station, non-edge.
Here, with a base station site collection S{A
0, A
1..., A
nRepresent all base station sites in the whole cellular network.Draw a polygonal detailed process in base station and relate to 4 variable P, Q, b and c.Wherein, P is as the base station site of current selection; Target BS website that the b representative is to be drawn and the perpendicular bisector between the P; C is a set, stores polygonal each summit of target BS to be drawn; Variable Q preserves last intersection point.
Fig. 3 draws the polygonal flow chart in base station in the present invention.Referring to Fig. 3, according to definition L, here, with base station site A
0As the target BS website for the treatment of drawing polygonal, the present invention determines that the polygonal detailed process in base station may further comprise the steps:
Step 301: the distribution situation according to base station in the network is drawn a border rectangle, makes all base station sites in its coverage base station set of sites, and, leave suitable distance between each bar limit of the border rectangle of doing and the edge site.
Step 302: the four edges of border rectangle respectively as perpendicular bisector, is drawn out targeted sites A
0Four adjacent virtual website A
01, A
02, A
03And A
04, these four virtual websites of gained are joined among the set of sites S, obtain new base station site collection S ' { A
0, A
1..., A
n, A
01, A
02, A
03, A
04.
Step 303: traversal set of sites S ', find out and targeted sites A
0Nearest website A
k, with A
kAs the website of current selection and give variable P, i.e. P=A
k, and with A
0A
kBe A
0The mid point coordinate figure of P is given Q.
Here, because with targeted sites A
0The website A of air line distance minimum
kMust be targeted sites A
0Adjacent sites, so at first choose website A
k, carry out base station site A
0With A
kBetween area dividing.And, because A
kBe distance objective website A
0Nearest website, A
0A
kPerpendicular bisector must be website A
0A polygonal limit, line segment A
0A
kMid point then must be website A
0Point on the polygonal limit.For from base station site A
0A point on the polygon begins to determine this polygon, then makes the initial value of Q equal line segment A
0A
kMid point.
Step 304: make line segment A
0The perpendicular bisector b of P, and among the set of sites S ' all at straight line A
0The website A of P top
j(j ≠ k ≠ 0) makes A
0A
jPerpendicular bisector B
j
Here, at straight line A
0The website A of P top
j, be meant that all make ∠ A
jA
0The base station site of P＜180 °.And, only at line segment A
0The base station site A of P top
jHandling, is in order to make this flow process promptly counterclockwise search A according to a fixing direction
0Polygonal next summit, base station.
Step 305: at each perpendicular bisector B
jIn each intersection point of straight line b, select an intersection point C that range points Q is nearest
j, with this intersection point C
jAs targeted sites A
0A polygonal summit deposits vertex set { c in
iIn.
Here, according to definition L, the base station polygon is the polygon that is intersected area minimum in formed all polygons by the perpendicular bisector of a base station and other each base station line, so from A
0Some Q on the polygon limit begins, and first summit that finds in the counterclockwise direction should be from the nearest intersection point C of current intersection point Q
j
Step 306: will deposit vertex set { c in the step 305 in
iIn some C
jGive Q, even Q=C
j, will put C
jCorresponding base station site A
jGive P, even P=A
j
Here, with a C
jCorresponding base station site A
jBe meant, make straight line A
0A
jPerpendicular bisector and the intersection point of current straight line b be current intersection point C
jBase station site A
j
Step 307: whether the currency of judging P equals determined base station site A in the step 303
k,, otherwise return step 304 if then execution in step 308.
Here, because in step 303, A
0A
kPerpendicular bisector must be website A
0A minimum polygonal limit.And two summits are arranged on this limit, drop on line segment A so must also have a summit
0A
kPerpendicular bisector on, promptly all must satisfy P once more and equal determined base station site A in the step 303 according to clockwise direction counterclockwise still
kCondition.So, if the currency of P equals determined base station site A in the step 303
k, then can think and determine A
0Polygonal all summits are if the currency of P is not equal to determined base station site A in the step 303
k, then can think and also not determine A
0Polygonal all summits.
Step 308: vertex set { c is linked in sequence
iIn the storage all summits, with formed polygon as targeted sites A
0Polygon.
Step 309: 4 virtual website A among the deletion set of sites S '
01, A
02, A
03, A
04, obtain original site collection S, finish the polygonal flow process in current drafting base station.
According to said process, the present invention then can finish base station site collection S{A
0, A
1..., A
nIn the polygonal drafting in all base stations.
Next, the present invention draws the overlay area of sub-district in the polygonal region of base station.
Because 1～3 sub-district of administration, each base station, therefore,, then need not to draw again the overlay area of sub-district, directly with the polygon of base station polygon as cell coverage area if during sub-district of administration, base station.When if a plurality of sub-district is administered in the base station, then the present invention draws cell coverage area according to the principle of justice, be about to the common edge of the angular bisector of two antenna in cell angles that direction forms, and the sub-district polygon that will finally obtain is as the overlay area of sub-district as two sub-districts.
Draw a polygonal detailed process in sub-district and relate to following parameter: { C
i, represent the polygonal vertex set of current base station; { M
n, represent the set of the sub-district that current base station has jurisdiction over; { α
i, represent the line between polygonal each summit, base station and the base station site, with the formed angle set of X-axis; β, the angle that storage azimuthal angular bisector in sub-district and X-axis form; P
n, represent the intersection point on azimuthal angular bisector in sub-district and the polygonal limit of current base station; C
Is, represent polygonal initial vertex, the shared base station of sub-district polygon; C
Ie, represent the polygonal end vertex in the shared base station of sub-district polygon; Vs represents polygonal initial vertex, sub-district; Ve represents the polygonal end vertex in sub-district.
Fig. 4 draws the polygonal flow chart in sub-district in the present invention, and Fig. 5 draws the polygonal schematic diagram in sub-district when comprising many sub-districts in the base station in the present invention.Referring to Fig. 4 and Fig. 5, here, with A
0As current base station, to draw A
0The polygon of each sub-district is an example in the polygonal region, and the present invention determines that the polygonal detailed process in sub-district may further comprise the steps:
Step 401: judge base station site A
0Whether the number of jurisdiction district is 1, if then execution in step 402, otherwise, direct execution in step 403.
Step 402: make the sub-district polygon equal website A
0Polygon, finish the polygonal flow process in current drafting sub-district then.
Step 403: make website A
0With website A
0Each summit of polygon i.e. { C
iIn the line of each point, deposit set { α in after the angle of each bar line of being done and X-axis formation sorted from small to large
iIn, and with { α
iRegard a cyclic sequence as.
Here, with { α
iRegard a cyclic sequence as and be meant, with { α
iIn last angle as the previous element of first angle, with the back element of first angle as last angle.
Step 404: with base station A
0Sorting according to its azimuth order from small to large in each sub-district of being had jurisdiction over, deposits each sub-district after the ordering in set { M
nIn, and will gather { M
nRegard a cyclic sequence as.
Here, being sorted from small to large by the azimuth in the sub-district and regard cyclic sequence as, is to be that clockwise direction carries out according to a certain direction in order to make this flow process.And, with { M
nRegard a cyclic sequence as and be meant, with { M
nIn last sub-district as the previous element of first sub-district, with the back element of first sub-district as last sub-district.
Step 405: from set of cells { M
nSub-district M of middle selection
n
Step 406: the sub-district M that does current selection
nWith cyclic sequence { M
nIn come the sub-district M of its front
N-1The angular bisector of formed angle, and remember that this angular bisector and the formed angle of X-axis are β.
Here, two formed angles in sub-district are meant the formed angle of antenna direction of two sub-districts.
Step 407: with website A
0With A
0Each summit line of polygon and the angle that forms of X-axis sort according to from small to large order, deposit each angle after the ordering in set { α
iIn, and will gather { α
iRegard a cyclic sequence as.
Step 408: at set { α
iIn, find out two value α in succession
iAnd α
I+1, make its α that satisfies condition
i≤ β≤α
I+1, and with α
iAnd α
I+1Corresponding summit is designated as sub-district M respectively
N-1The shared website A of polygon
0Polygonal end vertex C
Ie, sub-district M
nThe shared website A of polygon
0Polygonal initial vertex C
Is
Here, since in the step 406 the angle bisector done will inevitably with A
0A polygonal limit intersect, so must find two value α
iAnd α
I+1, make its α that satisfies condition
i≤ β≤α
I+1And, with α
iAnd α
I+1Dui Ying summit is meant respectively, with website A
0Line and X-axis angulation are respectively α
iAnd α
I+1A
0Polygonal two summits.
Step 409: with gained angular bisector in the step 406 and website A
0The intersection point on polygonal limit is designated as P
n, and note sub-district M
nPolygonal initial vertex V
s=P
n, sub-district M
N-1Polygonal end vertex V
e=P
n
Step 410: judge set of cells { M
nIn whether have the not sub-district of selected mistake, if exist, then will gather { M
nIn this handles the sub-district of the previous sub-district of sub-district as current selection, return step 406 then, if there is no, then execution in step 411.
Step 411: add up each sub-district initial vertex V separately
s, end vertex V
e, go up the polygonal initial vertex C in shared base station, sub-district in the counterclockwise direction
IsTo the polygonal end vertex C in shared base station
IeBetween the summit, obtain the polygonal vertex set { A in each sub-district respectively
0, V
s, C
Is..., C
Ie, V
e, at each sub-district, all summits in the vertex set separately of being linked in sequence respectively obtain each sub-district polygon.
To the described process of step 411, the present invention then can finish base station site collection S{A according to step 401
0, A
1..., A
nIn the polygonal drafting in sub-district in all base station polygonal regions.
Above-mentioned definite base station coverage area is that base station polygon and definite cell coverage area are that the polygonal specific implementation method in sub-district is: the polygonal program of above-mentioned definite base station polygon and sub-district is loaded in the computer stores, when carrying out the network optimization, input comprises the number of base station, the number of each jurisdiction district, base station and the parameters such as relative position of each base station in computer, then by this program of computer run, obtain the polygon of each base station range, and then obtain the polygon of each cell coverage area.
Fig. 6 is the polygonal schematic diagram in sub-district that the present invention draws.Referring to Fig. 6, the sub-district polygon good visual effect that the present invention drew can be expressed the sub-district in each base station exactly and be adjacent the position relation of sub-district.
When carrying out the network optimization, need to check neighboring BS relationship.Because prior art can't demonstrate the neighbouring relations of sub-district, so existing neighboring BS relationship inspection is to check according to the engineering parameter form whether the configuration of neighboring BS relationship is reasonable by the network optimization personnel.This kind checked the way of engineering parameter form, makes the network optimization personnel can't see the geographical position relation between each sub-district intuitively, and inspection parameter form is wasted time and energy, and easily makes mistakes.Use the shown sub-district of the present invention, when checking neighboring BS relationship, only be required to be current area and two-way adjacent area thereof and dispose different show tags respectively,, show by system to get final product such as different colors with unidirectional adjacent area.Fig. 7 adopts the shown neighbor cell design sketch of the inventive method.As can be seen from Figure 7, use the shown sub-district of the present invention can clearly express the mutual alignment relation of current area and two-way adjacent area and unidirectional adjacent area.From Fig. 7, can also see, the shown result of system shows that sub-district Y does not have the show tags of unidirectional adjacent area and two-way adjacent area, show that promptly sub-district Y is not the two-way adjacent area or the unidirectional adjacent area of current area, but from displayed map, can see, sub-district Y is adjacent with current area geographically, sub-district Y should be the two-way adjacent area or the unidirectional adjacent area of current area, this contradiction is likely owing to causing the parameter configuration of its neighbouring relations of sign of sub-district Y is unreasonable, therefore, can point out network optimization personnel inspection and adjustment to characterize the parameter of the neighbouring relations of sub-district Y, solve the mistake in the actual configuration parameter.
Fig. 8 is the subdistrict position district coding distribution map that adopts method of the present invention shown.The network optimization personnel are the identical lane place coding (LAC) of sub-district polygon configuration that is in the same position district, and the different show tags of LAC configuration for different such as different colors, uses the shown sub-district of the present invention to represent to dispose LAC result.As can be seen from Figure 8, lane place 2 and lane place 3 all are the continuous zones of color, the LAC of each base station and sub-district configuration is correct in this lane place, but, because there is the zone of the base station R of different colours in 1 inside, lane place, therefore, show that there is mistake in the LAC configuration of sub-district in the R of this base station, then can point out the network optimization personnel that the LAC of sub-district in the R of base station is made amendment.
In a word, the above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (7)
1. a method of carrying out the network optimization is characterized in that, this method may further comprise the steps:
A, the perpendicular bisector of other each base station line in current base station S and the network is intersected the polygon of formed area minimum, be defined as the polygon of described current base station S overlay area;
B, in the polygon of described current base station S overlay area, the overlay area of each sub-district that described current base station S has jurisdiction over is divided into the polygon that has syntople, specifically comprise:
B1, described current base station S is had jurisdiction over each sub-district form the sub-district cyclic sequence according to the azimuthal size order of antenna in cell;
The bisector of the antenna direction angle of the previous sub-district of B2, the antenna direction of determining the current area of overlay area to be determined in the cyclic sequence of described sub-district and described current area, determine the polygonal intersection point of described bisector and described current base station S overlay area, with the line segment between described intersection point and the described current base station S, be defined as the common edge of described current area and described previous sub-district, the polygonal intersection point of described common edge and current base station S overlay area be defined as the end vertex of the initial vertex and the described previous sub-district of described current area;
B3, with the next sub-district of current area described in the cyclic sequence of described sub-district current area as overlay area to be determined, carry out described step B2, the initial vertex and the end vertex of all sub-districts in having determined described sub-district cyclic sequence;
B4, determine on the polygon of S overlay area, described base station, on the initial vertex of each sub-district and the polygonal summit, overlay area of the described base station S between the end vertex;
B5, the initial vertex according to described each sub-district that necessarily is linked in sequence, end vertex, described initial vertex and polygonal summit between the end vertex and base station S in this sub-district obtain the polygon of described base station each cell coverage area that S has jurisdiction over respectively;
C, the polygon of described base station each cell coverage area that S has jurisdiction over is transferred to shows in the display system, whether correct according to the polygon phase-split network configuration parameter of the cell coverage area that demonstrates, carry out the network optimization.
2. method according to claim 1 is characterized in that, described steps A comprises:
The nearest base station S ' of current base station S of A1, definite distance overlay area to be determined;
A2, will be except that current base station S and S ' other base station and the intersection point of the perpendicular bisector of the perpendicular bisector of current base station S line and line segment SS ' in, the point nearest apart from the mid point of SS ' is defined as the current summit of current base station S overlay area;
A3, with the base station of fixed current summit correspondence as the nearest base station S ' of distance current base station S; In the intersection point of the perpendicular bisector of other base station that will be except that current base station S and S ' and the perpendicular bisector of current base station S line and line segment SS ', the nearest point of the vertex distance of determining with the last time is defined as the current summit of current base station S overlay area; Continue to carry out described steps A 3, identical up to current definite base station S ' with the base station S ' that determines first;
A4, fixed all summits that are linked in sequence obtain the polygon of current base station S overlay area.
3. method according to claim 2, it is characterized in that, further comprised before described steps A 1: drawing a border rectangle that covers all base stations, is perpendicular bisector with the four edges of this border rectangle, obtains four adjacent virtual base stations of current base station S respectively;
Described except that current base station S base station S ' and other base station in comprise four adjacent virtual base stations that obtained;
After described steps A, and further comprise before the described step B: four adjacent virtual base stations of deletion gained.
4. method according to claim 1 is characterized in that, further comprises before described step B1: whether the number of judging S jurisdiction district, described base station is 1, if be 1, then with the polygon of this base station coverage area polygon as its jurisdiction district; If be not 1, execution in step B1 then.
5. method according to claim 2, it is characterized in that, when the sub-district cyclic sequence is formed according to antenna azimuth order from small to large in the jurisdiction district of current base station S described in the step B1, described in the step B5 according to the initial vertex of each sub-district that necessarily is linked in sequence, end vertex, described initial vertex and the polygon vertex between the end vertex and the base station site S in this sub-district that determines is: according to the initial vertex of anticlockwise each sub-district that is linked in sequence, end vertex, described initial vertex and polygon vertex between the end vertex and the base station site S that determine in this sub-district.
6. method according to claim 1, it is characterized in that, when being the different lane place coding LAC of cell configuration in the diverse location district, and when being the different show tags of different LAC configuration, whether correct step according to the sub-district polygon phase-split network configuration parameter that demonstrates and that carry out the network optimization comprise described in the step C:
With the sub-district polygon corresponding district of the inner different show tags that exist in same position district,, and revise the LAC of this sub-district as the sub-district of LAC parameter configuration mistake.
7. method according to claim 1 is characterized in that, when being the neighbor cell configuration show tags of current area, whether correct step according to the sub-district polygon phase-split network configuration parameter that demonstrates and that carry out the network optimization comprise described in the step C:
With display system show do not have institute's show tags that dispose and for the actual adjacent polygon corresponding district of current area polygon as, there is the sub-district of configuration error in the parameter of sign neighbouring relations, and revises the parameter of its sign neighbouring relations.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200410070805XA CN100391294C (en) | 2004-07-20 | 2004-07-20 | Method for optimizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200410070805XA CN100391294C (en) | 2004-07-20 | 2004-07-20 | Method for optimizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1725891A CN1725891A (en) | 2006-01-25 |
| CN100391294C true CN100391294C (en) | 2008-05-28 |
Family
ID=35925083
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB200410070805XA Expired - Fee Related CN100391294C (en) | 2004-07-20 | 2004-07-20 | Method for optimizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100391294C (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101039490B (en) * | 2006-03-14 | 2010-06-16 | 中国电信股份有限公司 | Coverage analysis system and method for optimizing mobile communication system network |
| CN101052195B (en) * | 2006-04-03 | 2010-05-12 | 中兴通讯股份有限公司 | Adjacent zone configuration and optimizing method |
| CN101043260B (en) * | 2007-03-26 | 2010-05-26 | 华为技术有限公司 | Method and apparatus for dividing cell block |
| CN101668296B (en) * | 2008-09-03 | 2011-12-14 | 中国移动通信集团上海有限公司 | Method and device for determining communication zone boundaries |
| CN102547767A (en) * | 2012-02-29 | 2012-07-04 | 上海科旭网络技术有限公司 | Method and system for generating neighbor cell of mobile communication network |
| CN104581751B (en) * | 2015-01-12 | 2018-03-27 | 浪潮天元通信信息系统有限公司 | Simulate coverage rate method for drafting in a kind of mobile communication cells |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1999012226A2 (en) * | 1997-09-01 | 1999-03-11 | Nokia Networks Oy | A system of controlling subscriber data in a cellular telephone system |
| CN1265255A (en) * | 1997-06-04 | 2000-08-30 | 法国电信局 | Dynamic channel assignment method in cell communication network |
| CN1308824A (en) * | 1998-05-15 | 2001-08-15 | 艾利森电话股份有限公司 | Coded allocation for sectorised radiocommunication systems |
| US20030063614A1 (en) * | 2001-08-23 | 2003-04-03 | Steven Teig | Method and apparatus for storing routes for groups of related net configurations |
| WO2003065749A1 (en) * | 2002-02-01 | 2003-08-07 | Nokia Corporation | Information transfer method, information transfer system, and base station |
-
2004
- 2004-07-20 CN CNB200410070805XA patent/CN100391294C/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1265255A (en) * | 1997-06-04 | 2000-08-30 | 法国电信局 | Dynamic channel assignment method in cell communication network |
| WO1999012226A2 (en) * | 1997-09-01 | 1999-03-11 | Nokia Networks Oy | A system of controlling subscriber data in a cellular telephone system |
| CN1308824A (en) * | 1998-05-15 | 2001-08-15 | 艾利森电话股份有限公司 | Coded allocation for sectorised radiocommunication systems |
| US20030063614A1 (en) * | 2001-08-23 | 2003-04-03 | Steven Teig | Method and apparatus for storing routes for groups of related net configurations |
| WO2003065749A1 (en) * | 2002-02-01 | 2003-08-07 | Nokia Corporation | Information transfer method, information transfer system, and base station |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1725891A (en) | 2006-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yan et al. | Network-level multiband signal coordination scheme based on vehicle trajectory data | |
| CN106384371A (en) | Map drawing method based on vector tile | |
| CN103778477B (en) | Monitor station cloth station method and apparatus | |
| CN106780738A (en) | Path site optimization method based on project of transmitting and converting electricity environmental sensitive area | |
| Zou et al. | Topological relation of layered complex networks | |
| CN104899647A (en) | Urban logistics distribution place name and address system | |
| Tian et al. | The effect of regional integration on urban sprawl in urban agglomeration areas: A case study of the Yangtze River Delta, China | |
| CN102419927B (en) | Map road annotating method of navigation terminal | |
| CN100391294C (en) | Method for optimizing network | |
| CN110347764A (en) | A kind of ecological space data integration method | |
| Pakzad et al. | Measuring sustainability of urban blocks: The case of Dowlatabad, Kermanshah city | |
| CN105427177A (en) | Automatic farmland four-boundary calculation method based on GIS (Geographic Information System) | |
| Ai et al. | A map generalization model based on algebra mapping transformation | |
| Sun et al. | TZVis: Visual analysis of bicycle data for traffic zone division | |
| Yamamoto et al. | On-demand generalization of road networks based on facility search results | |
| CN101546438B (en) | Superposing analysis method of a plurality of region topology layers based on restricting Delaunay triangulation network technique | |
| Li et al. | An area merging method in map generalization considering typical characteristics of structured geographic objects | |
| CN104899328A (en) | Method for rapidly seeking boundaries of land parcel in four directions | |
| CN116089519B (en) | Pollution tracing path visualization platform based on GIS | |
| Karsznia et al. | Using machine learning and data enrichment in the selection of roads for small-scale maps | |
| CN106529560A (en) | Method of identifying urban function area integrated with population density and landscape structure | |
| Tsiotas et al. | Understanding peripherality in a multidimensional geographical, socioeconomic, and institutional context: Evidence from Greece | |
| CN113284030A (en) | Urban traffic network community division method | |
| Wang et al. | Spatial Form Analysis of Existing Industrial Buildings Renovation Based on Space Syntax | |
| Jangjoo | Modelling fuzzy multi-criteria decision-making method to locate industrial estates based on geographic information system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080528 Termination date: 20200720 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |