CN101043260A - Method and apparatus for dividing cell block - Google Patents
Method and apparatus for dividing cell block Download PDFInfo
- Publication number
- CN101043260A CN101043260A CN 200710086611 CN200710086611A CN101043260A CN 101043260 A CN101043260 A CN 101043260A CN 200710086611 CN200710086611 CN 200710086611 CN 200710086611 A CN200710086611 A CN 200710086611A CN 101043260 A CN101043260 A CN 101043260A
- Authority
- CN
- China
- Prior art keywords
- base station
- polygonal
- cells
- summit
- block
- 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.)
- Granted
Links
Images
Abstract
The invention discloses a little block dividing method, firstly, ensuring the polygon area of said base station A0 according to the corresponding position between base station A0 and other base stations in network, and furthermost covering distance r to said base station A0; then the polygon area of said base station A0 is divided into at least one little blocks based on the azimuth angle of antenna. The invention also discloses a device of dividing little block. When ensuring the polygon area of said base station, according to the relative position of base station which is to be divided with other base station in network and furthermost covering distance to said base station, so the little blocks can be astringed to a arc to close to real little block.
Description
Technical field
The present invention relates to networking technology area, especially relate to method and device that a kind of block of cells is divided.
Background technology
In recent years, along with developing rapidly of wireless communication technology, the demand that is optimized analysis at wireless network is more and more stronger.The network optimization tool software that helps network optimization personnel to carry out analytical work is also constantly weeded out the old and bring forth the new thereupon, because wireless network is geographical distribution, therefore network optimization tool software all adopts ground physics and chemistry Display Technique, comes the distribution situation of sub-district in the visually display radio network directly perceived.
In a wireless network, there is 1～n sub-district a plurality of base stations that distributing under each base station.In network optimization tool software, the sub-district is to be represented by the block of cells of drawing on map.Block of cells is meant under all very high distance calculation system of an accuracy and efficient, according to each sub-district geographical relationship each other and the azimuth of sub-district (be sub-district towards), is the polygonal region that calculate each sub-district.This block of cells is the useful effect zone of this sub-district.
But existing network optimization tool software is not strong to the disposal ability that the block of cells of base station, edge shows, causes the block of cells of existing block of cells in showing and actual sub-district that tangible gap is arranged.For example:,, but be into radial in the existing network optimization tool software so the base station, edge should be to converge on one section arc because the coverage of base station signal has the ultimate range restriction.
Summary of the invention
Method and device that the embodiment of the invention provides a kind of block of cells to divide can make the block of cells of the opposite side edge base station block of cells in showing more approach actual sub-district.
For achieving the above object, the method that the technical scheme of one embodiment of the present of invention provides a kind of block of cells to divide, may further comprise the steps: at first according to the relative position of other each base station in base station A0 and the network, with the signal coverage distance r farthest of described base station A0, determine the polygonal region of described base station A0; Then, according to the azimuth of antenna the polygonal region of described base station A0 is divided at least one block of cells.
The device that the technical scheme of one embodiment of the present of invention provides a kind of block of cells to divide comprises base station location memory cell, azimuth memory cell, polygon vertex memory cell and polygon acquiring unit; Described base station location memory cell is used to store the relative position of other each base station in base station A0 to be divided and the network; Described azimuth memory cell is used to store the azimuth of the antenna of described base station A0; Described polygon vertex memory cell is used to store the polygonal summit of the block of cells of the polygonal summit of described base station A0 and described base station A0; Described polygon acquiring unit according to the relative position of other each base station in base station A0 that stores in the described base station location memory cell and the network and the signal coverage distance r farthest of described base station A0, is determined the polygonal region of described base station A0; And, the polygonal region of described base station A0 is divided at least one block of cells according to the azimuth of the antenna of the base station A0 of described azimuth cell stores.
The technical scheme of the embodiment of the invention has the following advantages at least:
When determining the polygonal region of base station, relative position and described signal of base station coverage distance farthest according to other each base station in base station to be divided and the network, determine the polygonal region of described base station, make the block of cells of base station, the edge block of cells in showing converge on one section arc, more approach actual sub-district.
Description of drawings
Fig. 1 is the device schematic diagram that a kind of block of cells of the embodiment of the invention is divided;
Fig. 2 is the method flow diagram that a kind of block of cells of the embodiment of the invention is divided;
Fig. 3 is the method flow diagram of polygonal region of definite base station of the embodiment of the invention;
Fig. 4 is the method flow diagram of polygonal region of definite block of cells of the embodiment of the invention.
Embodiment
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail:
The device that a kind of block of cells of the embodiment of the invention is divided comprises that virtual base station is provided with unit 11, base station location memory cell 12, azimuth memory cell 13, polygon acquiring unit 14 and polygon vertex memory cell 15 as shown in Figure 1; Wherein virtual base station is provided with unit 11 and is connected with base station location memory cell 12, and polygon acquiring unit 14 is connected with base station location memory cell 12, azimuth memory cell 13 and polygon vertex memory cell 15 respectively.Polygon acquiring unit 14 comprises that further the base station polygon obtains subelement 141 and the sub-district polygon obtains subelement 142, polygon vertex memory cell 15 further comprises base station polygon vertex storing sub-units 151 and sub-district polygon vertex storing sub-units 152, wherein the base station polygon obtains subelement 141 and is connected with base station polygon vertex storing sub-units 151 with base station location memory cell 12 respectively, the sub-district polygon obtain subelement 142 respectively with azimuth memory cell 13, base station polygon vertex storing sub-units 151 is connected with sub-district polygon vertex storing sub-units 152.
When base station to be divided is in network edge, virtual base station is provided with unit 11 and is used to be provided with a plurality of virtual base stations, and store the relative position of each virtual base station and base station to be divided into base station location memory cell 12, participation is determined the polygonal region of this base station to be divided, after this polygonal region is determined to finish, each virtual base station that deletion is provided with.
Base station location memory cell 12 is used to store the relative position of other each base station in this base station to be divided and the network; Azimuth memory cell 13 is used to store the azimuth of the antenna of this base station to be divided.
Polygon vertex memory cell 15 is used to store the polygonal summit of the block of cells of the polygonal summit of this base station to be divided and this base station to be divided; Wherein base station polygon vertex storing sub-units 151 is used to store the polygonal summit of this base station to be divided; Sub-district polygon vertex storing sub-units 152 is used to store the polygonal summit of the block of cells of this base station to be divided.
The method flow that a kind of block of cells of the embodiment of the invention is divided as shown in Figure 2.Hypothesis base station to be divided is base station A0 in the present embodiment, and with reference to Fig. 2, present embodiment may further comprise the steps:
Step s201 according to the relative position of other each base station in base station A0 and the network and the signal coverage distance r farthest of base station A0, determines the polygonal region of base station A0.
The polygonal region of base station is to divide according to the principle that zone leveling between the base station distributes.When two base stations were adjacent geographically, each base station respectively accounted between two base stations half of zone.Therefore, can make the perpendicular bisector that base station A0 to be divided is adjacent the base station line, to realize regional dividing equally between the base station.After base station A0 has made perpendicular bisector with all base stations that are adjacent, if those perpendicular bisectors intersect, and be the center of circle with base station A0, be in the circle of radius with the signal coverage distance r farthest of base station A0, form the polygonal region of a sealing, then this polygonal region promptly can be used as the polygonal region of base station A0; If base station A0 is in network edge, promptly after base station A0 has made perpendicular bisector with all base stations that are adjacent, those perpendicular bisectors are being not the center of circle with base station A0, are being the polygonal region that forms a sealing in the circle of radius with r, then those perpendicular bisectors intersect the back and are the center of circle, are the circular arc of radius with r that with base station A0 the closed area of formation is the polygonal region of base station A0.So the polygonal region of base station A0 is by being the center of circle with base station A0, being the circle of radius with r, with the closed area by minimum in the closed figure of base station A0 and the crossing formed A0 of comprising of the perpendicular bisector that is adjacent each base station line.
But, determine a base station and another base station whether adjacent be very difficult, therefore for base station A0 to be divided, can make the perpendicular bisector of other each base station line in base station A0 and the network, so the polygonal region of base station A0 is by being the center of circle with base station A0, being the circle of radius with r, intersect minimum closed area in the formed closed figure that comprises A0 with perpendicular bisector by other each base station line in base station A0 and the network.
Step s202 is divided at least one block of cells according to the azimuth of antenna with the polygonal region of described base station A0.
Behind the polygonal region of determining base station A0, if base station A0 has only an antenna, then the polygonal region with base station A0 is divided into a block of cells, and the zone of this block of cells is the polygonal region of base station A0; If base station A0 contains two or more antennas, then the angular bisector according to angle between the azimuth of adjacent antenna carries out the division of block of cells, the zone of each block of cells is the angular bisector of angle between the azimuth of the antenna of this block of cells and adjacent antenna, intersects formed closed area with the polygon of base station A0.
When adopting the device of block of cells division shown in Figure 1, the method flow of the polygonal region of definite base station of the embodiment of the invention supposes in the present embodiment that base station to be divided is base station A0 as shown in Figure 3, and with reference to Fig. 3, present embodiment may further comprise the steps:
Step s301 is provided with virtual base station.At first, virtual base station is provided with unit 11 and according to the distribution situation of base station a rectangle is set, and this rectangle covers current all base stations, and every limit of this rectangle and be in distance between the base station of network edge greater than r; Then, a plurality of virtual base stations are set according to this rectangle, each virtual base station respectively with the limit symmetry of base station A0 about this rectangle, promptly this limit is the perpendicular bisector of this virtual base station and base station A0; And store the relative position of each virtual base station and base station A0 into base station location memory cell 12, participate in determining to the polygonal region of base station A0.
Step s302, base station polygon obtain subelement 141 from base station location memory cell 12 obtain base station A0 and apart between its nearest base station A1 apart from d, and judge that whether d is greater than 2r; If then change step s303, otherwise change step s304.
Step s303, it is the center of circle with base station A0 that the base station polygon obtains subelement 141, is that radius is drawn circle with r, the polygonal region of base station A0 is this round-formed closed area; And commentaries on classics step s317.
Step s304, base station polygon obtain subelement 141, and selected base station P is set is base station A1.
Step s305, the base station polygon obtains the perpendicular bisector b that subelement 141 is made line segment A0P, to all base station Ai above line segment A0P in the base station location memory cell 12, the perpendicular bisector Bi and the b that make line segment A0Ai intersect, and all intersection points form a set { Cj}; { select to make the some Cj of line segment QCj length minimum the Cj}, wherein Q is the mid point of line segment A0P from set.Wherein, the base station Ai above line segment A0P is meant the base station that meets ∠ AiA0P＜180 °.
Step s306, base station polygon obtain subelement 141 and whether judge line segment A0Cj less than r, if then change step s307; Otherwise change step s309.
Step s307, base station polygon obtain the set c of subelement 141 savepoint Cj in the base station polygon vertex storing sub-units 151; It is Cj for base station, the Q corresponding with a Cj that selected base station P is set.Wherein, the base station corresponding with a Cj is meant that the intersection point of the perpendicular bisector b of the perpendicular bisector of line of base station A0 and this base station and line segment A0P is the base station of Cj.
Step s308, base station polygon obtain subelement 141 and judge whether selected base station P is base station A1 once more, if then the polygonal region of base station A0 changes step s317 for being the formed closed area of polygon on summit with the point among the set c; Otherwise change step s305.
Step s309, base station polygon obtain subelement 141 preservation QCj sides and arrive set c upward to A0 apart from the some Cm for r; It is Cj for base station, the Q corresponding with a Cj that selected base station P is set.Wherein, the base station corresponding with a Cj is meant that the intersection point of the perpendicular bisector b of the perpendicular bisector of line of base station A0 and this base station and line segment A0P is the base station of Cj.
Step s310, the base station polygon obtains the perpendicular bisector b that subelement 141 is made line segment A0P, to all base station Ai above line segment A0P is non-in the base station location memory cell 12, the perpendicular bisector Bi and the b that make line segment A0Ai intersect, and all intersection points form a set { Ck}; { select to make the some Ck of line segment QCk length minimum the Ck} from set.
Step s311, base station polygon obtain subelement 141 and whether judge line segment A0Ck less than r, if then change step s312; Otherwise change step s313.
Step s312, base station polygon obtain subelement 141 savepoint Ck to set c, and selected base station P is set is Ck for base station Ak, the Q corresponding with a Ck, change step s310.
Step s313, base station polygon obtain subelement 141 preservation QCk sides and arrive set c upward to A0 apart from the some Cn for r.
Step s314, base station polygon obtain subelement 141 judge from vector A0Cm counterclockwise whether exist in the angular range of vector A0Cn and A0 distance less than the base station of 2r, if then change step s315, otherwise change step s316.
Step s315, base station polygon obtain subelement 141 and selected base station P are set for wherein apart from the nearest base station of A0, and from vector A0P, by counterclockwise and clockwise direction seek polygonal summit, preserve the summit found to gathering c; And commentaries on classics step s314.
It is the center of circle with A0 that step s316, base station polygon obtain subelement 141, be starting point with Cm, be terminal point with Cn, by counterclockwise drawing arc CmCn.The polygonal region of described base station A0 is for being the polygon and the formed closed area of arc CmCn on summit with the point of set among the c.
Step s317, virtual base station are provided with unit 11 deletion virtual base stations and finish.
After the polygonal region of base station A0 is determined, when adopting the device of block of cells division shown in Figure 1, the method flow of the polygonal region of definite block of cells of the embodiment of the invention as shown in Figure 4, in the present embodiment A0 to be in A0 be initial point, be that x axle positive direction, above (north) they are in the plane right-angle coordinate of y axle positive direction with right (east).With reference to Fig. 4, present embodiment may further comprise the steps:
Step s401, sub-district polygon obtain quantity that subelement 142 judges antenna among the A0 of base station whether greater than 1, if then change step s403, otherwise change step s402.
Step s402, sub-district polygon obtain subelement 142 and the polygonal region of base station A0 is divided into a block of cells and finishes, and the zone of this block of cells is the polygonal region of base station A0.
It is initial point that step s403, sub-district polygon obtain that subelement 142 does with base station A0, and through the ray of the polygonal summit Vi of base station A0 in the base station polygon vertex storing sub-units 151, determines this ray and the formed angle [alpha] of x axle
iTo all angle orderings, form the angle sequence { α of a circulation
i.Because this angle sequence { α
iBe cyclic sequence, so the previous element of first element is last element, and a back element of last element is first element.
Step s404 obtains the angular bisector of the angle between the azimuth of the azimuth of current antenna and last antenna, and with the polygonal intersection point Vs of base station A0, and savepoint Vs is to set v.
At first, the sub-district polygon obtains subelement 142 and obtains the azimuth of current antenna and the azimuth of last antenna from azimuth memory cell 13, and determines the angular bisector and the formed angle beta of x axle of the angle between two azimuths; Then, the sub-district polygon obtains subelement 142 and obtains angle sequence { α
iIn satisfy α
k≤ β≤α
K+1Two adjacent angle [alpha]
kAnd α
K+1Connect again and angle [alpha]
kThe polygonal summit V of corresponding base station A0
kAnd and angle [alpha]
K+1The polygonal summit V of corresponding base station A0
K+1, form line segment V
kV
K+1At last, obtain this angular bisector and line segment V
kV
K+1Intersection point Vs, and the set v of savepoint Vs in the sub-district polygon vertex storing sub-units 152.
Step s405 obtains the azimuth of current antenna and the angular bisector of the angle between the azimuth of line one day after, and with the polygonal intersection point Ve of base station A0, and savepoint Ve is to set v.
At first, the sub-district polygon obtains subelement 142 and obtains the azimuth of current antenna and the azimuth of line one day after from azimuth memory cell 13, and determines the angular bisector and the formed angle θ of x axle of the angle between two azimuths; Then, the sub-district polygon obtains subelement 142 and obtains angle sequence { α
iIn satisfy α
j≤ θ≤α
J+1Two adjacent angle [alpha]
jAnd α
J+1Connect again and angle [alpha]
jThe polygonal summit V of corresponding base station A0
jAnd and angle [alpha]
J+1The polygonal summit V of corresponding base station A0
J+1, form line segment V
jV
J+1At last, obtain this angular bisector and line segment V
jV
J+1Intersection point Ve, and the set v of savepoint Ve in the sub-district polygon vertex storing sub-units 152.
Step s406, the polygonal summit that obtains the base station A0 between Vs and the Ve, and preserve the point that obtains and arrive set v.
At first, the sub-district polygon obtains the subscript Is=k+1 that subelement 142 is provided with the polygonal initial vertex of base station A0; The subscript Ie=j of the polygonal end vertex of base station A0 is set then; At last, preserve in the base station polygon vertex storing sub-units 151 and angle sequence { α
iIn angle [alpha]
Is, α
Is+1α
IeThe polygonal summit V of corresponding base station A0
Is, V
Is+1V
IeSet v in the sub-district polygon vertex storing sub-units 152.
Step s407, sub-district polygon obtain the position S0 that subelement 142 obtains base station A0, the set v of savepoint S0 in the sub-district polygon vertex storing sub-units 152, and finish.The zone of this block of cells is with point { S0, Vs, V among the set v
Is, V
Is+1V
Ie, Ve} is the formed closed area of polygon on summit.
By above embodiment, when determining the polygonal region of base station, relative position and described signal of base station coverage distance farthest according to other each base station in base station to be divided and the network, determine the polygonal region of described base station, make the block of cells of base station, the edge block of cells in showing converge on one section arc, more approach actual sub-district.
Through the above description of the embodiments, those skilled in the art can be well understood to the present invention and can realize by the mode that software adds essential general hardware platform, can certainly pass through hardware, but the former is better execution mode under a lot of situation.Based on such understanding, the part that technical scheme of the present invention contributes to prior art in essence in other words can embody with the form of software product, this computer software product is stored in the storage medium, comprise that some instructions are with so that a computer equipment (can be a personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the present invention.
The above only is embodiments of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (18)
1, a kind of method of block of cells division is characterized in that, may further comprise the steps:
According to the relative position of other each base station in base station A0 and the network and the signal coverage distance r farthest of described base station A0, determine the polygonal region of described base station A0;
According to the azimuth of antenna the polygonal region of described base station A0 is divided at least one block of cells.
2, the block of cells method of dividing according to claim 1, it is characterized in that, the polygonal region of described base station A0 is by being the center of circle with described base station A0, being the circle of radius with r, intersects the closed area that comprises the minimum of base station A0 in the formed closed figure with perpendicular bisector by other each base station line in described base station A0 and the network.
3, the block of cells method of dividing according to claim 1 is characterized in that the polygonal region of described definite base station A0 comprises:
Judge described base station A0 and apart between its nearest base station A1 apart from d whether greater than 2r;
If d greater than 2r, is the center of circle with described base station A0 then, be that radius is drawn circle with r, the polygonal region of described base station A0 is this round-formed closed area;
If it is selected base station P that d, then is provided with base station A1 less than 2r, seek the summit of polygonal region.
4, the method for dividing as block of cells as described in the claim 3 is characterized in that the summit of described searching polygonal region comprises:
From vector A0P, seek polygonal summit by counter clockwise direction, and preserve the summit of finding and arrive set c;
Judge whether to find described polygonal all summits, if the polygonal region of then described base station A0 is for being the formed closed area of polygon on summit with the point of set among the c;
If not,, seek described polygonal summit in the direction of the clock, and preserve the summit of finding and arrive set c then from vector A0P;
When last summit of finding by counter clockwise direction is Cm, and when last summit of finding in the direction of the clock is Cn, searching is from the vector A0Cm polygonal summit in the angular range of vector A0Cn counterclockwise, and preserves the summit found to set c.
5, the method for dividing as block of cells as described in the claim 4 is characterized in that, and is described from vector A0P, by counterclockwise seeking polygonal summit, and preserves the summit found to set c, may further comprise the steps:
Make the perpendicular bisector b of line segment A0P;
To all base station Ai above line segment A0P, the perpendicular bisector Bi and the b that make line segment A0Ai intersect, and all intersection points form a set { Cj};
{ select to make the some Cj of line segment QCj length minimum the Cj}, wherein Q is the mid point of line segment A0P from set;
Whether judge line segment A0Cj less than r, if less than, then savepoint Cj is to set c;
It is Cj for base station Aj, the Q corresponding with a Cj that selected base station P is set, and repeats above step, up to P=A1 or line segment A0Cj greater than r;
As line segment A0Cj during greater than r, the some Cm that preserves QCj side and upward to the A0 distance be r is to gathering c.
6, the method for dividing as block of cells as described in the claim 5 is characterized in that, describedly judges whether to find polygonal all summits, is specially:
If selected base station P is set to P=A1, then determine to find described polygonal all summits;
If line segment A0Cj greater than r, then determines not find described polygonal all summits.
7, the method for dividing as block of cells as described in the claim 4 is characterized in that, and is described from vector A0P, seeks described polygonal summit in the direction of the clock, and preserves the summit found to set c, may further comprise the steps:
Make the perpendicular bisector b of line segment A0P;
To all base station Ai above line segment A0P is non-, the perpendicular bisector Bi and the b that make line segment A0Ai intersect, and all intersection points form a set { Ck};
{ select to make the some Ck of line segment QCk length minimum the Ck} from set;
Whether judge line segment A0Ck less than r, if A0Ck less than r, then savepoint Ck to the set c, and be provided with selected base station P for base station Ak, the Q corresponding with a Ck be Ck, repeat above step, up to A0Ck greater than r;
If A0Ck, then preserves QCk side greater than r and arrives set c upward to A0 apart from the some Cn for r.
8, the method for dividing as block of cells as described in the claim 4 is characterized in that, described searching is from the vector A0Cm polygonal summit in the angular range of vector A0Cn counterclockwise, and preserves the summit found to set c, may further comprise the steps:
Judgement from vector A0Cm counterclockwise whether exist in the angular range of vector A0Cn and A0 distance less than the base station of 2r, if there is no, be the center of circle then, be starting point, be terminal point with Cn with Cm with A0, by counterclockwise drawing arc CmCn, the polygonal region of then described base station A0 is for being the polygon and the formed closed area of arc CmCn on summit with the point among the set c;
If exist, selected base station P then is set for wherein apart from the nearest base station of A0, from vector A0P, seek polygonal summit, and preserve the summit of finding and arrive set c by counter clockwise direction and clockwise direction;
Repeat above step, up to sought from vector A0Cm counterclockwise in the angular range of vector A0Cn the distance all and the A0 less than the base station of 2r.
9, as claim 1 to 8 method that block of cells is divided as described in each, it is characterized in that, when described base station A0 is in network edge, before the polygonal region of determining described base station A0, further comprising the steps of:
Distribution situation according to the base station is provided with a rectangle, and described rectangle covers current all base stations, and every limit of described rectangle and be in distance between the base station of network edge greater than r;
According to described rectangle a plurality of virtual base stations are set, each virtual base station respectively with the limit symmetry of described base station A0 about described rectangle.
10, the method for dividing as block of cells as described in the claim 9 is characterized in that, after the polygonal region of determining described base station A0, also comprises the described virtual base station of deletion.
11, the block of cells method of dividing according to claim 1 is characterized in that, described azimuth according to antenna is divided at least one block of cells with the polygonal region of described base station A0, specifically comprises:
Whether the quantity of judging antenna among the described base station A0 is greater than 1, and if not, then the polygonal region with described base station A0 is divided into a block of cells, and the zone of described block of cells is the polygonal region of described base station A0.
12, the method for dividing as block of cells as described in the claim 11 is characterized in that, described azimuth according to antenna is divided at least one block of cells with the polygonal region of described base station A0, further comprises: if the quantity of antenna is greater than 1, then among the described base station A0
Obtain the angular bisector of the angle between the azimuth of the azimuth of current antenna and last antenna, with the polygonal intersection point Vs of described base station A0, and savepoint Vs is to set v;
Obtain the azimuth of current antenna and the angular bisector of the angle between the azimuth of line one day after, with the polygonal intersection point Ve of described base station A0, and savepoint Ve is to set v;
Obtain the polygonal summit of the described base station A0 between Vs and the Ve, and preserve the point that obtains and arrive set v;
Obtain the position S0 of described base station A0, and savepoint S0 is to set v;
Then the zone of described block of cells is for for being the formed closed area of polygon on summit with the point of set among the v.
13, the method for dividing as block of cells as described in the claim 12 is characterized in that, before obtaining described intersection point Vs, also comprises:
Work is an initial point with described base station A0, and the ray of the polygonal summit Vi of the described base station A0 of process;
Determine described ray and the formed angle [alpha] of x axle
i
To all angle orderings, form the angle sequence { α of a circulation
i.
14, the method for dividing as block of cells as described in the claim 13 is characterized in that the described intersection point Vs that obtains specifically comprises:
Determine described angular bisector and the formed angle beta of x axle;
Obtain described angle sequence { α
iIn satisfy α
k≤ β≤α
K+1Two adjacent angle [alpha]
kAnd α
K+1
Connect and angle [alpha]
kThe polygonal summit V of corresponding described base station A0
kAnd and angle [alpha]
K+1The polygonal summit V of corresponding described base station A0
K+1, form line segment V
kV
K+1
Obtain described angular bisector and described line segment V
kV
K+1Intersection point Vs, and savepoint Vs to the set v.
15, the method for dividing as block of cells as described in the claim 13 is characterized in that the described intersection point Ve that obtains specifically comprises:
Determine described angular bisector and the formed angle θ of x axle;
Obtain described angle sequence { α
iIn satisfy α
j≤ θ≤α
J+1Two adjacent angle [alpha]
jAnd α
J+1
Connect and angle [alpha]
jThe polygonal summit V of corresponding described base station A0
jAnd and angle [alpha]
J+1The polygonal summit V of corresponding described base station A0
J+1, form line segment V
jV
J+1
Obtain described angular bisector and described line segment V
jV
J+1Intersection point Ve, and savepoint Ve to the set v.
16, the method for dividing as block of cells as described in the claim 13 is characterized in that the described polygonal summit that obtains the base station A0 between Vs and the Ve specifically comprises:
Determine the azimuth of current antenna and the angular bisector and the formed angle beta of x axle of the angle between the azimuth of line one day after;
Obtain described angle sequence { α
iIn satisfy α
k≤ β≤α
K+1Two adjacent angle [alpha]
kAnd α
K+1
The subscript Is=k+1 of the polygonal initial vertex of described base station A0 is set;
Determine the azimuth of current antenna and the angular bisector and the formed angle θ of x axle of the angle between the azimuth of line one day after;
Obtain described angle sequence { α
iIn satisfy α
j≤ θ≤α
J+1Two adjacent angle [alpha]
jAnd α
J+1
The subscript Ie=j of the polygonal end vertex of described base station A0 is set;
Preserve and angle sequence { α
iIn angle [alpha]
Is, α
Is+1α
IeThe polygonal summit V of corresponding described base station A0
Is, V
Is+1V
IeTo set v.
17, a kind of device of block of cells division is characterized in that, comprises base station location memory cell, azimuth memory cell, polygon vertex memory cell and polygon acquiring unit;
Described base station location memory cell is used to store the relative position of other each base station in base station A0 to be divided and the network;
Described azimuth memory cell is used to store the azimuth of the antenna of described base station A0;
Described polygon vertex memory cell is used to store the polygonal summit of the block of cells of the polygonal summit of described base station A0 and described base station A0;
Described polygon acquiring unit according to the relative position of other each base station in base station A0 that stores in the described base station location memory cell and the network and the signal coverage distance r farthest of described base station A0, is determined the polygonal region of described base station A0; And, the polygonal region of described base station A0 is divided at least one block of cells according to the azimuth of the antenna of the base station A0 of described azimuth cell stores.
18, the device of dividing as block of cells as described in the claim 17, it is characterized in that, comprise that also virtual base station is provided with the unit, be connected with described base station location memory cell, when described base station A0 is in network edge, a plurality of virtual base stations are set, and store the relative position of each virtual base station and described base station A0 into described base station location memory cell.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710086611A CN101043260B (en) | 2007-03-26 | 2007-03-26 | Method and apparatus for dividing cell block |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710086611A CN101043260B (en) | 2007-03-26 | 2007-03-26 | Method and apparatus for dividing cell block |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101043260A true CN101043260A (en) | 2007-09-26 |
| CN101043260B CN101043260B (en) | 2010-05-26 |
Family
ID=38808514
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710086611A Expired - Fee Related CN101043260B (en) | 2007-03-26 | 2007-03-26 | Method and apparatus for dividing cell block |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101043260B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103841567A (en) * | 2012-11-26 | 2014-06-04 | 中国移动通信集团广东有限公司 | Method for obtaining polygon area of base station and base station |
| CN106993301A (en) * | 2017-06-12 | 2017-07-28 | 中国联合网络通信集团有限公司 | Determine that base station belongs to the method and apparatus of grid |
| CN109413661A (en) * | 2018-09-20 | 2019-03-01 | 中国联合网络通信集团有限公司 | A kind of computer installation away from method and device |
| CN109547915A (en) * | 2017-08-08 | 2019-03-29 | 深圳市润安科技发展有限公司 | A kind of method and device of the more base station locations of multizone |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| SE9702408L (en) * | 1997-06-24 | 1998-12-25 | Ericsson Telefon Ab L M | Sectorization of a cellular CDMA system |
| US6094580A (en) * | 1997-10-16 | 2000-07-25 | Nortel Networks Corporation | Method for optimizing cell-site placement |
| KR100285734B1 (en) * | 1998-06-23 | 2001-04-02 | 윤종용 | Multiple Sectorizer of Base Station System |
| CN100391294C (en) * | 2004-07-20 | 2008-05-28 | 华为技术有限公司 | Method for optimizing network |
-
2007
- 2007-03-26 CN CN200710086611A patent/CN101043260B/en not_active Expired - Fee Related
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103841567A (en) * | 2012-11-26 | 2014-06-04 | 中国移动通信集团广东有限公司 | Method for obtaining polygon area of base station and base station |
| CN103841567B (en) * | 2012-11-26 | 2017-11-21 | 中国移动通信集团广东有限公司 | A kind of method of polygonal region for obtaining base station and base station |
| CN106993301A (en) * | 2017-06-12 | 2017-07-28 | 中国联合网络通信集团有限公司 | Determine that base station belongs to the method and apparatus of grid |
| CN109547915A (en) * | 2017-08-08 | 2019-03-29 | 深圳市润安科技发展有限公司 | A kind of method and device of the more base station locations of multizone |
| CN109413661A (en) * | 2018-09-20 | 2019-03-01 | 中国联合网络通信集团有限公司 | A kind of computer installation away from method and device |
| CN109413661B (en) * | 2018-09-20 | 2022-02-15 | 中国联合网络通信集团有限公司 | Method and device for calculating station distance |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101043260B (en) | 2010-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10237845B2 (en) | Geo-reference based positioning of a mobile device | |
| CN102867004B (en) | A kind of method and apparatus of address coupling | |
| CN1320793C (en) | Device and method for judging position of mobile communication terminal | |
| CN1282500A (en) | Smart subdivision of base station candidates for position location accuracy | |
| CN1114852A (en) | A registration method in a cellular mobile radio system | |
| CN101043260A (en) | Method and apparatus for dividing cell block | |
| CN103778477B (en) | Monitor station cloth station method and apparatus | |
| CN102480784A (en) | Method and system for evaluating fingerprint positioning error | |
| CN111107485B (en) | Positioning base station selection method | |
| CN110493853B (en) | Sequencing method for high-speed rail private network base stations | |
| CN103366325A (en) | Supervision method and device in patrol area | |
| CN110851547A (en) | Multi-data-source map data fusion method | |
| CN110319830A (en) | Location processing method, device and equipment based on geomagnetic data | |
| US8577376B2 (en) | Location based network access point scanning | |
| CN103530381B (en) | A kind of parallel optimization method towards remote sensing image neighborhood processing | |
| Wu et al. | Indexing continual range queries for location-aware mobile services | |
| CN1725891A (en) | Method for optimizing network | |
| CN115276760B (en) | Beam center position determining method and device and computer storage medium | |
| CN1852598A (en) | Method for accuretely positioning mobile station in double-arriving-time positioning | |
| CN1710981A (en) | Method for realizing terminal positioning utilizing digit map infomration in wireless communication system | |
| CN112203226B (en) | Antenna feeder adjusting method and device based on user position information | |
| Wu et al. | Shingle-based query indexing for location-based mobile e-commerce | |
| Dueker et al. | Locating Truck Data Collection Sites in Oregon Using Representation Optimal Sampling | |
| CN113487666B (en) | Intersection method and device of polygonal chain | |
| CN111913229B (en) | Sea-air gravity network cross point searching method and device |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100526 Termination date: 20180326 |