CN105451319B - For realizing the maximized power optimization method of the sum of Weighted rate and its device - Google Patents
For realizing the maximized power optimization method of the sum of Weighted rate and its device Download PDFInfo
- Publication number
- CN105451319B CN105451319B CN201410381528.8A CN201410381528A CN105451319B CN 105451319 B CN105451319 B CN 105451319B CN 201410381528 A CN201410381528 A CN 201410381528A CN 105451319 B CN105451319 B CN 105451319B
- Authority
- CN
- China
- Prior art keywords
- rate
- allocation vector
- allocation
- value
- vector
- 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.)
- Active
Links
Abstract
The present invention relates to a kind of in a communications system for realizing the method and device thereof of the maximized distributed global power optimization of the sum of Weighted rate of inner link, the method includes the steps: A. determines allowable error value δ and comprising initial rate allocation vector z0Initial rate allocation vector set T0；B. the rate-allocation vector z is calculatedkIn justifiable rate region CrOn projection factor lambda (zk) and power allocation vector p (zk)；C. judge (1- λ (zk)) whether it is greater than the allowable error value δ: when being less than or equal to the allowable error value δ, p (zk) it is global optimal power contribution mode；When being greater than the allowable error value δ, a new rate-allocation set of vectors T is generatedk+1, and determine next rate-allocation vector zk+1, k=k+1 is enabled, and be again carried out step B；Wherein, by the initial rate allocation vector z0The polynary rectangular area [0, z of constructed rate-allocation0] it include the justifiable rate region Cr。
Description
Technical field
The invention mainly relates to fields of communication technology, and in particular, to one kind is in a communications system for realizing internal chain
The method of the maximized distributed global power optimization of the sum of the Weighted rate on road, and one kind is for realizing the sum of Weighted rate
Maximized power optimization transmitter installation and auxiliary device.
Background technique
Most of network optimization problem can be converted into the sum of Weighted rate about power optimization maximize (WRSM:
Weighted Rate Sum Maximization) the problem of, generally determine the final performance of network.In practice, it weights
Weighted factor in the sum of rate reflects the fairness of user, determines generally according to the priority of link or user.It should add
Weight factor is also possible to control determination by different upper layer algorithms, such as back pressure (back-pressure) algorithm.However,
The global optimization that WRSM problem is realized by distributed method is long-term outstanding question in interference and coupling network.
Complex jamming coupling between Radio Link causes reluctant non-convex optimization problem, in a manner of centralization very
Difficulty efficiently solves the problem.
One distributed global power optimization algorithm for realizing WRSM of the invention, is first and passes through
The scheme of distributed WRSM is realized in conjunction with monotone optimization method and non-linear Perron-Frobenius theory.Based on non-linear
Perron-Frobenius it is theoretical, it is proposed that a kind of distributed projection algorithm, which is to realize to manage from monotone optimization
By the key core step of outer polynary rectangular area (Polyblock) approach method developed.The distribution projection algorithm side
Case makes each link (user) that can independently generate the consistent polynary rectangular area constantly shunk, wherein this is polynary
The generation of rectangular area is only dependent upon the measurement result of local Signal to Interference plus Noise Ratio (SINR), therefore is easy in fact in practice
It is existing.The polynary rectangular area of the contraction can constantly approach the area of feasible solutions of non-convex link rate, and then we pass through in table
Show in the rate-allocation set of vectors for the polynary rectangular area approached the mode of (rather than in original region) search, to find out energy
Realize the power distribution mode of WRSM global optimization.In addition and it is apparent that well-designed projection algorithm shows geometry receipts
Characteristic is held back, will obviously accelerate the solving speed of WRSM by reducing computation complexity.
According to present inventors understand that, the existing scheme of global optimization for realizing WRSM is famous MAPEL algorithm.MAPEL
Works be published in 2009, and obtain IEEEMarconi Grand Prix in 2011.
MAPEL algorithm has attempted the General Theory by introducing monotone optimization for the first time to realize the global optimization of WRSM.It is special
Other, MAPEL is considered as the target effectiveness of WRSM the monotonic function of (1+SINR) about each link.MAPEL passes through building
The polynary rectangular area constantly shunk and vertex relevant to the polynary rectangular area based on (1+SINR) characterization
(vertex) (vertex is the vector about (1+SINR)), to use monotone optimization method, wherein (1+SINR) can by into
One step is converted to the linear fractional function about transmission power, is then converted into a linear fractional programming problem, and pass through
Dinkelbach-type algorithm calculates projection of the vertex on the area of feasible solutions about (1+SINR).
In MAPEL implementation process, kernel projection algorithm is realized, the projection based on multiplication linear fractional programming
Algorithm can only calculate implementation in central node, and central node needs to collect the status information of all channels.In addition,
Dinkelbach-type convergence speed of the algorithm is quotitent-super linear, and huge calculating is needed to spend.This two
A disadvantage hinders the practice of MAPEL.
It is different, one distributed monotone optimization method for realizing WRSM of the invention.We are adding
The target effectiveness of the sum of power rate is considered as the monotonic function about link rate, it may be assumed that log (1+SINR).The algorithm proposed is logical
Link rate is crossed to characterize the polynary rectangular area approached and its related top (rate-allocation vector), has thus developed one kind
New monotone optimization method.As core of the invention step, we propose with non-linear Perron-Frobenius theory
A kind of distributed method, for projection of the computation rate allocation vector on justifiable rate region.This is for projection process
Distributed Design, with only the respective local SINR information of link (user), and each link being capable of independent maintenance one
A identical polynary rectangular area of contraction, to realize distributed dull power optimization method, this method is able to achieve non-convex add
Weigh the global optimization of the sum of rate problem.Particularly, the projection algorithm proposed be it is convergent with geometric ways, have more
Estimated performance well, Dinkelbach-type algorithm used in the convergence property ratio MAPEL of the algorithm are more preferable.
Therefore, for WRSM problem, this programme is more convenient for practical realization, and is had distributed and low computing cost excellent
Good characteristic.
Summary of the invention
In order to solve the above-mentioned technical problem, it discloses according to an aspect of the present invention a kind of in a communications system for real
The method of the maximized distributed global power optimization of the sum of the Weighted rate of existing inner link, wherein in the communication system
Including M peripheral link and the L inner links, comprising steps of A. determines allowable error value δ and distributes comprising initial rate
Vector z0Initial rate allocation vector set T0, the initial rate allocation vector z0As rate-allocation vector zkJust
Initial value, the initial rate allocation vector set T0As rate-allocation set of vectors TkInitial value；B. the rate point is calculated
With vector zkIn justifiable rate region CrOn projection factor lambda (zk) and projection λ (zk)zkAnd correspond to the projection λ (zk)zk
Power allocation vector p (zk)；C. judge the rate-allocation vector zkWith the projection λ (zk)zkBetween normalized cumulant value
(1-λ(zk)) whether it is greater than the allowable error value δ: when being less than or equal to the allowable error value δ, implementation steps I: the speed
Rate allocation vector zkCorresponding power allocation vector p (zk) it is global optimal power contribution mode；Allow to miss when greater than described
When value of delta, implementation steps II: according to presently described projection factor lambda (zk), presently described rate-allocation vector zkWith it is presently described
Rate-allocation set of vectors TkGenerate a new rate-allocation set of vectors Tk+1, further according to the new rate-allocation vector
Set Tk+1Determine next rate-allocation vector zk+1, enable k=k+1 and be again carried out step B；Wherein, by the initial rate
Allocation vector z0The polynary rectangular area [0, z of constructed rate-allocation0] it include the justifiable rate region Cr。
Particularly, in step II, the new rate-allocation set of vectors Tk+1The polynary rectangle of constructed rate-allocation
Region is less than original rate-allocation set of vectors TkThe polynary rectangular area of constructed rate-allocation, and include it is described can
Row rate areas Cr.Specifically, the rate-allocation set of vectors TkThe polynary rectangular area of constructed rate-allocation can state
For the union of these following rectangular areas: [0, z] | z ∈ Tk}。
Particularly, specifically include in the step II: i. is according to the projection factor lambda (zk) and the rate-allocation vector
zkGenerate L new rate-allocation vectors；Present rate allocation vector set T is replaced with the L new rate-allocation vectorsk
In the rate-allocation vector zk, thus generate a new rate-allocation set of vectors Tk+1；Ii. from the new set
Tk+1It is middle to delete non-suitable rate-allocation vector；Iii. from the new set Tk+1In find out optimal bit allocation vector using as
Next rate-allocation vector zk+1。
Particularly, the step i further include: be calculated by the following formula and obtain the L new rate-allocation vector
Wherein, elIndicate the unit vector of only first of component non-zero,Indicate set of vectorsIn
L vector, k indicate the number of iterations, zkIndicate rate-allocation vector corresponding when the number of iterations is k, zK, lIndicate vector zk's
First of component.
Particularly, the non-appropriate speed allocation vector refers to each component both less than or equal to the new set Tk+1
In any one rate-allocation vector corresponding component rate-allocation vector.
Particularly, by following formula from the new set Tk+1In find out optimal bit allocation vector using as described
Next rate-allocation vector zk+1:
Wherein, ω is weighted value vector, and r corresponds to the new rate-allocation set of vectors Tk+1In any one
Rate-allocation vector.
Particularly, the step B is specifically included:
A. time slot t=0 is set, and at the beginning in gap, the internal transmitter of each inner link is respectively with any positive work
Rate value sends signal, wherein the performance number of the internal transmitter of the l articles inner link is p0, l；B. the inside of each inner link
Receiver measures local Signal to Interference plus Noise Ratio value respectively；C. dry make an uproar is believed respectively in the measured local by each internal receipt machine
Ratio feeds back to corresponding internal transmitter；D. each internal receipt machine is according to the rate-allocation vector zk
With the Signal to Interference plus Noise Ratio value, transmission power level of each internal transmitter in next time slot t+1 is calculated separately out, and
In next time slot t+1, each internal transmitter presses the transmission power level respectively and sends signal, wherein described the l articles
The internal transmitter of inner link is p in the performance number of next time slot t+1T+1, l；E. each outer in next time slot t+1
The external receiver of portion's link measures the interference general power from inner link respectively, and calculates separately and obtain each outside
The interference normalized value of link, wherein the interference normalized value for corresponding to the m articles peripheral link isF. exist
In next time slot t+1, each internal transmitter determines transmission power normalized value respectively, wherein corresponding in the l articles
The transmission power normalized value of portion's link isG. according to the interference normalized value
With the transmitting normalized valueEach internal transmitter calculates separately in next one time slot t+2
Transmission power level；And in next one time slot t+2, each internal transmitter is pressed the transmission power level respectively and is sent
Signal, wherein the internal transmitter of the l articles inner link is p in the performance number of next one time slot t+2T+2, l；H. again
In next time slot t+2, the internal receipt machine of each inner link measures local Signal to Interference plus Noise Ratio respectively, and judges in time slot t+
Whether the local Signal to Interference plus Noise Ratio in 2 converges to steady state value: if converging to steady state value, implementation steps j；If do not converged to
Steady state value then implementation steps c；J. according to the final convergent local dry ratio of letter, the internal transmitter point of each inner link
It does not calculate and the rate-allocation vector zkThe corresponding projection factor lambda (zk) and the power allocation vector p (zk)；Its
In, m=1,2 ..., M, l=1,2 ..., L.
It particularly, further include that each internal transmitter calculates described in acquisition according to the following formula respectively in step d
Transmission power level in next time slot t+1, wherein the internal transmitter of the l articles inner link is in next time slot t+
1 performance number pT+1, lAre as follows:
pt=[pT, 1 pT, 2 … pT, L]T
Wherein, SINRl(pt) indicate to obtain measured by the internal receipt machine of first of the inner link measured in current time slots t
The local Signal to Interference plus Noise Ratio arrived；zlIndicate the rate-allocation vector zkFirst of component；ptIndicate all internal transmitters
The vector that transmission power level in time slot t is constituted.
Particularly, further include in step e, in next time slot t+1, each external receiver respectively according to
Lower formula calculates the interference normalized value from inner link, wherein the interference normalization for corresponding to the m articles peripheral link
ValueFor
Wherein,It indicates in next time slot t+1, the external receiver of m-th of peripheral link is born
Total interference power values from inner link；Indicate can bear for the external receiver of m-th of peripheral link
The upper limit of jamming power.
Particularly, further include in step f, in next time slot t+1, each internal transmitter respectively according to
Lower formula, which calculates, determines the transmission power normalized value, wherein the transmission power normalizing for corresponding to the l articles inner link
Change valueFor
Wherein,Indicate the maximum transmission power limitation on the internal receipt machine of first of inner link.
It particularly, further include that each internal transmitter calculates described in acquisition according to the following formula respectively in step g
Transmission power level in next one time slot t+2, wherein the internal transmitter of the l articles inner link is in next one time slot
The performance number p of t+2T+2, lFor
It particularly, further include that the internal transmitter of each inner link calculates according to the following formula respectively in step j
With the rate-allocation vector zkThe corresponding projection factor lambda (zk) and the power allocation vector p (zk):
p(zk)=pt
Wherein, ptIndicate the transmitting of each internal transmitter when the local dry ratio of letter converges to steady state value
The vector that performance number is constituted.
It particularly, in step further include calculating obtain the initial sets T according to the following formula0:
T0={ b },
z0=b=[b1 b2 … bL], wherein
wM, lIt indicates in the external receiver from the internal transmitter of first of inner link to m-th of peripheral link
Channel gain, and wM+l, l=1 and as k ≠ l wM+k, l=0, wherein m=1,2 ..., M, l=1,2 ..., L.
Disclose one kind according to another aspect of the present invention for realizing the maximized power optimization of the sum of Weighted rate
Transmitter installation characterized by comprising power update module: its transmission power for being used to calculate and update transmitter；Power supply
Management module: it is used to calculate current transmission power and emission maximum function according to the update result that the power update module exports
The ratio of rate；Rate-allocation vector management module: it is used to determine and renewal rate allocation vector zk, calculate the rate-allocation
Vector zkIn justifiable rate region CrOn projection factor lambda (zk) and projection λ (zk)zk, according to the projection factor lambda (zk) and institute
State rate-allocation vector zkL new rate-allocation vectors are generated, replace present rate with the L new rate-allocation vectors
Allocation vector set TkIn the rate-allocation vector zkThus generate a new rate-allocation set of vectors Tk+1, from described
New set Tk+1It is middle to delete non-suitable rate-allocation vector and judge the rate-allocation vector zkWith the projection λ (zk)zk
Between normalized cumulant value (1- λ (zk)) whether it is greater than allowable error value δ.
Disclose one kind according to another aspect of the present invention for realizing the maximized power optimization of the sum of Weighted rate
Auxiliary device characterized by comprising normalized value receiving module: it is used to from the receiver of each peripheral link receive
Normalized value is interfered, and receives transmission power normalized value from the transmitter of each inner link；Maximum normalized value choosing
Select module: it is used to select maximum normalized value from the interference normalized value and the transmission power normalized value；Just
Initial set closes setting module, is used to set comprising initial rate allocation vector z0Initial sets T0；Sending module: its be used for
Maximum normalized value described in the transmitter broadcasts of each inner link and the initial sets T0。
The present invention devises the distributed global power optimization algorithm for WRSM, is first single by combining
Two kinds of theoretical advantages of tuning and non-linear Perron-Frobenius realize the scheme of distributed WRSM.Institute of the present invention
Disclosed scheme has the advantages that
Firstly, the algorithm proposed realizes the WRSM overall situation under multiple power constraints most by distributed way
Optimization aim.By the distributed projection algorithm proposed, the power optimization algorithm proposed can not be handed between each link
Distributed global power optimization is realized in the case where changing channel state information.
Secondly, proposing that the kernel projection algorithm of outer polynary rectangular area approximatioss has geometric convergence characteristic, therefore energy
Enough reduce computing cost.The complexity of projection algorithm is the bottleneck of outer polynary rectangular area approximatioss overall complexity.
Third, the algorithm proposed ensure the good backwards compatibility with current wireless system.In projection algorithm
The power renewal process used is similar to distributed power control mechanism, and the distributed power control mechanism is by as a standard
Technology is widely used in existing wireless system.Meanwhile the actual implementation of the algorithm proposed only relates to be similar to and commercially lead to
The measurement of local SINR in letter system, is easy to implement.
In short, all these advantages make existing business system towards the system of best WRSM and higher frequency spectrum efficiency
The road of upgrading becomes easy.
Detailed description of the invention
By the way that hereafter the embodiment in conjunction with shown by attached drawing is described in detail, above-mentioned and other features of the invention
It will be apparent from, the same or similar label indicates same or similar step in attached drawing of the present invention；
Fig. 1 shows the schematic diagram of distributed global power optimization system；
Fig. 2 shows the channel configuration schematic diagrames of distributed global power optimization system disclosed according to the present invention；
Fig. 3 shows the device mould group picture of distributed global power optimization system disclosed according to the present invention；
Fig. 4 shows the method flow diagram of distributed global power optimization system disclosed according to the present invention；
Fig. 5 shows the acquisition that is used for disclosed according to the present invention and projects factor lambda (zk) and power allocation vector p (zk)
Method flow diagram；
Fig. 6 shows the evolution schematic diagram of outer Approximate Sequence and the dependent projections factor；
Fig. 7 shows each circulation for algorithm 1, the computation complexity schematic diagram of algorithm 2；And
Fig. 8 shows the tradeoff schematic diagram of performance and complexity.
Specific embodiment
In the following detailed description of the preferred embodiment, reference is constituted to the appended attached drawing of present invention a part.Institute
Attached attached drawing, which has been illustrated by way of example, can be realized specific embodiment.Exemplary embodiment is not intended to
Exhaustive all embodiments according to the present invention.It should be noted that although described in the present invention with particular order has herein
The step of pass method, but this does not require that or implies must execute these operations or necessary in this particular order
It executes operation shown in whole and is just able to achieve desired as a result, on the contrary, step described herein can change and execute sequence.
Additionally or alternatively, it is convenient to omit multiple steps are merged into step and executed by certain steps, and/or by a step
It is decomposed into execution of multiple steps.
Fig. 1 shows the schematic diagram of a distributed global power optimization system.It includes L (labeled as 1,2 ..., L)
Inner link and M peripheral link (being labeled as 1,2 ..., M), unit 1-l and unit 2-l are respectively indicated in first of inner link
Internal transmitter and internal receipt machine, unit 1-l to unit 2-l send data-signal, wherein l=1,2 ..., L.Together
Sample, unit 3-m and unit 4-m respectively indicate external transmitter and external receiver on m-th of peripheral link, unit 3-m
Data-signal is sent to unit 4-m, wherein m=1,2 ..., M.The L inner link is to be overlapped shared mode public wireless
It is loaded in radio channel with transmission services, while the M peripheral link also shares the common radio channel in an overlapping manner.Cause
This, the transmission in inner link not only interferes with each other, but also can generate undesirable outside to the transmission on peripheral link
Interference.The peripheral link can be considered as primary link, and total interference of all active links on the primary link is expected to control
Under tolerable upper limit value.
It should be pointed out that the link in Fig. 1 can be considered to be the CDMA link of 3G system in practice, or
It is analogous to macro, micro- link based on cell isomery cellular system；Or the main and secondary links of cognitive radio system,
And or D2D system D2D link and cellular link.It is equally also suitable for ((going here and there similar to link cross jamming can occur
Disturb effect) ADSL system) wire communication.
It is usually controlled to total interference value caused by the external receiver of the m articles peripheral link in actual application
System is under specified tolerable standard, it may be assumed that wherein, plIndicate l
The transmission power of internal transmitter in inner link；It indicates to hold in the external receiver of the m articles peripheral link
The upper limit for the interference received；wM, lIt indicates from the internal transmitter of the l articles inner link to the external receiver of the m articles peripheral link
On channel gain.In addition, the transimission power of each internal transmitter is respective by its due to the power constraints of each transmitter
Maximum transmission power is limited.I.e.: wherein (l=1,2 ..., L) indicates the l articles inner link
The maximum transmission power of transmitter, then the area of feasible solutions of the power distribution of the system can indicate are as follows:
Wherein, wm=[wM, 1 wM, 2 … wM, L]T, (m=1,2 ..., M),
And wM+l(l=1,2 ..., L) isFirst of unit vector.The receiver of the l articles inner link is received
To SINR beL=1,2 ..., L
Wherein, nlIndicate the power of the ambient noise of the receiver of the l articles inner link, GlkIt indicates from kth link
Transmitter to the l articles link receiver channel gain.Channel gain covers such as path loss, shade and these physics that decline
The gross effect of factor.The transmission rate of link is calculated based on Shannon capacity formula.Therefore the justifiable rate region of network can be with
It is indicated by following formula:
Cr={ r (p)=[r1(p) r2(p) … rL(p)]T|rl(p)=log (1+SINRl(p)), p ∈ Cp, rl(p) it is
The transmission rate of the l articles inner link.
In practical application, it is intended to find the power distribution mode p of optimization*, which enables to
WRSM is realized in justifiable rate region.Mathematically, it is desirable to solve optimization problem below:
Wherein, ω=[ω1 ω2 … ωL]T, ωl> 0 indicates the priority weight factor of the l articles link.The priority weight factor passes through
Specific cross-layer or system design are to define.Without loss of generality, weight factor ωlIt is normalized to by settingIt can demonstrate,prove
Bright, WRSM problem is a non-convex optimization problem about transimission power p.Even if therefore in the mode of centralization, it is also difficult to
Effectively find out a global optimization scheme.
Particularly, due to ωTR (p) is about rl(p) monotonically increasing function can prove r (p*) must be positioned at it is feasible
Rate areas CrCoboundary.However CrIt is a non-convex set, and lacks closed type or explicit description, this makes it difficult to count
Calculate desired r (p*).Some traditional method such as tangent lines, which approach, is not particularly suited for this case.
To solve the above-mentioned problems, the present invention provides a kind of in a communications system for realizing the weighting speed of inner link
The method of the maximized distributed global power optimization of the sum of rate.The method of the recommendation has been merged non-by algorithm one and algorithm two
Linear Perron-Frobenius theory and existing monotone optimization method solve long-term pendent by distributed way
The problem of non-convex power optimization.
We introduce system architecture and apparatus module of the invention first.Fig. 2 shows institute according to the present invention is public
The channel configuration schematic diagram for the distributed global power optimization system opened.Wherein, the expression of unit 11 is used for transmission business load
Common radio channel, by the internal network being made of multiple inner links and the external network being made of multiple peripheral links
It shares in an overlapping manner, and therefore leads to interfering with each other between the two.Unit 12-l is indicated out of the l articles inner link
Portion's receiver to the l articles inner link internal transmitter feedback channel, which is specific to the l articles inner link simultaneously
For feeding back local Signal to Interference plus Noise Ratio (SINR), wherein l=1,2 ..., L.Unit 13 indicates dedicated auxiliary channel, in the channel
With for realizing the maximized power optimization auxiliary device 1300 of the sum of Weighted rate.
Fig. 3 shows the device mould group picture of distributed global power optimization system disclosed according to the present invention.For reality
Scheme disclosed in this invention is applied, which is furnished with following basic mould group:
Every inner link includes an internal transmitter 100 and an internal receipt machine 200.Every peripheral link includes
One external transmitter 300 and an external receiver 400.It include a power optimization auxiliary device in dedicated auxiliary channel
1300, it is in communication with each other with the transmitter of each inner link and the receiver of each peripheral link.
Power optimization auxiliary device 1300 includes normalized value receiving module 1301, maximum normalized value selecting module
1302, initial sets setting module 1303 and sending module 1304.
Normalized value receiving module 1301 is used to receive interference normalization from the external receiver 400 of each peripheral link
Value, and transmission power normalized value is received from the internal transmitter 100 of each inner link；Maximum normalized value selects mould
Block 1302 is for selecting maximum normalized value from the interference normalized value and the transmission power normalized value；Initial set
It includes initial rate allocation vector z that setting module 1303, which is closed, for setting0Initial sets T0；Sending module 1304 is used for institute
State maximum normalized value described in the transmitter broadcasts of each inner link and the initial sets T0。
Each internal transmitter 100 includes power amplifier module 105, power update module 106, rate-allocation arrow
Measure management module 107 and power management module 108.
Power amplifier module 105 is configured as adjusting internal transmitter according to the input value from power update module 106
Performance number.
Power update module 106 is configured as according to the maximum normalization obtained from power optimization auxiliary device 1300
It is worth, the local SINR measured in the output of rate-allocation vector management module 107 and internal receipt machine calculates the transmitting of transmitter
Power.Its transmission power value exported is input in power amplifier module 105 and power management module 108.
Rate-allocation vector management module 107 is configured as it and is used to determine simultaneously renewal rate allocation vector zk, calculate institute
State rate-allocation vector zkIn justifiable rate region CrOn projection factor lambda (zk) and projection λ (zk)zk, according to the projection factor
λ(zk) and the rate-allocation vector zkL new rate-allocation vectors are generated, are replaced with the L new rate-allocation vectors
Present rate allocation vector set TkIn the rate-allocation vector zkThus generate a new rate-allocation set of vectors
Tk+1, from the new set Tk+1It is middle to delete non-suitable rate-allocation vector and judge the rate-allocation vector zkWith it is described
Project λ (zk)zkBetween normalized cumulant value (1- λ (zk)) whether it is greater than allowable error value δ.
Power management module 108 is configured as based on its update result by being exported according to the power update module 106
Calculate the ratio of current transmission power and maximum transmission power.Wherein, the maximum transmission power refers to function of the transmitter because of power supply
Rate constrains and the maximum transmission power value that can be provided.
The internal receipt machine 200 of each inner link includes local Signal to Interference plus Noise Ratio measurement module 209, is used for base
In the signal estimation local Signal to Interference plus Noise Ratio received.
The external receiver 400 of each peripheral link includes interference normalized value measurement module 410, is used to survey
It measures suffered all interference power values in the external receiver 400 and it is converted into interference normalized value.
Below herein will be in conjunction with Fig. 3 and Fig. 4, one kind disclosed in specific introduction according to the present invention is used in a communications system
The method for realizing the maximized distributed global power optimization of the sum of Weighted rate of inner link.
This method passes through distributed outer polynary rectangular area (polyblock) approximatioss (algorithm one) mainly to solve
WRSM problem.In the method, the sequence for the outer polynary rectangular area constantly shunk iteratively generates, and finally receives
It holds back and approaches rate area of feasible solutions Cr, and solve global optimal r (p*).We construct polynary rectangular area S firstk, it includes can
Scanning frequency rate set Cr, it may be assumed thatSubstantially, polynary rectangular area SkIt can be with its suitable vertex, that is, rate-allocation vector
Set TkTo characterize.Specifically, SkIt is rate-allocation set of vectors TkThe polynary rectangular area of constructed rate-allocation can be with table
It states as the union of these following rectangular areas: [0, z] | z ∈ Tk}.The objective function ω of WRSMTR (wherein, r ∈ Sk) polynary
Rectangular area SkOn maximum value necessarily correspond to objective function in SkAssociated rate-allocation set of vectors TkOn i.e.: zk∈Tk,
WhereinIf rate-allocation vector zkIt is placed exactly in justifiable rate set Cr
On, then solution, that is, r (p the problem of available WRSM*)=zk.If rate-allocation vector zkNot in justifiable rate collection
Close CrOn, it would be desirable to generate smaller polynary rectangular areaSo that Sk+1It still include CrAnd eliminate rate point
With vector zk, it may be assumed that pass through the rate-allocation vectors new with LTo substitute original TkIn zkIt is new to construct
Rate-allocation set of vectors Tk+1。
Specifically, new rate-allocation vector can be expressed as formula:Wherein,
zK, lIndicate zkFirst of component；elIndicate the unit vector of only first of component non-zero；λ(zk) it is zkIn CrOn the projection factor,
That is: λ (zk)=max α | α zk∈CR}.That is λ (zk)zkIt is zkIn CrOn projection, it may be assumed that the subpoint is penetrated from origin
To zkRay and CrCoboundary crosspoint.In addition, in new rate-allocation set of vectors Tk+1In non-appropriate speed point
It should be removed with vector to accelerate the calculating speed of algorithm.
It is constantly repeated the above process by way of iteration until an optimal solution can be found out.The iterative process generates one
It is a constantly shrinking and include CrPolynary rectangular area sequence, i.e.,Therefore, it can demonstrate,prove
It is bright: ωTzk> ωTzk+1> ωTzk+2> ... > ωTr(p*)。zkIt is optimization rate-allocation vector, which makes
ωTR is in r ∈ TkUnder the conditions of it is maximum.SkIt is the outer polynary rectangular area approached, and it converges to C as k → ∞rOn, i.e.,It means that λ (z∞)=1 and z∞It is CrOn point, andAs the present invention
The algorithm two of core be used in a distributed fashion calculate and acquisition meets r (p (zk))=λ (zk)zkP (zk)。
In actual implementation process, we set an allowable error value δ, and work as 1- λ (zkWhen)≤δ, it is believed that zk∈
CR, wherein δ is the positive number of a very little.For the complexity of algorithm, as allowable error value δ=0, when the convergence of algorithm one
Between be unlimited, however can prove that, as δ > 0, algorithm is restrained in limited step for a moment, and can obtain and meet formulaThe feasible solution for approaching optimal value.
We are by example to introduce algorithm one and algorithm two in more detail below.Referring to fig. 4, algorithm one passes through following step
It is rapid to realize:
In step 410, the initial sets setting module in power optimization auxiliary device is the inside of each inner link
Transmitter determines to include initial rate allocation vector z0Initial rate allocation vector set T0, the transmitter of each inner link
The number of iterations k be set as 0, and set allowable error value δ.Wherein, by the initial rate allocation vector z0Constructed speed
Rate distributes polynary rectangular area [0, z0] it include the justifiable rate region Cr。
In a preferred embodiment, the power management module 108 in the internal transmitter of each inner link is to first
Initial set closes the maximum transmission power value that setting module sends respective internal transmitterThe external receiver of each peripheral link
It is fed back to the initial sets setting moduleWherein, l=1,2 ..., L.Then the initial sets setting module is according to following
Formula calculates initial rate allocation vector set T0。
Wherein, T0={ b }, z0=b=[b1 b2 … bL]。
Then the sending module in power optimization auxiliary device is sent to each internal transmitter by way of broadcast and is somebody's turn to do
Initial rate allocation vector set T0, each internal transmitter includes initial rate allocation vector z this0Initial rate distribution
Set of vectors T0It is input in rate-allocation vector management module 107.
At step 420, the rate-allocation vector management module 107 in the internal transmitter of each inner link is to be distributed
The mode of formula calculates λ (z according to algorithm two respectivelyk) and p (zk) value.In the initial state, rate-allocation vector zkIt is
z0, λ (zk) and p (zk) it is respectively λ (z0) and p (z0)。
In step 430, the rate-allocation vector management module 107 judges the rate-allocation vector zkWith it is described
Project λ (zk)zkBetween normalized cumulant value (1- λ (zk)) whether it is greater than the allowable error value δ: as normalization distance value (1- λ
(zk)) when being less than or equal to the allowable error value δ, then implementation steps 440: the rate-allocation vector zkCorresponding power
Allocation vector p (zk) as global optimal power contribution mode；As normalization distance value (1- λ (zk)) it is greater than the allowable error
When value δ, then implementation steps 431-433 is to obtain next (newly) rate-allocation vector zk+1, then make k=k+1, it may be assumed that more
New the number of iterations, and it is again carried out step 420 and 430, correspond to next (newly) rate-allocation vector z to confirmk(1-
λ(zk)) whether it is greater than the allowable error value δ.The circulation will be repeated until finding an allocation vector zk, institute it is right
Normalized cumulant value (1- λ (the z answeredk)) it is less than or equal to the allowable error value δ.
In step 431, rate-allocation vector management module 107 is according to projection factor lambda (zk) and rate-allocation vector zkIt is raw
At L new rate-allocation vectors；And present rate allocation vector set T is replaced with the L new rate-allocation vectorskIn
The rate-allocation vector zk, thus generate a new rate-allocation set of vectors Tk+1；Wherein, the L new rates
Allocation vectorIt is calculated by the following formula acquisition:
Wherein, elIndicate the unit vector of only first of component non-zero,It indicatesIn first of element,
K indicates the number of iterations, zkIndicate rate-allocation vector corresponding when the number of iterations is k.
In step 432, rate-allocation vector management module 107 is from the new set Tk+1It is middle to delete non-suitable rate
Allocation vector, wherein the non-appropriate speed allocation vector refers to each component both less than or equal to the new set Tk+1In
The rate-allocation vector of the corresponding component of any one rate-allocation vector, it may be assumed that Tk+1In there is no v andSo thatAnd on component direction
In step 433, rate-allocation vector management module 107 passes through following formula from the new set Tk+1In look for
Optimal bit allocation vector is using as next rate-allocation vector z outk+1:Wherein, ω
It is weighted value vector, r corresponds to the new rate-allocation set of vectors Tk+1In any one rate-allocation vector.It
Afterwards, k=k+1 is enabled, it may be assumed that the number of iterations adds 1, to substitute original the number of iterations.
The rate-allocation vector management module 107 is calculated according to algorithm two at step 420 corresponds to new obtain
Zkλ (zk) and p (zk) value, and judge normalized cumulant value (1- λ (z again in step 430k)) whether greater than described
Allowable error value δ meets 1- λ (z until finding outkThe z of)≤δk。
In step 440, meet 1- λ (z when finding outkThe z of)≤δkLater, with the zkCorresponding power allocation vector p
(zk) it is global optimal power contribution mode.
The effect of algorithm two is according to rate-allocation vector zk, calculate in justifiable rate region CrOn projection factor lambda (zk)
With projection λ (zk)zkAnd correspond to the projection λ (zk)zkPower allocation vector p (zk), referring to Fig. 5, algorithm two by with
Lower step is realized:
In step 510, the internal transmitter of each inner link sets time slot t=0, and at the beginning in gap, each
The internal transmitter of inner link sends signal respectively with any positive value, wherein the internal transmitter of the l articles inner link
Performance number be p0, l, p0, l> 0.
In step 512, the local letter drying in the internal receipt machine of each inner link is surveyed respectively than measurement module 209
Measure local Signal to Interference plus Noise Ratio value SINRl(pt), and fed back in corresponding internal transmitter by unit 12-l, wherein pt=
[pT, 1 pT, 2 … pT, L]T, ptIndicate the vector that transmission power level of all internal transmitters in time slot t is constituted.T table
Show current time slot.
In step 522, the power update module 106 in each internal receipt machine is sweared according to the rate-allocation respectively
Measure zkWith the Signal to Interference plus Noise Ratio value, each internal transmitter is calculated in next time slot) transmission power level in (t+1),
And in next time slot (t+1), so that the power amplifier module 105 of each internal transmitter presses the transmitting function respectively
Rate value sends signal, wherein the internal transmitter of the l articles inner link is in the performance number of next time slot (t+1)
pT+1, l；It can be calculated by following formula:
pt=[pT, 1 pT, 2 … pT, L]T
Wherein, SINRl(pt) indicate to obtain measured by the internal receipt machine of first of the inner link measured in current time slots t
The local Signal to Interference plus Noise Ratio arrived；zlIndicate the rate-allocation vector zkFirst of component.
Interference normalizing in step 523, in next time slot (t+1), in the external receiver of each peripheral link
Change value measurement module 410 measures the interference general power from inner link respectively, and described each by calculating acquisition respectively
The interference normalized value of peripheral link, each external receiver interference normalized value obtained can indicate are as follows:
Wherein, it indicates when described next
In gap (t+1), total interference power values from inner link that the external receiver of m-th of peripheral link is born, the value
It can be directly obtained by measurement；Indicate the jamming power that can bear of the external receiver of m-th of peripheral link
The upper limit.
In addition, the power management module 108 in next time slot (t+1), in the internal transmitter of each inner link
The transmission power normalized value of each internal transmitter is determined respectively, which can indicate are as follows:Wherein, indicate that the inside of first of inner link connects
Maximum transmission power value on receipts machine.
Then, the interference normalized value and transmission power normalized value can all be sent to power optimization auxiliary device
Normalized value receiving module in 1300.
In step 524, the maximum normalized value selecting module in power optimization auxiliary device 1300, from received
Interfere normalized valueWith received transmitting normalized valueIn, pick out maximum
Normalized valueAnd it is broadcast to the update of the power in the internal transmitter of each inner link
Module 106.The power update module 106 of each internal transmitter calculates next one time slot (t according to the following formula respectively
+ 2) transmission power level in:
Then power update module 106 is this
Transmission power level is sent to power amplifier module 105, so that power amplifier module 105 is sent by the transmission power level respectively
Signal.
In step 530, in next one time slot (t+2), the internal receipt machine of each inner link measures this respectively
Ground Signal to Interference plus Noise Ratio, and judge the local Signal to Interference plus Noise Ratio SINR in the time slot (t+2)l(t+2) whether steady state value is converged to: if
Steady state value is converged to, then implementation steps 540；If not converging to steady state value, t=t+2 is set, and be back to step 522,
To repeat implementation steps 522-524, until local Signal to Interference plus Noise Ratio converges to steady state value.
In step 540, the rate-allocation vector management module 107 in the internal transmitter of each inner link distinguishes base
In the convergent local Signal to Interference plus Noise Ratio received from 12-l unit, it is calculated by the following formula acquisition projection factor lambda (zk) and function
Rate allocation vector p (zk):
p(zk)=pt。
Wherein, ptIndicate the transmitting of each internal transmitter when the local dry ratio of letter converges to steady state value
The vector that performance number is constituted.
Next, we will assess distributed global power proposed by the invention by simulation result and theoretical proof
The performance of optimization algorithm.Conclusion one is to prove computation complexity and precision of the invention, and conclusion two is to pass through theoretical proof
The convergence and superiority of algorithm one and algorithm two.
1. simulating, verifying:
In order to compared with MAPEL algorithm and verify the Global Optimality of method proposed by the invention.We by with
Identical example disclosed in MAPEL illustrates the effect of distributed algorithm proposed by the invention.We emulate 4 links
Network, channel gain matrix is as follows:
The maximum transmission power of its each link is set to 0.7,0.8,0.9 and 1.0mW, the noise power of all links
For 0.1 μ W, preferential weighted factor is respectively ω=[1/6 1/6 1/3 1/3].
Fig. 6 is shown in an iterative process, the differentiation of outer Approximate Sequence and the dependent projections factor.Which show one by calculating
The Approximate Sequence for the monotone decreasing that method one generatesThe sequence converges 4.65598582521068 bps/Hz, should
Calculated result is consistent with MAPEL algorithm, and which show global optimum's characteristics of distributed schemes proposed by the invention.Meanwhile
Project factor sequenceConverge 1.It was noticed thatIt will not successively decrease, this is also in fig. 8
It is confirmed.Fig. 7, which is shown, to be required to calculateAlgorithm two have very little computing cost, this is because
Algorithm two has geometric convergence rate.
Fig. 8 shows the sum of the achievable Weighted rate obtained from algorithm one, required the number of iterations with allow to miss
The relational graph of value of delta.It proves that the performance of algorithm can be improved by reducing δ.This is also by conclusion one with theory
Mode is predicted.Moreover, the performance of algorithm is for the δ value and insensitive, as δ=0.01, we can obtain Weighted rate
The sum of be 4.65323242663538 bps/Hz, this and optimal value deviation 0.059137%.This illustrates the property obtained from conclusion one
Energy boundary is very loose, and actual performance may be more preferable than the boundary.It is obvious that parameter δ provides one in algorithm
The adjusting knob of various balances is realized between performance and convergence time.
2. theoretical validation
To draw a conclusion for explaining that allowable error value δ influences the performance of algorithm 1.
Conclusion one:
If at that time, algorithm 1 is in kth*Terminate when secondary iteration, then obtain the result is that
For the optimal case for the WRSM problem having.That is:
Prove: if at that time, algorithm 1 terminate, we it can be concluded that
Wherein, first inequality can be converted into
It considersWe obtain
And we can obtain
Therefore,
Proof finishes.
Conclusion two (convergence property of algorithm two): λ (z)=max when algorithm two converges to optimal case α | α z ∈ CR, r
(p (z))=λ (z) z.In addition, rate of convergence is geometry.
It proves: in α z ∈ CRThe maximum value of α under constraint can indicate are as follows:
It is equivalent to
In addition, setting up since r (α p) > r (p) is permanent as α > 1, it is easy to prove that optimal solution p (z) must satisfy
Therefore Z is in CrOn On The Projection can be converted into nonlinear condition flag value problem:
Wherein, ψ (p)=[ψ1(p) ψ2(p) …ψL(p)]T, wherein
Non-linear Perron-Frobenius theory is it has been proved that the fixed point p (z) for meeting above-mentioned condition can pass through pT+1, l
=ψl(pt) (l=1,2 ..., L) primary iteration, andIt obtains,
In addition, ptP (z) is converged to geometry rate,
Proof finishes.
It is obvious to a person skilled in the art that invention is not limited to the details of the above exemplary embodiments, Er Qie
In the case where without departing substantially from spirit or essential attributes of the invention, the present invention can be realized in other specific forms.Therefore, no matter
How from the point of view of, the present embodiments are to be considered as illustrative and not restrictive.In addition, it will be evident that one word of " comprising " not
Exclude other elements and steps, and wording "one" be not excluded for plural number.The multiple element stated in device claim can also
To be implemented by one element.The first, the second equal words are used to indicate names, and are not indicated any particular order.
Claims (14)
1. a kind of excellent for realizing the maximized distributed global power of the sum of Weighted rate of inner link in a communications system
The method of change, wherein including M peripheral link and the L inner links in the communication system, comprising steps of
A. it determines allowable error value δ and includes initial rate allocation vector z0Initial rate allocation vector set T0, described first
Beginning rate-allocation vector z0As rate-allocation vector zkInitial value, the initial rate allocation vector set T0As rate
Allocation vector set TkInitial value；
B. the rate-allocation vector z is calculatedkIn justifiable rate region CrOn projection factor lambda (zk) and projection λ (zk)zkAnd
Corresponding to the projection λ (zk)zkPower allocation vector p (zk)；
C. judge the rate-allocation vector zkWith the projection λ (zk)zkBetween normalized cumulant value (1- λ (zk)) whether be greater than
The allowable error value δ:
When being less than or equal to the allowable error value δ, implementation steps I: the rate-allocation vector zkCorresponding power distribution arrow
Measure p (zk) it is global optimal power contribution mode；
When being greater than the allowable error value δ, implementation steps II: according to presently described projection factor lambda (zk), presently described rate
Allocation vector zkWith presently described rate-allocation set of vectors TkGenerate a new rate-allocation set of vectors Tk+1, further according to institute
State new rate-allocation set of vectors Tk+1Determine next rate-allocation vector zk+1, enable k=k+1 and be again carried out step B；
Wherein, by the initial rate allocation vector z0The polynary rectangular area [0, z of constructed rate-allocation0] can comprising described in
Row rate areas Cr。
2. according to the method described in claim 1, wherein, in step II,
The new rate-allocation set of vectors Tk+1The polynary rectangular area of constructed rate-allocation is less than original rate
Allocation vector set TkThe polynary rectangular area of constructed rate-allocation, and include the justifiable rate region Cr。
3. according to the method described in claim 2, wherein, being specifically included in the step II:
I. according to the projection factor lambda (zk) and the rate-allocation vector zkGenerate L new rate-allocation vectors；With the L
A new rate-allocation vector replaces present rate allocation vector set TkIn the rate-allocation vector zk, thus generate one
A new rate-allocation set of vectors Tk+1；
Ii. from the new set Tk+1It is middle to delete non-suitable rate-allocation vector, wherein the non-suitable rate-allocation vector
Refer to each component both less than or equal to the new set Tk+1In any one rate-allocation vector corresponding component
Rate-allocation vector；
Iii. from the new set Tk+1In find out optimal bit allocation vector using as next rate-allocation vector
zk+1。
4. according to the method described in claim 3, wherein, the step i further include: be calculated by the following formula and obtain the L
A new rate-allocation vector
Wherein, elIndicate the unit vector of only first of component non-zero,Indicate set of vectorsIn first
Vector, k indicate the number of iterations, zkIndicate rate-allocation vector corresponding when the number of iterations is k, zk,lIndicate vector zkL
A component.
5. according to the method described in claim 3, wherein, by following formula from the new set Tk+1In find out optimal speed
Rate allocation vector is using as next rate-allocation vector zk+1:
Wherein, ω is weighted value vector, and r corresponds to the new rate-allocation set of vectors Tk+1In any one rate
Allocation vector.
6. method according to claim 1, wherein the step B is specifically included:
A. time slot t=0 is set, and at the beginning in gap, the internal transmitter of each inner link is respectively with any positive value
Signal is sent, wherein the performance number of the internal transmitter of the l articles inner link is p0,l；
B. the internal receipt machine of each inner link measures local Signal to Interference plus Noise Ratio value respectively；
C. each internal receipt machine respectively feeds back to the measured local Signal to Interference plus Noise Ratio value corresponding described
Internal transmitter；
D. each internal receipt machine is according to the rate-allocation vector zkWith the Signal to Interference plus Noise Ratio value, calculate separately out each
Transmission power level of the internal transmitter in next time slot t+1, and in next time slot t+1, each internal hair
It penetrates machine and sends signal by the transmission power level respectively, wherein the internal transmitter of the l articles inner link is when next
The performance number of gap t+1 is pt+1,l；
E. in next time slot t+1, it is total that the external receiver of each peripheral link measures the interference from inner link respectively
Power, and the interference normalized value for obtaining each peripheral link is calculated separately, wherein corresponding to the dry of the m articles peripheral link
Disturbing normalized value is
F. in next time slot t+1, each internal transmitter determines transmission power normalized value respectively, wherein corresponding to
The transmission power normalized value of the l articles inner link is
G. according to the interference normalized valueWith the transmitting normalized valueIt is each
The internal transmitter calculates separately the transmission power level in next one time slot t+2；And in next one time slot t+2, respectively
A internal transmitter presses the transmission power level respectively and sends signal, wherein the internal emission of the l articles inner link
Machine is p in the performance number of next one time slot t+2t+2,l；
H. in next one time slot t+2, the internal receipt machine of each inner link measures local Signal to Interference plus Noise Ratio respectively, and judges
Whether the local Signal to Interference plus Noise Ratio in time slot t+2 converges to steady state value: if converging to steady state value, implementation steps i；If
Steady state value then implementation steps c is not converged to；
I. according to the final convergent local Signal to Interference plus Noise Ratio, the internal transmitter of each inner link calculate separately out with it is described
Rate-allocation vector zkThe corresponding projection factor lambda (zk) and the power allocation vector p (zk)；
Wherein, m=1,2 ..., M, l=1,2 ..., L.
7. method according to claim 6, wherein further include that each internal transmitter distinguishes root in step d
It is calculated according to following formula and obtains the transmission power level in next time slot t+1, wherein the l articles inner link is interior
Performance number p of portion's transmitter in next time slot t+1t+1,lAre as follows:
pt=[pt,1 pt,2 … pt,L]T,
Wherein, SINRl(pt) indicate to obtain measured by the internal receipt machine of first of inner link measured in current time slots t
Local Signal to Interference plus Noise Ratio；zlIndicate the rate-allocation vector zkFirst of component；ptIndicate all internal transmitters when
The vector that transmission power level in gap t is constituted.
8. method according to claim 6, wherein further include in step e, in next time slot t+1, Ge Gesuo
It states external receiver and calculates the interference normalized value from inner link according to the following formula respectively, wherein described correspond to m
The interference normalized value of peripheral linkFor
Wherein,It indicates in next time slot t+1, what the external receiver of m-th of peripheral link was born comes
From total interference power values of inner link；Indicate the interference that can bear of the external receiver of m-th of peripheral link
The upper limit of power.
9. method according to claim 6, wherein further include in step f, in next time slot t+1, Ge Gesuo
It states internal transmitter and calculates the determining transmission power normalized value according to the following formula respectively, wherein described correspond to the l articles
The transmission power normalized value of inner linkFor
Wherein,Indicate the maximum transmission power limitation on the internal receipt machine of first of inner link.
10. method according to claim 6, wherein further include each internal transmitter difference in step g
The transmission power level obtained in next one time slot t+2 is calculated according to the following formula, wherein the l articles inner link
Performance number p of the internal transmitter in next one time slot t+2t+2,lFor
11. method according to claim 6, wherein further include the inside of each inner link in step i
Transmitter calculates and the rate-allocation vector z according to the following formula respectivelykThe corresponding projection factor lambda (zk) and the power
Allocation vector p (zk):
p(zk)=pt,
Wherein, ptIt indicates when the local Signal to Interference plus Noise Ratio converges to steady state value, the transmission power level of each internal transmitter
The vector constituted.
12. method according to claim 1, wherein in step further include calculating obtain institute according to the following formula
State initial sets T0:
T0={ b },
z0=b=[b1 b2 … bL], wherein
wm,lIndicate the channel in the external receiver from the internal transmitter of first of inner link to m-th of peripheral link
Gain, and wM+l,l=1 and as k ≠ l wM+k,l=0, wherein m=1,2 ..., M, l=1,2 ..., L,Indicate the m
The upper limit of the jamming power that can bear of the external receiver of a peripheral link, GllIndicate from the transmitter of the l articles link to
The channel gain of the receiver of the l articles link.
13. a kind of for realizing the maximized power optimization transmitter installation of the sum of Weighted rate characterized by comprising
Power update module: its transmission power for being used to calculate and update transmitter；
Power management module: its be used for according to the power update module export update result calculate current transmission power with most
The ratio of big transmission power；
Rate-allocation vector management module: it is used to determine and renewal rate allocation vector zk, calculate the rate-allocation vector zk
In justifiable rate region CrOn projection factor lambda (zk) and projection λ (zk)zk, according to the projection factor lambda (zk) and the rate
Allocation vector zkL new rate-allocation vectors are generated, replace present rate distribution arrow with the L new rate-allocation vectors
Duration set TkIn the rate-allocation vector zkThus generate a new rate-allocation set of vectors Tk+1, from the new collection
Close Tk+1It is middle to delete non-suitable rate-allocation vector and judge the rate-allocation vector zkWith the projection λ (zk)zkBetween return
One changes distance value (1- λ (zk)) whether it is greater than allowable error value δ.
14. a kind of for realizing the maximized power optimization auxiliary device of the sum of Weighted rate characterized by comprising
Normalized value receiving module: it is used to receive interference normalized value from the receiver of each peripheral link, and from each
Transmission power normalized value is received in the transmitter of a inner link；
Maximum normalized value selecting module: it is used to from the interference normalized value and the transmission power normalized value select
Maximum normalized value；
Initial sets setting module is used to set comprising initial rate allocation vector z0Initial sets T0；
Sending module: it is used for maximum normalized value described in the transmitter broadcasts to each inner link and described initial
Set T0。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410381528.8A CN105451319B (en) | 2014-08-05 | 2014-08-05 | For realizing the maximized power optimization method of the sum of Weighted rate and its device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410381528.8A CN105451319B (en) | 2014-08-05 | 2014-08-05 | For realizing the maximized power optimization method of the sum of Weighted rate and its device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105451319A CN105451319A (en) | 2016-03-30 |
| CN105451319B true CN105451319B (en) | 2018-12-21 |
Family
ID=55560991
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410381528.8A Active CN105451319B (en) | 2014-08-05 | 2014-08-05 | For realizing the maximized power optimization method of the sum of Weighted rate and its device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105451319B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107968761A (en) * | 2017-11-28 | 2018-04-27 | 桂林理工大学 | A kind of amplitude limit-projecting method for reducing peak-to-average power ratio |
| CN108235383B (en) * | 2017-12-01 | 2021-06-15 | 南京航空航天大学 | Distributed energy control-based multi-mobile-operator rate allocation method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101674118A (en) * | 2008-09-12 | 2010-03-17 | 上海交通大学 | Weighted rate and maximization-based low-complexity multi-user MIMO scheduling algorithm and device |
| CN102469597A (en) * | 2010-11-17 | 2012-05-23 | 株式会社Ntt都科摩 | Apparatus and method for allocating resources to nodes in a communication system using an update of iteration resource weights |
| CN102905320A (en) * | 2012-09-24 | 2013-01-30 | 上海交通大学 | Monotone optimization method for maximizing multi-cell downlink weighting and rate |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7778598B2 (en) * | 2007-01-22 | 2010-08-17 | Mitsubishi Electric Research Laboratories, Inc. | Asymmetric cooperation in downlink cellular networks with relay stations |
-
2014
- 2014-08-05 CN CN201410381528.8A patent/CN105451319B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101674118A (en) * | 2008-09-12 | 2010-03-17 | 上海交通大学 | Weighted rate and maximization-based low-complexity multi-user MIMO scheduling algorithm and device |
| CN102469597A (en) * | 2010-11-17 | 2012-05-23 | 株式会社Ntt都科摩 | Apparatus and method for allocating resources to nodes in a communication system using an update of iteration resource weights |
| CN102905320A (en) * | 2012-09-24 | 2013-01-30 | 上海交通大学 | Monotone optimization method for maximizing multi-cell downlink weighting and rate |
Non-Patent Citations (4)
| Title |
|---|
| 《Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks》;Chee Wei Tan等;《IEEE/ACM TRANSACTIONS ON NETWORKING》;20130630;第21卷(第3期);全文 * |
| 《Maximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SINR》;Chee Wei Tan等;《IEEE TRANSACTIONS ON SIGNAL PROCESSING》;20111231;第59卷(第12期);全文 * |
| 《Maximizing Sum Rates in Cognitive Radio Networks: Convex Relaxation and Global Optimization Algorithms》;Liang Zheng等;《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》;20140531;第32卷(第3期);全文 * |
| 《Optimal Max-min Fairness Rate Control in Wireless Networks: Perron-Frobenius Characterization and Algorithms》;Desmond W. H. Cai等;《2012 Proceedings IEEE INFOCOM》;20121231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105451319A (en) | 2016-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Qian et al. | Joint base station association and power control via Benders' decomposition | |
| CN110417496B (en) | Cognitive NOMA network stubborn resource allocation method based on energy efficiency | |
| Kwon et al. | Distributed resource allocation through noncooperative game approach in multi-cell OFDMA systems | |
| Chen et al. | User association with unequal user priorities in heterogeneous cellular networks | |
| Vu et al. | Ultra-reliable communication in 5G mmWave networks: A risk-sensitive approach | |
| CN107113634A (en) | Method and apparatus for optimizing cell-specific antenna configuration parameters | |
| Kuang et al. | Energy management in heterogeneous networks with cell activation, user association, and interference coordination | |
| Zhang et al. | Distributed power allocation for coordinated multipoint transmissions in distributed antenna systems | |
| CN101635600B (en) | Channel and power joint distribution method based on interference temperature in cognitive radio (CR) | |
| CN105451319B (en) | For realizing the maximized power optimization method of the sum of Weighted rate and its device | |
| Song et al. | D3M: Distributed multi-cell multigroup multicasting | |
| CN107567055A (en) | Robust resource allocation methods based on user's outage probability in two layers of heterogeneous wireless network | |
| Adam et al. | Energy efficiency maximization in downlink multi-cell multi-carrier NOMA networks with hardware impairments | |
| CN113382477A (en) | Method for modeling uplink interference between wireless network users | |
| CN107276704B (en) | Optimal robust power control method based on energy efficiency maximization in two-layer Femtocell network | |
| Xie et al. | Joint power allocation and beamforming with users selection for cognitive radio networks via discrete stochastic optimization | |
| CN108990141B (en) | Energy-collecting wireless relay network throughput maximization method based on deep multi-network learning | |
| Calvo-Fullana et al. | Sensor selection in energy harvesting wireless sensor networks | |
| Qian et al. | Monotonic optimization for non-concave power control in multiuser multicarrier network systems | |
| Tang et al. | Artificial-noise-aided coordinated secure transmission design in multi-cell multi-antenna networks with limited feedback | |
| US11330444B2 (en) | Cognitive radio communication control device for determining cognitive radio terminal and cognitive radio terminal determining method | |
| Yao et al. | Robust beamforming design for reconfigurable intelligent surface-aided cell-free systems | |
| Cavalcante et al. | The role of asymptotic functions in network optimization and feasibility studies | |
| Zappone et al. | Secrecy and energy efficiency in MIMO-ME systems | |
| Sharma et al. | Differential evolution aided adaptive resource allocation in OFDMA systems with proportional rate constraints |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 201206 Shanghai, Pudong Jinqiao Ning Bridge Road, No. 388, No. Applicant after: Shanghai NOKIA Baer Limited by Share Ltd Address before: 201206 Shanghai, Pudong Jinqiao Ning Bridge Road, No. 388, No. Applicant before: Shanghai Alcatel-Lucent Co., Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |