CN103580806A - Method for energy-efficient transmission of robustness in cognitive network - Google Patents

Method for energy-efficient transmission of robustness in cognitive network Download PDF

Info

Publication number
CN103580806A
CN103580806A CN201310534296.0A CN201310534296A CN103580806A CN 103580806 A CN103580806 A CN 103580806A CN 201310534296 A CN201310534296 A CN 201310534296A CN 103580806 A CN103580806 A CN 103580806A
Authority
CN
China
Prior art keywords
channel
secondary user
user
power
robustness
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201310534296.0A
Other languages
Chinese (zh)
Other versions
CN103580806B (en
Inventor
盛敏
王亮
史琰
张琰
王玺钧
李建东
马骁
刘国庆
徐超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201310534296.0A priority Critical patent/CN103580806B/en
Publication of CN103580806A publication Critical patent/CN103580806A/en
Application granted granted Critical
Publication of CN103580806B publication Critical patent/CN103580806B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a method for energy-efficient transmission of robustness in a cognitive network. According to the method for energy-efficient transmission of the robustness in the cognitive network, channel state information of relevant channels is measured through the receiving end of a secondary user and is fed back to the sending end of the secondary user; the sending end of the secondary user carries out measurement multiple times to determine an uncertain set of the gain of each channel; the secondary user establishes a model according to a robustness optimizing method to maximize secondary user energy efficiency; the poorest channel gain is solved, and a service quality requirement constraint of a main user is converted into a convex constraint; the optimal sending power is solved according to a power distribution algorithm, transmission is carried out on each channel according to the optimal sending power, and the optimal transmission power of the robustness is solved when the channel state information is uncertain. The method for energy-efficient transmission of the robustness in the cognitive network can be used for cognitive network communication and has the advantages that the maximization of the energy efficiency of the secondary user is guaranteed under the circumstance that the channel state information is uncertain, interference power at the receiving end of the main user is strictly controlled, the service quality of the main user is guaranteed, and negative influence of the uncertainty of the channel state information on the performance of the cognitive network is effectively eliminated.

Description

A kind of method of robustness efficiency transmission in cognition network
Technical field
The invention belongs to wireless communication technology field, relate in particular to the method for robustness efficiency transmission in a kind of cognition network.
Background technology
Cognitive radio networks allows secondary user's under the prerequisite of service quality QoS that does not reduce primary user, to utilize primary user's mandate frequency spectrum to carry out frequency spectrum share, improves the utilance of whole frequency spectrum.On the other hand, the Radio Transmission Technology of maximization efficiency becomes the hot issue of current green communications.Especially, in cognitive radio networks, how secondary user's maximizes self efficiency when improving the availability of frequency spectrum is the hot issue of current research.
Existing most of document is when maximizing secondary user's efficiency, and the state information CSI that mostly supposes channel is accurately.Yet, due to the time-varying characteristics of wireless transmission channel, the impact of the finiteness of training sequence and the factors such as time delay of feedback channel, the channel condition information CSI that transmitting terminal obtains is inaccurate often.And inaccurate channel condition information can affect the energetic efficiency characteristic of secondary user's and primary user's service quality.
Because the existing maximization efficiency method for cognitive radio networks designs in the accurate channel information situation of hypothesis.These transmission methods are applied in practical wireless systems, tend to cause the deterioration of secondary user's efficiency, also can reduce primary user's service quality.
Summary of the invention
The object of the embodiment of the present invention is to provide the method for robustness efficiency transmission in a kind of cognition network, be intended to solve existing cognitive radio networks and maximize efficiency method because not considering the uncertain deterioration that causes secondary user's efficiency of channel information, reduce the problem of primary user's service quality.
The embodiment of the present invention is achieved in that the method for robustness efficiency transmission in a kind of cognition network, and in this cognition network, the method for robustness efficiency transmission comprises the following steps:
Step 1, secondary user's receiving terminal SR measures the interference signal receiving when not receiving useful data or before receiving, and estimates that the primary user of transmitting on channel k is to the estimated value of disturbing ; When primary user mourns in silence, secondary user's receiving terminal SR measures the white noise power σ on channel k 2, when receiving data, according to training sequence, estimate the channel gain of secondary user's transmitting terminal ST
Figure BDA0000405747230000022
, secondary user's receiving terminal SR also sends to secondary user's transmitting terminal ST by numerical value by feedback channel;
Step 2, secondary user's transmitting terminal ST when not having data to send, demodulation primary user's public transmitted signal, as confirmed to reply ACK, negative response NAK etc., estimate the channel gain of primary user's receiving terminal PR accordingly
Figure BDA0000405747230000023
Step 3, before communication starts, by repeating step one to three repeatedly, determines the uncertain set of relevant parameter;
Step 4, according to the parameter of step 1 to three acquisition, can be expressed as a plurality of secondary user's at the descending efficiency f of a plurality of channel (P)
f ( P ) = Σ k = 1 3 B log 2 ( 1 + Γ k P k H s k σ 2 + I P k ) P C + 5 Σ k = 1 3 p k
Wherein, B is the bandwidth of channel, while adopting quadrature amplitude modulation MQAM when error rate BER=0.001 of secondary user's, and the now channel speed of actual transmissions system and the coefficient of variation Γ between channel capacity k=0.1258, P cthe secondary user's transmitting terminal ST that cognitive base station CBS(above mentions) constant power expense, efficiency 1/ η of the power amplifier of cognitive base station CBS 0=0.20, P=[P 1, P 2, P 3] represent the transmitted power of cognitive base station CBS on all channels vector, here P k, { 1,2,3} is illustrated in the transmitted power on channel k to k ∈;
Now, according to robustness optimization method, the problem that maximizes secondary user's efficiency is modeled as
P 1 : max P x · min G Sj , H S k , I P k · f ( P )
s . t . C 1 : Σ k = 1 3 P k ≤ P max ,
C 2 : P · G Sj T ≤ IT j , ∀ j ∈ { 1,2 } ,
C 3 : G Sj ∈ Q j , ∀ j ∈ { 1,2 } ,
C 4 : H S k ∈ F k , ∀ k ∈ { 1,2,3 } ,
C 5 : I P k ∈ I k , ∀ k ∈ { 1,2,3 } ·
Wherein, P maxthe maximum transmit power that represents cognitive base station CBS, IT jj the interference threshold value that primary user's receiving terminal PR can tolerate;
Step 5, according to ( H S k ) * = arg min ( H S k ∈ F k ) · ( 1 + Γ k P k H S k BN 0 + I P k ) = arg min ( H S k ∈ F k ) · ( H S k ) , ∀ k ∈ { 1,2,3 } , Solve the channel gain of secondary user's on channel k
Figure BDA0000405747230000039
worst-case value
Figure BDA00004057472300000310
wherein, worst-case value refers at a given feasible transmitted power vector
Figure BDA00004057472300000311
make target function in problem P1
Figure BDA00004057472300000312
minimum value;
Step 6, then solve the synthetic interference that primary user causes secondary user's on channel k
Figure BDA00004057472300000410
worst-case value
Figure BDA0000405747230000041
wherein, worst-case value refers at a given feasible transmitted power vector make target function in problem P1
Figure BDA0000405747230000043
minimum
Figure BDA0000405747230000044
value; ;
Step 7, according to the correlation criterion of robustness optimization, can will retrain C2 and C3 and be converted into the protruding constraint C6 of following equivalence in P1:
C 6 : P · G Sj T + ϵ 0 | | P | | 2 ≤ IT j , ∀ j ∈ { 1,2 }
Wherein, weight matrix M j=I 3 * 3, inverse matrix in addition l, 2norm || || 2dual norm be still l 2norm || || 2,
Figure BDA0000405747230000047
Step 8, by the result substitution problem P1 in step 5 to seven, can be converted into
P 2 : max P k · f 1 ( P ) = U R ( P ) U TP ( P ) = Σ k = 1 3 B log 2 ( 1 + Γ k P k ( H S k ) * σ 2 + ( I P k ) * ) P C + 5 Σ k = 1 3 P k s . t . C 1 , C 6 . ;
Step 9, adopts following power distribution algorithm, Solve problems P2:
The first step, given maximum iteration time L max=50 and error tolerance threshold value κ=0.0001;
Second step, the current efficiency value of initialization q=0 gives current iteration index assignment n=0 simultaneously;
The 3rd step, as convergence identifier F==0 and current iteration index n≤L maxtime, order is carried out statement below; Otherwise, jump to the 7th step;
The 4th step, when maximum efficiency q gives regularly, solves following protruding optimization problem P3, obtains power allocation vector P ' now;
P 3 : max P . U R ( P ) - q U TP ( P ) s . t . C 1 , C 6 .
The 5th step, if inequality U r(P ')-qU tP(P ') < κ sets up, so assignment P*=P ' and convergence sign assignment F=1; Otherwise, assignment
Figure BDA0000405747230000052
and n=n+1, convergence sign assignment F=0;
The 6th step, turns back to the 3rd step, and correlative is sequentially carried out in continuation;
The 7th step, returns to optimum efficiency value q *with optimal power allocation vector P *=[P 1 *, P 2 *, P 3 *];
Step 10, cognitive base station CBS adopts given vector power P *=[P 1 *, P 2 *, P 3 *], on channel 1 with power P 1 *to secondary user's S1, send data, on channel 2 and 3, adopt respectively P 2 *and P 3 *to secondary user's S2, send data.
Further, in step 3, determine that the uncertain set of relevant parameter is as follows:
Make ε 0jkk, { 1,2}, { 1,2,3} represents the border of unified uncertain set to k ∈ to j ∈, and generalized norm adopts l in addition 2norm || || 2, for vectorial X ∈ R 1 * n, l 2norm || || 2can be expressed as | | X | | 2 = ( | x 1 | 2 + . . . + | x n | 2 ) 1 2 :
The first step, for parameter G sj, for the receiving terminal of primary user P1, set up following uncertain set
Q 1 = { G S 1 | | | ( G S 1 - G ^ S 1 ) T | | 2 &le; &epsiv; 0 }
Wherein,
Figure BDA0000405747230000055
when primary user P1 does not transmit on channel 2, now
Figure BDA0000405747230000056
making weight matrix value is unit matrix M 1=I 3 * 3∈ R 3 * 3, g s1current estimated value;
For the receiving terminal of primary user P2, can obtain similar uncertain set
Q 2 = { G S 2 | | | ( G S 2 - G ^ S 2 ) T | | 2 &le; &epsiv; 0 }
Wherein,
Figure BDA0000405747230000059
when primary user P1 does not transmit on channel 1 and 3, now
Figure BDA0000405747230000061
making weight matrix value is unit matrix M 2=I 3 * 3∈ R 3 * 3, g s2current estimated value;
Second step, about parameter for secondary user's S1, set up following uncertain set
F 1 = { H S 1 | | | H S 1 - H ^ S 1 | | 2 &le; &epsiv; 0 }
About secondary user's S2, set up following uncertain set
F 2 = { H S 2 | | | H S 2 - H ^ S 2 | | 2 &le; &epsiv; 0 }
F 3 = { H S 3 | | | H S 3 - H ^ S 3 | | 2 &le; &epsiv; 0 }
Wherein, F 1the channel gain of secondary user's S1 on channel 1 uncertain set, F 2and F 3respectively the channel gain of secondary user's S2 on channel 2 and 3
Figure BDA0000405747230000068
with
Figure BDA0000405747230000069
uncertain set, now weight coefficient assignment is
Figure BDA00004057472300000610
Figure BDA00004057472300000611
be secondary user's in secondary user's the channel gain on channel k
Figure BDA00004057472300000612
estimated value;
The 3rd step, for parameter
Figure BDA00004057472300000613
can obtain following uncertain set
L k = { I P k | | | I P k - I ^ P k | | 2 &le; &epsiv; 0 } , &ForAll; k &Element; { 1,2,3 }
Wherein, L kit is the synthetic interference that primary user produces secondary user's on channel k
Figure BDA00004057472300000615
uncertain set, Z kthat weight coefficient assignment is
Figure BDA00004057472300000616
Figure BDA00004057472300000617
it is the synthetic interference that primary user produces secondary user's on channel k
Figure BDA00004057472300000618
estimated value.
Further, in step 5, worst-case value expression formula be:
( H S k ) * = arg min ( H S k &Element; F k ) &CenterDot; ( 1 + &Gamma; k P &OverBar; k H S k BN 0 + I P k ) = arg min ( H S k &Element; F k ) &CenterDot; ( H S k ) , &ForAll; k &Element; { 1,2,3 } .
Further, in step 6, worst-case value expression formula be:
( I S k ) * = arg min ( I S k &Element; L k ) &CenterDot; ( 1 + &Gamma; k P &OverBar; k H S k BN 0 + I P k ) = arg min ( I S k &Element; L k ) &CenterDot; ( I S k ) , &ForAll; k &Element; { 1,2,3 } .
In cognition network provided by the invention, the method for robustness efficiency transmission, measures the channel condition information of correlated channels, and feeds back to secondary user's transmitting terminal by secondary user's receiving terminal; Secondary user's transmitting terminal is by repeatedly measuring the uncertain set of determining each channel gain; Secondary user's maximizes the problem of secondary user's efficiency according to robustness optimization method modeling; Solve difference channel gain and the constraint of primary user's QoS requirement is converted into protruding constraint; According to power distribution algorithm, solve optimum transmitted power, and according to this power, transmit on each channel, when channel condition information uncertain, solve the optimal transmission power of robust, strict guarantee primary user's service quality maximized the efficiency of secondary user's simultaneously, can be used for cognition network communication;
Tool of the present invention has the following advantages:
1. in the present invention, secondary user's determines by measurement the uncertain set that its channel information and primary user arrive secondary user's interfere information, optimizes accordingly the power of self, has guaranteed the maximization of secondary user's efficiency in the uncertain situation of channel information;
2. in the present invention, secondary user's utilizes the uncertain set of primary user's channel information to determine transmitted power, strictly control primary user's receiving terminal interference power, and then in the uncertain situation of channel information, strictly guaranteed primary user's service quality (QoS);
3. the present invention, by considering the uncertainty of channel information and interference power, adopts the power transmission method of robustness, has effectively eliminated the deterioration of channel information uncertainty to cognition network performance.
Accompanying drawing explanation
Fig. 1 is the method flow diagram of robustness efficiency transmission in the cognition network that provides of the embodiment of the present invention;
Fig. 2 is the use cognition network downlink transfer scene graph that the embodiment of the present invention provides;
Fig. 3 is the method realization flow figure of robustness efficiency transmission in the cognition network that provides of the embodiment of the present invention;
Fig. 4 is the sub-process figure of the power distribution algorithm that provides of the embodiment of the present invention.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearer, below in conjunction with embodiment, the present invention is further elaborated.Should be appreciated that specific embodiment described herein, only in order to explain the present invention, is not intended to limit the present invention.
Below in conjunction with drawings and the specific embodiments, application principle of the present invention is further described.
As shown in Figure 1, in the cognition network of the embodiment of the present invention, the method for robustness efficiency transmission comprises the following steps:
S101: secondary user's receiving terminal is measured the channel condition information of correlated channels, and feeds back to secondary user's transmitting terminal;
S102: secondary user's transmitting terminal is by repeatedly measuring the uncertain set of determining each channel gain;
S103: secondary user's maximizes the problem of secondary user's efficiency according to robustness optimization method modeling;
S104: solve difference channel gain and the constraint of primary user's QoS requirement is converted into protruding constraint;
S105: solve optimum transmitted power according to power distribution algorithm, and transmit according to this power on each channel.
The present invention is described further in conjunction with specific embodiments:
As shown in Figure 2, in simulating scenes of the present invention, comprising two pairs of primary user's transmission nodes is P=2 to PT and PR, primary user is numbered to P1 and P2, a cognitive base station CBS and two secondary user's SR, be numbered respectively S1 and S2, suppose always to have three channels and get K=3, wherein secondary user's receiving terminal S1 busy channel 1, secondary user's receiving terminal S1 busy channel 2 and 3, primary user P1 busy channel 1 and channel 3, how busy channel does not affect use of the present invention for primary user P2 busy channel 2(secondary user's and primary user, here only provide the example of a concrete channel occupancy),
As shown in Figure 3, in the present invention, maximize the method for the robustness transmission of efficiency, specifically comprise that step is as follows:
Step 1, secondary user's receiving terminal S1 measures the interference signal receiving when not receiving useful data or before receiving, the estimated value of the primary user of estimation transmission on channel 1 to its interference secondary user's receiving terminal S2 estimates the estimated value to its interference at channel 2 and 3 primary users of transmitting
Figure BDA0000405747230000092
with
Figure BDA0000405747230000093
when primary user mourns in silence, secondary user's receiving terminal S1 and S2 measure the white noise power σ on three channels 2(without loss of generality, supposing that on three channels, white noise power is identical here), secondary user's receiving terminal S1 arrives its channel gain according to training sequence cognitive base station CBS on channel 1
Figure BDA0000405747230000094
secondary user's receiving terminal S2 estimates on channel 2 and 3
Figure BDA0000405747230000095
with secondary user's receiving terminal also sends to cognitive base station CBS by the numerical value of measurement by feedback channel;
Step 2, cognitive base station CBS estimates on three channels that according to primary user's public information it arrives the channel gain between primary user's receiving terminal PR
Figure BDA0000405747230000097
with
Figure BDA0000405747230000098
Step 3, before communication starts, by repeating step (to three) repeatedly, determines that the uncertain set of relevant parameter is following (for convenient statement, to make ε here 0jkk, { 1,2}, { 1,2,3} represents the border of unified uncertain set to k ∈ to j ∈, and generalized norm adopts l in addition 2norm || || 2, for vectorial X ∈ R 1 * n, l 2norm || || 2can be expressed as | | X | | 2 = ( | x 1 | 2 + . . . + | x n | 2 ) 1 2 :
The first step, for parameter G sj, for the receiving terminal of primary user P1, set up following uncertain set
Q 1 = { G S 1 | | | ( G S 1 - G ^ S 1 ) T | | 2 &le; &epsiv; 0 }
Wherein,
Figure BDA0000405747230000103
when primary user P1 does not transmit on channel 2, now
Figure BDA0000405747230000104
making weight matrix value is unit matrix M 1=I 3 * 3∈ R 3 * 3,
Figure BDA0000405747230000105
g s1current estimated value;
For the receiving terminal of primary user P2, can obtain similar uncertain set
Q 2 = { G S 2 | | | ( G S 2 - G ^ S 2 ) T | | 2 &le; &epsiv; 0 }
Wherein,
Figure BDA0000405747230000107
when primary user P1 does not transmit on channel 1 and 3, now
Figure BDA0000405747230000108
making weight matrix value is unit matrix M 2=I 3 * 3∈ R 3 * 3,
Figure BDA0000405747230000109
g s2current estimated value;
Second step, about parameter
Figure BDA00004057472300001010
for secondary user's S1, set up following uncertain set
F 1 = { H S 1 | | | H S 1 - H ^ S 1 | | 2 &le; &epsiv; 0 }
About secondary user's S2, set up following uncertain set
F 2 = { H S 2 | | | H S 2 - H ^ S 2 | | 2 &le; &epsiv; 0 }
F 3 = { H S 3 | | | H S 3 - H ^ S 3 | | 2 &le; &epsiv; 0 }
Wherein, F 1the channel gain of secondary user's S1 on channel 1 uncertain set, F 2and F 3respectively the channel gain of secondary user's S2 on channel 2 and 3
Figure BDA0000405747230000111
with
Figure BDA0000405747230000112
uncertain set, now weight coefficient assignment is
Figure BDA0000405747230000114
be secondary user's in secondary user's the channel gain on channel k
Figure BDA0000405747230000115
estimated value;
The 3rd step, for parameter
Figure BDA0000405747230000116
can obtain following uncertain set
L k = { I P k | | | I P k - I ^ P k | | 2 &le; &epsiv; 0 } , &ForAll; k &Element; { 1,2,3 }
Wherein, L kit is the synthetic interference that primary user produces secondary user's on channel k
Figure BDA0000405747230000118
uncertain set, Z kthat weight coefficient assignment is
Figure BDA0000405747230000119
Figure BDA00004057472300001110
it is the synthetic interference that primary user produces secondary user's on channel k
Figure BDA00004057472300001111
estimated value;
Step 4, according to the parameter of step 1 to three acquisition, can be expressed as a plurality of secondary user's at the descending efficiency f of a plurality of channel (P)
f ( P ) = &Sigma; k = 1 3 B log 2 ( 1 + &Gamma; k P k H s k &sigma; 2 + I P k ) P C + 5 &Sigma; k = 1 3 p k
Wherein, B is the bandwidth of channel, while adopting quadrature amplitude modulation MQAM when error rate BER=0.001 of secondary user's, and the now channel speed of actual transmissions system and the coefficient of variation Γ between channel capacity k=0.1258, P cthe constant power expense of cognitive base station CBS, efficiency 1/ η of the power amplifier of cognitive base station CBS 0=0.20, P=[P 1, P 2, P 3] represent the transmitted power of cognitive base station CBS on all channels vector, here P k, { 1,2,3} represents its transmitted power on channel k to k ∈;
Now, according to robustness optimization method, the problem that maximizes secondary user's efficiency is modeled as
P 1 : max P x &CenterDot; min G Sj , H S k , I P k &CenterDot; f ( P )
s . t . C 1 : &Sigma; k = 1 3 P k &le; P max , C 2 : P &CenterDot; G Sj T &le; IT j , &ForAll; j &Element; { 1,2 } ,
C 3 : G Sj &Element; Q j , &ForAll; j &Element; { 1,2 } ,
C 4 : H S k &Element; F k , &ForAll; k &Element; { 1,2,3 } ,
C 5 : I P k &Element; I k , &ForAll; k &Element; { 1,2,3 } &CenterDot;
Wherein, P maxthe maximum transmit power that represents cognitive base station CBS, IT jj the interference threshold value that primary user's receiving terminal PR can tolerate;
Step 5, according to following formula, solves the channel gain of secondary user's on channel k
Figure BDA0000405747230000127
worst-case value
Figure BDA0000405747230000128
( H S k ) * = arg min ( H S k &Element; F k ) &CenterDot; ( 1 + &Gamma; k P k H S k BN 0 + I P k ) = arg min ( H S k &Element; F k ) &CenterDot; ( H S k ) , &ForAll; k &Element; { 1,2,3 }
Wherein, worst-case value refers at a given feasible transmitted power vector
Figure BDA00004057472300001210
make target function in problem P1
Figure BDA00004057472300001211
minimum
Figure BDA00004057472300001212
Step 6, after this, then solves the synthetic interference that primary user causes secondary user's on channel k worst-case value
Figure BDA00004057472300001214
( I S k ) * = arg min ( I S k &Element; L k ) &CenterDot; ( 1 + &Gamma; k P &OverBar; k H S k BN 0 + I P k ) = arg min ( I S k &Element; L k ) &CenterDot; ( I S k ) , &ForAll; k &Element; { 1,2,3 }
Wherein, worst-case value refers to when a given feasible transmitted power is vectorial, makes target function in problem P1
Figure BDA00004057472300001216
minimum
Figure BDA00004057472300001217
value;
Step 7, according to the correlation criterion of robustness optimization, can will retrain C2 and C3 and be converted into the protruding constraint C6 of following equivalence in P1:
C 6 : P &CenterDot; G Sj T + &epsiv; 0 | | P | | 2 &le; IT j , &ForAll; j &Element; { 1,2 }
Wherein, weight matrix M j=I 3 * 3, its inverse matrix
Figure BDA00004057472300001219
in addition l, 2norm || || 2dual norm be still l 2norm || || 2, step 8, by the result substitution problem P1 in step 5 to seven, can be translated into
P 2 : max P k &CenterDot; f 1 ( P ) = U R ( P ) U TP ( P ) = &Sigma; k = 1 3 B log 2 ( 1 + &Gamma; k P k ( H S k ) * &sigma; 2 + ( I P k ) * ) P C + 5 &Sigma; k = 1 3 P k s . t . C 1 , C 6 .
Step 9, as shown in Figure 4, adopts following power distribution algorithm, Solve problems P2:
The first step, given maximum iteration time L max=50 and error tolerance threshold value κ=0.0001;
Second step, the current efficiency value of initialization q=0 gives current iteration index assignment n=0 simultaneously;
The 3rd step, as convergence identifier F==0 and current iteration index n≤L maxtime, order is carried out statement below; Otherwise, jump to the 7th step;
The 4th step, when maximum efficiency q gives regularly, solves following protruding optimization problem P3, obtains power allocation vector P ' now;
P 3 : max P . U R ( P ) - q U TP ( P ) s . t . C 1 , C 6 .
The 5th step, if inequality U r(P ')-qU tP(P ') < κ sets up, so assignment P *=P ' and
Figure BDA0000405747230000133
convergence sign assignment F=1; Otherwise, assignment
Figure BDA0000405747230000134
and n=n+1, convergence sign assignment F=0;
The 6th step, turns back to the 3rd step, and correlative is sequentially carried out in continuation;
The 7th step, returns to optimum efficiency value q *with optimal power allocation vector P *=[P 1 *, P 2 *, P 3 *];
Step 10, cognitive base station CBS adopts given vector power P *=[P 1 *, P 2 *, P 3 *], on channel 1 with power P 1 *to secondary user's S1, send data, on channel 2 and 3, adopt respectively P 2 *and P 3 *to secondary user's S2, send data.
Secondary user's in the present invention determines by measurement the uncertain set that its channel information and primary user arrive secondary user's interfere information, has optimized the power of self, has guaranteed the maximization of secondary user's efficiency in the uncertain situation of channel information; Secondary user's utilizes the uncertain set of primary user's channel information to determine transmitted power, has strictly controlled primary user's receiving terminal interference power, has guaranteed primary user's service quality QoS; By considering the uncertainty of channel information and interference power, adopt the power transmission method of robustness, effectively eliminated the deterioration of information uncertainty to cognition network performance.
Robustness of the present invention maximizes efficiency transmission method and can be widely applied in various cognition wireless networks, for example, the uplink of the downlink transfer of cognitive base station (described in application example) and single secondary user's in centralized cognition wireless network, point-to-multipoint transmission between the transmission of point-to-point or secondary user's between distributed cognition network secondary user's.
The present invention has considered the negative effect of channel information uncertainty to cognition network performance, with existing hypothesis channel information accurately conventional method compare and there is following advantage: the present invention can strictly guarantee that primary user's service quality is (as cognitive base station CBS in application example will strictly be less than given interference threshold to the interference power of primary user's receiving terminal PR, with this, guarantee primary user's transmission quality), and conventional method is when channel information has uncertainty, it probably surpasses given interference threshold to primary user's interference, thereby seriously worsen primary user's transmission quality, the present invention can promote the efficiency (in application example, the descending efficiency of cognitive base station CBS can access maximization) of secondary user's transmitting terminal, and conventional method is when channel information has uncertainty, and the efficiency of secondary user's can significantly decrease.
In sum, compare with conventional method, the present invention is the in the situation that of strict guarantee primary user service quality, and the efficiency of maximizing secondary user's transmitting terminal, is the effective means that cognition wireless network is realized green communications.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any modifications of doing within the spirit and principles in the present invention, be equal to and replace and improvement etc., within all should being included in protection scope of the present invention.

Claims (4)

1. a method for robustness efficiency transmission in cognition network, is characterized in that, in this cognition network, the method for robustness efficiency transmission comprises the following steps:
Step 1, secondary user's receiving terminal SR measures the interference signal receiving when not receiving useful data or before receiving, and estimates that the primary user of transmitting on channel k is to the estimated value of disturbing
Figure FDA0000405747220000012
; When primary user mourns in silence, secondary user's receiving terminal SR measures the white noise power σ on channel k 2, when receiving data, according to training sequence, estimate the channel gain of secondary user's transmitting terminal ST
Figure FDA0000405747220000013
, secondary user's receiving terminal SR also sends to secondary user's transmitting terminal ST by numerical value by feedback channel;
Step 2, secondary user's transmitting terminal ST when not having data to send, demodulation primary user's public transmitted signal, as confirmed to reply ACK, negative response NAK etc., estimate the channel gain of primary user's receiving terminal PR accordingly
Figure FDA0000405747220000014
Step 3, before communication starts, by repeating step one to three repeatedly, determines the uncertain set of relevant parameter;
Step 4, according to the parameter of step 1 to three acquisition, can be expressed as a plurality of secondary user's at the descending efficiency f of a plurality of channel (P)
f ( P ) = &Sigma; k = 1 3 B log 2 ( 1 + &Gamma; k P k H s k &sigma; 2 + I P k ) P C + 5 &Sigma; k = 1 3 p k
Wherein, B is the bandwidth of channel, while adopting quadrature amplitude modulation MQAM when error rate BER=0.001 of secondary user's, and the now channel speed of actual transmissions system and the coefficient of variation Γ between channel capacity k=0.1258, P cthe secondary user's transmitting terminal ST that cognitive base station CBS(above mentions) constant power expense, efficiency 1/ η of the power amplifier of cognitive base station CBS 0=0.20, P=[P 1, P 2, P 3] represent the transmitted power of cognitive base station CBS on all channels vector, here P k, { 1,2,3} is illustrated in the transmitted power on channel k to k ∈;
Now, according to robustness optimization method, the problem that maximizes secondary user's efficiency is modeled as
P 1 : max P x &CenterDot; min G Sj , H S k , I P k &CenterDot; f ( P )
s . t . C 1 : &Sigma; k = 1 3 P k &le; P max ,
C 2 : P &CenterDot; G Sj T &le; IT j , &ForAll; j &Element; { 1,2 } ,
C 3 : G Sj &Element; Q j , &ForAll; j &Element; { 1,2 } ,
C 4 : H S k &Element; F k , &ForAll; k &Element; { 1,2,3 } ,
C 5 : I P k &Element; I k , &ForAll; k &Element; { 1,2,3 } &CenterDot;
Wherein, P maxthe maximum transmit power that represents cognitive base station CBS, IT jj the interference threshold value that primary user's receiving terminal PR can tolerate;
Step 5, first solves the channel gain of secondary user's on channel k
Figure FDA0000405747220000027
worst-case value
Figure FDA0000405747220000028
wherein, worst-case value refers at a given feasible transmitted power vector
Figure FDA0000405747220000029
make target function in problem P1
Figure FDA00004057472200000210
minimum
Figure FDA00004057472200000211
value;
Step 6, then solve the synthetic interference that primary user causes secondary user's on channel k worst-case value
Figure FDA00004057472200000212
wherein, worst-case value refers at a given feasible transmitted power vector
Figure FDA00004057472200000213
make target function in problem P1
Figure FDA00004057472200000214
minimum
Figure FDA00004057472200000215
value;
Step 7, according to the correlation criterion of robustness optimization, can will retrain C2 and C3 and be converted into the protruding constraint C6 of following equivalence in P1:
C 6 : P &CenterDot; G Sj T + &epsiv; 0 | | P | | 2 &le; IT j , &ForAll; j &Element; { 1,2 }
Wherein, weight matrix M j=I 3 * 3, inverse matrix
Figure FDA00004057472200000217
in addition l, 2norm || || 2dual norm be still l 2norm || || 2,
Figure FDA00004057472200000218
Step 8, by the result substitution problem P1 in step 5 to seven, can be converted into
P 2 : max P k &CenterDot; f 1 ( P ) = U R ( P ) U TP ( P ) = &Sigma; k = 1 3 B log 2 ( 1 + &Gamma; k P k ( H S k ) * &sigma; 2 + ( I P k ) * ) P C + 5 &Sigma; k = 1 3 P k s . t . C 1 , C 6 . ;
Step 9, adopts following power distribution algorithm, Solve problems P2:
The first step, given maximum iteration time L max=50 and error tolerance threshold value κ=0.0001;
Second step, the current efficiency value of initialization q=0 gives current iteration index assignment n=0 simultaneously;
The 3rd step, as convergence identifier F==0 and current iteration index n≤L maxtime, order is carried out statement below; Otherwise, jump to the 7th step;
The 4th step, when maximum efficiency q gives regularly, solves following protruding optimization problem P3, obtains power allocation vector P ' now;
P 3 : max P . U R ( P ) - q U TP ( P ) s . t . C 1 , C 6 .
The 5th step, if inequality U r(P ')-qU tP(P ') < κ sets up, so assignment P *=P ' and
Figure FDA0000405747220000033
convergence sign assignment F=1; Otherwise, assignment
Figure FDA0000405747220000034
and n=n+1, convergence sign assignment F=0;
The 6th step, turns back to the 3rd step, and correlative is sequentially carried out in continuation;
The 7th step, returns to optimum efficiency value q *with optimal power allocation vector P *=[P 1 *, P 2 *, P 3 *];
Step 10, cognitive base station CBS adopts given vector power P *=[P 1 *, P 2 *, P 3 *], on channel 1 with power P 1 *to secondary user's S1, send data, on channel 2 and 3, adopt respectively P 2 *and P 3 *to secondary user's S2, send data.
2. the method for robustness efficiency transmission in cognition network as claimed in claim 1, is characterized in that, in step 3, determines that the uncertain set of relevant parameter is as follows:
Make ε 0jkk, { 1,2}, { 1,2,3} represents the border of unified uncertain set to k ∈ to j ∈, and generalized norm adopts l in addition 2norm || || 2, for vectorial X ∈ R 1 * n, l 2norm || || 2can be expressed as | | X | | 2 = ( | x 1 | 2 + . . . + | x n | 2 ) 1 2 :
The first step, for parameter G sj, for the receiving terminal of primary user P1, set up following uncertain set
Q 1={G S1|||(G S1-G S1) T|| 2≤ε 0}
Wherein, when primary user P1 does not transmit on channel 2, now
Figure FDA0000405747220000043
making weight matrix value is unit matrix M 1=I 3 * 3∈ R 3 * 3, G s1g s1current estimated value;
For the receiving terminal of primary user P2, can obtain similar uncertain set
Q 2={G S2|||(G S2-G S2) T|| 2≤ε 0]
Wherein,
Figure FDA0000405747220000044
when primary user P1 does not transmit on channel 1 and 3, now
Figure FDA0000405747220000045
making weight matrix value is unit matrix M 2=I 3 * 3∈ R 3 * 3, G s2g s2current estimated value;
Second step, about parameter
Figure FDA0000405747220000046
for secondary user's S1, set up following uncertain set
F 1 = { H S 1 | | | H S 1 - H ^ S 1 | | 2 &le; &epsiv; 0 }
About secondary user's S2, set up following uncertain set
F 2 = { H S 2 | | | H S 2 - H ^ S 2 | | 2 &le; &epsiv; 0 }
F 3 = { H S 3 | | | H S 3 - H ^ S 3 | | 2 &le; &epsiv; 0 }
Wherein, F 1the channel gain of secondary user's S1 on channel 1
Figure FDA00004057472200000410
uncertain set, F 2and F 3respectively the channel gain of secondary user's S2 on channel 2 and 3
Figure FDA0000405747220000051
with uncertain set, now weight coefficient assignment is
Figure FDA0000405747220000053
Figure FDA0000405747220000054
be secondary user's in secondary user's the channel gain on channel k
Figure FDA0000405747220000055
estimated value;
The 3rd step, for parameter
Figure FDA0000405747220000056
can obtain following uncertain set
L k = { I P k | | | I P k - I ^ P k | | 2 &le; &epsiv; 0 } , &ForAll; k &Element; { 1,2,3 }
Wherein, L kit is the synthetic interference that primary user produces secondary user's on channel k
Figure FDA0000405747220000058
uncertain set, Z kthat weight coefficient assignment is
Figure FDA0000405747220000059
Figure FDA00004057472200000510
it is the synthetic interference that primary user produces secondary user's on channel k estimated value.
3. the method for robustness efficiency transmission in cognition network as claimed in claim 1, is characterized in that, in step 5, and worst-case value expression formula be:
( H S k ) * = arg min ( H S k &Element; F k ) &CenterDot; ( 1 + &Gamma; k P &OverBar; k H S k BN 0 + I P k ) = arg min ( H S k &Element; F k ) &CenterDot; ( H S k ) , &ForAll; k &Element; { 1,2,3 } .
4. the method for robustness efficiency transmission in cognition network as claimed in claim 1, is characterized in that, in step 6, and worst-case value
Figure FDA00004057472200000514
expression formula be:
( I S k ) * = arg min ( I S k &Element; L k ) &CenterDot; ( 1 + &Gamma; k P &OverBar; k H S k BN 0 + I P k ) = arg min ( I S k &Element; L k ) &CenterDot; ( I S k ) , &ForAll; k &Element; { 1,2,3 } .
CN201310534296.0A 2013-10-31 2013-10-31 A kind of method of robustness efficiency transmission in cognition network Expired - Fee Related CN103580806B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310534296.0A CN103580806B (en) 2013-10-31 2013-10-31 A kind of method of robustness efficiency transmission in cognition network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310534296.0A CN103580806B (en) 2013-10-31 2013-10-31 A kind of method of robustness efficiency transmission in cognition network

Publications (2)

Publication Number Publication Date
CN103580806A true CN103580806A (en) 2014-02-12
CN103580806B CN103580806B (en) 2016-07-27

Family

ID=50051821

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310534296.0A Expired - Fee Related CN103580806B (en) 2013-10-31 2013-10-31 A kind of method of robustness efficiency transmission in cognition network

Country Status (1)

Country Link
CN (1) CN103580806B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104219749A (en) * 2014-09-19 2014-12-17 华北电力大学(保定) Power grid supply and demand adjustment method based on synergy of power grid and base station
CN105246109A (en) * 2015-09-18 2016-01-13 福州大学 Intra-cluster data fusion method for vehicle Ad-Hoc Network
CN107947880A (en) * 2017-11-29 2018-04-20 南京航空航天大学 Towards the probabilistic frequency spectrum investment tactics of spectrum requirement in cognitive radio networks
CN108347761A (en) * 2018-01-05 2018-07-31 山东财经大学 Power distribution method in CRN and its application in wisdom traffic network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040174938A1 (en) * 2003-03-06 2004-09-09 Lg Electronics Inc. Data transmitting/receiving apparatus and method in wireless system
CN102413540A (en) * 2011-08-25 2012-04-11 西安电子科技大学 Self-organizing network unicast method with combination of cognitive network coding and routing based on cognition
CN102695255A (en) * 2012-05-29 2012-09-26 西安电子科技大学 Heterogeneous network energy saving method based on cognition technology
CN103220094A (en) * 2013-03-19 2013-07-24 西安电子科技大学 Joint transmission method for carrying out parallel transmission and cooperation in cognitive network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040174938A1 (en) * 2003-03-06 2004-09-09 Lg Electronics Inc. Data transmitting/receiving apparatus and method in wireless system
CN102413540A (en) * 2011-08-25 2012-04-11 西安电子科技大学 Self-organizing network unicast method with combination of cognitive network coding and routing based on cognition
CN102695255A (en) * 2012-05-29 2012-09-26 西安电子科技大学 Heterogeneous network energy saving method based on cognition technology
CN103220094A (en) * 2013-03-19 2013-07-24 西安电子科技大学 Joint transmission method for carrying out parallel transmission and cooperation in cognitive network

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104219749A (en) * 2014-09-19 2014-12-17 华北电力大学(保定) Power grid supply and demand adjustment method based on synergy of power grid and base station
CN104219749B (en) * 2014-09-19 2018-05-04 华北电力大学(保定) The power grid supply and demand adjusting method cooperateed with based on power grid with base station
CN105246109A (en) * 2015-09-18 2016-01-13 福州大学 Intra-cluster data fusion method for vehicle Ad-Hoc Network
CN105246109B (en) * 2015-09-18 2018-10-30 福州大学 Data fusion method in a kind of cluster towards car self-organization network
CN107947880A (en) * 2017-11-29 2018-04-20 南京航空航天大学 Towards the probabilistic frequency spectrum investment tactics of spectrum requirement in cognitive radio networks
CN107947880B (en) * 2017-11-29 2020-11-06 南京航空航天大学 Spectrum investment strategy facing spectrum demand uncertainty in cognitive radio network
CN108347761A (en) * 2018-01-05 2018-07-31 山东财经大学 Power distribution method in CRN and its application in wisdom traffic network

Also Published As

Publication number Publication date
CN103580806B (en) 2016-07-27

Similar Documents

Publication Publication Date Title
CN107947878B (en) Cognitive radio power distribution method based on energy efficiency and spectrum efficiency joint optimization
CN109714817B (en) Communication system power allocation method using NOMA and D2D groups
CN105744628B (en) A kind of resource allocation optimal method of several energy integrated communication networks
WO2015070502A1 (en) Large-scale mimo wireless communication method based on pilot multiplexing
CN102970256B (en) Based on the multiple antennas D2D communication system interference elimination method of kernel
CN103997394A (en) Multi-cell coordination large-scale MIMO pilot frequency multiplexing transmission method
CN104023382B (en) Poewr control method and base station in co-channel full duplex system
CN107041005B (en) Bidirectional cognitive relay network resource allocation method based on energy cooperation
CN103580806B (en) A kind of method of robustness efficiency transmission in cognition network
CN103326764A (en) Method and device for obtaining downlink channel quality information
CN104702557A (en) Incomplete CSI (Channel State Information)-based distributed antenna system adaptive modulation method
CN105636216A (en) Robust power allocation method based on throughput maximization
CN105281817A (en) Robust wave beam molding method based on distributed bidirectional relay system
CN104601297A (en) Coordinative wireless energy transmission method and system
CN105188124A (en) Robustness gaming power control method under imperfect CSI for multi-user OFDMA relay system
WO2013147554A1 (en) Method and apparatus for transmitting and receiving signals in multi-cellular network
CN102347820A (en) Joint coding and decoding method of multi-cell cooperation wireless communication system
CN101895911A (en) Self-adaption transmission method utilizing channel statistical information in multi-base station cooperative transmission system
Zhou et al. QoS-based robust power optimization for SWIPT NOMA system with statistical CSI
CN103974433A (en) Resource distribution method oriented towards service quality guarantee and suitable for wireless full-duplex network
CN114584233A (en) Cognitive wireless network interruption performance prediction method and system based on RIS assistance
CN103248460B (en) Under imperfect channel state in mimo system based on interference alignment signal processing method
Ren et al. Maximizing the effective capacity for wireless cooperative relay networks with QoS guarantees
Guan et al. Stochastic channel access for underwater acoustic networks with spatial and temporal interference uncertainty
CN106160814B (en) A kind of multi-base station cooperative downlink transmission method based on interference alignment techniques

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160727