CN105323804A - Method and device for realizing neighbor planning - Google Patents

Method and device for realizing neighbor planning Download PDF

Info

Publication number
CN105323804A
CN105323804A CN201410319233.8A CN201410319233A CN105323804A CN 105323804 A CN105323804 A CN 105323804A CN 201410319233 A CN201410319233 A CN 201410319233A CN 105323804 A CN105323804 A CN 105323804A
Authority
CN
China
Prior art keywords
adjacent
importance list
candidate adjacent
candidate
base station
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.)
Pending
Application number
CN201410319233.8A
Other languages
Chinese (zh)
Inventor
杨棠
翟长昊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Potevio Information Technology Co Ltd
Putian Information Technology Co Ltd
Original Assignee
Putian Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Putian Information Technology Co Ltd filed Critical Putian Information Technology Co Ltd
Priority to CN201410319233.8A priority Critical patent/CN105323804A/en
Publication of CN105323804A publication Critical patent/CN105323804A/en
Pending legal-status Critical Current

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a method and device for realizing neighbor planning. The method comprises the following steps: obtaining a candidate neighbor cell importance list, wherein the candidate neighbor cell importance list comprises information of each candidate neighbor cell; and judging whether the distance between a base station of each candidate neighbor cell and a base station of a local cell is larger than a value obtained through an expression shown in the specification, and if so, deleting the information of the candidate neighbor cell from the candidate neighbor cell importance list, wherein, in the expression, D represents preset maximum neighbor cell allowable distance, Xi is the ith distance of the distances, in an ascending order, between the base stations of the candidate neighbor cells and the base station of local cell, n is a preset integer, and Y is a preset value. The method and device can realize large-station-distance multi-scene neighbor planning.

Description

A kind of method for realizing adjacent section planning and device
Technical field
The present invention relates to adjacent section planning technical field, particularly relating to a kind of method for realizing adjacent section planning and device.
Background technology
Adjacent section planning is an important step in wireless network planning, and the quality of neighbor cell configuration directly has influence on the gravity treatment of user and switching and then affects its network performance such as access rate, drop rate.Rational adjacent section planning, adjacent area quantity, distance controlling are carried out prioritization in suitable scope and according to the factor such as antenna gain parameter and distance in aerial angle or main plot and alternative adjacent cell line direction and finds out the most rational adjacent area, make user carry out gravity treatment and switching in the most rational adjacent area.
In existing adjacent section planning algorithm, the unified maximum adjacent area of setting allows distance, and the distance of neighbor base station and this cell base station need meet and is less than or equal to this maximum adjacent area and allows distance.This unified mode setting maximum adjacent area permission distance cannot meet many scenes adjacent section planning that station spacing differs greatly, this is because, when allowing distance setting larger unified maximum adjacent area, the remote community in small inter-site distance region can be made to be added as adjacent area; Otherwise, when allowing distance to arrange less unified maximum adjacent area, then make the relatively closely community of major station pitch area can not be joined for adjacent area.
Summary of the invention
The invention provides a kind of method for realizing adjacent section planning, many scenes adjacent section planning that station spacing differs greatly can be met.
Also the invention provides a kind of device for realizing adjacent section planning, many scenes adjacent section planning that station spacing differs greatly can be met.
Technical scheme of the present invention is achieved in that
For realizing a method for adjacent section planning, comprising:
Obtain candidate adjacent importance list, the importance list of described candidate adjacent comprises the information of each candidate adjacent;
Judge whether the base station of each candidate adjacent and the distance of this cell base station are greater than respectively if be greater than, then from the importance list of described candidate adjacent, delete the information of this candidate adjacent; Wherein:
D is that the maximum adjacent area preset allows distance;
X ifor the base station of each candidate adjacent and this cell base station are by i-th distance in ascending order spread length;
N is the integer preset;
Y is the value preset.
For realizing a device for adjacent section planning, comprising:
Candidate adjacent importance list chosen module, for obtaining candidate adjacent importance list, the importance list of described candidate adjacent comprises the information of each candidate adjacent;
Candidate adjacent importance list screening module, whether the distance for the base station and this cell base station that judge each candidate adjacent is respectively greater than if be greater than, then from the importance list of described candidate adjacent, delete the information of this candidate adjacent; Wherein:
D is that the maximum adjacent area preset allows distance;
X ifor the base station of each candidate adjacent and this cell base station are by i-th distance in ascending order spread length;
N is the integer preset;
Y is the value preset.
Visible, method and device for realizing adjacent section planning that the present invention proposes, considering the community dense degree of this region, community when selecting adjacent area, being suitable for the adjacent section planning comprising many scenes that the station spacing such as dense city, general city, rural area, open ground, highway differs greatly.
Accompanying drawing explanation
Fig. 1 is the method realization flow figure for realizing adjacent section planning that the present invention proposes;
Fig. 2 is the realization flow figure of the embodiment of the present invention one;
Fig. 3 is the apparatus structure schematic diagram for realizing adjacent section planning that the present invention proposes.
Embodiment
The present invention proposes a kind of method for realizing adjacent section planning, is suitable for the adjacent section planning comprising many scenes such as dense city, general city, rural area, open ground, highway.This method calculates maximum adjacent area and allows distance D and the Y minimum value doubly apart from the average distance of the nearest n of this cell base station base station, using this minimum value as the condition choosing adjacent area, solve the maximum adjacent area distance of each base station being suitable for different scene in bulk zone, adjacent area distance controlling is obtained more reasonable.
If Fig. 1 is the method realization flow figure for realizing adjacent section planning that invention proposes, comprising:
Step 101: obtain candidate adjacent importance list, the importance list of described candidate adjacent comprises the information of each candidate adjacent;
Step 102: judge whether the base station of each candidate adjacent and the distance of this cell base station are greater than respectively if be greater than, then from the importance list of described candidate adjacent, delete the information of this candidate adjacent; Wherein:
D is that the maximum adjacent area preset allows distance;
X ifor the base station of each candidate adjacent and this cell base station are by i-th distance in ascending order spread length;
N is the integer preset;
Y is the value preset.
Through test, in above-mentioned steps 102, when n=4, Y=2.5, effect is better.
In above-mentioned steps 101, the obtain manner of candidate adjacent importance list can be: the cell information obtaining appointed area, upgrade the neighboring BS information that user forces to configure or force not configure, also generate the importance list of described candidate adjacent according to sort algorithm according to described cell information and neighboring BS information.
May further include after above-mentioned steps 102: according to adjacent area interworking criterion, from the candidate adjacent importance list after screening, select adjacent area importance list, preserve this adjacent area importance list.
Below lift specific embodiment to introduce in detail.
Embodiment one:
As the realization flow figure that Fig. 2 is the embodiment of the present invention one, comprise the following steps:
Step 201: the cell information obtaining appointed area;
Step 202: upgrade the neighboring BS information that user forces to configure or force not configure;
Step 203: according to the information in above-mentioned steps 201 and step 202, candidate adjacent importance table is generated according to sort algorithm, this candidate adjacent importance list comprises the information of each candidate adjacent, such as, in the candidate adjacent relative position of base station, the information such as antenna azimuth;
Step 204: choose unscreened (following steps 205 and step 206 are a screening process) candidate adjacent from the importance list of candidate adjacent.
Step 205: judge whether the distance of base station and this cell base station in this candidate adjacent is greater than if be greater than, then perform step 206; Otherwise perform step 207;
Wherein, D is that the maximum adjacent area preset allows distance;
X ifor the base station of each candidate adjacent and this cell base station are by i-th distance in ascending order spread length;
N is the integer preset;
Y is the value preset.
Step 206: the information of deleting this candidate adjacent from the importance list of candidate adjacent, continues to perform step 207.
From step 205 and step 206, represent the Y of the mean value of nearest base station, n candidate adjacent and this cell base station distance doubly, this value and the maximum adjacent area preset allow the minimum value of distance D as the condition of screening adjacent area by the present embodiment, thus consider the dense degree of this region, community when adjacent section planning.In the present embodiment, when n=4, Y=2.5, effect is better.
Step 207: judged whether the screening to all candidate cells, if do not completed, then returns and performs step 204; If completed, then continue to perform step 208.
Step 208: according to adjacent area interworking criterion, chooses adjacent area importance list, and preserves this adjacent area importance list from the candidate adjacent importance list after above-mentioned screening.
Be described above adjacent section planning method, the present invention also proposes a kind of device for realizing adjacent section planning, if Fig. 3 is the structural representation of this device, comprising:
Candidate adjacent importance list chosen module 301, for obtaining candidate adjacent importance list, the importance list of described candidate adjacent comprises the information of each candidate adjacent;
Candidate adjacent importance list screening module 302, whether the distance for the base station and this cell base station that judge each candidate adjacent is respectively greater than if be greater than, then from the importance list of described candidate adjacent, delete the information of this candidate adjacent; Wherein:
D is that the maximum adjacent area preset allows distance;
X ifor the base station of each candidate adjacent and this cell base station are by i-th distance in ascending order spread length;
N is the integer preset;
Y is the value preset.
In said apparatus, n=4, described Y=2.5.
The mode that above-mentioned candidate adjacent importance list chosen module obtains candidate adjacent importance list can be: the cell information obtaining appointed area, upgrade the neighboring BS information that user forces to configure or force not configure, also generate the importance list of described candidate adjacent according to sort algorithm according to described cell information and neighboring BS information.
Said apparatus may further include:
Adjacent area importance list chosen module 303, for according to adjacent area interworking criterion, selects adjacent area importance list, preserves this adjacent area importance list from the candidate adjacent importance list after described screening.
As fully visible, method and device for realizing adjacent section planning that the present invention proposes, the community dense degree of this region, community can be considered when selecting adjacent area, being thus suitable for the adjacent section planning comprising many scenes that the station spacing such as dense city, general city, rural area, open ground, highway differs greatly.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, within the spirit and principles in the present invention all, any amendment made, equivalent replacement, improvement etc., all should be included within the scope of protection of the invention.

Claims (8)

1. for realizing a method for adjacent section planning, it is characterized in that, described method comprises:
Obtain candidate adjacent importance list, the importance list of described candidate adjacent comprises the information of each candidate adjacent;
Judge whether the base station of each candidate adjacent and the distance of this cell base station are greater than respectively if be greater than, then from the importance list of described candidate adjacent, delete the information of this candidate adjacent; Wherein:
D is that the maximum adjacent area preset allows distance;
X ifor the base station of each candidate adjacent and this cell base station are by i-th distance in ascending order spread length;
N is the integer preset;
Y is the value preset.
2. method according to claim 1, is characterized in that, described n=4, described Y=2.5.
3. method according to claim 1 and 2, is characterized in that, the obtain manner of described candidate adjacent importance list is:
Obtain the cell information of appointed area, upgrade the neighboring BS information that user forces to configure or force not configure, also generate the importance list of described candidate adjacent according to sort algorithm according to described cell information and neighboring BS information.
4. method according to claim 1 and 2, is characterized in that, describedly judges whether the base station of each candidate adjacent and the distance of this cell base station are greater than respectively and delete the information of candidate adjacent according to judged result after, comprise further:
According to adjacent area interworking criterion, from the importance list of described candidate adjacent, select adjacent area importance list, preserve this adjacent area importance list.
5. for realizing a device for adjacent section planning, it is characterized in that, described device comprises:
Candidate adjacent importance list chosen module, for obtaining candidate adjacent importance list, the importance list of described candidate adjacent comprises the information of each candidate adjacent;
Candidate adjacent importance list screening module, whether the distance for the base station and this cell base station that judge each candidate adjacent is respectively greater than if be greater than, then from the importance list of described candidate adjacent, delete the information of this candidate adjacent; Wherein:
D is that the maximum adjacent area preset allows distance;
X ifor the base station of each candidate adjacent and this cell base station are by i-th distance in ascending order spread length;
N is the integer preset;
Y is the value preset.
6. device according to claim 5, is characterized in that, described n=4, described Y=2.5.
7. the device according to claim 5 or 6, is characterized in that, the mode that described candidate adjacent importance list chosen module obtains candidate adjacent importance list is:
Obtain the cell information of appointed area, upgrade the neighboring BS information that user forces to configure or force not configure, also generate the importance list of described candidate adjacent according to sort algorithm according to described cell information and neighboring BS information.
8. the device according to claim 5 or 6, is characterized in that, described device comprises further:
Adjacent area importance list chosen module, for according to adjacent area interworking criterion, selects adjacent area importance list, preserves this adjacent area importance list from the candidate adjacent importance list after described screening.
CN201410319233.8A 2014-07-07 2014-07-07 Method and device for realizing neighbor planning Pending CN105323804A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410319233.8A CN105323804A (en) 2014-07-07 2014-07-07 Method and device for realizing neighbor planning

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410319233.8A CN105323804A (en) 2014-07-07 2014-07-07 Method and device for realizing neighbor planning

Publications (1)

Publication Number Publication Date
CN105323804A true CN105323804A (en) 2016-02-10

Family

ID=55250209

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410319233.8A Pending CN105323804A (en) 2014-07-07 2014-07-07 Method and device for realizing neighbor planning

Country Status (1)

Country Link
CN (1) CN105323804A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106332136A (en) * 2016-08-24 2017-01-11 上海华为技术有限公司 Data processing method and wireless network controller

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101594618A (en) * 2008-05-27 2009-12-02 中兴通讯股份有限公司 Adaptive configuring method for neighboring area in a kind of wireless network
CN101959227A (en) * 2009-07-21 2011-01-26 中国移动通信集团设计院有限公司 Method and device for generating neighboring cells among different systems
KR20130004656A (en) * 2011-07-04 2013-01-14 주식회사 엘지유플러스 Method and apparatus for assigning physical cell identifier of radio access network
CN103354647A (en) * 2013-07-17 2013-10-16 深圳市网信联动技术有限公司 Adjacent cell optimization method in mobile communication system and apparatus thereof

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101594618A (en) * 2008-05-27 2009-12-02 中兴通讯股份有限公司 Adaptive configuring method for neighboring area in a kind of wireless network
CN101959227A (en) * 2009-07-21 2011-01-26 中国移动通信集团设计院有限公司 Method and device for generating neighboring cells among different systems
KR20130004656A (en) * 2011-07-04 2013-01-14 주식회사 엘지유플러스 Method and apparatus for assigning physical cell identifier of radio access network
CN103354647A (en) * 2013-07-17 2013-10-16 深圳市网信联动技术有限公司 Adjacent cell optimization method in mobile communication system and apparatus thereof

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106332136A (en) * 2016-08-24 2017-01-11 上海华为技术有限公司 Data processing method and wireless network controller

Similar Documents

Publication Publication Date Title
Huang et al. An algorithm of efficient proactive placement of autonomous drones for maximum coverage in cellular networks
RU2557080C1 (en) System and methods for beam forming in self-organising network (son)
CN102316469B (en) Method and system for configuring antenna parameters
CN103354644A (en) Method and system for site selection of base station
CN108024299A (en) A kind of residence reselecting and device
CN105794247B (en) For the method for resource-sharing, network node and storage medium
CN102448087A (en) Method and system for optimizing antenna feeder parameters
US20170251377A1 (en) Method and system for neighbor tier determination
Arshad et al. Handover rate characterization in 3D ultra-dense heterogeneous networks
JP7486659B2 (en) Energy saving processing method and processing device for base station
CN104053160A (en) Method and device for adjusting cell work frequency bands
CN106792764B (en) Wireless base station planning method for power distribution terminal communication access network
CN103269490A (en) Method for locating wireless mixing cellular network base station and measuring and calculating scale
CN105874861B (en) A kind of method and device adjusting capacity density of eating dishes without rice or wine
CN109863820A (en) System and method for scalable radio electric network slice
CN104080094A (en) Method and device for adjusting antenna azimuths of cells
CN105828393A (en) Method and device for inter-system neighbor cell configuration
Ghosh et al. Coverage and rate analysis in two‐tier heterogeneous networks under suburban and urban scenarios
CN108271164A (en) LTE neighbor cell optimizing methods and device
Nikam et al. Optimal positioning of small cells for coverage and cost efficient 5G network deployment: A smart simulated annealing approach
CN106658526A (en) Simulated annealing algorithm based frequency spectrum distribution method in super-dense small cell network
CN105323804A (en) Method and device for realizing neighbor planning
Wang et al. Graph-based dynamic frequency reuse in Cloud-RAN
KR101886737B1 (en) Method and system for determining neighboring tiers
US9490534B1 (en) Dynamic optimization of antenna systems

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20160210