CN105228161A - A kind of adjacent section planning method - Google Patents
A kind of adjacent section planning method Download PDFInfo
- Publication number
- CN105228161A CN105228161A CN201410286291.5A CN201410286291A CN105228161A CN 105228161 A CN105228161 A CN 105228161A CN 201410286291 A CN201410286291 A CN 201410286291A CN 105228161 A CN105228161 A CN 105228161A
- Authority
- CN
- China
- Prior art keywords
- adjacent
- candidate
- serving cell
- base station
- adjacent area
- 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
Abstract
Embodiment of the present invention proposes a kind of method of adjacent section planning.Comprise: the adjacent area candidate list determining Serving cell; In the candidate list of described adjacent area, delete the community dorsad of this Serving cell according to main lobe direction angle, and determine the priority of each remaining candidate adjacent according to the distance of each remaining candidate adjacent and Serving cell in this adjacent area candidate list; According to the priority of Neighboring Cell List number and each remaining candidate adjacent described, from the candidate list of described adjacent area, determine the Neighboring Cell List of this Serving cell.After application embodiment of the present invention, not relying on electronic chart and propagation model, having taken into full account that distance and directional antenna deflection are on the impact of adjacent section planning, by defining the priority factors of adjacent area, significantly improve the order of accuarcy of adjacent section planning.
Description
Technical field
The invention belongs to mobile communication technology field, particularly a kind of adjacent section planning method.
Background technology
Radio communication (Wirelesscommunication) is a kind of communication mode that the characteristic utilizing electromagnetic wave signal to propagate in free space carries out information exchange.In information communication field in recent years, with fastest developing speed, most widely used is exactly wireless communication technology.The radio communication realized in movement is commonly referred to as mobile communication again, and people are collectively referred to as wireless mobile communications the two.
Adjacent area is defined as: two are coated with overlap and are provided with the community of handoff relation, and can there be multiple neighbor cell a community.Adjacent section planning is the important content of wireless communication system network planning.Adjacent section planning plays very important meaning to keeping the continuity of communication, it is link very important in wireless network planning, whether adjacent section planning rationally directly affects network performance, and the quality height of such as adjacent section planning will directly have influence on the index such as performance of handoffs and cutting off rate.
At present, adjacent section planning scheme of the prior art mainly comprises:
(1), manually plan: there is efficiency low, high in cost of production shortcoming.
(2), based on the adjacent section planning of coverage prediction: determine whether as adjacent area according to the overlapping coverage condition between community, the method depends on the accuracy of numerical map and propagation model to a great extent, be difficult to the prerequisite ensured in the accuracy of numerical map and propagation model under, adjacent section planning result error can be larger.
(3), based on the adjacent section planning of distance: only considered distance factor, do not consider the impact at the different main lobe direction angle of directional antenna, the unreasonable of adjacent section planning can be caused.
Summary of the invention
Embodiment of the present invention proposes a kind of method of adjacent section planning, thus improves the order of accuarcy of adjacent section planning.
Technical scheme of the present invention comprises:
A method for adjacent section planning, the method comprises:
Determine the adjacent area candidate list of Serving cell;
In the candidate list of described adjacent area, delete the community dorsad of this Serving cell according to main lobe direction angle, and determine the priority of each remaining candidate adjacent according to the distance of each remaining candidate adjacent and Serving cell in this adjacent area candidate list;
According to the priority of Neighboring Cell List number and each remaining candidate adjacent described, from the candidate list of described adjacent area, determine the Neighboring Cell List of this Serving cell.
Described community dorsad of deleting this Serving cell according to main lobe direction angle in the candidate list of described adjacent area, comprising:
By the main lobe direction translation of the candidate adjacent in Serving cell and adjacent area candidate list;
Detect Serving cell and the region corresponding to main lobe direction angle of this candidate adjacent and the relativeness between the half-power angle overlay region of Serving cell and this candidate adjacent, if the region wherein corresponding to described main lobe direction angle is all positioned within described half-power angle overlay region, then judge that this candidate adjacent is not community dorsad, if the region corresponding to described main lobe direction angle is not all positioned within described half-power angle overlay region, then judge that this candidate adjacent is community dorsad, and delete this candidate adjacent in the candidate list of described adjacent area.
Describedly determine that the priority of each remaining candidate adjacent comprises according to each remaining candidate adjacent in this adjacent area candidate list with the distance of Serving cell:
Determine the base station location of Serving cell, and the base station of Serving cell is connected to form connecting line with the base station of candidate adjacent;
Take base station location as initial point, in the both sides of described connecting line with the angle scanning preset, if exist in this angular range and sweep small area, and described in sweep the base station of small area and the base station of Serving cell spacing be greater than the spacing of the base station of this candidate adjacent and the base station of Serving cell, and in this angular range, do not have the distance between the base station of Serving cell to be less than the other candidate adjacent of this candidate adjacent to the spacing of the base station of Serving cell, then arranging this candidate adjacent is first lap adjacent area, this sweeps small area is the second circle adjacent area, and the priority of first lap adjacent area is greater than the priority of the second circle adjacent area.
Describedly determine that the priority of each remaining candidate adjacent comprises according to each residue community and the distance of Serving cell in this adjacent area candidate list:
Determine the base station location of Serving cell, and the base station of Serving cell is connected to form connecting line with the base station of candidate adjacent;
With the base station location of Serving cell for initial point, in the both sides of described connecting line with the angle scanning preset, if exist in this angular range and sweep small area, and described in sweep the base station of small area and the base station of Serving cell spacing be greater than the spacing of the base station of this candidate adjacent and the base station of Serving cell, and in this angular range, have the distance between the base station of Serving cell to be less than the other candidate adjacent of this candidate adjacent to the spacing of the base station of Serving cell, then arranging this candidate adjacent is first lap adjacent area, this other candidate adjacent is the second circle adjacent area, this sweeps small area is the 3rd circle adjacent area, and the priority of first lap adjacent area is greater than the priority of the second circle adjacent area, the priority of the second circle adjacent area is greater than the priority of the 3rd circle adjacent area.
Co-sited community is comprised in the candidate list of described adjacent area; The method comprises further:
In the Neighboring Cell List of this Serving cell, co-sited community is set with limit priority.
Comprise in the candidate list of described adjacent area and force community; The method comprises further: in the Neighboring Cell List of this Serving cell, arranges force community with the priority being only second to co-sited community.
As can be seen from technique scheme, the method for adjacent section planning of the present invention comprises: the adjacent area candidate list determining Serving cell; In the candidate list of described adjacent area, delete the community dorsad of this Serving cell according to main lobe direction angle, and determine the priority of each remaining candidate adjacent according to the distance of each remaining candidate adjacent and Serving cell in this adjacent area candidate list; According to the priority of Neighboring Cell List number and each remaining candidate adjacent described, from the candidate list of described adjacent area, determine the Neighboring Cell List of this Serving cell.As can be seen here, after application embodiment of the present invention, do not rely on electronic chart and propagation model, taken into full account that distance and directional antenna deflection are on the impact of adjacent section planning, by defining the priority factors of adjacent area, significantly improve the order of accuarcy of adjacent section planning.
Accompanying drawing explanation
Fig. 1 is the method flow diagram according to adjacent section planning of the present invention.
Fig. 2 is the schematic diagram of the half-power angle according to Serving cell of the present invention and candidate adjacent.
Fig. 3 points to the schematic diagram after translation according to Serving cell of the present invention and candidate adjacent.
Fig. 4 is the schematic diagram of the priority according to calculated candidate adjacent area of the present invention.
Embodiment
For making the object, technical solutions and advantages of the present invention clearly, below in conjunction with accompanying drawing, the present invention is described in further detail.
Succinct and directly perceived in order to what describe, hereafter by description some representational execution modes, the solution of the present invention is set forth.Details a large amount of in execution mode only understands the solution of the present invention for helping.But these details can be not limited to when clearly, technical scheme of the present invention realizes.In order to avoid unnecessarily fuzzy the solution of the present invention, some execution modes do not describe meticulously, but only give framework.Hereinafter, " comprising " refers to " including but not limited to ", " according to ... " refer to " at least basis ..., but be not limited to only basis ... ".Due to the speech habits of Chinese, when hereinafter not particularly pointing out the quantity of a composition, mean that this composition can be one also can be multiple, or can be regarded as at least one.
In the present invention, not relying on electronic chart and propagation model, having taken into full account that community distance and directional antenna deflection are on the impact of adjacent section planning, by defining the priority factors of adjacent area, significantly improve the order of accuarcy of adjacent section planning.
Fig. 1 is the method flow diagram according to adjacent section planning of the present invention.
As shown in Figure 1, the method comprises:
Step 101: the adjacent area candidate list determining Serving cell.
Here, can determine the candidate adjacent of Serving cell based on various ways, each candidate adjacent together constitutes adjacent area candidate list.
Step 102: the community dorsad of deleting this Serving cell according to main lobe direction angle in the candidate list of adjacent area, and determine the priority of each remaining candidate adjacent according to the distance of each remaining candidate adjacent and Serving cell in this adjacent area candidate list.
Here, can by the main lobe direction translation of the candidate adjacent in Serving cell and adjacent area candidate list; Then Serving cell and the region corresponding to main lobe direction angle of this candidate adjacent and the relativeness between the half-power angle overlay region of Serving cell and this candidate adjacent is detected, if the region wherein corresponding to main lobe direction angle is all positioned within half-power angle overlay region, then judge that this candidate adjacent is not community dorsad, if the region corresponding to main lobe direction angle is not all positioned within half-power angle overlay region, then judge that this candidate adjacent is community dorsad, and delete this candidate adjacent in the candidate list of adjacent area.
Step 103: according to the priority of Neighboring Cell List number and each remaining candidate adjacent, determine the Neighboring Cell List of this Serving cell from the candidate list of adjacent area.
In one embodiment:
Determine the base station location of Serving cell, and the base station of Serving cell is connected to form connecting line with the base station of candidate adjacent;
Take base station location as initial point, in the both sides of connecting line with the angle scanning preset, if exist in this angular range and sweep small area, and the spacing of sweeping the base station of small area and the base station of Serving cell is greater than the spacing of the base station of this candidate adjacent and the base station of Serving cell, and in this angular range, do not have the distance between the base station of Serving cell to be less than the other candidate adjacent of this candidate adjacent to the spacing of the base station of Serving cell, then arranging this candidate adjacent is first lap adjacent area, this sweeps small area is the second circle adjacent area, and the priority of first lap adjacent area is greater than the priority of the second circle adjacent area.
In one embodiment:
Determine the base station location of Serving cell, and the base station of Serving cell is connected to form connecting line with the base station of candidate adjacent;
Take base station location as initial point, in the both sides of connecting line with the angle scanning preset, if exist in this angular range and sweep small area, and described in sweep the base station of small area and the base station of Serving cell spacing be greater than the spacing of the base station of this candidate adjacent and the base station of Serving cell, and in this angular range, have the distance between the base station of Serving cell to be less than the other candidate adjacent of this candidate adjacent to the spacing of the base station of Serving cell, then arranging this candidate adjacent is first lap adjacent area, this other candidate adjacent is the second circle adjacent area, this sweeps small area is the 3rd circle adjacent area, and the priority of first lap adjacent area is greater than the priority of the second circle adjacent area, the priority of the second circle adjacent area is greater than the priority of the 3rd circle adjacent area.
More than describe the defining method that adjacent area and the 3rd circle adjacent area are enclosed in first lap adjacent area, second in detail.It will be appreciated by those of skill in the art that this description is only exemplary, the protection range be not intended to limit the present invention.
Similarly, the adjacent area (if any) of more multi-turn number can be determined further with identical principle, and the priority of the less adjacent area of the number of turns is higher.
With instantiation, the present invention is described in further detail below.First, how exemplary illustrated deletes community dorsad according to community sensing.
Fig. 2 is the schematic diagram of the half-power angle according to Serving cell of the present invention and candidate adjacent.
Left one side of something is main lobe direction and the half-power angle schematic diagram of Serving cell (assuming that corresponding to base station A) as shown in Figure 2; Right one side of something is main lobe direction and the half-power angle schematic diagram of certain candidate adjacent (assuming that corresponding to base station B).
First, by the main lobe direction translation of Serving cell and candidate adjacent.Fig. 3 points to the schematic diagram after translation according to Serving cell of the present invention and candidate adjacent.
As seen from Figure 3, Serving cell and this candidate adjacent have main lobe direction angle (angle namely between the main lobe direction of Serving cell and the main lobe direction of candidate adjacent), and the half-power angle of Serving cell and this candidate adjacent has overlay region.If the region corresponding to main lobe direction angle is all positioned within half-power angle overlay region, then judge that this candidate adjacent is not community dorsad, if the region corresponding to main lobe direction angle is not all positioned within half-power angle overlay region, then judge that this candidate adjacent is community dorsad, and delete this candidate adjacent in the candidate list of adjacent area.
As seen from Figure 3, the main lobe direction angle of Serving cell and this candidate adjacent is all between Serving cell and the half-power angle overlay region of this candidate adjacent, and therefore this candidate adjacent is not community dorsad, then in the candidate list of adjacent area, retain this candidate adjacent.
According to above-mentioned decision procedure, each candidate adjacent in the candidate list of adjacent area is screened respectively, to remove community dorsad in the candidate list of adjacent area.
Then, to all candidate adjacent in the above-mentioned adjacent area candidate list filtered out, calculate its priority factors respectively, its core concept chooses candidate adjacent to be positioned at which circle adjacent area, and arrange priority based on distance to this circle adjacent area.The dense degree of adjacent area depends on a user configured angle parameter α.
Fig. 4 is the schematic diagram of the priority according to calculated candidate adjacent area of the present invention.
As shown in Figure 4, the position of the base station A at place, Serving cell is first determined.Prepare for certain the candidate adjacent D (assuming that the base station of this candidate adjacent is D) determining priority, the base station A at place, Serving cell is connected to form connecting line with base station D.
Then, with the base station location of Serving cell for initial point, scan with the angle [alpha] preset in the both sides of connecting line; If there is candidate adjacent E (its respective base station is base station E) in this scanning angle, and the distance of base station E to base station A is greater than the distance of base station D to base station A simultaneously, and in this scanning angle, do not have the distance between base station and base station A to be less than distance between base station D to base station A simultaneously, then base station D is first lap adjacent area, base station E is the second circle adjacent area, and the priority arranging the follow-up adjacent area D corresponding to the D of base station is greater than the priority of the follow-up adjacent area E corresponding to the E of base station.
Similarly, if there is candidate adjacent E (its respective base station is base station E) in this scanning angle, and the distance of base station E to base station A is greater than the distance of base station D to base station A simultaneously, and in this angle, also have the distance between base station F and F base station A to be less than between base station D to base station A, then base station D is first lap adjacent area, and base station F is the second circle adjacent area; Base station E is the 3rd circle adjacent area.
And, the priority factors f (n) n being enclosed to adjacent area is: f (first lap adjacent area) >f (the second circle adjacent area) >f (the 3rd circle adjacent area) > ... f (the n-th circle adjacent area), namely the priority of the adjacent area that the number of turns is less is higher.
Based on the change of real needs and applied environment, the value of angle [alpha] can change.Such as, preferred angle alpha is 0 ~ 60 degree.In fact, the value of angle [alpha] also can be other arbitrary value outside this scope, and the present invention is to this and indefinite.
In one embodiment, co-sited community is comprised in candidate list; The method comprises further:
In the Neighboring Cell List of this Serving cell, co-sited community is set with limit priority.
In one embodiment, pressure community is comprised in the candidate list of adjacent area; The method comprises further:
In the Neighboring Cell List of this Serving cell, arrange with the priority being only second to co-sited community and force community.
Wherein: co-sited community refers to the community identical with the position, site of Serving cell; Pressure community refers to the community needing to become adjacent area with Serving cell interworking.
Finally, finally determine the Neighboring Cell List of Serving cell according to priority and Neighboring Cell List number, wherein co-sited native region priority is the highest, secondly for forcing community, is finally the candidate adjacent of other type.
Particularly, first ensure that co-sited community appears in final Neighboring Cell List, ensure and then to force community to appear in final Neighboring Cell List.When meet for co-sited community and force community above-mentioned condition after, again based on the priority of other candidate adjacent, be aligned in final Neighboring Cell List according to priority order from big to small, wherein in final Neighboring Cell List, adjacent area number is the Neighboring Cell List number preset.Such as, assuming that the Neighboring Cell List number of certain Serving cell is set to 18, and co-sited community number is 3, is respectively co-sited community A, co-sited community B and co-sited community C; Force community number to be 5, be respectively and force community D, force community E, force community F, force community G and force community H.So, in final Neighboring Cell List, preferably comprise co-sited community A, co-sited community B and co-sited community C, force community D, force community E, force community F, force community G and force community H.10 adjacent areas remaining in Neighboring Cell List, then according to priority order from big to small, are never force to choose in the community of other type of community or co-sited community.
In fact, embodiment of the present invention can be applied in polytype mobile communication system.Such as, the present invention goes for the second generation digital mobile communication technology mainly comprising GSM and narrowband CDMA technology, the present invention also goes for Wideband Code Division Multiple Access (WCDMA) (W-CDMA), the modulation of overloading wavelength-division multiplexed spread spectrum (CDMA2000) and Time division multiple access (TD-SCDMA) etc. are the third generation digital mobile communication technology of representative, the present invention is equally also applicable to forth generation digital mobile communication technology etc., and embodiment of the present invention is to this and indefinite.
In sum, the method for adjacent section planning of the present invention comprises: the adjacent area candidate list determining Serving cell; In the candidate list of described adjacent area, delete the community dorsad of this Serving cell according to main lobe direction angle, and determine the priority of each remaining candidate adjacent according to the distance of each remaining candidate adjacent and Serving cell in this adjacent area candidate list; According to the priority of Neighboring Cell List number and each remaining candidate adjacent described, from the candidate list of described adjacent area, determine the Neighboring Cell List of this Serving cell.As can be seen here, after application embodiment of the present invention, do not rely on electronic chart and propagation model, taken into full account that distance and directional antenna deflection are on the impact of adjacent section planning, by defining the priority factors of adjacent area, significantly improve the order of accuarcy of adjacent section planning.
The above, be only preferred embodiment of the present invention, be not intended to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (6)
1. a method for adjacent section planning, is characterized in that, the method comprises:
Determine the adjacent area candidate list of Serving cell;
In the candidate list of described adjacent area, delete the community dorsad of this Serving cell according to main lobe direction angle, and determine the priority of each remaining candidate adjacent according to the distance of each remaining candidate adjacent and Serving cell in this adjacent area candidate list;
According to the priority of Neighboring Cell List number and each remaining candidate adjacent described, from the candidate list of described adjacent area, determine the Neighboring Cell List of this Serving cell.
2. the method for adjacent section planning according to claim 1, is characterized in that, described community dorsad of deleting this Serving cell according to main lobe direction angle in the candidate list of described adjacent area, comprising:
By the main lobe direction translation of the candidate adjacent in Serving cell and adjacent area candidate list;
Detect Serving cell and the region corresponding to main lobe direction angle of this candidate adjacent and the relativeness between the half-power angle overlay region of Serving cell and this candidate adjacent, if the region wherein corresponding to described main lobe direction angle is all positioned within described half-power angle overlay region, then judge that this candidate adjacent is not community dorsad, if the region corresponding to described main lobe direction angle is not all positioned within described half-power angle overlay region, then judge that this candidate adjacent is community dorsad, and delete this candidate adjacent in the candidate list of described adjacent area.
3. the method for adjacent section planning according to claim 1, is characterized in that, describedly determines that the priority of each remaining candidate adjacent comprises according to each remaining candidate adjacent in this adjacent area candidate list with the distance of Serving cell:
Determine the base station location of Serving cell, and the base station of Serving cell is connected to form connecting line with the base station of candidate adjacent;
With the base station location of Serving cell for initial point, in the both sides of described connecting line with the angle scanning preset, if exist in this angular range and sweep small area, and described in sweep the base station of small area and the base station of Serving cell spacing be greater than the spacing of the base station of this candidate adjacent and the base station of Serving cell, and in this angular range, do not have the distance between the base station of Serving cell to be less than the other candidate adjacent of this candidate adjacent to the spacing of the base station of Serving cell, then arranging this candidate adjacent is first lap adjacent area, this sweeps small area is the second circle adjacent area, and the priority of first lap adjacent area is greater than the priority of the second circle adjacent area.
4. the method for adjacent section planning according to claim 1, is characterized in that, describedly determines that the priority of each remaining candidate adjacent comprises according to each residue community and the distance of Serving cell in this adjacent area candidate list:
Determine the base station location of Serving cell, and the base station of Serving cell is connected to form connecting line with the base station of candidate adjacent;
Take base station location as initial point, in the both sides of described connecting line with the angle scanning preset, if exist in this angular range and sweep small area, and described in sweep the base station of small area and the base station of Serving cell spacing be greater than the spacing of the base station of this candidate adjacent and the base station of Serving cell, and in this angular range, have the distance between the base station of Serving cell to be less than the other candidate adjacent of this candidate adjacent to the spacing of the base station of Serving cell, then arranging this candidate adjacent is first lap adjacent area, this other candidate adjacent is the second circle adjacent area, this sweeps small area is the 3rd circle adjacent area, and the priority of first lap adjacent area is greater than the priority of the second circle adjacent area, the priority of the second circle adjacent area is greater than the priority of the 3rd circle adjacent area.
5. the method for adjacent section planning according to claim 1, is characterized in that, comprises co-sited community in the candidate list of described adjacent area; The method comprises further:
In the Neighboring Cell List of this Serving cell, co-sited community is set with limit priority.
6. the method for adjacent section planning according to claim 5, is characterized in that, comprises and force community in the candidate list of described adjacent area; The method comprises further:
In the Neighboring Cell List of this Serving cell, arrange with the priority being only second to co-sited community and force community.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410286291.5A CN105228161B (en) | 2014-06-24 | 2014-06-24 | A kind of adjacent section planning method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410286291.5A CN105228161B (en) | 2014-06-24 | 2014-06-24 | A kind of adjacent section planning method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105228161A true CN105228161A (en) | 2016-01-06 |
| CN105228161B CN105228161B (en) | 2019-05-17 |
Family
ID=54996774
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410286291.5A Expired - Fee Related CN105228161B (en) | 2014-06-24 | 2014-06-24 | A kind of adjacent section planning method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105228161B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105813096A (en) * | 2016-04-19 | 2016-07-27 | 中国普天信息产业北京通信规划设计院 | Method for optimizing neighbor cell plan based on topological structure |
| CN106332136A (en) * | 2016-08-24 | 2017-01-11 | 上海华为技术有限公司 | Data processing method and wireless network controller |
| US10972918B2 (en) | 2016-11-15 | 2021-04-06 | Elisa Oyj | Method and apparatus for mobile network designing |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09275584A (en) * | 1996-04-08 | 1997-10-21 | N T T Ido Tsushinmo Kk | Mobile communication network |
| CN101459916A (en) * | 2009-01-05 | 2009-06-17 | 普天信息技术研究院有限公司 | Method for determining priority of adjacent domain |
| CN102036341A (en) * | 2010-12-20 | 2011-04-27 | 北京北方烽火科技有限公司 | Method and device for implementing cell blockage |
| CN102281546A (en) * | 2010-06-13 | 2011-12-14 | 中兴通讯股份有限公司 | Method and system for selecting candidate neighbor cells |
| CN102480767A (en) * | 2010-11-30 | 2012-05-30 | 普天信息技术研究院有限公司 | Establishment method of adjacent cell list |
| CN102572856A (en) * | 2010-12-22 | 2012-07-11 | 普天信息技术研究院有限公司 | Method and device for determining cell adjacent relation |
| CN102647725A (en) * | 2011-02-17 | 2012-08-22 | 中兴通讯股份有限公司 | Method and device for determining neighbor cell priority in neighbor cell planning |
| EP2645772A1 (en) * | 2012-03-30 | 2013-10-02 | ST-Ericsson SA | Neighboring cell measurements |
| US20140099961A1 (en) * | 2011-06-07 | 2014-04-10 | Huawei Technologies Co., Ltd. | Method for optimizing neighboring cell, base station and system |
-
2014
- 2014-06-24 CN CN201410286291.5A patent/CN105228161B/en not_active Expired - Fee Related
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09275584A (en) * | 1996-04-08 | 1997-10-21 | N T T Ido Tsushinmo Kk | Mobile communication network |
| CN101459916A (en) * | 2009-01-05 | 2009-06-17 | 普天信息技术研究院有限公司 | Method for determining priority of adjacent domain |
| CN102281546A (en) * | 2010-06-13 | 2011-12-14 | 中兴通讯股份有限公司 | Method and system for selecting candidate neighbor cells |
| CN102480767A (en) * | 2010-11-30 | 2012-05-30 | 普天信息技术研究院有限公司 | Establishment method of adjacent cell list |
| CN102036341A (en) * | 2010-12-20 | 2011-04-27 | 北京北方烽火科技有限公司 | Method and device for implementing cell blockage |
| CN102572856A (en) * | 2010-12-22 | 2012-07-11 | 普天信息技术研究院有限公司 | Method and device for determining cell adjacent relation |
| CN102647725A (en) * | 2011-02-17 | 2012-08-22 | 中兴通讯股份有限公司 | Method and device for determining neighbor cell priority in neighbor cell planning |
| US20140099961A1 (en) * | 2011-06-07 | 2014-04-10 | Huawei Technologies Co., Ltd. | Method for optimizing neighboring cell, base station and system |
| EP2645772A1 (en) * | 2012-03-30 | 2013-10-02 | ST-Ericsson SA | Neighboring cell measurements |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105813096A (en) * | 2016-04-19 | 2016-07-27 | 中国普天信息产业北京通信规划设计院 | Method for optimizing neighbor cell plan based on topological structure |
| CN105813096B (en) * | 2016-04-19 | 2019-02-05 | 普天信息工程设计服务有限公司 | The method for carrying out adjacent section planning optimization based on topological structure |
| CN106332136A (en) * | 2016-08-24 | 2017-01-11 | 上海华为技术有限公司 | Data processing method and wireless network controller |
| US10972918B2 (en) | 2016-11-15 | 2021-04-06 | Elisa Oyj | Method and apparatus for mobile network designing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105228161B (en) | 2019-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102480742B (en) | A kind ofly detect method and the device that wireless network crosses covering | |
| CN102316469B (en) | Method and system for configuring antenna parameters | |
| EP3269171B1 (en) | Improving overall network performance and/or overall quality of service of a mobile communication network by assigning a physical cell identifier information to a plurality of radio cells | |
| CN102647725B (en) | Method and device for determining neighbor cell priority in neighbor cell planning | |
| CN105578496A (en) | Adjacent cell optimization method and apparatus | |
| CN105813096A (en) | Method for optimizing neighbor cell plan based on topological structure | |
| CN102325333B (en) | Indoor neighbor cell coverage planning method of multi-storey building based on radio frequency remote system | |
| CN105228161A (en) | A kind of adjacent section planning method | |
| CN103841602A (en) | Neighborhood configuration method and system | |
| CN104349351A (en) | Method and device for neighboring cell optimization based on network communication | |
| CN103354647A (en) | Adjacent cell optimization method in mobile communication system and apparatus thereof | |
| CN102883332B (en) | Method and device for determining base station site | |
| CN104105105B (en) | The method for determining adjacent area proximity relations | |
| WO2016049592A1 (en) | Method and system for neighbor tier determination | |
| CN104349326B (en) | Network plan method | |
| CN104602249A (en) | Method and device for determining community relations | |
| CN102056261A (en) | Switchover judgment method and device | |
| CN103916873B (en) | A kind of existing network mends the configuring method for neighboring area and device at station | |
| US7050804B1 (en) | Method and system for improving mobile communication handoffs using pilot beacons | |
| CN102638807B (en) | A kind of descending interference defining method and device | |
| CN105744533B (en) | A kind of adjacent area determines method, apparatus and system | |
| CN105282800A (en) | Network switching method and device for mobile terminal | |
| CN109640365A (en) | Switching method, device and the storage medium of cell | |
| CN107801220A (en) | The method and computer-readable recording medium of automatic switchover cell type | |
| CN102413526B (en) | Method for selecting switching object cell and base station controller |
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 | ||
| 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: 20190517 |