CN108551374A - A kind of autoplacement method of LTE indoor distribution system antenna - Google Patents
A kind of autoplacement method of LTE indoor distribution system antenna Download PDFInfo
- Publication number
- CN108551374A CN108551374A CN201810254789.1A CN201810254789A CN108551374A CN 108551374 A CN108551374 A CN 108551374A CN 201810254789 A CN201810254789 A CN 201810254789A CN 108551374 A CN108551374 A CN 108551374A
- Authority
- CN
- China
- Prior art keywords
- cell
- antenna
- denoted
- bit
- dna
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/309—Measuring or estimating channel quality parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/391—Modelling the propagation channel
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
- Variable-Direction Aerials And Aerial Arrays (AREA)
Abstract
The present invention provides a kind of autoplacement methods of LTE indoor distribution system antenna, which is characterized in that including：Step A：Parameter setting is carried out to LTE indoor distribution system；Step B：Rasterizing processing is carried out to floor plan, establishes alternative antenna set；Step C：Independent simulation calculation is carried out to each alternative antenna；Step D：Using cell division algorithm, optimal mother cell is found；Step E：Antenna arrangement is obtained according to by the calculated optimal mother cell of cell division algorithm.The present invention establishes in emulation of coverage capability result indoors using wireless signal propagation model as foundation, and accuracy is far above the estimation with artificial experience；Only need input relevant parameter that can be calculated；It calculates and meets the required minimum antenna amount of coverage rate up to standard and the highest antenna arrangement scheme of coverage rate, the antenna amount caused by artificial experience judges inaccuracy is avoided to over-evaluate；The present invention mitigates related personnel's workload, shortens working hours, saves human cost.
Description
Technical field
The present invention relates to mobile communication fields, and in particular, to indoor to a kind of LTE (Long Term Evolution)
The autoplacement method of compartment system antenna.
Background technology
With the fast development of mobile Internet, the distributed scytoblastema station of new indoor solves distributed architecture in conventional chamber
Complicated, the problems such as construction cost is high, difficult in maintenance, the construction period is long, but in construction plan, it is main still by people's subjective judgement
It is laid out, lacks unified standard and objective basis.
Traditional indoor distributed system Planning emphasis is the cabling for planning feeder line/cable, because its is of high cost, and is limited to build
Building structure and layout, while being also contemplated that the various situations such as fire-fighting, cable.And for the placement of indoor ceiling aerial, because its
Cost be it is low-down, typically " it is the more the better ".
New indoor compartment system does not use feeder line/cable, directly connects signal source by cable, in signal source
Set antenna.But the cost of signal source is high much compared with traditional domestic aerial.So the planning of new indoor compartment system must
Reasonable placement and the quantity control of antenna (signal source) must more be stressed.It therefore can be by the phase of computer or intelligent terminal
Algorithm is closed, traditional artificial experience is replaced with algorithm, to plan quantity and the position of antenna or signal source.
Invention content
For the defects in the prior art, the object of the present invention is to provide a kind of the automatic of LTE indoor distribution system antenna
Layout method, solve the problems, such as be how within a short period of time, using radio transmission model obtain simulation result on the basis of,
Calculate rational LTE indoor distribution system antenna arrangement method so that under the premise of meeting the requirement of RSRP coverage rates, antenna
Minimum number, RSRP coverage rate highests can be solved effectively with unreasonable layout caused by artificial experience possibility and cost waste.
The present invention is realized according to following technical scheme：
A kind of autoplacement method of LTE indoor distribution system antenna, which is characterized in that include the following steps：
Step A：Parameter setting is carried out to LTE indoor distribution system, wherein
RSRP threshold values, are denoted as Threshold, take -105dBm ∽ -95dBm,
RSRP coverage rates value up to standard, is denoted as Coverage, takes 90% ∽ 98%,
RSRP grid coverage sizes, are denoted as CubeStep, take 0.1m ∽ 0.5m,
Aerial position sizing grid, is denoted as GridStep, takes 0.5m ∽ 2m；
Step B：Rasterizing processing is carried out to floor plan, establishes alternative antenna set；
Step C：Independent simulation calculation is carried out to each alternative antenna；
Step D：Using cell division algorithm, optimal mother cell is found；
Step E：Antenna arrangement is obtained according to by the calculated optimal mother cell of cell division algorithm.
In above-mentioned technical proposal, the step B further includes following steps：
Step B01：Plane domain is divided into equal-sized close adjacent square net array, each grid it is big
Small is CubeStep, and the columns of this grid array is denoted as M, and line number is denoted as N, altogether M*N square net；
Step B02：The bit arrays that a length is M*N are established according to the step B1 grids divided, BitR is denoted as, is used for
RSRP emulation of coverage capability is stored as a result, BitR [M*y+x] indicates that the bit values of xth row, y rows, bit values indicate the grid for 1
RSRP values meet threshold requirement, and bit values indicate that the RSRP values of the grid are unsatisfactory for threshold requirement for 0；
Step B03：Plane domain is divided into equal-sized close adjacent square net array, each grid it is big
Small is GridStep；
Step B04：Alternative antenna location sets are established, set SetA is denoted as, in all grid element centers that step B3 is divided
Antenna is established, judges whether aerial position is legal according to floor plan, if aerial position is legal, which is added
Enter set SetA, the antenna amount in SetA is denoted as C by the position that final set SetA will be likely to occur comprising all antennas；
Step B05：RSRP coverage rates required number of grid up to standard up to standard is calculated, the institute in statistics BitR is in need to be covered
The number of grid of lid, is denoted as FullNum, calculates number of grid up to standard according to following formula, is denoted as LimitNum, wherein
LimitNum=ceil (FullNum*Coverage), wherein ceil () are the function that rounds up.
In above-mentioned technical proposal, the step C further includes following steps：
Step C01：The antenna in set SetA is traversed, step C02 ∽ C04 are executed to each antenna, are executed C times altogether；
Step C02：For n-th of antenna in set SetA, the bit arrays that the exclusive length of the antenna is M*N are established,
It is denoted as BitS [n], for storing the RSRP emulation of coverage capability in the presence of there was only the antenna as a result, BitS [n] [M*y+x] indicates xth
The bit values of row, y rows, bit values indicate that the RSRP values of the grid meet threshold requirement for 1, and bit values indicate the grid for 0
RSRP values are unsatisfactory for threshold requirement；
Step C03：The RSRP coverings in the presence of the only antenna are calculated using indoor distribution wireless signal propagation model
Simulation result；
Step C04：Each grid of RSRP emulation of coverage capability results in traversal step C03, for xth row, y rows
Grid, if the RSRP values of the grid region are more than or equal to threshold T hreshold, by BitS [n] [M*y+x] assignment
It is 1, if the RSRP values of the grid region are less than threshold T hreshold or the grid region and need not cover,
BitS [n] [M*y+x] is then assigned a value of 0.
In above-mentioned technical proposal, the step D further includes following steps：
Step D01：The bit arrays that a length is C are established, Cell is denoted as, for storing all days in set SetA
The combination of line, Cell [n] indicate that the bit values that n-th of antenna whether there is in set SetA, bit values indicate the antenna for 1
In the presence of bit values indicate that the antenna is not present for 0；This indicates that the bit arrays Cell of antenna combination is known as cell, which includes
1 and 0 sequence be known as the DNA of the cell；
Step D02：All bit values in Cell are set as 0, DNA completion subalgorithms are called to Cell, generate just godmother
Cell；Cell is primary mother cell at this time, if DNA completion subalgorithms return the result to fail, can not generate just godmother
Cell shows under current setting no matter how many antenna all can not make RSRP coverage rates up to standard, and algorithm terminates；
Step D03：Cell division is carried out to mother cell Cell, the DNA of mother cell is cut, obtains two containing mutual
Then two daughter cells are carried out DNA completions, grow into two new mother cells by the daughter cell of the imperfect DNA mended respectively.
Step D04：The DNA of mother cell Cell is cut, traverse all Cell [n] value be 1 position n, respectively into
The following two operations of row：1) value of p position therein is set as 0 by operation, the value of remaining position is constant, obtains one and contains
The daughter cell of DNA after cutting, referred to as O-shaped daughter cell；2) value of p position therein is left 1 by operation, remaining position
Value is disposed as 0, obtains the daughter cell for the DNA that another contains after cutting, referred to as I types daughter cell；
P is set as 1 first, when carrying out the step again, other possible cutting position combinations are found, when all
After position grouping traversal based on p, p is increased by 1, works as p>3 or p>When C/2, step D10 is carried out；
Step D05：DNA completion subalgorithms are carried out to O-shaped daughter cell, obtain novel mother cell CellO.To I type daughter cells
DNA completion subalgorithms are carried out, novel mother cell CellI is obtained；
Step D06：1 quantity, is denoted as NumP, counts in novel mother cell CellO 1 number in the former mother cell Cell of statistics
Amount, is denoted as NumO, counts in novel mother cell CellI 1 quantity, be denoted as NumI, take smaller in NumO and NumI one, remembers
For MinOI, it is compared with NumP；If MinOI<NumP then shows to have found more excellent mother cell, by mother cell Cell
It is updated to the new mother cell, primary evolution is completed, executes step D03；If MinOI=NumP executes D06；If MinOI
>NumP then executes D09；
Step D07：The corresponding multiple antennas bit figures of former mother cell Cell are generated, wherein by RSRP emulation of coverage capability result bit numbers
Group is known as bit figures, and generation method is n-th of single antenna bit in the set SetA traversed corresponding to n of all Cell [n] values for 1
Scheme BitS [n], all qualified BitS [n] are done into step-by-step or operation, obtained multiple antennas bit seals are BitM, statistics
1 quantity, is denoted as CountM in BitM；
Step D08：The corresponding multiple antennas bit figures of novel mother cell CellO and CellI are generated respectively, and are counted in bit figures
1 quantity, is denoted as CountO and CountI respectively；
Step D09：Larger in CountO and CountI one is taken, MaxOI is denoted as, is compared with CountM；If
MaxOI>CountM then shows to have found outstanding mother cell, and mother cell Cell is updated to the new mother cell, complete once into
Change, executes step D03；If MaxOI<=CountM, then execute D09；
Step D10：Give up two novel mother cells, maintains former mother cell Cell constant, and attempt under mother cell Cell
One DNA cutting mode executes step D04；
Step D11：More excellent mother cell can not be found in polynomial time, algorithm terminates, at this time mother cell Cell
Including bit value informations be antenna distribution optimal location.
In above-mentioned technical proposal, the step E further includes following steps：
Step E1：According to the bit arrays of mother cell Cell, quantity and the position of antenna are restored, traverses all Cell [n]
N-th of antenna in set SetA corresponding to n of the value for 1, antenna amount are denoted as R, n-th of antenna are calculated according to following formula
Mesh column coordinate x [n], row coordinate y [n]：
X [n]=n%M, wherein % are complementation operation；
Y [n]=floor (n/M) wherein floor () are downward bracket function；
Then the practical abscissa rx [n] of n-th of antenna, ordinate ry [n] are calculated according to following formula：
Rx [n]=x [n] * GridStep+GridStep/2,
Ry [n]=y [n] * GridStep+GridStep/2；
Step E2：For the antenna of the above R known location, this is calculated using indoor distribution wireless signal propagation model
RSRP emulation of coverage capability results in the presence of R antenna.
In above-mentioned technical proposal, RSRP emulation of coverage capability result bit arrays are known as bit and schemed by the DNA completions subalgorithm, packet
Include following steps：
Step Z01：For given Cell, its corresponding multiple antennas bit figure is generated, it is 1 to traverse all Cell [n] value
All qualified BitS [n] are done step-by-step or fortune by n-th of single antenna bit figure BitS [n] in set SetA corresponding to n
It calculates, obtained multiple antennas bit seals are BitM, count in BitM 1 quantity, are denoted as CountM；
Step Z02：DNA next bit completions are carried out to Cell using greedy algorithm and traverse all Cell [n] values as 0 n institutes
It is carried out step-by-step or operation with BitM one by one, is denoted as BitT by n-th of single antenna bit figure BitS [n] in corresponding set SetA
[n] counts in BitT [n] 1 quantity, is denoted as Count [n], finding out makes Count [n] maximum n, is denoted as BestN；
Step Z03：Compare Count [BestN] and CountM, if Count [BestN]=CountM, stops DNA benefits
Full subalgorithm returns the result and fails for DNA completions.If Count [BestN]>CountM thens follow the steps Z04；
Step Z04：The value of Cell [BestN] is updated to 1, the value of CountM is updated to Count [BestN]；
Step Z05：Compare CountM and LimitNum, if CountM>=LimitNum then stops the calculation of DNA completion
Method returns the result and succeeds for DNA completions, if CountM<LimitNum thens follow the steps Z02.
Compared with prior art, the present invention has following advantageous effect：
1) more accurate.The method of the present invention is built upon a kind of searching algorithm carried out on in-door covering simulation result, with nothing
Line signal propagation model is foundation, and accuracy is far above the estimation with artificial experience.
2) more efficient.The present invention is full automatic antenna arrangement method, it is only necessary to which inputting some relevant parameters can carry out
It calculates.After tested, on Portable intelligent terminal (such as iPad), the floor antenna arrangement scheme for calculating 5000 sides or so generally exists
Within one minute.
3) more cost-effective.The method of the present invention, which can calculate, meets the required minimum antenna amount of coverage rate up to standard,
It avoids the antenna amount caused by artificial experience judges inaccuracy to over-evaluate, saves construction cost；The method of the present invention can also
The workload for mitigating related personnel, shortens working hours, saves human cost.
Specific implementation mode
With reference to specific embodiment, the present invention is described in detail.Following embodiment will be helpful to the technology of this field
Personnel further understand the present invention, but the invention is not limited in any way.It should be pointed out that the ordinary skill of this field
For personnel, without departing from the inventive concept of the premise, several changes and improvements can also be made.These belong to the present invention
Protection domain.
The present invention respectively defines following technical term：
Indoor distributed system：Indoor distributed system is for indoor user group, for improving mobile communication ring in building
A kind of successful scheme in border；It is that the signal of mobile base station is uniformly distributed each angle indoors using domestic aerial compartment system
It falls, to ensure that room area possesses ideal signal covering.
Distributed base station：Distributed base station is modern production of a new generation for completing the network coverage.Its feature is main
It is to be connected further through optical fiber while detaching RF processing unit with conventional macro base station baseband processing unit.
Set covering problem：Definition：Given complete or collected works U and one gather comprising n and this n union of sets collection is complete
The set S of collection.Set covering problem will find a minimum subset of S so that their union is equal to complete or collected works.
The optimization problem of set covering is given (U, S), asks a covering using minimum set.Optimization problem
Set covering be NP difficult problems.
For set covering problem, there are mainly two types of processing methods both at home and abroad at present：One is using heuritic approach；Separately
One is use exact algorithm or approximate data outside.
NP difficult problems：When all np problems can be in polynomial time Turing reduction to this problem, this problem quilt
Referred to as NP is difficult.
So far, no one of such issues that, finds efficient algorithm.Tend to receive np complete problem and NP is difficult
There is no efficient algorithm this guesses for problem, it is believed that such issues that large-scale example cannot be solved with exact algorithm, it is necessary to seek
Such issues that effective approximate data.
Heuritic approach：One algorithm constructed based on intuitive or experience (is referred in acceptable spend and calculates time and sky
Between) under provide a feasible solution of each example of combinatorial optimization problem to be solved, the departure degree of the feasible solution and optimal solution
It cannot generally be expected.
At this stage, heuritic approach mainly has genetic algorithm, ant group algorithm, simulated annealing based on imitative nature body algorithm
Algorithm, artificial neural network algorithm etc..
The autoplacement method of a kind of LTE indoor distribution system antenna of the present invention, which is characterized in that including following step
Suddenly：
Step A：Parameter setting is carried out to LTE indoor distribution system antenna, wherein
RSRP threshold values, are denoted as Threshold, take -105dBm ∽ -95dBm,
RSRP coverage rates value up to standard, is denoted as Coverage, takes 90% ∽ 98%,
RSRP grid coverage sizes, are denoted as CubeStep, build and take 0.1m ∽ 0.5m,
Aerial position sizing grid, is denoted as GridStep, takes 0.5m ∽ 2m；
Step B：Rasterizing processing is carried out to floor plan；
Step C：Independent simulation calculation is carried out to each antenna；
Step D：Using cell division algorithm, antenna optimal location scheme is found；
Step E：Antenna arrangement is obtained according to by the calculated optimal mother cell of cell division algorithm.
In above-mentioned technical proposal, the step B further includes following steps：
Step B01：Plane domain is divided into equal-sized close adjacent square net array, each grid it is big
Small is CubeStep, and the columns of this grid array is denoted as M, and line number is denoted as N, altogether M*N square net；
Step B02：The bit arrays that a length is M*N are established according to the step B1 grids divided, BitR is denoted as, is used for
RSRP emulation of coverage capability is stored as a result, BitR [M*y+x] indicates that the bit values of xth row, y rows, bit values indicate the grid for 1
RSRP values meet threshold requirement, and bit values indicate that the RSRP values of the grid are unsatisfactory for threshold requirement for 0；
Step B03：Plane domain is divided into equal-sized close adjacent square net array, each grid it is big
Small is GridStep；
Step B04：Alternative antenna location sets are established, set SetA is denoted as, in all grid element centers that step B3 is divided
Antenna is established, judges whether aerial position is legal according to floor plan, if aerial position is legal, which is added
Enter set SetA, the antenna amount in SetA is denoted as C by the position that final set SetA will be likely to occur comprising all antennas；
Step B05：RSRP coverage rates required number of grid up to standard up to standard is calculated, the institute in statistics BitR is in need to be covered
The number of grid of lid, is denoted as FullNum, calculates number of grid up to standard according to following formula, is denoted as LimitNum, wherein
LimitNum=ceil (FullNum*Coverage), wherein ceil () are the function that rounds up.
In above-mentioned technical proposal, the step C further includes following steps：
Step C01：The antenna in set SetA is traversed, step C02 ∽ C04 are executed to each antenna, are executed C times altogether；
Step C02：For n-th of antenna in set SetA, the bit arrays that the exclusive length of the antenna is M*N are established,
It is denoted as BitS [n], for storing the RSRP emulation of coverage capability in the presence of there was only the antenna as a result, BitS [n] [M*y+x] indicates xth
The bit values of row, y rows, bit values indicate that the RSRP values of the grid meet threshold requirement for 1, and bit values indicate the grid for 0
RSRP values are unsatisfactory for threshold requirement；
Step C03：The RSRP coverings in the presence of the only antenna are calculated using indoor distribution wireless signal propagation model
Simulation result；
Step C04：Each grid of RSRP emulation of coverage capability results in traversal step C03, for xth row, y rows
Grid, if the RSRP values of the grid region are more than or equal to threshold T hreshold, by BitS [n] [M*y+x] assignment
It is 1, if the RSRP values of the grid region are less than threshold T hreshold or the grid region and need not cover,
BitS [n] [M*y+x] is then assigned a value of 0.
In above-mentioned technical proposal, the step D further includes following steps：
Step D01：The bit arrays that a length is C are established, Cell is denoted as, for storing all days in set SetA
The combination of line, Cell [n] indicate that the bit values that n-th of antenna whether there is in set SetA, bit values indicate the antenna for 1
In the presence of bit values indicate that the antenna is not present for 0；This indicates that the bit arrays Cell of antenna combination is known as cell, which includes
1 and 0 sequence be known as the DNA of the cell；
Step D02：All bit values in Cell are set as 0, DNA completion subalgorithms are called to Cell, generate just godmother
Cell；Cell is primary mother cell at this time, if DNA completion subalgorithms return the result to fail, can not generate just godmother
Cell shows under current setting no matter how many antenna all can not make RSRP coverage rates up to standard, and algorithm terminates；
Step D03：Cell division is carried out to mother cell Cell, the DNA of mother cell is cut, obtains two containing mutual
Then two daughter cells are carried out DNA completions, grow into two new mother cells by the daughter cell of the imperfect DNA mended respectively.
Step D04：The DNA of mother cell Cell is cut, traverse all Cell [n] value be 1 position n, respectively into
The following two operations of row：1) value of p position therein is set as 0 by operation, the value of remaining position is constant, obtains one and contains
The daughter cell of DNA after cutting, referred to as O-shaped daughter cell；2) value of p position therein is left 1 by operation, remaining position
Value is disposed as 0, obtains the daughter cell for the DNA that another contains after cutting, referred to as I types daughter cell；
P is set as 1 first, when carrying out the step again, other possible cutting position combinations are found, when all
After position grouping traversal based on p, p is increased by 1, works as p>3 or p>When C/2, step D10 is carried out；
Step D05：DNA completion subalgorithms are carried out to O-shaped daughter cell, obtain novel mother cell CellO.To I type daughter cells
DNA completion subalgorithms are carried out, novel mother cell CellI is obtained；
Step D06：1 quantity, is denoted as NumP, counts in novel mother cell CellO 1 number in the former mother cell Cell of statistics
Amount, is denoted as NumO, counts in novel mother cell CellI 1 quantity, be denoted as NumI, take smaller in NumO and NumI one, remembers
For MinOI, it is compared with NumP；If MinOI<NumP then shows to have found more excellent mother cell, by mother cell Cell
It is updated to the new mother cell, primary evolution is completed, executes step D03；If MinOI=NumP executes D06；If MinOI
>NumP then executes D09；
Step D07：The corresponding multiple antennas bit figures of former mother cell Cell are generated, wherein by RSRP emulation of coverage capability result bit numbers
Group is known as bit figures, and generation method is n-th of single antenna bit in the set SetA traversed corresponding to n of all Cell [n] values for 1
Scheme BitS [n], all qualified BitS [n] are done into step-by-step or operation, obtained multiple antennas bit seals are BitM, statistics
1 quantity, is denoted as CountM in BitM；
Step D08：The corresponding multiple antennas bit figures of novel mother cell CellO and CellI are generated respectively, and are counted in bit figures
1 quantity, is denoted as CountO and CountI respectively；
Step D09：Larger in CountO and CountI one is taken, MaxOI is denoted as, is compared with CountM；If
MaxOI>CountM then shows to have found outstanding mother cell, and mother cell Cell is updated to the new mother cell, complete once into
Change, executes step D03；If MaxOI<=CountM, then execute D09；
Step D10：Give up two novel mother cells, maintains former mother cell Cell constant, and attempt under mother cell Cell
One DNA cutting mode executes step D04；
Step D11：More excellent mother cell can not be found in polynomial time, algorithm terminates, at this time mother cell Cell
Including bit value informations be antenna distribution optimal location.
In above-mentioned technical proposal, the step E further includes following steps：
Step E1：According to the bit arrays of mother cell Cell, quantity and the position of antenna are restored, traverses all Cell [n]
N-th of antenna in set SetA corresponding to n of the value for 1, antenna amount are denoted as R, n-th of antenna are calculated according to following formula
Mesh column coordinate x [n], row coordinate y [n]：
X [n]=n%M, wherein % are complementation operation；
Y [n]=floor (n/M) wherein floor () are downward bracket function；
Then the practical abscissa rx [n] of n-th of antenna, ordinate ry [n] are calculated according to following formula：
Rx [n]=x [n] * GridStep+GridStep/2,
Ry [n]=y [n] * GridStep+GridStep/2；
Step E2：For the antenna of the above R known location, this is calculated using indoor distribution wireless signal propagation model
RSRP emulation of coverage capability results in the presence of R antenna.
In above-mentioned technical proposal, RSRP emulation of coverage capability result bit arrays are known as bit and schemed by the DNA completions subalgorithm, packet
Include following steps：
Step Z01：For given Cell, its corresponding multiple antennas bit figure is generated, it is 1 to traverse all Cell [n] value
All qualified BitS [n] are done step-by-step or fortune by n-th of single antenna bit figure BitS [n] in set SetA corresponding to n
It calculates, obtained multiple antennas bit seals are BitM, count in BitM 1 quantity, are denoted as CountM；
Step Z02：DNA next bit completions are carried out to Cell using greedy algorithm and traverse all Cell [n] values as 0 n institutes
It is carried out step-by-step or operation with BitM one by one, is denoted as BitT by n-th of single antenna bit figure BitS [n] in corresponding set SetA
[n] counts in BitT [n] 1 quantity, is denoted as Count [n], finding out makes Count [n] maximum n, is denoted as BestN；
Step Z03：Compare Count [BestN] and CountM, if Count [BestN]=CountM, stops DNA benefits
Full subalgorithm returns the result and fails for DNA completions.If Count [BestN]>CountM thens follow the steps Z04；
Step Z04：The value of Cell [BestN] is updated to 1, the value of CountM is updated to Count [BestN]；
Step Z05：Compare CountM and LimitNum, if CountM>=LimitNum then stops the calculation of DNA completion
Method returns the result and succeeds for DNA completions, if CountM<LimitNum thens follow the steps Z02.
Specific embodiments of the present invention are described above.It is to be appreciated that the invention is not limited in above-mentioned
Particular implementation, those skilled in the art can make a variety of changes or change within the scope of the claims, this not shadow
Ring the substantive content of the present invention.In the absence of conflict, the feature in embodiments herein and embodiment can arbitrary phase
Mutually combination.
Claims (6)
1. a kind of autoplacement method of LTE indoor distribution system antenna, which is characterized in that include the following steps：
Step A：Parameter setting is carried out to LTE indoor distribution system, wherein
RSRP threshold values, are denoted as Threshold, take -105dBm ∽ -95dBm,
RSRP coverage rates value up to standard, is denoted as Coverage, takes 90% ∽ 98%,
RSRP grid coverage sizes, are denoted as CubeStep, take 0.1m ∽ 0.5m,
Aerial position sizing grid, is denoted as GridStep, takes 0.5m ∽ 2m；
Step B：Rasterizing processing is carried out to floor plan, establishes alternative antenna set；
Step C：Independent simulation calculation is carried out to each alternative antenna；
Step D：Using cell division algorithm, optimal mother cell is found；
Step E：Antenna arrangement is obtained according to by the calculated optimal mother cell of cell division algorithm.
2. a kind of autoplacement method of LTE indoor distribution system antenna according to claim 1, which is characterized in that institute
It further includes following steps to state step B：
Step B01：Plane domain is divided into equal-sized close adjacent square net array, the size of each grid is
The columns of CubeStep, this grid array are denoted as M, and line number is denoted as N, altogether M*N square net；
Step B02：The bit arrays that a length is M*N are established according to the step B1 grids divided, BitR are denoted as, for storing
RSRP emulation of coverage capability is as a result, BitR [M*y+x] indicates that the bit values of xth row, y rows, bit values are the 1 RSRP values for indicating the grid
Meet threshold requirement, bit values indicate that the RSRP values of the grid are unsatisfactory for threshold requirement for 0；
Step B03：Plane domain is divided into equal-sized close adjacent square net array, the size of each grid is
GridStep；
Step B04：Alternative antenna location sets are established, set SetA is denoted as, are established in all grid element centers that step B3 is divided
Antenna judges whether aerial position is legal according to floor plan, if aerial position is legal, which is added and is collected
SetA is closed, the antenna amount in SetA is denoted as C by the position that final set SetA will be likely to occur comprising all antennas；
Step B05：Calculate RSRP coverage rates required number of grids up to standard up to standard, count in BitR covering in need
Number of grid is denoted as FullNum, calculates number of grid up to standard according to following formula, is denoted as LimitNum, wherein LimitNum
=ceil (FullNum*Coverage), wherein ceil () are the function that rounds up.
3. a kind of autoplacement method of LTE indoor distribution system antenna according to claim 1, which is characterized in that institute
It further includes following steps to state step C：
Step C01：The antenna in set SetA is traversed, step C02 ∽ C04 are executed to each antenna, are executed C times altogether；
Step C02：For n-th of antenna in set SetA, the bit arrays that the exclusive length of the antenna is M*N are established, are denoted as
BitS [n], for store RSRP emulation of coverage capability only in the presence of the antenna as a result, BitS [n] [M*y+x] indicate xth arrange, the
The bit values of y rows, bit values indicate that the RSRP values of the grid meet threshold requirement for 1, and bit values are the 0 RSRP values for indicating the grid
It is unsatisfactory for threshold requirement；
Step C03：The RSRP emulation of coverage capability in the presence of the only antenna is calculated using indoor distribution wireless signal propagation model
As a result；
Step C04：Each grid of RSRP emulation of coverage capability results in traversal step C03, for the net of xth row, y rows
BitS [n] [M*y+x] is assigned a value of by lattice if the RSRP values of the grid region are more than or equal to threshold T hreshold
1, if the RSRP values of the grid region are less than threshold T hreshold or the grid region and need not cover,
BitS [n] [M*y+x] is assigned a value of 0.
4. a kind of autoplacement method of LTE indoor distribution system antenna according to claim 1, which is characterized in that institute
It further includes following steps to state step D：
Step D01：The bit arrays that a length is C are established, Cell is denoted as, for storing all antennas in set SetA
Combination, Cell [n] indicate that the bit values that n-th of antenna whether there is in set SetA, bit values indicate that the antenna is deposited for 1
It is that the 0 expression antenna is not present in, bit values；This indicate antenna combination bit arrays Cell be known as cell, the array include 1
It is known as the DNA of the cell with 0 sequence；
Step D02：All bit values in Cell are set as 0, DNA completion subalgorithms are called to Cell, it is thin to generate just godmother
Born of the same parents；Cell is primary mother cell at this time, if DNA completion subalgorithms return the result to fail, it is thin can not to generate just godmother
Born of the same parents show under current setting no matter how many antenna all can not make RSRP coverage rates up to standard, and algorithm terminates；
Step D03：Cell division is carried out to mother cell Cell, the DNA of mother cell is cut, obtains two containing complementation
Then the daughter cell of imperfect DNA carries out DNA completions respectively to two daughter cells, grow into two new mother cells.
Step D04：The DNA of mother cell Cell is cut, traverse all Cell [n] value be 1 position n, carry out respectively with
Lower two kinds of operations：1) value of p position therein is set as 0 by operation, the value of remaining position is constant, obtains one containing cutting
The daughter cell of DNA afterwards, referred to as O-shaped daughter cell；2) value of p position therein is left 1 by operation, the value of remaining position is equal
It is set as 0, obtains the daughter cell for the DNA that another contains after cutting, referred to as I types daughter cell；
P is set as 1 first, when carrying out the step again, finds other possible cutting positions combinations, when it is all based on
After the position grouping traversal of p, p is increased by 1, works as p>3 or p>When C/2, step D10 is carried out；
Step D05：DNA completion subalgorithms are carried out to O-shaped daughter cell, obtain novel mother cell CellO.I type daughter cells are carried out
DNA completion subalgorithms obtain novel mother cell CellI；
Step D06：1 quantity, is denoted as NumP, counts in novel mother cell CellO 1 quantity in the former mother cell Cell of statistics,
It is denoted as NumO, in novel mother cell CellI 1 quantity is counted, is denoted as NumI, smaller in NumO and NumI one is taken, is denoted as
MinOI is compared with NumP；If MinOI<NumP then shows to have found more excellent mother cell, more by mother cell Cell
It is newly the new mother cell, completes primary evolution, execute step D03；If MinOI=NumP executes D06；If MinOI>
NumP then executes D09；
Step D07：The corresponding multiple antennas bit figures of former mother cell Cell are generated, wherein RSRP emulation of coverage capability result bit arrays are claimed
Scheme for bit, generation method is n-th of single antenna bit figure in the set SetA traversed corresponding to n of all Cell [n] values for 1
All qualified BitS [n] are done step-by-step or operation by BitS [n], and obtained multiple antennas bit seals are BitM, statistics
1 quantity, is denoted as CountM in BitM；
Step D08：The corresponding multiple antennas bit figures of novel mother cell CellO and CellI are generated respectively, and are counted 1 in bit figures
Quantity is denoted as CountO and CountI respectively；
Step D09：Larger in CountO and CountI one is taken, MaxOI is denoted as, is compared with CountM；If MaxOI
>CountM then shows to have found outstanding mother cell, mother cell Cell is updated to the new mother cell, primary evolution is completed, holds
Row step D03；If MaxOI<=CountM, then execute D09；
Step D10：Give up two novel mother cells, maintains former mother cell Cell constant, and attempt the next of mother cell Cell
DNA cutting modes execute step D04；
Step D11：More excellent mother cell can not be found in polynomial time, algorithm terminates, at this time mother cell Cell packets
The bit value informations contained are the optimal location of antenna distribution.
5. a kind of autoplacement method of LTE indoor distribution system antenna according to claim 1, which is characterized in that institute
It further includes following steps to state step E：
Step E1：According to the bit arrays of mother cell Cell, quantity and the position of antenna are restored, traversing all Cell [n] value is
N-th of antenna in set SetA corresponding to 1 n, antenna amount are denoted as R, and the net of n-th of antenna is calculated according to following formula
Lattice row coordinate x [n], row coordinate y [n]：
X [n]=n%M, wherein % are complementation operation；
Y [n]=floor (n/M) wherein floor () are downward bracket function；
Then the practical abscissa rx [n] of n-th of antenna, ordinate ry [n] are calculated according to following formula：
Rx [n]=x [n] * GridStep+GridStep/2,
Ry [n]=y [n] * GridStep+GridStep/2；
Step E2：For the antenna of the above R known location, this R are calculated using indoor distribution wireless signal propagation model
RSRP emulation of coverage capability results in the presence of antenna.
6. a kind of autoplacement method of LTE indoor distribution system antenna according to claim 4, which is characterized in that institute
It states DNA completions subalgorithm and RSRP emulation of coverage capability result bit arrays is known as bit figures, include the following steps：
Step Z01：For given Cell, its corresponding multiple antennas bit figure is generated, traverses all Cell [n] values as 1 n institutes
All qualified BitS [n] are done step-by-step or operation by n-th of single antenna bit figure BitS [n] in corresponding set SetA,
Obtained multiple antennas bit seals are BitM, count in BitM 1 quantity, are denoted as CountM；
Step Z02：DNA next bit completions are carried out using greedy algorithm to Cell to traverse corresponding to the n that all Cell [n] values are 0
Set SetA in n-th of single antenna bit figure BitS [n], it is subjected to step-by-step or operation with BitM one by one, is denoted as BitT [n],
The quantity for counting in BitT [n] 1, is denoted as Count [n], finding out makes Count [n] maximum n, is denoted as BestN；
Step Z03：Compare Count [BestN] and CountM, if Count [BestN]=CountM, stops DNA completion
Algorithm returns the result and fails for DNA completions.If Count [BestN]>CountM thens follow the steps Z04；
Step Z04：The value of Cell [BestN] is updated to 1, the value of CountM is updated to Count [BestN]；
Step Z05：Compare CountM and LimitNum, if CountM>=LimitNum then stops DNA completion subalgorithms, returns
Result is returned for DNA completions success, if CountM<LimitNum thens follow the steps Z02.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810254789.1A CN108551374B (en) | 2018-03-26 | 2018-03-26 | Automatic layout method for LTE indoor distribution system antenna |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810254789.1A CN108551374B (en) | 2018-03-26 | 2018-03-26 | Automatic layout method for LTE indoor distribution system antenna |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108551374A true CN108551374A (en) | 2018-09-18 |
| CN108551374B CN108551374B (en) | 2020-10-13 |
Family
ID=63517188
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810254789.1A Active CN108551374B (en) | 2018-03-26 | 2018-03-26 | Automatic layout method for LTE indoor distribution system antenna |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108551374B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112601231A (en) * | 2020-11-03 | 2021-04-02 | 中国飞机强度研究所 | 5G network deep coverage method under complex test environment |
| CN113297648A (en) * | 2021-03-19 | 2021-08-24 | 广州天越电子科技有限公司 | Optimization method for drawing digital room partition scheme design drawing |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000333239A (en) * | 1999-05-24 | 2000-11-30 | Mitsubishi Electric Corp | Method for deciding optimum layout of indoor base station and optimum layout decision system |
| CN103096338A (en) * | 2011-11-02 | 2013-05-08 | 无锡物联网产业研究院 | Sensor network node location method |
| CN103188695A (en) * | 2011-12-30 | 2013-07-03 | 中国移动通信集团广东有限公司 | Method and system for laying of indoor antennas |
| US20140226524A1 (en) * | 2003-03-24 | 2014-08-14 | Strix Systems, Inc. | Node placement method within a wireless network, such as a wireless local area network |
| CN107318058A (en) * | 2017-08-07 | 2017-11-03 | 广东电网有限责任公司电力调度控制中心 | ONU dispositions methods in power distribution communication net based on Optimum cost and load balancing |
-
2018
- 2018-03-26 CN CN201810254789.1A patent/CN108551374B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000333239A (en) * | 1999-05-24 | 2000-11-30 | Mitsubishi Electric Corp | Method for deciding optimum layout of indoor base station and optimum layout decision system |
| US20140226524A1 (en) * | 2003-03-24 | 2014-08-14 | Strix Systems, Inc. | Node placement method within a wireless network, such as a wireless local area network |
| CN103096338A (en) * | 2011-11-02 | 2013-05-08 | 无锡物联网产业研究院 | Sensor network node location method |
| CN103188695A (en) * | 2011-12-30 | 2013-07-03 | 中国移动通信集团广东有限公司 | Method and system for laying of indoor antennas |
| CN107318058A (en) * | 2017-08-07 | 2017-11-03 | 广东电网有限责任公司电力调度控制中心 | ONU dispositions methods in power distribution communication net based on Optimum cost and load balancing |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112601231A (en) * | 2020-11-03 | 2021-04-02 | 中国飞机强度研究所 | 5G network deep coverage method under complex test environment |
| CN112601231B (en) * | 2020-11-03 | 2023-01-13 | 中国飞机强度研究所 | 5G network deep coverage method under complex test environment |
| CN113297648A (en) * | 2021-03-19 | 2021-08-24 | 广州天越电子科技有限公司 | Optimization method for drawing digital room partition scheme design drawing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108551374B (en) | 2020-10-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9059927B2 (en) | Network traffic profile aggregation for efficient discrete event smart grid network simulations | |
| CN104168577B (en) | A kind of the whole network LTE cells PCI method and device for planning | |
| CN102395136B (en) | Telephone traffic distribution calculation method based on neighbor cell field intensity information and system thereof | |
| CN105519161B (en) | A kind of disturbance coordination method and equipment | |
| CN108124267A (en) | Base station automatic planning and device | |
| CN108551374A (en) | A kind of autoplacement method of LTE indoor distribution system antenna | |
| CN102564388B (en) | Method and device for determining horizontal direction angles of antennae of base station | |
| JP7486659B2 (en) | Energy saving processing method and processing device for base station | |
| CN106792764B (en) | Wireless base station planning method for power distribution terminal communication access network | |
| CN104125581B (en) | Covering and capacity combined optimization method and device, system | |
| CN103906078B (en) | Relational matrix constructing system and method and PCI intelligent optimization systems and method | |
| CN110461006A (en) | Reduce WLAN interference method, device and terminal device | |
| CN109561436B (en) | Physical layer cell identity (PCI) optimization method, equipment, computer readable storage medium and device | |
| CN108271181A (en) | A kind of PCI optimization method and devices of wireless network | |
| CN107682864A (en) | A kind of base station construction method assessed based on coverage rate | |
| CN103379507B (en) | A kind of network plan method based on RSVP, optimization method and device | |
| CN107347189A (en) | A kind of wireless private network base station planning methods of TD LTE 230 | |
| CN106096013A (en) | Frequency queries based on electromagnetic environment data base and planing method | |
| CN104754747B (en) | The method for channel allocation of high-density wireless local area network deployment | |
| CN106817186B (en) | A kind of method and device of Physical Cell Identifier PCI interference self-optimizing | |
| CN111861397A (en) | Intelligent scheduling platform for client visit | |
| CN114915977A (en) | Determination method and device for topological structure of repeater, storage medium and electronic device | |
| CN115314906A (en) | Network planning method and device | |
| CN112423306B (en) | Automatic site selection method for base station | |
| CN103369538B (en) | The distribution method of a kind of base station identity code, equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |