CN105323800A - Scheduling method applied to heterogeneous network enhancement mode interference coordination and optimization method thereof - Google Patents
Scheduling method applied to heterogeneous network enhancement mode interference coordination and optimization method thereof Download PDFInfo
- Publication number
- CN105323800A CN105323800A CN201510786330.2A CN201510786330A CN105323800A CN 105323800 A CN105323800 A CN 105323800A CN 201510786330 A CN201510786330 A CN 201510786330A CN 105323800 A CN105323800 A CN 105323800A
- Authority
- CN
- China
- Prior art keywords
- user
- formula
- scheduling
- dispatching
- blank subframe
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a scheduling method applied to heterogeneous network enhancement mode interference coordination and an optimization method thereof. The scheduling method comprises the steps of adjusting an area expansion and throughput target of a micro-base station through a [eta] parameter; and introducing an expansion factor [zeta]m,tn of a user to improve a proportional fairness scheduling algorithm during an approximate blank sub-frame period. Therefore, the proportional fairness scheduling algorithm in which the area expansion and throughput target of the micro-base station is adjusted through the [eta] parameter is proposed; a problem of distinguishing a central trap, which the proportional fairness scheduling algorithm faces, can be avoided through the improved proportional fairness scheduling algorithm; and a capacity and load balance optimization method is provided based on the algorithm. The result shows that the algorithm can increase resource utilization rate of base stations and can realize load balance among the base stations.
Description
Technical field
The present invention relates to wireless mobile communications field, be specifically a kind ofly applied to dispatching method in heterogeneous network enhancement mode interference coordination and optimization method thereof.
Background technology
Traditional ICIC (IntercellInterferenceCoordination, interference coordination) scheme can not solve LTE-A heterogeneous network interference scene under interference, so coordinate mainly for the interference in heterogeneous network between macro base station and low power nodes in Rel-10, and propose interference coordination between enhancement type district.Enhancement mode interference coordination have studied emphatically cell area expansion and is similar to blank subframe two technology.Cell area expands the coverage of PeNB (PicoeNodeB, micro-base station), and macro base station user is unloaded to Pico node, the balanced load of system; And approximate blank subframe does not allow MeNB (MacroeNodeB, macro base station) to send any except the special reference signal of community controling and data signal, to reduce now to the interference of adjacent femto base station in specific sub-frame.
Current many documents expand research to the dispatching algorithm used in enhancement mode interference coordination.Due to proportional fair algorithm [JalaliA, PadovaniR, PankajR.DataThroughputofCDMA-HDRaHighEfficiency-HighData RatePersonalCommunicationWirelessSystem [C] .inIEEE51stVehicularTechnologyConferenceProceedings, 2000, pp.1854-1858.] and derivative algorithm only consider throughput, the fairness of user.But after LTE-A heterogeneous network applies extended area, this algorithm can be caused accurately cannot to differentiate the type of user, causing can not the corresponding user of subframe scheduling accurately.This just causes in normal sub-frames period, scheduler schedules central user, approximate blank subframe also possibility control centre user in period, now extended area user does not obtain resource substantially, there will be the phenomenon of " dying of hunger ", as document [BasimAY.RangeexpansionforpicocellinheterogeneousLTE-Acel lularnetwork [C], InternationalConferenceonComputerScienceandNetworkTechno logy (ICCSNT), ChangChun, 2012:1372-1379.] described in.
For this reason, when dispatching, approximate empty white chessman frame scheduling extended area user, at normal sub-frames control centre zone user, document [SomasundaramK.ProportionalfairnessinLTE-Advancedheteroge neoushetworkswitheICIC [C] //VehicularTechnologyConference (VTCFall), LasVegas, NV.2013:1-6.] scheduling is distinguished with proportional fair scheduling, result shows that enhancement mode interference coordination improves the throughput of overall network, and particularly the performance of extended area user has obvious lifting.Document [ShirakabeM, MorimotoA, andMikiN.Performanceevaluationofinter-cellinterferenceco ordinationandcellrangeexpansioninheterogeneousnetworksfo rLTE-Advanceddownlink [C] //InternationalSymposiumonWirelessCommun.Systems (ISWCS) .Lucca, Italy, 2010:844-848.] from the angle of fairness, use polling dispatching algorithm to distinguish scheduling, result shows that enhancement mode interference coordination contributes to the fairness of elevator system.Compared to when not distinguishing scheduling, although the throughput of system declines to some extent, the user of extended area there will not be " dying of hunger " phenomenon, just because of the superperformance that differentiation dispatching method obtains, most of article is all application division dispatching algorithm when dispatching.
But distinguish dispatching algorithm just distinguishes scheduling lifting network in different subframe fairness by different user, but also there is greatest differences in same user.Because the distance of the micro-base station of user distance is different, the signal to noise ratio obtained is also different, and along with the increase of distance, signal to noise ratio reduces successively.Generally the signal to noise ratio that obtains in the approximate blank subframe moment of user is more much higher than the signal to noise ratio obtained in the normal sub-frames moment, and the edge customer of central area is only dispatched in normal sub-frames, and signal to noise ratio is now very little, the speed that the user at edge, center obtains is very low, particularly Proportional Fair, to such an extent as to its QoS (QualityofService cannot be ensured, service quality) demand, and the speed that the extended area user be adjacent obtains is very high, this has just occurred that central user " dies of hunger " phenomenon, be referred to as " center trap ", need under this situation to propose corresponding dispatching algorithm to this specific situation.
Summary of the invention
The object of the present invention is to provide and avoid " center trap " problem, namely the edge customer of central area is only dispatched in normal sub-frames, and signal to noise ratio is now very little, the speed that the user at edge, center obtains is very low, particularly Proportional Fair, to such an extent as to its QoS demand cannot be ensured, and the speed that the extended area user be adjacent obtains is very high, this has just occurred that central user " dies of hunger " phenomenon, thus a kind of dispatching method be applied in heterogeneous network enhancement mode interference coordination is proposed, and the optimization method of a kind of capacity and load balancing is proposed based on the method.
For achieving the above object, the invention provides following technical scheme:
Be applied to the dispatching method in heterogeneous network enhancement mode interference coordination, comprise the following step:
Step 1: distinguish normal sub-frames and approximate blank subframe
Normal sub-frames and approximate blank subframe are distinguished and are, approximate blank subframe can send community common signal, but can not launch the special Physical Downlink Control Channel of user in approximate blank subframe; Include multimedia broadcasting and multicast service signal and approximate blank subframe can not be configured to for the subframe of the position reference of locating; In the dispatching cycle of 3GPP protocol agreement, the ratio of approximate blank subframe can be set as 1/8,2/8,3/8 or 3/20;
Step 2: user is at the dispatching method in normal sub-frames moment
Suppose containing M user in a community, and think that scheduler has infinite buffer, during downlink scheduling, packet scheduler can choose a user in short time interval, and gives its resource allocation; Definition
with
represent that user m is in the instantaneous received power in moment and momentary rate respectively,
and π
m,tf () is illustrated respectively in [t
0, t
n] the long-term average throughput of user (kbit/s) in the time period and long-term mean receiving power (dBm), the unit of long-term average throughput is kbit/s, and the unit of long-term mean receiving power is dBm, wherein t
0for initial time; According to the physical significance of real network data, know
with
suppose that all information of channel at that time understood by scheduler simultaneously, can effectively with reference to instantaneous received power and instantaneous transmission speed when dispatching; The long-term average throughput of user m can be obtained by following formula recursive calculation,
formula (1)
Wherein V
nbe according to QoS demand in order to ensure the sliding time window that user fairness increases, get
δ () is Kronecker function; Wherein dispatch symbol
represent at t
ntime user m be scheduled; Under the proportional fair scheduling following throughput, when average channel quality higher than client oneself time of the momentary channel quality of user, then scheduler priority dispatches this user,
formula (2)
Step 3: user is at the dispatching method in approximate blank subframe moment
Approximate blank subframe period, while retaining ratio fair scheduling algorithm, introduce the spreading factor of user
improve comparative example fair scheduling algorithm, i.e. η-ECPF dispatching algorithm; Wherein,
represent as shown in formula (3),
formula (3)
The step of η-ECPF dispatching algorithm is as follows:
First the spreading factor of monitor user ' when scheduler is dispatched each time, then the recursive expression of average spreading factor is,
formula (4)
Wherein
depend on user's Received signal strength correlation, get
during scheduling, the expression formula of scheduler is,
formula (5)
Wherein 0 < η < 1, for regulating scheduling extended area user and the ratio of center edge user, K is unified dimension, the expression formula of K as shown in formula (6),
formula (6)
represent the bandwidth when polling dispatching, bandwidth is total number of users N with network actual parameter also
rBwith total resources N
u, p, crrelevant;
Defined formula (7),
formula (7)
Know according to definition, at t
n-1to t
nthe variable quantity of the Comprehensive Assessment amount of moment covering and capacity is
as shown in formula (8),
formula (8)
The integration requirement target function of service coverage and throughput is ensured, as shown in formula (9) by scheduling:
formula (9)
Obtain the Comprehensive Assessment amount of dispatching
it obtains expression formula of best priority as shown in formula (10),
formula (10).
As the further scheme of the present invention: Physical Downlink Control Channel, Physical Downlink Control Channel, Physical Downlink Shared Channel, physical hybrid automatic repeat request indicator channel when community common signal comprises master sync signal, auxiliary synchronous signals, Physical Broadcast Channel, Physical Control Format Indicator Channel, transmitting system information broadcasting can be sent in approximate blank subframe.
Based on the capacity of above-mentioned dispatching method and an optimization method for load balancing, comprising two control methods, is area extension triggering method and scheduling triggering method respectively; Wherein area extension triggering method is the load balancing realizing between macrocell and picocell by area extension; As long as scheduling triggering method regulates the scheduling of picocell internal user, the step that capacity and load optimized method realize is as follows:
(1) network can analyze the difference of the load between macrocell and picocell, and when load all below or above picocell in a time range Δ T of the load of macrocell, it can trigger femto base station control band expanding value;
(2) area extension value increases according to certain step-length or reduces area extension value, then determines user's set of each community, and reanalyses the load of each community, form new user collection;
(3) the new user that community is formed collects, and scheduler is according to a fixed step size η
stepprogressively adjust the size of η in η-ECPF dispatching algorithm, make all users in picocell meet the demand of minimum speed limit;
Repeat step (2) afterwards continue the overlay area of expansion femto base station or the user of picocell be switched to macrocell, until all users can meet minimum speed limit demand.
Compared with prior art, the invention has the beneficial effects as follows:
The present invention proposes the dispatch analysis method be applied in heterogeneous network enhancement mode interference coordination, this dispatching method regulates micro-base station area to expand and throughput objective by η parameter, called after (η-ExpansionandCapacityproportionFair, η-ECPF) dispatching algorithm, do not distinguish approximate blank subframe and normal sub-frames two kinds of situations at scheduled time division.In the normal sub-frames moment, η-ECPF is exactly proportional fair algorithm; In approximate blank subframe period, η-ECPF, then while retaining ratio fair scheduling algorithm, introduces the spreading factor of user
algorithm is improved.And based on this algorithm propose a kind of calmodulin binding domain CaM expansion and η-ECPF dispatching algorithm realize the capacity of community and the optimization method of load balancing.
The innovation of the inventive method is: in approximate blank subframe period, introduce the spreading factor of user
carry out proportional fair scheduling to improve, thus propose a kind of proportional fair scheduling being regulated the expansion of micro-base station area and throughput objective by η parameter, avoided by the proportional fair scheduling improved distinguishing " center trap " problem faced in proportional fair scheduling, and propose the optimization method of a kind of capacity and load balancing based on this algorithm.The present invention can improve the resource utilization of base station, realizes the load balancing between base station.
Accompanying drawing explanation
Fig. 1 is the frame assumption diagram of ABS;
Fig. 2 is the user of the scheduling of η-ECPF algorithm;
Fig. 3 is CFO optimization method flow process;
Embodiment
Below in conjunction with the embodiment of the present invention, be clearly and completely described the technical scheme in the embodiment of the present invention, obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
Be applied to the dispatching method in heterogeneous network enhancement mode interference coordination, comprise the following step:
Step 1: distinguish normal sub-frames and approximate blank subframe
Area extension is applied in the load that can significantly improve system in Macro/Pico scene.But the signal of the macro base station received the extended area user of micro-base station is stronger than the signal of micro-base station, can be subject to the serious interference of MeNB, now the signal to noise ratio of these users may be less than zero.In order to eliminate the interference of extended area user, 3GPP introduces approximate blank subframe in Rel-10.
The frame structure of approximate blank subframe as shown in Figure 1, normal sub-frames and approximate blank subframe are distinguished and are, approximate blank subframe can send community common signal (Physical Downlink Control Channel, Physical Downlink Control Channel, Physical Downlink Shared Channel, physical hybrid automatic repeat request indicator channel as when master sync signal, auxiliary synchronous signals, Physical Broadcast Channel, Physical Control Format Indicator Channel, transmitting system information broadcasting), but the special Physical Downlink Control Channel of user can not be launched in approximate blank subframe.In addition, include multimedia broadcasting and multicast service signal (MultimediaBroadcastMulticastService, MBMS) subframe with for the position reference (PositioningReferenceSignal, PRS) of locating can not be configured to approximate blank subframe.If approximate blank subframe is configured in MBSFN sub-frame and PRS subframe, also just invalid.Because physical mixed ARQ indicating channel (PhysicalHybridARQIndicatorChannel, PHICH) carrying HARQ information to send, therefore approximate blank subframe there is PHICH.3GPP protocol agreement one (TransmissionTimeInterval dispatching cycle, TTI) in, the ratio of approximate blank subframe can be set as 1/8,2/8,3/8, or 3/20, be specified in [R4-110284, CATT.EvaluationsofRSRP/RSRQmeasurement.Austin, TX, Jan.2011.].
Step 2: user is at the dispatching method in normal sub-frames moment
Suppose containing M user in a community, and think that scheduler has infinite buffer, during downlink scheduling, packet scheduler can choose a user in short time interval, and gives its resource allocation.Definition
with
represent that user m is in the instantaneous received power in moment and momentary rate respectively,
and π
m,tf () is illustrated respectively in [t
0, t
n] the long-term average throughput of user (kbit/s) in the time period and long-term mean receiving power (dBm), wherein t
0for initial time.According to the physical significance of real network data, known
with
suppose that all information of channel at that time understood by scheduler simultaneously, can effectively with reference to the information such as instantaneous received power and instantaneous transmission speed when dispatching.According to document [KushnerHK, WhitingPK.Convergenceofproportionalfairsharingalgorithms undergeneralconditions [J] .IEEETransactionsonWirelessCommunications, 2004,3 (4): 1250-1259.], the long-term average throughput of user m can be obtained by following formula recursive calculation
formula (1)
Wherein V
nbe according to QoS demand in order to ensure the sliding time window that user fairness increases, its value is general comparatively large, generally gets
δ () is Kronecker function, as in formula (1)-(2), if m
*=m, represents that scheduler is at moment t
nchoose user m to dispatch, now δ (m) equals 1, otherwise equals 0.Wherein dispatch symbol
represent at t
ntime user m be scheduled.Under the proportional fair scheduling following throughput, when average channel quality higher than client oneself time of the momentary channel quality of user, then scheduler priority dispatches this user,
formula (2)
Step 3: user is at the dispatching method in approximate blank subframe moment
Approximate blank subframe period, while retaining ratio fair scheduling algorithm, introduce the spreading factor of user
carry out comparative example fair scheduling algorithm to be improved.The framework of η-ECPF dispatching algorithm represents as Fig. 2, wherein,
be expressed as follows,
formula (3)
This is due in the approximate blank subframe moment, the user of main scheduling is extended area user, spreading factor as weighing the factor of area extension, embodiment be the factor of user in extended area position, depend primarily on the ratio of the distance between user and MeNB and PeNB.If
then represent that this user m is picocell extended area user; If
then show that this user m is central area, picocell user.If
larger, user is more in the edge of extended area user, from PeNB more away from; Otherwise user is more in the center of picocell.So the scheduling principle of concentrated discussion η-ECPF dispatching algorithm when approximate blank subframe below.
First the spreading factor of monitor user ' when scheduler is dispatched each time, then the recursive expression of average spreading factor is,
formula (4)
Wherein
depend on user's Received signal strength correlation.Conveniently get here
when the present invention is desirably in scheduling, scheduler comprehensively can take into account extended area user and center edge user, thus " center trap " problem of solution, its expression formula is,
formula (5)
Wherein 0 < η < 1, for regulating the ratio of scheduling extended area user and center edge user, K is unified dimension, and the expression formula of K is as follows,
formula (6)
represent the bandwidth when polling dispatching, bandwidth is total number of users N with network actual parameter also
rBwith total resources N
u, p, crrelevant.As formula (5), when η is larger, H is partial to the user at the larger user of average spreading factor and extended area edge; When η is less, H is partial to compare the user by center.Definition,
formula (7)
Known at t according to definition
n-1to t
nthe variable quantity of the Comprehensive Assessment amount of moment covering and capacity is
be expressed as,
formula (8)
The integration requirement target function of service coverage and throughput is ensured by scheduling, as follows:
formula (9)
Be easy to the Comprehensive Assessment amount obtaining dispatching
its expression formula obtaining best priority is,
formula (10)
Step 4: capacity and load optimized method
Doubly, can cause Macro overload, serious interference like this, and the user of picocell is few, frequency spectrum resource is not but fully utilized the area coverage difference 10-100 of Macro base station and Pico base station.This causes the unfairness of the unbalanced and user scheduling of the business load of community.For this reason, the present invention proposes the optimization method (CapacityandFairnessOptimization of a kind of capacity and load balancing, CFO), calmodulin binding domain CaM expansion and η-ECPF dispatching algorithm are realized the load balancing of community and the optimization of capacity by this optimization method.
The overall flow of the optimization method of CFO as shown in Figure 3.In this optimization method, have two control methods, be area extension triggering method and scheduling triggering method respectively.Wherein area extension triggering method is the load balancing realizing between macrocell and picocell by area extension.As long as and dispatch the scheduling that triggering method regulates picocell internal user, evade " center trap " problem by scheduling η parameter, thus meet consumers' demand.
Introduce the key step that CFO method realizes below:
(1) network can analyze the difference of the load between this community and adjacent picocell, when the load of this community is in a time range Δ T during all certain below or above the load of adjacent area threshold value, it can trigger femto base station control band expanding value, usual Δ T in time scale much larger than TTI (TTI is 1ms), otherwise too frequently touching appears in CFO optimization method, can occur to occur conflicting with the scheduling process of system;
(2) area extension value increases according to certain step-length or reduces area extension value, then determines user's set of each community, and reanalyses the load of each community;
(3) then, new user's collection that community is formed, scheduler is according to a fixed step size η
stepprogressively adjust the size of η in η-ECPF dispatching algorithm, make all users in picocell meet the demand of minimum speed limit, and avoid the appearance of " center trap ".
Repeat step (2) afterwards continue the overlay area of expansion femto base station or the user of picocell be switched to macrocell, until all users can meet minimum speed limit demand.
The detailed step of CFO optimization control scheme is as described below.
Step 1: compare the load difference between macrocell and picocell wherein.
In a Δ T, if the load of macrocell is higher than the load of picocell, and reach threshold delta B, then enter step 2;
Step 2: regulate picocell area extension value, the load of balanced macrocell and picocell.
Picocell is with a fixed step size b
stepincrease area extension value.By formula CellID
serving=argmax
{ i}{ RSRP
i+ bias
icalculate user b
stepwhich base station should be accessed.Then and enter step 3 user of these new accesses is brought in community user set;
Step 3: dispatched by η-ECPF algorithm realization.
Assuming that the setting of approximate blank subframe is determined, if extended area user does not meet minimum speed limit requirement r
min, perform following steps:
A, with a fixed step size η
stepincrease or reduce the size of η.
B, in a TTI, first judge that user is that type of user.If extended area user Ze Tong formula (10) judges user k when approximate blank subframe the need of being scheduled; If central user is then in two kinds of situation, judge whether to be scheduled by formula (2) in normal sub-frames, if approximate blank subframe then through type (10) judge whether to be scheduled.
C, update time, enter next Δ T.
Regulate η to make intra-cell users meet minimum speed limit demand according to a fixed step size, repeat step 2 until all users meet minimum speed limit demand.Even if if η equals 1, the rate requirement of all users can not be met, enter step 1 again.
Embodiment 1
Suppose containing M user in a community, and think that scheduler has infinite buffer, during downlink scheduling, packet scheduler can choose a user in short time interval, and gives its resource allocation, and basic implementation is as follows:
1, in the normal sub-frames moment, η-ECPF dispatching algorithm is exactly proportional fair algorithm, and dispatched users priority is as follows,
2, in approximate blank subframe period, then, while retaining ratio fair scheduling algorithm, the spreading factor of user is introduced
carry out comparative example fair scheduling algorithm to be improved.Definition
representation, and the optimal scheduling User Priority obtained,
3, calmodulin binding domain CaM expansion and η-ECPF dispatching algorithm realize the load balancing of community and the optimization of capacity.Flow process is as follows:
(1) network can analyze the difference of the load between this community and adjacent picocell, when the load of this community is in a time range Δ T during all certain below or above the load of adjacent area threshold value, it can trigger femto base station control band expanding value, usual Δ T in time scale much larger than TTI (TTI is 1ms), otherwise too frequently touching appears in CFO optimization method, can occur to occur conflicting with the scheduling process of system.
(2) area extension value increases according to certain step-length or reduces area extension value, then determines user's set of each community, and reanalyses the load of each community.
(3) then, new user's collection that community is formed, scheduler is according to a fixed step size η
stepprogressively adjust the size of η in η-ECPF dispatching algorithm, make all users in picocell meet the demand of minimum speed limit, and avoid the appearance of " center trap ".
(4) repeat step (2) after continue the overlay area of expansion femto base station or the user of picocell be switched to macrocell, until all users can meet minimum speed limit demand.
To those skilled in the art, obviously the invention is not restricted to the details of above-mentioned one exemplary embodiment, and when not deviating from spirit of the present invention or essential characteristic, the present invention can be realized in other specific forms.Therefore, no matter from which point, all should embodiment be regarded as exemplary, and be nonrestrictive, scope of the present invention is limited by claims instead of above-mentioned explanation, and all changes be therefore intended in the implication of the equivalency by dropping on claim and scope are included in the present invention.
In addition, be to be understood that, although this specification is described according to execution mode, but not each execution mode only comprises an independently technical scheme, this narrating mode of specification is only for clarity sake, those skilled in the art should by specification integrally, and the technical scheme in each embodiment also through appropriately combined, can form other execution modes that it will be appreciated by those skilled in the art that.
Claims (3)
1. be applied to the dispatching method in heterogeneous network enhancement mode interference coordination, it is characterized in that, comprise the following step:
Step 1: distinguish normal sub-frames and approximate blank subframe
Normal sub-frames and approximate blank subframe are distinguished and are, approximate blank subframe can send community common signal, but can not launch the special Physical Downlink Control Channel of user in approximate blank subframe; Include multimedia broadcasting and multicast service signal and approximate blank subframe can not be configured to for the subframe of the position reference of locating; In the dispatching cycle of 3GPP protocol agreement, the ratio of approximate blank subframe can be set as 1/8,2/8,3/8 or 3/20;
Step 2: user is at the dispatching method in normal sub-frames moment
Suppose containing M user in a community, and think that scheduler has infinite buffer, during downlink scheduling, packet scheduler can choose a user in short time interval, and gives its resource allocation; Definition
with
represent that user m is in the instantaneous received power in moment and momentary rate respectively,
with
be illustrated respectively in [t
0, t
n] the long-term average throughput of user (kbit/s) in the time period and long-term mean receiving power (dBm), the unit of long-term average throughput is kbit/s, and the unit of long-term mean receiving power is dBm, wherein t
0for initial time; According to the physical significance of real network data, know
with
suppose that all information of channel at that time understood by scheduler simultaneously, can effectively with reference to instantaneous received power and instantaneous transmission speed when dispatching; The long-term average throughput of user m can be obtained by following formula recursive calculation,
formula (1)
Wherein V
nbe according to QoS demand in order to ensure the sliding time window that user fairness increases, get
δ () is Kronecker function; Wherein dispatch symbol
represent at t
ntime user m be scheduled; Under the proportional fair scheduling following throughput, when average channel quality higher than client oneself time of the momentary channel quality of user, then scheduler priority dispatches this user,
formula (2)
Step 3: user is at the dispatching method in approximate blank subframe moment
Approximate blank subframe period, while retaining ratio fair scheduling algorithm, introduce the spreading factor of user
improve comparative example fair scheduling algorithm, i.e. η-ECPF dispatching algorithm; Wherein,
represent as shown in formula (3),
formula (3)
The step of η-ECPF dispatching algorithm is as follows:
First the spreading factor of monitor user ' when scheduler is dispatched each time, then the recursive expression of average spreading factor is,
formula (4)
Wherein
depend on user's Received signal strength correlation, get
during scheduling, the expression formula of scheduler is,
formula (5)
Wherein 0 < η < 1, for regulating scheduling extended area user and the ratio of center edge user, K is unified dimension, the expression formula of K as shown in formula (6),
formula (6)
represent the bandwidth when polling dispatching, bandwidth is total number of users N with network actual parameter also
rBwith total resources N
u, p, crrelevant;
Defined formula (7),
formula (7)
Know according to definition, at t
n-1to t
nthe variable quantity of the Comprehensive Assessment amount of moment covering and capacity is
as shown in formula (8),
formula (8)
The integration requirement target function of service coverage and throughput is ensured, as shown in formula (9) by scheduling:
formula (9)
Obtain the Comprehensive Assessment amount of dispatching
it obtains expression formula of best priority as shown in formula (10),
formula (10).
2. the dispatching method be applied in heterogeneous network enhancement mode interference coordination according to claim 1, it is characterized in that, approximate blank subframe can send Physical Downlink Control Channel, Physical Downlink Control Channel, Physical Downlink Shared Channel, physical hybrid automatic repeat request indicator channel when community common signal comprises master sync signal, auxiliary synchronous signals, Physical Broadcast Channel, Physical Control Format Indicator Channel, transmitting system information broadcasting.
3. based on the capacity of dispatching method as described in as arbitrary in claim 1-2 and the optimization method of load balancing, it is characterized in that, comprise two control methods, is area extension triggering method and scheduling triggering method respectively; Wherein area extension triggering method is the load balancing realizing between macrocell and picocell by area extension; As long as scheduling triggering method regulates the scheduling of picocell internal user, the step that capacity and load optimized method realize is as follows:
(1) network can analyze the difference of the load between macrocell and picocell, and when load all below or above picocell in a time range Δ T of the load of macrocell, it can trigger femto base station control band expanding value;
(2) area extension value increases according to certain step-length or reduces area extension value, then determines user's set of each community, and reanalyses the load of each community, form new user collection;
(3) the new user that community is formed collects, and scheduler is according to a fixed step size η
stepprogressively adjust the size of η in η-ECPF dispatching algorithm, make all users in picocell meet the demand of minimum speed limit;
Repeat step (2) afterwards continue the overlay area of expansion femto base station or the user of picocell be switched to macrocell, until all users can meet minimum speed limit demand.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510786330.2A CN105323800A (en) | 2015-11-17 | 2015-11-17 | Scheduling method applied to heterogeneous network enhancement mode interference coordination and optimization method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510786330.2A CN105323800A (en) | 2015-11-17 | 2015-11-17 | Scheduling method applied to heterogeneous network enhancement mode interference coordination and optimization method thereof |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105323800A true CN105323800A (en) | 2016-02-10 |
Family
ID=55250206
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510786330.2A Pending CN105323800A (en) | 2015-11-17 | 2015-11-17 | Scheduling method applied to heterogeneous network enhancement mode interference coordination and optimization method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105323800A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106455102A (en) * | 2016-11-25 | 2017-02-22 | 西安电子科技大学 | Global-faired self-adaption ratio fairness scheduling method |
| CN107592640A (en) * | 2017-08-31 | 2018-01-16 | 中国科学院计算技术研究所 | Disturbance coordination method in heterogeneous network |
| CN109743145A (en) * | 2016-07-13 | 2019-05-10 | 上海朗帛通信技术有限公司 | A kind of method and apparatus in wireless communication |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102088735A (en) * | 2010-03-24 | 2011-06-08 | 电信科学技术研究院 | Method and equipment for balancing inter-sub-frame traffic load and processing inter-cell interference (ICI) |
| CN102791002A (en) * | 2012-08-01 | 2012-11-21 | 重庆邮电大学 | Energy efficiency-based resource allocation method for LTE network |
| CN103517279A (en) * | 2013-09-23 | 2014-01-15 | 西安交通大学 | Method for combining dynamic radio resource allocation and mobility load balancing in LTE system |
-
2015
- 2015-11-17 CN CN201510786330.2A patent/CN105323800A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102088735A (en) * | 2010-03-24 | 2011-06-08 | 电信科学技术研究院 | Method and equipment for balancing inter-sub-frame traffic load and processing inter-cell interference (ICI) |
| CN102791002A (en) * | 2012-08-01 | 2012-11-21 | 重庆邮电大学 | Energy efficiency-based resource allocation method for LTE network |
| CN103517279A (en) * | 2013-09-23 | 2014-01-15 | 西安交通大学 | Method for combining dynamic radio resource allocation and mobility load balancing in LTE system |
Non-Patent Citations (3)
| Title |
|---|
| HAROLD J. KUSHNER: "Convergence of Proportional-Fair Sharing Algorithms", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》 * |
| KIRAN SOMASUNDARAM: "Proportional Fairness in LTE-Advanced", 《VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL)》 * |
| MASASHIGE SHIRAKABE: "Performance Evaluation of Inter-cell Interference Coordination", 《 WIRELESS COMMUNICATION SYSTEMS (ISWCS)》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109743145A (en) * | 2016-07-13 | 2019-05-10 | 上海朗帛通信技术有限公司 | A kind of method and apparatus in wireless communication |
| CN109743145B (en) * | 2016-07-13 | 2021-07-27 | 上海朗帛通信技术有限公司 | Method and device in wireless communication |
| CN106455102A (en) * | 2016-11-25 | 2017-02-22 | 西安电子科技大学 | Global-faired self-adaption ratio fairness scheduling method |
| CN106455102B (en) * | 2016-11-25 | 2019-07-02 | 西安电子科技大学 | The adaptive proportional fair dispatching method of global fair |
| CN107592640A (en) * | 2017-08-31 | 2018-01-16 | 中国科学院计算技术研究所 | Disturbance coordination method in heterogeneous network |
| CN107592640B (en) * | 2017-08-31 | 2019-10-25 | 中国科学院计算技术研究所 | Disturbance coordination method in heterogeneous network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Xu et al. | Cooperative distributed optimization for the hyper-dense small cell deployment | |
| Tanbourgi et al. | Analysis of non-coherent joint-transmission cooperation in heterogeneous cellular networks | |
| CN104902431B (en) | A kind of LTE network mid-span cell D2D communication spectrum distribution methods | |
| CN103781118A (en) | Heterogeneous wireless network access control and resource distribution joint method based on multiple services | |
| CN103891334A (en) | Inter-operator spectrum sharing control, inter-operator interference coordination method, and radio resource scheduling in wireless communication systems | |
| Al-Rawi | A dynamic approach for cell range expansion in interference coordinated LTE-advanced heterogeneous networks | |
| CN103052113B (en) | Collaborative load balancing method of wireless access network system based on RAN (Residential Access Network) framework | |
| CN105323800A (en) | Scheduling method applied to heterogeneous network enhancement mode interference coordination and optimization method thereof | |
| CN103369568A (en) | Game theory-based radio resource optimization method in LTE-A relay system | |
| Meng et al. | User-centric mobility management based on virtual cell in ultra-dense networks | |
| Sasikumar et al. | An intelligent pico cell range expansion technique for heterogeneous wireless networks | |
| CN105246162B (en) | Resource regulating method and device in a kind of heterogeneous network | |
| Shao et al. | Locally cooperative traffic‐offloading in multi‐mode small cell networks via potential games | |
| CN103856945B (en) | The up-link interference coordination method of LTE Advanced relay systems | |
| CN103379497A (en) | Interference coordination method for heterogeneous network | |
| CN103874219B (en) | Terminal scheduling method and a kind of micro-base station in a kind of heterogeneous network | |
| CN103327590A (en) | Method and device for determining transmitted power | |
| Song et al. | Throughput analysis of small cell networks under D-TDD and FFR | |
| CN108235829B (en) | Method for synchronously accessing unauthorized media through small cells in packet-licensed-assisted access (LAA) network | |
| Yang et al. | Best-fit cell attachment for decoupling DL/UL to promote traffic offloading in HetNets | |
| Ba et al. | Effective scheduling scheme for multi-connectivity in intra-frequency 5G ultra-dense networks | |
| Zhang et al. | Congestion-aware user-centric cooperative base station selection in ultra-dense networks | |
| CN103001688B (en) | Method and device for determining time domain blank subframe density in heterogeneous network | |
| Cuibo et al. | Feasibility study for the LTE-advanced system | |
| CN105813217A (en) | Simultaneous, same-frequency and full-duplex user quick clustering scheduling method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160210 |
|
| WD01 | Invention patent application deemed withdrawn after publication |