CN104660391B - Interference elimination method between distributing cell in orthogonal frequency-time multiple access network - Google Patents
Interference elimination method between distributing cell in orthogonal frequency-time multiple access network Download PDFInfo
- Publication number
- CN104660391B CN104660391B CN201510096950.3A CN201510096950A CN104660391B CN 104660391 B CN104660391 B CN 104660391B CN 201510096950 A CN201510096950 A CN 201510096950A CN 104660391 B CN104660391 B CN 104660391B
- Authority
- CN
- China
- Prior art keywords
- base station
- user
- power
- interference
- coordination
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/0001—Arrangements for dividing the transmission path
- H04L5/0003—Two-dimensional division
- H04L5/0005—Time-frequency
- H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- 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
- H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
-
- 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)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Interference elimination method between a kind of distributing cell in orthogonal frequency-time multiple access network.Its core concept is to use channeling technology so that the interference signal source distance between neighbor cell reaches the effect for improving transmission quality, raising cell and its edge user throughput as far as possible, and using the interference of power control techniques suppression neighbor cell.In view of the algorithm of centralization needs substantial amounts of information exchange expense and algorithm complex, the present invention is dispatched using distributed method to study the optimal power allocation of inter-cell coordination and user（Channeling）Scheme.Each base station by realizing that system and speed maximize with its neighbor base stations cooperation, the value of utility of each base station be defined as its own traffic rate and adjacent cell speed and.Each new value of utility for coordinating base station and calculating its current value of utility and strategy being surveyed based on examination, according to Boltzmann probability updatings rule and optimal response policy update rule, carries out the renewal of interference coordination strategy in a manner of iteration adjustment.
Description
Technical field
The present invention relates to a kind of distribution of distributed joint Power and user's scheduling for maximizing system transfer rate
Method is specifically a kind of suitable for being based on orthogonal frequency-time multiple access (Orthogonal Frequency Division
Multiple Access, OFDMA) interference elimination method between distributing cell in network.
Background technology
With the rapid development of the communication technology, to meet the needs of mobile subscriber is to high speed business, next generation wireless network
Middle frequency duplex factor as one reaches 1, that is to say, that each individually cell base station can use whole system band resource.OFDMA
As the multiple access technique of Next generation cellular GSM, overall available band system band is divided into multiple narrow by it
And mutually orthogonal frequency band.Therefore, it is not present between multiple users in same cell same in intersymbol interference and cell
Frequency disturbs.However, the deployment of mobile network's reality is all multi-cell environment, and in such a scenario, the interference (Inter- of minizone
Cell Interference, ICI) just exist all the time, significantly reduce the performance of edge customer.More accurately say, when same
When the frequency resource of sample is by adjacent cell reuse, the multi cell cellular system based on OFDMA technologies will produce ICI, cause
Network communication quality declines, and especially causes to be that Cell Edge User service quality is poor, handling capacity is relatively low.Therefore eliminate ICI, carry
Handling capacity, balance cell edge region and the communication quality difference of central area of high cell edge user, turns into honeybee of future generation
Cellular mobile communication system key issue urgently to be resolved hurrily.
In order to solve the problems, such as OFDMA network ICI, Inter-Cell Interference Coordination technology passes through rationally effective to Radio Resource progress
Management, in the state of the interference level between cell is maintained at into controllable.Its core concept is to use channeling skill
Art so that the distance of the interference signal source between neighbor cell as far as possible, and suppresses neighbor cell using power control techniques
Interference, reach the effect for improving transmission quality, improving cell and its edge user throughput.Inter-Cell Interference Coordination technology sheet
It is to realize multiple cell radio resource management functions in matter, by managing Radio Resource (mainly time/frequency source block and transmitting work(
Rate) ICI is controlled, it needs to consider following information from multiple cells simultaneously：Resource using status, traffic load situation with
Number of users etc..Because the distance of each user distance base station is different, so the channel bar of each user on different sub-channels
Part also differs.Moreover, the continuous change with space over time, the channel condition of each user also become constantly
Change, the diversity of this channel condition, be the basis for carrying out adaptive wireless resource management and distribution.In next generation communication system
Radio resource allocation for multi-user's situation design, mainly including time/frequency source block, transmission power combined optimization distribution.This
The overall goal of one allocative decision is according to the instantaneous fading characteristic of user, the disturbed condition of minizone and the service of active user
Grade and quality requirement, using optimized algorithm or quiet/dynamic adjusting method, it is determined which subchannel distributed for each user
And the size of transmission power level is distributed in these subchannels, so as to mitigate or even eliminate ICI, improve handling up for edge customer
Amount and systematic function.
Meanwhile understanding of each cell for network global information is very limited in multi cell cellular network, therefore concentrate
The algorithm of formula is difficult to carry out.Although provide what enough information was possible to each honeycomb by back haul link, so
The congestion of back haul link can be caused.In addition, the algorithm of centralization can bring very big computation complexity, especially in cell number
In the case that mesh is a lot.So distributed algorithm is very heavy for the Inter-Cell Interference Coordination of multi-cell OFDMA system
Want.It there is now a variety of theoretical distributed resource managements for being applied to wireless communication system.And game theory is used extensively as a kind of
To solve the theoretical rigorous mathematical modeling of conflict of interests in real world, it has also become solve the problems, such as the important of optimally in distributed mode
Method.Game theory is also known as " game theory ", is to study decision-making when the behavior of each decision-maker influences each other and its equilibrium is asked
A kind of important mathematical tool of topic.It can effectively solve the problems, such as to collide with each other and cooperation between the policymaker of rationality.Game bag
Branch containing Liang great, i.e. non-cooperative game and cooperative game, the invention mainly relates to the former.Non-cooperative game is it is emphasised that personal row
To analyze each rationality and what kind of decision-making the participant of selfishness can make, and what the result that game most probable occurs is.
It has been widely used wireless communication field at present, is the participant for portraying and studying " selfishness " in distributed resource allocation problem
Between the conflict of interest that has and competition provide complete theoretical tool.Specifically, it is by designing different utility functions
With cost mechanism, followed by optimization reaches the desired performance of system with causing each user " automatic ", i.e., a kind of
Relatively stable equilibrium state " Nash Equilibrium ".
The content of the invention
For existing interference management techniques in performances such as system transfer rate, algorithm complex, control information interaction expenses
The deficiency of aspect, the present invention provide point in the orthogonal frequency-time multiple access network of the optimal low complex degree of a kind of system and speed
Cloth inter-cell downlink interference elimination method.
Realize that the technical solution of the object of the invention is as follows：
Interference elimination method between a kind of distributing cell in orthogonal frequency-time multiple access network, if：Iteration time slot t=1,
2 ..., T (T is maximum iteration), useWithRepresent that base station i adjusts in the transimission power of t iteration time slots and user respectively
Degree strategy, i ∈ N, N={ 1,2 ..., N } represent collection of base stations, and N is total number of base,
Step 1, Initialize installation：Iteration time slot t is made equal to 1, its user's scheduling strategy of each Base station initialization, each base station
Subcarrier is randomly assigned to any one communication user of its service respectively, then, each base station random initializtion is respective
Transmit power.One different adjustment priority λ is set at random to each base stationi, λiBase station i adjustment priority is represented,
Step 2, according to interference indexOrder from big to small, the B base stations to base station i interference effects maximum before taking Interference index for base station j to base station i interference effects, j ∈ N { i }, N { i } represent set
N and the difference set of set { i }, BiFor base station i interference neighbors set, index is disturbedCalculation formula beWherein CiThe communication user set of base station i services is represented, | Ci| represent communication user set CiIn element
Number, n ∈ CiAnd n be base station i service any one communication user sequence number, gj,nFor from base station j to communication user n letter
Road power gain, gi,nFor from base station i to communication user n channel power gain,
Step 3, respectively by the priority of each base station in the interference neighbors set of the priority of each base station and each base station
It is compared, if the priority of base station is higher than the priority of each base station in the interference neighbors set of base station, by the base station
It is classified as coordinating base station k, k ∈ Lt, LtCoordination base station k set is represented, carries out interference coordination processing；Otherwise, without interference coordination
Operation,
Step 4, each base station i ∈ N calculate its rate of information throughput in iteration time slot t using shannon formulaWherein W represents channel width, Represent t-th of iteration time slot
When base station i Signal to Interference plus Noise Ratio, N0For noise power, n ∈ CiThe user serviced by base station i, then calculate each coordination base station k
∈LtValue of utilityAnd Coordinate base station k ∈ LtInterference neighbors base station l ∈ BkInformation transfer speed
Rate and by its report give coordinate base station k, BkFor base station k interference neighbors set,
Step 5, power level examination is surveyed and corresponding value of utility calculates：
Step 5.1, in t≤T/2, each coordination base station k ∈ LtGeneral one examination of random selection such as the probability with 1/M is surveyed
Power level Here Pk,maxFor base station k maximum transmission power, M is power
The number of level, η1=0, ηM=1, and η1<η2<...<ηM, each base station i ∈ N, which are calculated, is based on examination power scale levelMost
Excellent user's scheduling strategyAnd subcarrier is given into rate of information throughput highest service user,Table
Show the user n that base station i ∈ N are serviced based on examination power scale levelThe rate of information throughput, then calculate each coordination base station k
∈LtExamination power scale levelCorresponding value of utilityAnd enter step 6.1,
Step 5.2, in t>In T/2, each coordination base station k ∈ LtAll power levels are surveyed in examination successivelyHere Pk,maxFor base station k maximum transmission power, M is the number of power level, η1
=0, ηM=1, and η1<η2<...<ηM, based on examination power scale levelEach base station i ∈ N perform optimal user and dispatch plan
SlightlyAnd subcarrier is given into the most fast service user of the rate of information throughput,Represent that base station i ∈ N are taken
User's n rates of information throughput of business, then calculate each coordination base station k ∈ LtExamination power scale levelCorresponding value of utilityAnd enter step 6.2,
Step 6, transimission power and the renewal of user's scheduling strategy：
Step 6.1, equally distributed random number θ between random generation one [0,1], ifIt is then next
Timeslot power-levelsIt is updated to try power scale levelOtherwise, ifThen next timeslot power-levels are protected
Hold it is constant i.e.Whereinβ is a coefficient and β>0,To coordinate base station k ∈ Lt
Examination power scale levelCorresponding value of utility, after the completion of renewal, by all coordination base station k ∈ LtPriority reduce by 1 grade, no
Carry out interference coordination operation base station w ∈ N LtPriority keep constant, while new priority is reported to adjacent base station；
Then, each base station i ∈ N calculate the best user's scheduling scheme of next time slot based on the power level after renewalAnd subcarrier is given into rate of information throughput highest service user, whereinRepresent base station i ∈ N
The user n serviced next gap information transmission rate based on the power level after renewal, is transferred to step 7,
Step 6.2, each coordination base station k ∈ LtCompare all examination power scale level { η1Pk,max,η2Pk,max,...,ηMPk,maxCorresponding to value of utility size, choose transimission power of the power level as next time slot corresponding to highest value of utility,
After the completion of renewal, by all coordination base station k ∈ LtPriority reduce by 1 grade, without interference coordination operation base station w ∈ N Lt
Priority keep constant, while new priority is reported to adjacent base station；Then, each base station i ∈ N are calculated based on renewal
The best user's scheduling scheme of next time slot of power level afterwardsAnd subcarrier is given into information transfer speed
Rate highest service user, whereinRepresent the user n that are serviced of base station i ∈ N based under the power level after renewal
The one time slot rate of information throughput, is transferred to step 7,
Step 7, algorithm end condition judges：If algorithm performs reach maximum iteration T, algorithm terminates；Otherwise, t is made
=t+1 simultaneously goes to step 3.
It is of the invention significantly the advantages of be：1) present invention is a kind of distributed embodiment, and each base station is as independent
Individual, autonomous carry out computing and interference coordination Developing Tactics, it is not necessary to which the master controller of a wide area carries out centralized Control
And calculating, this distributed operation cause system architecture flattening, avoid the system crash brought by single point failure, system is more
Steadily and surely；2) local (local) information exchange is only needed, each base station only needs to carry out with adjacent base station during interference coordination
Necessary information exchange, because being connected between adjacent base station by wired optical fiber, the communication between them is very easy；3) divide
The embodiment of cloth shares arithmetic operation does distributed variable-frequencypump and calculating in each base station, each base station, has phase
Than in the lower computation complexity of centralized algorithm；4) in step 6, when iteration time slot t is not more than T/2, using Boltzmann
Probability updating rule (parameter beta is similar to the temperature parameter in simulated annealing), if the value of utility that examination power scale level obtains
More than value of utility corresponding to current power strategy, then next time slot will be used as using larger probability selection examination survey level by coordinating base station
Transimission power, deny with greater probability its power policy being kept constant.But that more preferable, poor plan of whichever strategy
Slightly still there is certain probability to be selected to, this may be such that local optimum is easily jumped out in each base station compared to greedy optimizing algorithm
Interference coordination strategy and the interference coordination strategy for finding global optimum, reach system and speed maximizes；5) in step 6, when repeatedly
When being not more than T/2 for time slot t, the Boltzmann probability updating rules of use make algorithm jump out locally optimal solution and search the overall situation
It is optimal；And when iteration time slot t is more than T/2, using optimal response policy update rule, the selection determined in each iteration is best
Strategy, convergence of algorithm speed can be accelerated.
Brief description of the drawings
Fig. 1 is the system model of the inventive method；
Fig. 2 is the flow chart of the inventive method；
Fig. 3 be the inventive method system and speed with algorithm iteration number change curve；
Fig. 4 be the inventive method system and speed with cooperation neighbor base stations number change curve；
Embodiment
Interference elimination method between a kind of distributing cell in orthogonal frequency-time multiple access network, it is characterised in that set：Repeatedly
For time slot t=1,2 ..., T (T is maximum iteration), useWithTransmission of the base station i in t iteration time slots is represented respectively
Power and user's scheduling strategy, i ∈ N, N={ 1,2 ..., N } represent collection of base stations, and N is total number of base,
Step 1, Initialize installation：Iteration time slot t is made equal to 1, its user's scheduling strategy of each Base station initialization, each base station
Subcarrier is randomly assigned to any one communication user of its service respectively, then, each base station random initializtion is respective
Transmit power, in addition, in order to determine the precedence of each base station policy update, different to the random setting one in each base station
Adjust priority λi, λiBase station i adjustment priority is represented,
Step 2, according to interference indexOrder from big to small, the B base stations to base station i interference effects maximum before taking Interference index for base station j to base station i interference effects, j ∈ N { i }, N { i } represent set
N and the difference set of set { i }, BiFor base station i interference neighbors set, index is disturbedCalculation formula beWherein CiThe communication user set of base station i services is represented, | Ci| represent communication user set CiIn member
Plain number, n ∈ CiAnd n be base station i service any one communication user sequence number, gj,nFor from base station j to communication user n's
Channel power gain, gi,nFor from base station i to communication user n channel power gain,
Step 3, respectively by the priority of each base station in the interference neighbors set of the priority of each base station and each base station
It is compared, if the priority of base station is higher than the priority of each base station in the interference neighbors set of base station, by the base station
It is classified as coordinating base station k ∈ Lt, LtCoordination base station k set is represented, carries out interference coordination processing；Otherwise, grasped without interference coordination
Make,
Step 4, each base station i ∈ N calculate its rate of information throughput in iteration time slot t using shannon formulaWherein W represents channel width, Represent t-th of iteration time slot
When base station i Signal to Interference plus Noise Ratio, N0For noise power, n ∈ CiThe user serviced by base station i, then calculate each coordination base station k
∈LtValue of utilityAnd Coordinate base station k ∈ LtInterference neighbors base station l ∈ BkInformation transfer speed
Rate and by its report give coordinate base station k, BkFor base station k interference neighbors set, it can be seen that by formula, each effect for coordinating base station
WithThe transmission rate sum of the transmission rate of its own and interference neighbors base station is defined as, therefore each coordination base station is in root
It can both consider its own when carrying out policy update according to its effectiveness, can also consider interference neighbors base station.Thus, the effectiveness design method
Embody the thought cooperated with each other, set BkSize embody the number of cooperation base station, and from step 2 | Bk|=B,
Step 5, power level examination is surveyed and corresponding value of utility calculates：
Step 5.1, in t≤T/2, each coordination base station k ∈ LtGeneral one examination of random selection such as the probability with 1/M is surveyed
Power level Here Pk,maxFor base station k maximum transmission power, M is power
The number of level, η1=0, ηM=1, and η1<η2<...<ηM, each base station i ∈ N, which are calculated, is based on examination power scale levelMost
Excellent user's scheduling strategyAnd subcarrier is given into rate of information throughput highest service user,Table
Show the user n that base station i ∈ N are serviced based on examination power scale levelThe rate of information throughput, then calculate each coordination base station k
∈LtExamination power scale levelCorresponding value of utilityAnd enter step 6.1,
Step 5.2, in t>In T/2, each coordination base station k ∈ LtAll power levels are surveyed in examination successivelyHere Pk,maxFor base station k maximum transmission power, M is the number of power level, η1
=0, ηM=1, and η1<η2<...<ηM, based on examination power scale levelEach base station i ∈ N perform optimal user and dispatch plan
SlightlyAnd subcarrier is given into the most fast service user of the rate of information throughput,Represent that base station i ∈ N are taken
User's n rates of information throughput of business, then calculate each coordination base station k ∈ LtExamination power scale levelCorresponding value of utilityAnd enter step 6.2,
Step 6, transimission power and the renewal of user's scheduling strategy：
Step 6.1, equally distributed random number θ between random generation one [0,1], ifIt is then next
Timeslot power-levelsIt is updated to try power scale levelOtherwise, ifThen next timeslot power-levels are protected
Hold it is constant i.e.Whereinβ is a coefficient and β>0,To coordinate base station k ∈ Lt
Examination power scale levelCorresponding value of utility, after the completion of renewal, by all coordination base station k ∈ LtPriority reduce by 1 grade, no
Carry out interference coordination operation base station w ∈ N LtPriority keep constant, while new priority is reported to adjacent base station；
Then, each base station i ∈ N calculate the best user's scheduling scheme of next time slot based on the power level after renewalAnd subcarrier is given into rate of information throughput highest service user, whereinRepresent base station i ∈ N
The user n serviced next gap information transmission rate based on the power level after renewal, is transferred to step 7,
Step 6.2, each coordination base station k ∈ LtCompare all examination power scale level { η1Pk,max,η2Pk,max,...,ηMPk,maxCorresponding to value of utility size, choose transimission power of the power level as next time slot corresponding to highest value of utility,
After the completion of renewal, by all coordination base station k ∈ LtPriority reduce by 1 grade, without interference coordination operation base station w ∈ N Lt
Priority keep constant, while new priority is reported to adjacent base station；Then, each base station i ∈ N are calculated based on renewal
The best user's scheduling scheme of next time slot of power level afterwardsAnd subcarrier is given into information transfer speed
Rate highest service user, whereinRepresent the user n that are serviced of base station i ∈ N based under the power level after renewal
The one time slot rate of information throughput, is transferred to step 7,
Step 7, algorithm end condition judges：If algorithm performs reach maximum iteration T, algorithm terminates；Otherwise, t is made
=t+1 simultaneously goes to step 3, in view of the interference index in step 2It is to evaluate base station j for the flat of the base station i all users serviced
Equal interference effect, interference coordination strategy change is not influenceed the interference relationships analysis in step 2 during by algorithm iteration, therefore
Iterative process is transferred to step 3 by step 7.
The present invention is described in further detail below in conjunction with the accompanying drawings.
Referring to Fig. 1, the inventive method system is provided with the OFDMA system of 49 cells, and each radius of society is set to 1000 meters,
Each center of housing estate is provided with a base station, and random distribution has 8 communication users in each cell.Band system band is divided into 16 sons
Channel, each a width of 200KHz of sub-channel.The maximum transmission power of base station46dBm is set to, and is distributed evenly over its son
On channel.Power level number is set to M=2,4,8.There is identical noise variance σ on each communication link2=-130dBm.
Channel gain model is hi=A/di α, wherein involved parameter is set to：A=0.097, α=3.The greatest iteration of algorithm
Number is set to 400.As Fig. 2, the implementation process of whole example are as follows：
Step 1, Initialize installation：Its subchannel (subcarrier) is randomly assigned to the logical of its service by t=1, each base station
Credit household, it need to ensure only to be taken by a communication user per sub-channels in each cell.Then, each base station of random initializtion
Transmit power on each sub-channels,Hereafter, assisted for all subchannels using following scheme
Adjust the transimission power and user's scheduling strategy between base station.Assuming that each sub-channels are completely orthogonal, therefore on each sub-channels
Interference coordination schemes be separate.In addition, in order to determine the precedence of each base station policy update, to each base station
One different coordination priority λ of setting at randomi∈ [1,2 ..., 49], i ∈ N, N are base station set.
Step 2, interference relationships analysis and interference neighbors set determine：By taking the i ∈ N of any one base station as an example, pass through calculating
Disturb indexCome evaluate other base station j ∈ N { i } to base station i interference effect, wherein N { i } represent set N with gathering
The difference set of { i }.Disturb indexCalculation formula beWherein CiRepresent cell i (base station i service area
Domain) in communication user set, | Ci| represent set CiIn element number, n ∈ CiFor a base station i service user, gj,n
For from base station j to user n channel power gain.WillArrange, obtain from big to smallWhereinRepresent the base station of the interference big to base station i generations b.More strongly disturbing preceding B base station will be produced to base station i and be defined as one
Interference neighbors set,
Step 3, the base station set L that can coordinate simultaneously is determined in a distributed fashiont, ensure mutually strongly disturbing adjacent base station
Interference coordination is asynchronously carried out, i.e.,AndSpecific implementation method is each base station i ∈ N ratios
Compared with the priority of its own and its adjacent base station BiPriority.Have if there is an adjacent base station than it higher preferential
Level, then the base station operates without interference coordination.Otherwise, interference coordination is carried out.
Step 4, each base station i ∈ N calculate its information rate in iteration time slot t using shannon formulaWherein W=200KHz represents channel width,Represent Signal to Interference plus Noise Ratio,
N0For noise power, n ∈ CiThe user serviced by base station i.Each coordination base station k ∈ LtPass through base station l ∈ B adjacent theretok's
Communication obtains its rate of information throughputAnd thus calculate value of utilityWherein BkIt is adjacent for base station k interference
Occupy set.It can be seen that by formula, each effectiveness for coordinating base stationIt is defined as the transmission rate of its own and interference neighbors base station
Transmission rate sum, therefore it is each coordination base station according to its effectiveness carry out policy update when can both consider its own, also can
Consider interference neighbors base station.Thus, the effectiveness design method embodies the thought cooperated with each other, set BkSize embody conjunction
Make the number of base station, and from step 2 | Bk|=B.
Step 5, power level examination is surveyed and corresponding value of utility calculates：
If 1) t≤T/2：Each coordination base station k ∈ LtGeneral one examination power scale level of random selection such as the probability with 1/MHereFor base station k maximum transmission power, M is power level
Number (being set to 2,4,8), η1=0, ηM=1, and η1<η2<...<ηM.Hereafter, based on examination power scale levelIt is each
Base station i ∈ N it is autonomous determine its optimal user's scheduling strategyWhereinRepresent user n be scheduled into
The information rate of row communication.Then, repeat step 4, each coordination base station k ∈ LtCalculate examination power scale levelCorresponding effectiveness
Value
If 2) t>T/2：Each coordination base station k ∈ LtAll power levels are surveyed in examination successively
HereFor base station k maximum transmission power, M is the number (being set to 2,4,8) of power level, η1=0, ηM
=1, and η1<η2<...<ηM.Hereafter, based on examination power scale levelEach base station i ∈ N it is autonomous determine its optimal use
Family scheduling strategyWhereinRepresent the scheduled information rates to be communicated of user n.Then, repeat to walk
Rapid 4, each coordination base station k ∈ LtCalculate examination power scale levelCorresponding value of utility
Step 6, transimission power and the renewal of user's scheduling strategy：
If 1) t>T/2：Each coordination base station k ∈ LtIt is lower for the moment that it is updated according to the following Boltzmann rule of probabilitys
The power level of gap
Whereinβ=t/10 is a positive parameter developed with iteration time,Represent next timeslot power-levelsIt is updated to try power scale levelProbability,Represent
Next timeslot power-levels keep constant probability.Equally distributed random number θ between random generation one [0,1], ifThen next timeslot power-levelsIt is updated to try power scale levelOtherwise, if
Then next timeslot power-levels holding is constant i.e.In addition, remaining non-coordinating base station w ∈ N LtIt is kept to launch work(
Rate is constant, i.e.,Then, its best user is recalculated based on the power level after renewal, each base station i ∈ N
Scheduling schemeWhereinRepresent the scheduled information rates to be communicated of user n.Completed in renewal
Afterwards, all coordination base station k ∈ LtReduce its priority (non-coordinating base station w ∈ N LtPriority keep constant), it is and its is preferential
Level, which is reported, gives its adjacent base station.
If 2) t>T/2：Each coordination base station k ∈ LtCompare all examination power scale level { η1Pk,max,η2Pk,max,...,ηMPk,maxCorresponding to value of utility size, choose transimission power of the power level as next time slot for obtaining highest value of utility, i.e.,
In addition, remaining non-coordinating base station w ∈ N LtKeep its transmission power constant, i.e.,Then, based on more
Power level after new, each base station i ∈ N recalculate its best user's scheduling schemeWhereinRepresent the scheduled information rates to be communicated of user n.After the completion of renewal, all coordination base station k ∈ LtIt is preferential to reduce its
Level (non-coordinating base station w ∈ N LtPriority keep constant), and its priority is reported and gives its adjacent base station.
Step 7, algorithm end condition judges：If algorithm performs reach maximum iteration T (T=400), algorithm terminates；
Otherwise, make t=t+1 and go to step 3.
Fig. 3 show the change curve of system of the invention and rate capability with algorithm iteration number.Depict and work as in figure
The change curve of inventive energy when number of power levels M is respectively 2,4,8 three kinds of schemes.For three kinds of schemes, specifically return
One change power level be respectively { 0,1 }, { 0,1/4,1/2,1 },From figure
As can be seen that the increase of the performance of several schemes all iterationses and improve, and algorithm is restrained after about 150 iteration.I
It is also found that when power level number is more, the performance that the present invention reaches is more excellent.Because more power level numbers
Corresponding to wider array of search solution space, and solution space when solution space during M=8 includes M=4, solution space during M=4 is again
Solution space during comprising M=2.In addition, simulation curve shows power level number by 2 to 4, system and speed have larger carry
Rise, level book further then is brought up into 8 will not bring very big raising.
Fig. 4 show the change curve of system of the invention and speed with cooperation neighbor base stations number B.Depict and work as in figure
The change curve of inventive energy when number of power levels M is respectively 2,4,8 three kinds of schemes.It can be seen that several sides
The performance of case all improves with the increase of cooperation neighbor base stations number.It can be appreciated that cooperation neighbor base stations number is more, interference association
The efficiency of tune is also higher, and the conflict brought each other by independent decision-making is also just smaller.But when cooperation number reaches 8, it is
System and rate capability no longer have a distinct increment.Because general (6-8) base station that only made a circle to week of single base station produce compared with
Big interference, therefore coordinate the neighbouring base station effect of surrounding than more significant.Also it correspond to preferably in addition, power level number is more more
Systematic function.
Claims (1)
1. interference elimination method between the distributing cell in a kind of orthogonal frequency-time multiple access network, it is characterised in that set：Iteration
Time slot t=1,2 ..., T, T be maximum iteration, useWithTransimission powers of the base station i in t iteration time slots is represented respectively
With user's scheduling strategy,Collection of base stations is represented, N is total number of base,
Step 1, Initialize installation：Iteration time slot t is made to be equal to 1, its user's scheduling strategy of each Base station initialization, each base station is distinguished
Subcarrier is randomly assigned to any one communication user of its service, then, each respective transmission of base station random initializtion
Power, a different adjustment priority λ is set at random to each base stationi, λiBase station i adjustment priority is represented,
Step 2, according to interference indexOrder from big to small, the B base stations to base station i interference effects maximum before taking Interference index for base station j to base station i interference effects, Represent set
Difference set with gathering { i },For base station i interference neighbors set, index is disturbedCalculation formula be
WhereinThe communication user set of base station i services is represented,Represent communication user setIn element number,And n is
The sequence number of any one communication user of base station i services, gj,nFor from base station j to communication user n channel power gain, gi,nFor
From base station i to communication user n channel power gain,
Step 3, the priority of each base station in the interference neighbors set of the priority of each base station and each base station is carried out respectively
Compare, if the base station is classified as by the priority of base station higher than the priority of each base station in the interference neighbors set of base station
Coordinate base station k, Coordination base station k set is represented, carries out interference coordination processing；Otherwise, grasped without interference coordination
Make,
Step 4, each base stationIts rate of information throughput in iteration time slot t is calculated using shannon formulaWherein W represents channel width, When representing t-th of iteration time slot
Base station i Signal to Interference plus Noise Ratio, N0For noise power,The user serviced by base station i, then calculate each coordination base stationValue of utilityAnd Coordinate base stationInterference neighbors base stationInformation transfer speed
Rate and by its report give coordinate base station k,For base station k interference neighbors set,
Step 5, power level examination is surveyed and corresponding value of utility calculates：
Step 5.1, in t≤T2, each coordination base stationGeneral one examination power scale electricity of random selection such as the probability with 1M
It is flat Here Pk,maxFor base station k maximum transmission power, M is power level
Number, η1=0, ηM=1, and η1＜ η2＜ ... ＜ ηM, each base stationCalculate based on examination power scale levelIt is optimal
User's scheduling strategyAnd subcarrier is given into rate of information throughput highest service user,Represent base
StandThe user n serviced based on examination power scale levelThe rate of information throughput, then calculate each coordination base station
Examination power scale levelCorresponding value of utilityAnd enter step 6.1,
Step 5.2, in t ＞ T2, each coordination base stationAll power levels are surveyed in examination successivelyHere Pk,maxFor base station k maximum transmission power, M is the number of power level, η1
=0, ηM=1, and η1＜ η2＜ ... ＜ ηM, based on examination power scale levelEach base stationOptimal user is performed to adjust
Degree strategyAnd subcarrier is given into the most fast service user of the rate of information throughput, whereinRepresent base stationThe user's n rates of information throughput serviced, then calculate each coordination base stationExamination power scale levelCorresponding effect
With valueAnd enter step 6.2,
Step 6, transimission power and the renewal of user's scheduling strategy：
Step 6.1, equally distributed random number θ between random generation one [0,1], ifThen next time slot work(
Rate levelIt is updated to try power scale levelOtherwise, ifThen next timeslot power-levels are kept constant
I.e.Whereinβ is a coefficient and β ＞ 0,To coordinate base stationExamination survey
Power levelCorresponding value of utility, after the completion of renewal, by all coordination base stationsPriority reduce by 1 grade, without dry
Disturb the base station of coordinated manipulationPriority keep constant, while new priority is reported to adjacent base station；Then,
Each base stationCalculate the best user's scheduling scheme of next time slot based on the power level after renewalAnd subcarrier is given into rate of information throughput highest service user, whereinRepresent base station
The user n serviced next gap information transmission rate based on the power level after renewal, is transferred to step 7,
Step 6.2, each coordination base stationCompare all examination power scale level { η1Pk,max,η2Pk,max,...,ηMPk,maxRight
The value of utility size answered, chooses transimission power of the power level corresponding to highest value of utility as next time slot, and renewal is completed
Afterwards, by all coordination base stationsPriority reduce by 1 grade, without interference coordination operate base stationIt is preferential
Level keeps constant, while new priority is reported to adjacent base station；Then, each base stationAfter calculating based on renewal
The best user's scheduling scheme of next time slot of power levelAnd subcarrier is given into the rate of information throughput most
High service user, whereinRepresent base stationThe user n serviced lower a period of time based on the power level after renewal
The gap rate of information throughput, is transferred to step 7,
Step 7, algorithm end condition judges：If algorithm performs reach maximum iteration T, algorithm terminates；Otherwise, t=t+1 is made
And go to step 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510096950.3A CN104660391B (en) | 2015-03-04 | 2015-03-04 | Interference elimination method between distributing cell in orthogonal frequency-time multiple access network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510096950.3A CN104660391B (en) | 2015-03-04 | 2015-03-04 | Interference elimination method between distributing cell in orthogonal frequency-time multiple access network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104660391A CN104660391A (en) | 2015-05-27 |
| CN104660391B true CN104660391B (en) | 2017-11-17 |
Family
ID=53251129
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510096950.3A Expired - Fee Related CN104660391B (en) | 2015-03-04 | 2015-03-04 | Interference elimination method between distributing cell in orthogonal frequency-time multiple access network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104660391B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108449150B (en) * | 2018-02-01 | 2022-06-28 | 中国电子科技集团公司电子科学研究院 | Satellite-ground interference coordination method, device and equipment based on radio map information |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101009541A (en) * | 2006-01-23 | 2007-08-01 | 华为技术有限公司 | Disturbance coordination method and device of OFDMA system |
| CN101155170A (en) * | 2006-09-28 | 2008-04-02 | 阿尔卡特朗讯 | Method for improving inter cell interference cancellation in an cellular radio communication system and corresponding base station and subscriber station |
| WO2008119216A1 (en) * | 2007-04-03 | 2008-10-09 | Zte Corporation | A common frequency interference suppression method in a wireless communication system |
| CN101810020A (en) * | 2007-09-28 | 2010-08-18 | 高通股份有限公司 | Scheduling based on effective target load with interference cancellation in a wireless communication system |
| CN102014507A (en) * | 2009-09-04 | 2011-04-13 | 普天信息技术研究院有限公司 | User uplink resource scheduling method in HSUPA system |
| CN102769861A (en) * | 2012-06-27 | 2012-11-07 | 华为技术有限公司 | User attribute determining method, inter-cell interference coordination method and base station |
-
2015
- 2015-03-04 CN CN201510096950.3A patent/CN104660391B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101009541A (en) * | 2006-01-23 | 2007-08-01 | 华为技术有限公司 | Disturbance coordination method and device of OFDMA system |
| CN101155170A (en) * | 2006-09-28 | 2008-04-02 | 阿尔卡特朗讯 | Method for improving inter cell interference cancellation in an cellular radio communication system and corresponding base station and subscriber station |
| WO2008119216A1 (en) * | 2007-04-03 | 2008-10-09 | Zte Corporation | A common frequency interference suppression method in a wireless communication system |
| CN101810020A (en) * | 2007-09-28 | 2010-08-18 | 高通股份有限公司 | Scheduling based on effective target load with interference cancellation in a wireless communication system |
| CN102014507A (en) * | 2009-09-04 | 2011-04-13 | 普天信息技术研究院有限公司 | User uplink resource scheduling method in HSUPA system |
| CN102769861A (en) * | 2012-06-27 | 2012-11-07 | 华为技术有限公司 | User attribute determining method, inter-cell interference coordination method and base station |
Non-Patent Citations (1)
| Title |
|---|
| OFDMA系统小区间干扰调度协调算法;付少忠;《西安电子科技大学学报》;20100228;第37卷(第1期);第8－12页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104660391A (en) | 2015-05-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | Joint downlink cell association and bandwidth allocation for wireless backhauling in two-tier HetNets with large-scale antenna arrays | |
| Hande et al. | Distributed uplink power control for optimal SIR assignment in cellular data networks | |
| JP5496203B2 (en) | Method for changing transmit power pattern in a multi-cell environment | |
| Hao et al. | On the energy and spectral efficiency tradeoff in massive MIMO-enabled HetNets with capacity-constrained backhaul links | |
| Weeraddana et al. | Multicell MISO downlink weighted sum-rate maximization: A distributed approach | |
| CN107613555A (en) | Non-orthogonal multiple accesses honeycomb and terminal direct connection dense network resource management-control method | |
| Ali et al. | Joint RRH-association, sub-channel assignment and power allocation in multi-tier 5G C-RANs | |
| Huang et al. | Joint spectrum and power allocation for multi-node cooperative wireless systems | |
| Abdelhakam et al. | A cooperation strategy based on bargaining game for fair user-centric clustering in cloud-RAN | |
| CN104412647B (en) | The method for being used to help solve the cluster optimization of the border issue in communication system | |
| Wang et al. | User association in non-orthogonal multiple access networks | |
| Gemici et al. | Resource allocation for NOMA downlink systems: Genetic algorithm approach | |
| Guo et al. | QoS-aware user grouping strategy for downlink multi-cell NOMA systems | |
| Sun et al. | Resource allocation for D2D communication using particle swarm optimization in LTE networks | |
| Hao et al. | Interference-aware resource optimization for device-to-device communications in 5G networks | |
| Zhang et al. | Dynamic user-centric clustering for uplink cooperation in multi-cell wireless networks | |
| CN106027214A (en) | Pilot distribution method of multi-cell large-scale MIMO system | |
| Hassan et al. | Joint throughput-power optimization of fog-RAN using rate-splitting multiple access and reinforcement-learning based user clustering | |
| Yin et al. | Decentralized federated reinforcement learning for user-centric dynamic TFDD control | |
| Azoulay et al. | Transmission power control using deep neural networks in TDMA-based ad-hoc network clusters | |
| Al-Obiedollah et al. | Self-sustainable multi-IRS-aided wireless powered hybrid TDMA-NOMA system | |
| Cai et al. | A joint game-theoretic interference coordination approach in uplink multi-cell OFDMA networks | |
| CN104660391B (en) | Interference elimination method between distributing cell in orthogonal frequency-time multiple access network | |
| CN105611640B (en) | A kind of adjustable CoMP downlink user dispatching method of equitable degree | |
| Li et al. | Reinforcement learning power control algorithm based on graph signal processing for ultra-dense mobile networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Cai Yueming Inventor after: Zheng Jianchao Inventor after: Lin Zhi Inventor after: Wu Dan Inventor after: Yang Wendong Inventor after: Qu Junyue Inventor before: Cai Yueming Inventor before: Zheng Jianchao Inventor before: Wu Dan Inventor before: Yang Wendong Inventor before: Qu Junyue |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: CAI YUEMING ZHENG JIANCHAO WU DAN YANG WENDONG QU JUNYUE TO: CAI YUEMING ZHENG JIANCHAO LIN ZHI WU DAN YANG WENDONG QU JUNYUE |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171117 Termination date: 20190304 |