CN104378772A - Cell-oriented amorphous coverage small base station deployment method in cellular network - Google Patents

Cell-oriented amorphous coverage small base station deployment method in cellular network Download PDF

Info

Publication number
CN104378772A
CN104378772A CN201410636550.2A CN201410636550A CN104378772A CN 104378772 A CN104378772 A CN 104378772A CN 201410636550 A CN201410636550 A CN 201410636550A CN 104378772 A CN104378772 A CN 104378772A
Authority
CN
China
Prior art keywords
mrow
base station
msub
small base
user
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
Application number
CN201410636550.2A
Other languages
Chinese (zh)
Other versions
CN104378772B (en
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.)
CERTUSNET CORP
Original Assignee
Xian Jiaotong University
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 Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN201410636550.2A priority Critical patent/CN104378772B/en
Publication of CN104378772A publication Critical patent/CN104378772A/en
Application granted granted Critical
Publication of CN104378772B publication Critical patent/CN104378772B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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
    • H04W16/20—Network planning tools for indoor coverage or short range network deployment

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a cell-oriented amorphous coverage small base station deployment method in a cellular network. The method aims at maximizing multi-user distribution system average throughout capacity. The multi-user distribution system average throughout capacity under different small base station position vectors is calculated by means of a given collaborative cell building and resource scheduling method; a small base station deployment position enabling the throughout capacity to be maximum is found based on a given position updating algorithm, and multi-user distribution is considered to the greatest degree. Compared with a traditional method, the cell-oriented amorphous coverage small base station deployment method is more applicable to an actual site; in consideration of the user distribution tidal phenomenon, when user distribution is changed, the determined small base station position enables adjacent small base stations to change the collaboration way more effectively in real time, so that a traditional fixed cell shape is changed, and the system performance requirement for distribution of different users is met. By the adoption of the cell-oriented amorphous coverage small base station deployment method, the system average throughout capacity, margin user performance and user fairness can be effectively improved.

Description

Small base station deployment method facing cell amorphous coverage in cellular network
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a cell amorphous coverage oriented small base station deployment method in a cellular network.
Background
With the rapid increase of wireless communication data volume, a homogeneous network under a Macro cell structure cannot meet huge mobile data requirements, and the advantages of a Macro-Small cell coexisting heterogeneous network in the aspect of improving network capacity attract extensive attention of the academic world and the industrial world, but with the intensive scheduling of Small Base Stations (SBS), cross-layer interference between the Small Base stations and Macro Base stations (Macro Base stations) and inter-cell layer interference become a problem to be solved, and therefore a Phantom cell structure is proposed. The structure is mainly characterized in that a Control Plane (Control Plane) is separated from a User Plane (User Plane), namely a macro base station is mainly responsible for Control Plane functions such as coverage guarantee and mobility management, and a small base station is responsible for data Plane functions such as data service, so that the same-layer interference is effectively solved, how to reasonably deploy the small base station is realized, and the capacity requirement of a User is met, so that the structure becomes a hotspot of research in the industry.
In the prior art, the problem about the deployment of the small cell is mainly to consider a given statistical average distribution of users, that is, the distribution of users is assumed to be static, but because of the moving characteristics of users in the real world, the distribution of users presents a tidal phenomenon, that is, the communication load in the network varies in different time periods, for example, the daytime communication traffic is mainly concentrated in business districts, and the nighttime communication peak appears in residential districts, the method for deploying the small cell, which only considers one user distribution, cannot achieve effective coverage and meet the user requirements under different user distributions.
In order to solve the above problems, the cell amorphous coverage becomes a possible solution, that is, the topology of the cellular communication station changes its fixed coverage characteristics, and a dynamic time-varying coverage and service is formed, so as to adapt to the dynamic demand of data traffic and the regional distribution imbalance of traffic, and better meet the service demand of users. So far, no special deployment method exists for optimizing the deployment position of the small base station in combination with the amorphous coverage formed by cooperation among the small base stations.
Disclosure of Invention
The invention aims to provide a cell-oriented amorphous coverage small base station deployment method in a cellular network, which can meet user requirements under different user distributions.
In order to achieve the purpose, the invention adopts the following technical scheme:
1) under the initial small base station position vector, calculating the average system throughput of various user distributions by utilizing a cooperative cell construction and resource scheduling method, and then updating the small base station position vector;
2) in each updating of the small base station position vector, the small base station sequentially selects undetermined updating positions, if the undetermined updating positions meet the small base station position updating criterion, the small base station updates the corresponding undetermined updating positions, and otherwise, the small base station does not update the positions; the updating criterion of the small base station position is as follows: in the updating process of the position of the small base station, the average throughput of the system distributed by various users is ensured not to be reduced to the maximum extent, or the small base station is updated to the undetermined updating position (in order to avoid the algorithm from falling into local optimum) where the average throughput of the system distributed by various users is reduced with the increase of the updating times of the position vector of the small base station, according to a certain probability;
3) and updating the small base station position vector for multiple times until the average throughput of the system distributed by multiple users reaches a stable value, and obtaining the optimized small base station deployment position (the small base station position vector corresponding to the stable value is the optimized small base station deployment position).
The step 1) specifically comprises the following steps:
1.1) initializing the position of each small base station to obtain an initial small base station position vector X0＝(x1 0,x2 0,…,xn 0) N represents the total number of deployed small base stations, x represents the position coordinates of the small base stations, and the average system throughput under the p-th user distribution is calculated by utilizing a cooperative cell construction and resource scheduling method:
<math> <mrow> <msub> <mi>R</mi> <mi>p</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>&Element;</mo> <mi>U</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>)</mo> </mrow> </mrow> </msub> <mi>log</mi> <msub> <mi>R</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msub> <mi>R</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&Sigma;</mi> <mrow> <mi>r</mi> <mo>&Element;</mo> <msub> <mi>RB</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> </mrow> </msub> <mi>B</mi> <mi>log</mi> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <msubsup> <mi>SINR</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> <mi>r</mi> </msubsup> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mo>)</mo> </mrow> </mrow> </math>
wherein，Rm,i(X0) For the average throughput of the mth user with the ith small base station as the serving base station, u (i) is the set of users served by the ith small base station, i belongs to N, N is {1,2, …, N }, N is the set of small base stations, N represents the total number of deployed small base stations, RBm,iThe resource allocated to the mth user, B is the bandwidth of each resource block,is at X0The signal-to-interference-and-noise ratio of the mth user in the mth resource block is obtained;
1.2) then small base station position vector X0The system average throughput (i.e., the objective function value) for the following various user distributions is:
<math> <mrow> <msup> <mi>S</mi> <mn>0</mn> </msup> <mo>=</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>P</mi> </msubsup> <msub> <mi>&alpha;</mi> <mi>p</mi> </msub> <msub> <mi>R</mi> <mi>p</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> </mrow> </math>
wherein alpha ispP represents the number of user distributions as the probability of the occurrence of the pth user distribution.
Initial position vector X for a given small cell0＝(x1 0,x2 0,…,xn 0) Each small base station i constructs a neighbor list NiCalculating the average throughput R of the p-th user distribution under the position vector by using the cooperative cell construction and resource scheduling methodp(X0) (ii) a When the user distribution changes, the small base station changes the cooperation form to form a new cooperation coverage range to meet the requirements of cell coverage and capacity, thereby obtaining a system for distributing various users under the position vectorAverage throughput.
The step 2) specifically comprises the following steps:
2.1) in each updating of the position vector of the small base station, if the ith small base station selects a position s to be updated according to the step length diI ∈ N, N ═ {1,2, …, N }, where N is the set of small base stations, N represents the total number of deployed small base stations, and the positions of other small base stations do not change, then the small base station position vector at this time is obtained asThe average system throughput of the distribution of various users under the small base station position vector is as follows:
<math> <mrow> <msubsup> <mi>S</mi> <mi>i</mi> <mi>c</mi> </msubsup> <mo>=</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>P</mi> </msubsup> <msub> <mi>&alpha;</mi> <mi>p</mi> </msub> <msub> <mi>R</mi> <mi>p</mi> </msub> <mrow> <mo>(</mo> <msubsup> <mi>x</mi> <mi>i</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>&LeftArrow;</mo> <msub> <mi>s</mi> <mi>i</mi> </msub> <mo>|</mo> <msub> <mi>X</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>)</mo> </mrow> </mrow> </math>
the average throughput S of the system distributed by various users calculated after the last update of the position of the small base stationt-1In contrast, if the following equation is satisfied:
<math> <mrow> <msubsup> <mi>S</mi> <mi>i</mi> <mi>c</mi> </msubsup> <mo>&GreaterEqual;</mo> <msup> <mi>S</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>|</mo> <mo>|</mo> <mi>&epsiv;</mi> <mo>></mo> <mi>rand</mi> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>
the ith small base station updates the position to siNamely:
x i t - 1 : = s i , S t - 1 : = S i c
otherwise, the position of the ith small base station is not updated, the step 2.1) is continuously executed until all the small base stations are updated once,T(t)＝F×T(t-1)，0.9<F<1, T represents the number of updates of the small base station position vector, T (0)>10, rand (1) represents random numbers uniformly distributed between 0 and 1;
2.2) after completing the updating of the small base station position vector for one time, obtaining an updated small base station position vector Xt;
and (3) repeating the step 2.1) to the step 2.2) until an iteration (small base station position vector updating) stopping condition is reached, and finding the optimized small base station position.
In the updating process of the position of the small base station, the position of the small base station with the candidate objective function value reduced is accepted according to the probability rather than directly discarded, and the algorithm is prevented from falling into local optimization to a certain extent.
The cooperative cell construction and resource scheduling method specifically comprises the following steps:
3.1) dividing all users served by each small base station into edge users (CEU) and center users (CCU) according to the SINR of the users;
for small base station position vector X ═ X1,x2,…,xn) N represents the total number of deployed small base stations, x represents the position coordinates of the small base stations, and the user selects a serving base station according to RSRP:
<math> <mrow> <msup> <mi>i</mi> <mo>*</mo> </msup> <mo>=</mo> <mi>arg</mi> <munder> <mi>max</mi> <mrow> <mi>i</mi> <mo>&Element;</mo> <mi>N</mi> </mrow> </munder> <msub> <mi>RSRP</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> </mrow> </math>
wherein N is small base station set, RSRPk,iReceiving the reference signal received power from the ith small base station for the kth user, thereby calculating the user k taking the ith small base station as a service base station*Signal to interference plus noise ratio ofIf it satisfies the following formula:
<math> <mrow> <msub> <mi>SINR</mi> <mrow> <msup> <mi>k</mi> <mo>*</mo> </msup> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mo>&lt;</mo> <mi>&gamma;</mi> <munder> <mi>max</mi> <mrow> <msup> <mi>k</mi> <mo>&prime;</mo> </msup> <mo>&Element;</mo> <mi>U</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>)</mo> </mrow> </mrow> </munder> <msub> <mi>SINR</mi> <mrow> <msup> <mi>k</mi> <mo>&prime;</mo> </msup> <mo>,</mo> <mi>i</mi> </mrow> </msub> </mrow> </math>
then user k*Is judged as an edge user, otherwise, k*Identified as the central user, u (i) serves the set of users for the ith small base station, and γ is a factor for adjusting the ratio of the edge users (CEUs) to the central users (CCUs);
3.2) neighbor list N from ith Small base stationiFinding out the small base station j with the maximum interference to the l edge user served by the i small base station*As a cooperative base station, and constructing a cooperative list of the l-th edge user <math> <mrow> <msubsup> <mi>CS</mi> <mi>l</mi> <mi>i</mi> </msubsup> <mo>=</mo> <mo>{</mo> <mi>i</mi> <mo>,</mo> <msup> <mi>j</mi> <mo>*</mo> </msup> <mo>}</mo> <mo>,</mo> <msup> <mi>j</mi> <mo>*</mo> </msup> <mo>&Element;</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>;</mo> </mrow> </math>
The ith small base station constructs a neighbor list N according to the distance between the ith small base station and the surrounding small base stationsi(the small base station with the distance between the edge user and the ith small base station smaller than the set distance threshold is added to the neighbor list of the ith small base station), in order to improve the performance of the edge user and not bring excessive information interaction, the ith edge user only selects the small base station j from the neighbor list of the service base station thereof according to the following formula*As a cooperative base station:
<math> <mrow> <msup> <mi>j</mi> <mo>*</mo> </msup> <mo>=</mo> <mi>arg</mi> <munder> <mi>max</mi> <mrow> <msup> <mi>j</mi> <mo>&prime;</mo> </msup> <mo>&Element;</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </munder> <msub> <mi>RSRP</mi> <mrow> <mi>l</mi> <mo>,</mo> <msup> <mi>j</mi> <mo>&prime;</mo> </msup> </mrow> </msub> </mrow> </math>
thereby constructing a collaboration list of the ith edge user
3.3) for the r-th Resource Block (RB), the edge users and the center users are considered fairly, namely, the edge users and the center users served by all the small base stations are respectively arranged in a descending order according to the scheduling priority; then, the edge user with the highest scheduling priority and the serving base station i in the cooperation list of the edge user are foundpAnd cooperative base station jpThe central users with the highest scheduling priority of their respective services, if their scheduling priority satisfies the formula:
<math> <mrow> <mn>2</mn> <mo>&times;</mo> <msubsup> <mi>PF</mi> <mi>c</mi> <mi>r</mi> </msubsup> <mo>&GreaterEqual;</mo> <msubsup> <mi>PF</mi> <mi>a</mi> <mi>r</mi> </msubsup> <mo>+</mo> <msubsup> <mi>PF</mi> <mi>b</mi> <mi>r</mi> </msubsup> </mrow> </math>
then serving base station ipAnd a cooperative base station jpCooperatively scheduling the edge user with the highest scheduling priority on the r resource block, otherwise, ipAnd jpServing the respective center user with the highest scheduling priority individually,are respectively ipAnd jpRespectively service toolThe scheduling priority of the center user with the highest scheduling priority on the r-th resource block,is ipScheduling priority of the served edge user with the highest scheduling priority on the r-th resource block;
3.4) update small set of base stations N ═ N- { ip,jp},ip,jpE to N, wherein N is a small base station set, and then other users are continuously scheduled on the r-th resource block according to the scheduling method in the step 3.3) until N belongs to phi;
3.5) repeating the steps 3.3) to 3.4) until all resource blocks are scheduled.
Compared with the prior art, the invention has the beneficial effects that:
the small base station deployment method facing the cell amorphous coverage in the cellular network aims at maximizing the average throughput of a system distributed by various users. The invention considers the possible distribution of various users in the process of deploying the small base station, therefore, when the distribution of the users changes, the deployment position of the small base station determined by the invention can enable the adjacent small base station to more effectively change the cooperation mode in real time, thereby forming a dynamic variable service range and ensuring the system capacity; in the optimization process, the method of the invention receives the position of reducing the average throughput of the distribution of various users with a certain probability, and avoids the algorithm from falling into local optimization. The deployment position of the small base station optimized by the method of the invention gives consideration to various user distributions, and in the area with dense communication traffic and dynamic change of service requirements, the average throughput of the system can be greatly improved, the performance of users at the edge of the cell is better ensured, and better user fairness is realized.
Drawings
FIG. 1 is an example of a scenario in which the method of the present invention is applied;
FIG. 2 is a flowchart of a method for updating the position of a small cell in the present invention;
FIG. 3(a) is a comparison graph of normalized average throughput of the comparison method and the system of the present invention when different numbers of small base stations are deployed;
fig. 3(b) is a user normalized average throughput cdf (cumulative Distribution function) curve comparing the method for deploying 13 small base stations with the method of the present invention;
fig. 3(c) is a comparison chart of user fairness in the comparison method and the method of the present invention under the condition of deploying different numbers of small base stations.
Detailed Description
The invention is described in detail below with reference to the attached drawing figures:
the invention provides a small base station deployment method for maximizing the average throughput of a distribution system of multiple users, the application scene of the small base station deployment method is shown in figure 1, and the system capacity under different user distributions is ensured by utilizing the amorphous coverage of a cell. In the following, the method of the present invention is described by a specific example, assuming that a Macro Sector (Macro Sector) is a deployment area, there are M users, there are P user distributions, and the probability of occurrence of the P-th user distribution (P ═ 1,2, …, P) is αpN small base stations need to be deployed, where N ═ {1,2, …, N } denotes a set of small base stations, and for ease of understanding, the invention is described as an optimization problem as follows:
<math> <mrow> <munder> <mi>max</mi> <mi>X</mi> </munder> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>P</mi> </msubsup> <msub> <mi>&alpha;</mi> <mi>p</mi> </msub> <msub> <mi>R</mi> <mi>p</mi> </msub> <mrow> <mo>(</mo> <mi>X</mi> <mo>)</mo> </mrow> </mrow> </math>
wherein,is the value of the objective function, Rp(X) is the average throughput of the system under the p-th user distribution, XiIs the position coordinate of the ith small base station,an area is deployed for a small base station.
The specific steps of the small base station deployment facing the cell amorphous coverage in the cellular network are as follows:
1. the cooperative cell construction and resource scheduling method specifically comprises the following steps:
1) for the location vector X of the small base station, the user selects the serving base station according to RSRP:
<math> <mrow> <msup> <mi>i</mi> <mo>*</mo> </msup> <mo>=</mo> <mi>arg</mi> <munder> <mi>max</mi> <mrow> <mi>i</mi> <mo>&Element;</mo> <mi>N</mi> </mrow> </munder> <msub> <mi>RSRP</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> </mrow> </math>
wherein RSRPk,iReceiving reference signal received power from the ith small base station for the kth user; if the kth user selects the ith small base station as the service base station, the kth user receives signalsComprises the following steps:
<math> <mrow> <msub> <mi>y</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>H</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <msub> <mi>w</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <msub> <mi>s</mi> <mi>k</mi> </msub> <mrow> <mo>+</mo> <msub> <mi>&Sigma;</mi> <munder> <mrow> <msup> <mi>k</mi> <mo>&prime;</mo> </msup> <mo>&Element;</mo> <mi>U</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msup> <mi>k</mi> <mo>&prime;</mo> </msup> <mo>&NotEqual;</mo> <mi>k</mi> </mrow> </munder> </msub> <msub> <mi>H</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> </mrow> <msub> <mi>w</mi> <mrow> <msup> <mi>k</mi> <mo>&prime;</mo> </msup> <mo>,</mo> <mi>i</mi> </mrow> </msub> <msub> <mi>s</mi> <msup> <mi>k</mi> <mo>&prime;</mo> </msup> </msub> <mo>+</mo> <msubsup> <mi>&Sigma;</mi> <munder> <mrow> <msup> <mi>i</mi> <mo>&prime;</mo> </msup> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <msup> <mi>i</mi> <mo>&prime;</mo> </msup> <mo>&NotEqual;</mo> <mi>i</mi> </mrow> </munder> <mi>n</mi> </msubsup> <msub> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>*</mo> <mo>&Element;</mo> <mi>U</mi> <mrow> <mo>(</mo> <msup> <mi>i</mi> <mo>&prime;</mo> </msup> <mo>)</mo> </mrow> </mrow> </msub> <msub> <mi>H</mi> <mrow> <mi>k</mi> <mo>,</mo> <msup> <mi>i</mi> <mo>&prime;</mo> </msup> </mrow> </msub> <msub> <mi>w</mi> <mrow> <msup> <mi>k</mi> <mrow> <mo>&prime;</mo> <mo>&prime;</mo> </mrow> </msup> <mo>,</mo> <msup> <mi>i</mi> <mo>&prime;</mo> </msup> </mrow> </msub> <msub> <mi>s</mi> <msup> <mi>k</mi> <mrow> <mo>&prime;</mo> <mo>&prime;</mo> </mrow> </msup> </msub> <mo>+</mo> <msub> <mi>n</mi> <mi>k</mi> </msub> </mrow> </math>
whereinThe channel gain from the ith cell site to the kth user,is a precoding matrix, skFor transmitting signals, u (i) a set of users serving the ith small base station,is gaussian white noise. Based on ofdm (orthogonal Frequency Division multiplexing), users accessing the same small base station are assumed to use mutually orthogonal resources, and therefore the SINR (signal to interference plus noise ratio) of the kth user is obtained:
<math> <mrow> <msub> <mi>SINR</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>P</mi> <mi>s</mi> </msub> <msup> <mrow> <mo>|</mo> <mo>|</mo> <msub> <mi>H</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <msub> <mi>w</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mo>|</mo> <mo>|</mo> </mrow> <mn>2</mn> </msup> </mrow> <mrow> <msubsup> <mi>&Sigma;</mi> <munder> <mrow> <msup> <mi>i</mi> <mo>&prime;</mo> </msup> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <msup> <mi>i</mi> <mo>&prime;</mo> </msup> <mo>&NotEqual;</mo> <mi>i</mi> </mrow> </munder> <mi>n</mi> </msubsup> <msub> <mi>P</mi> <mi>s</mi> </msub> <msup> <mrow> <mo>|</mo> <mo>|</mo> <msub> <mi>H</mi> <mrow> <mi>k</mi> <mo>,</mo> <msup> <mi>i</mi> <mo>&prime;</mo> </msup> </mrow> </msub> <msub> <mi>w</mi> <mrow> <mi>k</mi> <mo>,</mo> <msup> <mi>i</mi> <mo>&prime;</mo> </msup> </mrow> </msub> <mo>|</mo> <mo>|</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> </mrow> </mfrac> </mrow> </math>
Psrepresenting the sending power of the small base station, if the SINR of the kth user meets the formula:
<math> <mrow> <msub> <mi>SINR</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mo>&lt;</mo> <mi>&gamma;</mi> <munder> <mi>max</mi> <mrow> <msup> <mi>k</mi> <mo>&prime;</mo> </msup> <mo>&Element;</mo> <mi>U</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>)</mo> </mrow> </mrow> </munder> <msub> <mi>SINR</mi> <mrow> <msup> <mi>k</mi> <mo>&prime;</mo> </msup> <mo>,</mo> <mi>i</mi> </mrow> </msub> </mrow> </math>
and judging as an edge user (CEU) and considering to meet the requirement by using the small base station cooperative service, and otherwise, judging as a center user (CCU), wherein gamma is a factor for adjusting the proportion of the edge user (CEU) and the center user (CCU).
To improve edge user performance without excessive information interaction, edge user k*From its serving base station only (assumed to be small base station i)*) Neighbor list ofSelecting small base station j according to the following formula*As a cooperative base station:
<math> <mrow> <msup> <mi>j</mi> <mo>*</mo> </msup> <mo>=</mo> <mi>arg</mi> <munder> <mi>max</mi> <mrow> <mi>j</mi> <mo>&Element;</mo> <msub> <mi>N</mi> <msup> <mi>i</mi> <mo>*</mo> </msup> </msub> </mrow> </munder> <msub> <mi>RSRP</mi> <mrow> <msup> <mi>k</mi> <mo>*</mo> </msup> <mo>,</mo> <mi>j</mi> </mrow> </msub> </mrow> </math>
thereby constructing an edge user k*The collaboration list of (1):
CS k * i * = { i * , j * }
2) for the r Resource Block (RB), the edge users and the center users are considered fairly, namely, the edge users and the center users served by all the small base stations are arranged in a descending order according to the scheduling priority;
2.1) find the edge user c with the highest scheduling priority and its serving base station i in the cooperation list*And a cooperative base station j*If the scheduling priority of the center user a and the center user b with the highest scheduling priority of the respective services meets the formula:
<math> <mrow> <mn>2</mn> <mo>&times;</mo> <msubsup> <mi>PF</mi> <mi>c</mi> <mi>r</mi> </msubsup> <mo>&GreaterEqual;</mo> <msubsup> <mi>PF</mi> <mi>a</mi> <mi>r</mi> </msubsup> <mo>+</mo> <msubsup> <mi>PF</mi> <mi>b</mi> <mi>r</mi> </msubsup> </mrow> </math>
then serving base station i*And a cooperative base station j*Collaboratively scheduling edge users c, otherwise i*、j*Serving own central user a and central user b separately, whereinAndrespectively representing the scheduling priorities of an edge user c, a center user a and a center user b on an r-th RB;
2.2) updating the Small base station setContinuing to schedule other users on the r resource block according to the scheduling method in the step 2.1) until N belongs to phi;
3) and the scheduling of other resource blocks repeatedly executes the steps 2.1) -2.2).
2. The optimization method for small cell deployment specifically includes the following steps, see fig. 2:
1) initializing the positions of n small base stations to obtain an initial position vector X0＝(x1 0,x2 0,…,xn 0) Calculating the average system throughput under the p-th user distribution by using a given cooperative cell construction and resource allocation method:
<math> <mrow> <msub> <mi>R</mi> <mi>p</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>&Element;</mo> <mi>U</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>)</mo> </mrow> </mrow> </msub> <mi>log</mi> <msub> <mi>R</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msub> <mi>R</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&Sigma;</mi> <mrow> <mi>r</mi> <mo>&Element;</mo> <msub> <mi>RB</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> </mrow> </msub> <mi>B</mi> <mi>log</mi> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <msubsup> <mi>SINR</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> <mi>r</mi> </msubsup> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mo>)</mo> </mrow> </mrow> </math>
wherein R ism,i(X0) Average throughput, RB, for user m with the ith small base station as the serving base stationm,iThe allocated resources for user m, B the bandwidth of each resource block,for the vector X at the small base station0The SINR of the lower user m in the r-th resource block is obtained to obtain the position vector X0The following objective function values:
<math> <mrow> <msup> <mi>S</mi> <mn>0</mn> </msup> <mo>=</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>P</mi> </msubsup> <msub> <mi>&alpha;</mi> <mi>p</mi> </msub> <msub> <mi>R</mi> <mi>p</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> </mrow> </math>
2) for the T (T ═ 1,2, …, Tmax) Second iteration, TmaxRepresents the set maximum number of iterations:
2.1) in each iteration, each small base station updates the position thereof in turn, if the ith small base station (i belongs to N), the position s to be updated is selected according to the step length diIf the position of the other small base station is not changed, the position vector of the small base station at the moment is obtainedCandidate objective function values:
<math> <mrow> <msubsup> <mi>S</mi> <mi>i</mi> <mi>c</mi> </msubsup> <mo>=</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>P</mi> </msubsup> <msub> <mi>&alpha;</mi> <mi>p</mi> </msub> <msub> <mi>R</mi> <mi>p</mi> </msub> <mrow> <mo>(</mo> <msubsup> <mi>x</mi> <mi>i</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>&LeftArrow;</mo> <msub> <mi>s</mi> <mi>i</mi> </msub> <mo>|</mo> <msub> <mi>X</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>)</mo> </mrow> </mrow> </math>
and the target function value S obtained after the position of the small base station is updated last timet-1In contrast, if the following equation is satisfied:
<math> <mrow> <msubsup> <mi>S</mi> <mi>i</mi> <mi>c</mi> </msubsup> <mo>&GreaterEqual;</mo> <msup> <mi>S</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>|</mo> <mo>|</mo> <mi>&epsiv;</mi> <mo>></mo> <mi>rand</mi> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>
the ith small cell updates its location to siNamely:
x i t - 1 : = s i , S t - 1 : = S i c
otherwise, the position of the ith small base station is not updated, and the step 2.1) is continuously executed until all the small base stations finish one updating, wherein the probability of accepting the position to be updated which reduces the objective function value in the updating is as follows:
<math> <mrow> <mi>&epsiv;</mi> <mo>=</mo> <mi>exp</mi> <mrow> <mo>(</mo> <mfrac> <mrow> <msubsup> <mi>S</mi> <mi>i</mi> <mi>c</mi> </msubsup> <mo>-</mo> <msup> <mi>S</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> </mrow> <mrow> <mi>T</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>)</mo> </mrow> </mrow> </math>
t (T) ═ F × T (T-1), F is a constant slightly less than 1, typically 0.9< F <1, T (0) typically a constant of T (0) > 10; as the number of iterations increases, the value of T gradually decreases, eventually tending to 0, i.e. the probability of accepting a position that lowers the average throughput of the various user distributions tends to 0, F, T (0) mainly affecting the speed of the trend to 0 and the accuracy of the small cell location;
2.2) finishing one iteration, updating the position vector and the objective function value of the iteration:
Xt:＝Xt-1,St:＝St-1
3) and (3) repeating the step 2) until an iteration stop condition is reached (the average throughput of the system distributed by various users reaches a stable value or the maximum iteration number is reached), and finding the optimized small base station position.
Simulation experiment:
1) the simulation model parameters are as follows: the number of deployed small base stations is respectively 4, 7, 10 and 13, the transmission power of a macro base station is 46dBm, the transmission power of a small base station is 30dBm, the system bandwidth is 10MHz, the number of resource blocks is 50, the noise power spectral density is-174 dBm, the minimum moving distance d of the small base station in each updating is 50m, gamma is 0.1, the number P of user distributions is 3, and the probability alpha of occurrence of each user distributionp＝1/3，F＝0.95，T(0)＝15。
2) After the small base station deployment method is adopted, as shown in fig. 3(a), when the number of the small base stations is less, the method does not bring the improvement of the average throughput of the system, because the method takes account of the distribution of various users to optimize the position of the small base stations, and utilizes the cooperation among the small base stations to change the cell coverage in real time according to the user distribution, edge users with poorer cooperative service performance are difficult to take account of the distribution of various users because the distance among the small base stations is farther when the number of the small base stations is less, and the improvement of the edge user performance brought by the cooperative service does not make up the loss brought by the reduction of the resource utilization rate; however, in a scenario where the communication traffic is intensive and a plurality of small base stations need to be deployed, the method of the present invention can obtain more system average throughput compared with a scenario where only one user statistical average distribution condition (comparison method) is considered. Fig. 3(b) indicates that when 13 small bss are deployed, the CDF curve of the average throughput of the user of the method of the present invention is shifted to the right compared to the comparative method, and it can be seen from the 5% CDF point that the method of the present invention can obtain better edge user performance; fig. 3(c) shows that the method of the present invention can ensure better user fairness.

Claims (4)

1. A method for deploying a small base station facing to cell amorphous coverage in a cellular network is characterized in that: the method comprises the following steps:
1) under the initial small base station position vector, calculating the average system throughput of various user distributions by utilizing a cooperative cell construction and resource scheduling method, and then updating the small base station position vector;
2) in each updating of the small base station position vector, the small base station sequentially selects undetermined updating positions, if the undetermined updating positions meet the small base station position updating criterion, the small base station updates the corresponding undetermined updating positions, and otherwise, the small base station does not update the positions; the updating criterion of the small base station position is as follows: ensuring that the average throughput of the system distributed by various users does not drop in the updating process of the position of the small base station, or updating the small base station to an undetermined updating position where the average throughput of the system distributed by various users drops with a certain probability, wherein the probability is reduced along with the increase of the updating times of the position vector of the small base station;
3) and updating the position vector of the small base station for multiple times until the average throughput of the system distributed by multiple users reaches a stable value to obtain the optimized deployment position of the small base station.
2. The method of claim 1, wherein the method comprises: the step 1) specifically comprises the following steps:
1.1) initializing the position of each small base station to obtain an initial small base station position vector X0＝(x1 0,x2 0,…,xn 0) N represents the total number of deployed small base stations, x represents the position coordinates of the small base stations, and the average system throughput under the p-th user distribution is calculated by utilizing a cooperative cell construction and resource scheduling method:
<math> <mrow> <msub> <mi>R</mi> <mi>p</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>&Element;</mo> <mi>U</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>)</mo> </mrow> </mrow> </msub> <mi>log</mi> <msub> <mi>R</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msub> <mi>R</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&Sigma;</mi> <mrow> <mi>r</mi> <mo>&Element;</mo> <msub> <mi>RB</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> </mrow> </msub> <mi>B </mi> <mi>log</mi> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <msubsup> <mi>SINR</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>i</mi> </mrow> <mi>r</mi> </msubsup> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mo>)</mo> </mrow> </mrow> </math>
wherein R ism,i(X0) For the average throughput of the mth user with the ith small base station as the serving base station, u (i) is the set of users served by the ith small base station, i belongs to N, N is {1,2, …, N }, N is the set of small base stations, N represents the total number of deployed small base stations, RBm,iThe resource allocated to the mth user, B is the bandwidth of each resource block,is at X0The signal-to-interference-and-noise ratio of the mth user in the mth resource block is obtained;
1.2) then small base station position vector X0The system average throughput for the following multiple user distributions is:
<math> <mrow> <msup> <mi>S</mi> <mn>0</mn> </msup> <mo>=</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>P</mi> </msubsup> <msub> <mi>&alpha;</mi> <mi>p</mi> </msub> <msub> <mi>R</mi> <mi>p</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> </mrow> </math>
wherein alpha ispP represents the number of user distributions as the probability of the occurrence of the pth user distribution.
3. The method of claim 1, wherein the method comprises: the step 2) specifically comprises the following steps:
2.1) in each updating of the position vector of the small base station, if the ith small base station selects a position s to be updated according to the step length diI ∈ N, N ═ {1,2, …, N }, N is the set of small cells, N represents the total number of deployed small cells, and other small cell locations do not change, then the small cell location vector isThe average system throughput of the distribution of various users under the small base station position vector is as follows:
<math> <mrow> <msubsup> <mi>S</mi> <mi>i</mi> <mi>c</mi> </msubsup> <mo>=</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>P</mi> </msubsup> <msub> <mi>&alpha;</mi> <mi>p</mi> </msub> <msub> <mi>R</mi> <mi>p</mi> </msub> <mrow> <mo>(</mo> <msubsup> <mi>x</mi> <mi>i</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>&LeftArrow;</mo> <msub> <mi>s</mi> <mi>i</mi> </msub> <mo>|</mo> <msub> <mi>X</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>)</mo> </mrow> </mrow> </math>
αpis the probability of the occurrence of the P-th user distribution, P represents the number of user distributions, RpThe average throughput S of the system under the p-th user distribution and the average throughput S of the system of the distribution of various users calculated after the last update of the small base station positiont-1In contrast, if the following equation is satisfied:
<math> <mrow> <msubsup> <mi>S</mi> <mi>i</mi> <mi>c</mi> </msubsup> <mo>&GreaterEqual;</mo> <msup> <mi>S</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>|</mo> <mo>|</mo> <mi>&epsiv;</mi> <mo>></mo> <mi>rand</mi> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>
the ith small base station updates the position to siNamely:
x i t - 1 : = s i , S t - 1 : = S i c
otherwise the ith small cell site location is not updated,T(t)＝F×T(t-1)，0.9<F<1, T represents the number of updates of the small base station position vector, T (0)>10, rand (1) represents random numbers uniformly distributed between 0 and 1;
2.2) after completing the updating of the small base station position vector for one time, obtaining an updated small base station position vector Xt。
4. The method of claim 1, wherein the method comprises: the cooperative cell construction and resource scheduling method specifically comprises the following steps:
3.1) dividing all users served by each small base station into edge users and center users;
3.2) neighbor list N from ith Small base stationiFinding out the small base station j with the maximum interference to the l edge user served by the i small base station*As a cooperative base station, and constructing a cooperative list of the l-th edge user <math> <mrow> <msubsup> <mi>CS</mi> <mi>l</mi> <mi>i</mi> </msubsup> <mo>=</mo> <mo>{</mo> <mi>i</mi> <mo>,</mo> <msup> <mi>j</mi> <mo>*</mo> </msup> <mo>}</mo> <mo>,</mo> <msup> <mi>j</mi> <mo>*</mo> </msup> <mo>&Element;</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>;</mo> </mrow> </math>
3.3) for the r-th resource block, respectively arranging all edge users and center users served by the small base station in a descending order according to the scheduling priority; then, the edge user with the highest scheduling priority and the serving base station i in the cooperation list of the edge user are foundpAnd cooperative base station jpThe central user with the highest scheduling priority served by each user, if the formula is satisfied:
<math> <mrow> <mn>2</mn> <mo>&times;</mo> <msubsup> <mi>PF</mi> <mi>c</mi> <mi>r</mi> </msubsup> <mo>&GreaterEqual;</mo> <msubsup> <mi>PF</mi> <mi>a</mi> <mi>r</mi> </msubsup> <mo>+</mo> <msubsup> <mi>PF</mi> <mi>b</mi> <mi>r</mi> </msubsup> </mrow> </math>
then serving base station ipAnd a cooperative base station jpCooperatively scheduling the edge user with the highest scheduling priority on the r resource block, otherwise, ipAnd jpServing the respective center user with the highest scheduling priority individually,are respectively ipAnd jpScheduling priority on the r-th resource block for the center user with the highest scheduling priority for the respective service,is ipScheduling priority of the served edge user with the highest scheduling priority on the r-th resource block;
3.4) update small set of base stations N ═ N- { ip,jp},ip,jpE is N, N is a small base station set, and then the user is continuously scheduled on the r resource block according to the step 3.3) until N belongs to phi;
3.5) repeating the steps 3.3) to 3.4) until all resource blocks are scheduled.
CN201410636550.2A 2014-11-12 2014-11-12 Towards the small base station deployment method of the amorphous covering of cell in a kind of cellular network Active CN104378772B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410636550.2A CN104378772B (en) 2014-11-12 2014-11-12 Towards the small base station deployment method of the amorphous covering of cell in a kind of cellular network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410636550.2A CN104378772B (en) 2014-11-12 2014-11-12 Towards the small base station deployment method of the amorphous covering of cell in a kind of cellular network

Publications (2)

Publication Number Publication Date
CN104378772A true CN104378772A (en) 2015-02-25
CN104378772B CN104378772B (en) 2018-04-17

Family

ID=52557361

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410636550.2A Active CN104378772B (en) 2014-11-12 2014-11-12 Towards the small base station deployment method of the amorphous covering of cell in a kind of cellular network

Country Status (1)

Country Link
CN (1) CN104378772B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106162671A (en) * 2015-04-28 2016-11-23 中国移动通信集团公司 A kind of base station deployment location determining method and device
WO2017000543A1 (en) * 2015-06-29 2017-01-05 深圳市中兴微电子技术有限公司 Layout method and system for base station, and computer storage medium
CN109089277A (en) * 2018-09-10 2018-12-25 中国联合网络通信集团有限公司 Networking appraisal procedure and device based on ergodic data
CN109275158A (en) * 2018-09-10 2019-01-25 中国联合网络通信集团有限公司 The method and device of intensive networking
CN109302712A (en) * 2018-10-10 2019-02-01 北京邮电大学 Determine the method, apparatus and storage medium of intelligent base station position
CN110418350A (en) * 2018-04-27 2019-11-05 中兴网鲲信息科技（上海）有限公司 A kind of shared site appraisal procedure and system
CN110996328A (en) * 2019-11-25 2020-04-10 北京邮电大学 Unmanned aerial vehicle base station deployment position determining method and device and electronic equipment
CN114980138A (en) * 2022-05-24 2022-08-30 四川通信科研规划设计有限责任公司 Planning method, system and terminal of 5G wireless base station

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102300220A (en) * 2011-09-16 2011-12-28 华为技术有限公司 Method and device for determining deployment position of micro base station
CN102892125A (en) * 2012-10-19 2013-01-23 北京邮电大学 interference coordination method for energy-saving communication of heterogeneous network
US20130281089A1 (en) * 2012-04-23 2013-10-24 Accelera Mobile Broadband, Inc. Interference management and network performance optimization in small cells
CN103607717A (en) * 2013-11-07 2014-02-26 北京邮电大学 Configuration method of base station density and power in cellular hierarchical wireless network and device thereof

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102300220A (en) * 2011-09-16 2011-12-28 华为技术有限公司 Method and device for determining deployment position of micro base station
US20130281089A1 (en) * 2012-04-23 2013-10-24 Accelera Mobile Broadband, Inc. Interference management and network performance optimization in small cells
CN102892125A (en) * 2012-10-19 2013-01-23 北京邮电大学 interference coordination method for energy-saving communication of heterogeneous network
CN103607717A (en) * 2013-11-07 2014-02-26 北京邮电大学 Configuration method of base station density and power in cellular hierarchical wireless network and device thereof

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
RUI HAN等: "Coverage Optimization for Dense Deployment Small Cell Based on Ant Colony Algorithm", 《VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL), 2014 IEEE 80TH》 *

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106162671B (en) * 2015-04-28 2019-04-26 中国移动通信集团公司 A kind of base station deployment location determining method and device
CN106162671A (en) * 2015-04-28 2016-11-23 中国移动通信集团公司 A kind of base station deployment location determining method and device
WO2017000543A1 (en) * 2015-06-29 2017-01-05 深圳市中兴微电子技术有限公司 Layout method and system for base station, and computer storage medium
US10123215B2 (en) 2015-06-29 2018-11-06 Sanechips Technology Co., Ltd Layout method and system for base station, and computer storage medium
CN110418350B (en) * 2018-04-27 2023-03-10 中兴通讯股份有限公司 Shared station address evaluation method and system
CN110418350A (en) * 2018-04-27 2019-11-05 中兴网鲲信息科技（上海）有限公司 A kind of shared site appraisal procedure and system
CN109275158B (en) * 2018-09-10 2021-09-14 中国联合网络通信集团有限公司 Method and device for dense networking
CN109089277A (en) * 2018-09-10 2018-12-25 中国联合网络通信集团有限公司 Networking appraisal procedure and device based on ergodic data
CN109275158A (en) * 2018-09-10 2019-01-25 中国联合网络通信集团有限公司 The method and device of intensive networking
CN109089277B (en) * 2018-09-10 2021-06-18 中国联合网络通信集团有限公司 Networking evaluation method and device based on traversal data
CN109302712B (en) * 2018-10-10 2021-10-29 北京邮电大学 Method for determining position of intelligent base station, intelligent base station and storage medium
CN109302712A (en) * 2018-10-10 2019-02-01 北京邮电大学 Determine the method, apparatus and storage medium of intelligent base station position
CN110996328B (en) * 2019-11-25 2021-09-07 北京邮电大学 Unmanned aerial vehicle base station deployment position determining method and device and electronic equipment
CN110996328A (en) * 2019-11-25 2020-04-10 北京邮电大学 Unmanned aerial vehicle base station deployment position determining method and device and electronic equipment
CN114980138A (en) * 2022-05-24 2022-08-30 四川通信科研规划设计有限责任公司 Planning method, system and terminal of 5G wireless base station
CN114980138B (en) * 2022-05-24 2023-05-16 四川通信科研规划设计有限责任公司 Planning method, system and terminal of 5G wireless base station

Also Published As

Publication number Publication date
CN104378772B (en) 2018-04-17

Similar Documents

Publication Publication Date Title
CN104378772B (en) Towards the small base station deployment method of the amorphous covering of cell in a kind of cellular network
CN109474980B (en) Wireless network resource allocation method based on deep reinforcement learning
Dai et al. The multi-objective deployment optimization of UAV-mounted cache-enabled base stations
CN106231610B (en) Based on the resource allocation methods of sub-clustering in Femtocell double-layer network
CN104955077A (en) Heterogeneous network cell clustering method and device based on user experience speed
CN104703270B (en) User&#39;s access suitable for isomery wireless cellular network and power distribution method
CN109982437B (en) D2D communication spectrum allocation method based on location-aware weighted graph
CN107708157A (en) Intensive small cell network resource allocation methods based on efficiency
CN103281786B (en) The method for optimizing resources of a kind of Home eNodeB double-layer network based on energy efficiency
Elsayed et al. Deep reinforcement learning for reducing latency in mission critical services
Cheng et al. Joint user association and resource allocation in HetNets based on user mobility prediction
CN106788812B (en) Interference alignment schemes based on sub-clustering in a kind of two-tier network
CN105490794B (en) The packet-based resource allocation methods of the Femto cell OFDMA double-layer network
CN104618934B (en) A kind of global optimization relay node selecting method based on throughput prediction
CN116095690A (en) Dynamic resource allocation optimization method based on reinforcement learning in heterogeneous network
Ullah et al. Voronoi cell geometry based dynamic fractional frequency reuse for OFDMA cellular networks
Hatoum et al. Q-FCRA: QoS-based OFDMA femtocell resource allocation algorithm
CN101262701A (en) A dynamic channel allocation method based on generic algorithm
Park et al. Flocking-inspired transmission power control for fair resource allocation in vehicle-mounted mobile relay networks
CN106961293A (en) Wireless network distribution dense network resource allocation algorithm
CN104469849A (en) Dynamic flow distribution method based on intelligent antenna in small base station network
CN107517464B (en) Interference management and resource allocation method in heterogeneous network
WO2024060524A1 (en) Resource allocation method and apparatus, resource scheduling method, and device
CN104581910B (en) Small base station asynchronous Poewr control method in towards the cooperative cluster of the amorphous covering of cell
CN110380808B (en) Micro-cell semi-clustering interference coordination method taking user equipment as center

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
TR01 Transfer of patent right

Effective date of registration: 20210621

Address after: 210042 building 18, 699-22 Xuanwu Avenue, Xuanwu District, Nanjing City, Jiangsu Province

Patentee after: CERTUSNET Corp.

Address before: Beilin District Xianning West Road 710049, Shaanxi city of Xi'an province No. 28

Patentee before: XI'AN JIAOTONG University

TR01 Transfer of patent right