CN105072621A - Time-sharing cooperative communication implementation method based on OFDM cognitive network - Google Patents

Time-sharing cooperative communication implementation method based on OFDM cognitive network Download PDF

Info

Publication number
CN105072621A
CN105072621A CN201510443233.3A CN201510443233A CN105072621A CN 105072621 A CN105072621 A CN 105072621A CN 201510443233 A CN201510443233 A CN 201510443233A CN 105072621 A CN105072621 A CN 105072621A
Authority
CN
China
Prior art keywords
tau
primary user
sigma
user
prime
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
CN201510443233.3A
Other languages
Chinese (zh)
Other versions
CN105072621B (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.)
Nanjing Post and Telecommunication University
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing Post and Telecommunication 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 Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201510443233.3A priority Critical patent/CN105072621B/en
Publication of CN105072621A publication Critical patent/CN105072621A/en
Application granted granted Critical
Publication of CN105072621B publication Critical patent/CN105072621B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14Spectrum sharing arrangements between different networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • H04L27/2647Arrangements specific to the receiver only
    • H04L27/2655Synchronisation arrangements

Landscapes

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

Abstract

The invention discloses a time-sharing cooperative communication implementation method based on an OFDM cognitive network. The method is for the OFDM cognitive network with an energy collecting function, and belongs to the technical field of wireless communications. According to a conventional spectrum sharing method, a secondary user uses a band unoccupied by a primary user for communication, or uses a band being occupied by the primary user for communication on the premise that the communication quality of the primary user is ensured. According to the method provided by the invention, a secondary user transmitter can decode and transmit a primary user signal to promote primary user information transmission to acquire more opportunities to use a spectrum of the primary user for communication; the secondary user transmitter can collect energy from a part of received primary user signals to provide energy for relay transmission of the primary user information and the information transmission of the secondary user; the idea of dual decomposition is used for solving; optimal time and power allocation in a cooperative e communication scheme can be quickly acquired; and on the premise that the service quality of the primary user is ensured, the system capacity of the secondary user is effectively improved.

Description

A kind of implementation method of the timesharing communication for coordination based on OFDM cognition network
Technical field
The present invention relates to a kind of implementation method of the timesharing communication for coordination based on OFDM cognition network, belong to wireless communication technology field.
Background technology
The evolution of mobile communication system and develop rapidly, being mobile subscriber provides ubiquitous wireless access and high-speed wideband wireless transmission to become possibility, but day by day increases energy demand.The energy resource consumption of rapid upgrading not only increases the operating cost of communication system, has also caused serious environmental problem simultaneously.Green communications technology, especially energy collection technology more and more receive the concern of academia and industrial quarters.The wherein energy collection technology of radio signal, makes the equipment in wireless network skyborne for dispersed radio signal can be converted to electric energy and is used, extend its life cycle; And radio signal has been widely used in radio communication.Therefore, be worth for mobile terminal provides wireless data access and wireless energy to have very large Theory and applications simultaneously.
In traditional frequency spectrum sharing method, secondary user or the unappropriated band communication of use primary user, or the band communication using primary user taking under the prerequisite guaranteeing primary user's communication quality.And time user's reflector not only can decode forwarding primary user signal to promote primary user's information transmission in the method, thus the acquisition primary user's frequency spectrum that uses carries out the chance communicated more, can also from the part primary user signal received harvest energy, be the relay transmission of primary user's information and the information transmission energy supply of time user itself.By said method, the present invention utilizes the thinking of Duality Decomposition to solve, and obtains the middle time of communication for coordination scheme and the optimum allocation of power more quickly, under the prerequisite guaranteeing primary user's service quality, effectively improves the power system capacity of time user.
Summary of the invention
The object of the invention is to solve above-mentioned the deficiencies in the prior art, for the OFDM cognitive radio networks with collection of energy function, propose the implementation method of the timesharing communication for coordination of a kind of OFDM (that is: orthogonal frequency division multiplexi) cognition network, energy between the method support primary and secondary user and the dual cooperation of information are the co-allocations maximizing the resource such as time of implementation and power based on system energy efficiency and transmission performance.
Cognitive radio technology is a kind of effective way improving the availability of frequency spectrum: secondary user monitors the frequency band service condition of primary user, selects the unappropriated space of mandate frequency spectrum of primary user to communicate; Or secondary user adopts undelay pattern, when not affecting primary user's proper communication, time user is allowed to use the mandate frequency spectrum of primary user, and now, in order to not produce remarkable harmful interference to primary user's receiving terminal, the transmitting power of secondary user's transmitting terminal is often restricted.Different from said method, secondary user's transmitting terminal can forward primary user's signal as cooperative relaying decoding, and promotion primary user information transmission also obtains the chance that more use primary user frequency spectrums carry out communicating; Simultaneously time user's transmitting terminal can also from the part primary user signal received harvest energy, be the information transmission energy supply of cooperative relaying transmission and time user itself.
The present invention solves the technical scheme that its technical problem takes: a kind of implementation method of the timesharing communication for coordination based on OFDM cognition network, the method comprises the steps:
Step 1: at energy cooperation transmit stage (that is: time slot τ 1, k), primary user's transmitting terminal PT passes through a kth subcarrier, with power p p1, kto primary user's receiving terminal PU kwith secondary user's transmitting terminal ST kbroadcast message x p1, k.Primary user's receiving terminal PU kwith secondary user's transmitting terminal ST kreceived signal strength be respectively y k P U 1 = p p 1 , k h p , k x p 1 , k + z k 1 With y k S T 1 = p p 1 , k h p s , k x p 1 , k + w k 1 . In this stage, primary user's receiving terminal PU kreceived signal strength speed be meanwhile, the signal that secondary user's transmitting terminal is received is converted to electric energy, namely
Step 2: in Cooperative For Information transmit stage, secondary user's transmitting terminal, as relaying, forwards the signal of primary user's transmitting terminal with semiduplex working method decoding.Particularly, at time slot τ 21, k, primary user's transmitting terminal PT passes through a kth subcarrier, with power p p2, kto primary user's receiving terminal PU kwith secondary user's transmitting terminal ST ktransmit x p2, k.Primary user's receiving terminal PU kwith secondary user's transmitting terminal ST kreceived signal strength be respectively y k P U 21 = p p 2 , k h p , k x p 2 , k + z k 2 With y k S T 2 = p p 2 , k h p s , k x p 2 , k + w k 2 , Corresponding signal rate is respectively
R k P U 21 ( τ 21 , k , p p 2 , k ) = τ 21 , k log 2 ( 1 + p p 2 , k | h p , k | 2 σ k 2 ) With R k S T 2 ( τ 21 , k , p p 2 , k ) = τ 21 , k log 2 ( 1 + p p 2 , k | h p s , k | 2 σ k 2 ) .
At ensuing time slot τ 22, k, secondary user's transmitting terminal ST kby a kth subcarrier, with power p s1, kto primary user's receiving terminal PU kdecoding forwards x p2, k, now primary user's transmitting terminal PT keeps idle condition.At this time slot, primary user's receiving terminal PU kreceived signal strength be y k P U 22 = p s 1 , k h s p , k x p 2 , k + z k 3 , Corresponding signal rate is R k P U 22 ( τ 22 , p s 1 , k ) = τ 22 log 2 ( 1 + p s 1 , k | h s p , k | 2 σ k 2 ) . Therefore, in reached at the signal rate of this cooperation stage primary user's receiving terminal be P p 2 , k ( τ 21 , τ 22 , p p 2 , k p s 1 , k ) = min [ R k P U 21 ( τ 21 , k , p p 2 , k ) + R k P U 22 ( τ 22 , k , p s 1 , k ) , R k S T 2 ( τ 21 , k , p p 2 , k ) ] .
Step 3: at secondary user profile individual transmission stage τ 3, that is: after ensureing that primary user's achievable rate requires, secondary user's transmitting terminal ST kby a kth subcarrier, with power p s2, ksignal x is sent to secondary user's receiving terminal SU s,k, now primary user's transmitting terminal PT keeps idle condition.In this stage, the Received signal strength of secondary user's receiving terminal SU is corresponding achievable rate is according to constraints, make time maximized optimal resource allocation strategy of user's achievable rate (τ 3, p s2, k), can obtain by solving following formula, that is:
max τ k , p k Σ k = 1 K R s , k ( τ 3 , k , p s 2 , k )
s . t . C 1 : R p 1 , k ( τ 1 , k , p p 1 , k ) + R k S T 2 ( τ 21 , k , p p 2 , k ) ≥ R p k , ∀ k
C 2 : R p 1 , k ( τ 1 , k , p p 1 , k ) + R k P U 21 ( τ 21 , k , p p 2 , k ) + R k P U 22 ( τ 22 , k , p s 1 , k ) ≥ R p k , ∀ k
C 3 : p s 1 , k τ 22 , k + p s 2 , k τ 3 , k ≤ Σ j = 1 K ( p p 1 , k | h j , k | 2 + σ j , k ) τ 1 , j η ϵ , ∀ k
C 4 : Σ k = 1 K p p 1 , k τ 1 , k + Σ k = 1 K p p 2 , k τ 21 , k ≤ P t
C 5 : 0 ≤ p p 1 , k ≤ p m a x , ≤ p p 2 , k ≤ p m a x , ∀ k
C 6 : τ 1 , k + τ 21 , k + τ 22 , k + τ 3 1 , k ≤ 1 , ∀ k
C 7 : τ 1 , k = τ 1 , 1 , ∀ k ∈ [ 2 , K ]
C 8 : 0 ≤ τ i , k ≤ 1 , ∀ i ∈ { 1 , 21 , 22 , 3 } , k
Step 4: above-mentioned non-convex problem is changed, makes p ' p1, k=p p1, kτ 1, k, p ' p2, k=p p2, kτ 21, k, p ' s1, k=p s1, kτ 22, kwith p ' s2, k=p s2, kτ 3, k.R p1,k1,k,p p1,k), R k P U 21 ( τ 21 , k , p p 2 , k ) , R k S T 2 ( τ 21 , k , p p 2 , k ) , R k P U 22 ( τ 22 , k , p s 1 , k ) , R s,k3, k, p s2, k) can be expressed as about (τ k, p ' k) concave function, namely R k P U 21 ( τ 21 , k , p p 2 , k ′ ) = τ 21 , k log 2 ( 1 + p p 2 , k ′ | h p , k | 2 τ 21 , k σ k 2 ) , R k S T 2 ( τ 21 , k , p p 2 , k ′ ) = τ 21 , k log 2 ( 1 + p p 2 , k ′ | h p s , k | 2 τ 21 , k σ k 2 ) , R k U 22 ( τ 22 , k , p p 2 , k ′ ) = τ 22 , k log 2 ( 1 + p s 1 , k ′ | h p s , k | 2 τ 22 , k σ k 2 ) With R s , k ( τ 3 , k , p s 2 , k ′ ) = τ 3 , k log 2 ( 1 + p s 2 , k ′ | h p s , k | 2 τ 3 , k σ k 2 ) . Thus, non-convex problem is rewritten as convex problem.Its concrete derivation proved comprises:
By observing above-mentioned function, all there is following form, wherein (x, t) is independent variable, and α>=0 is constant.Its Hessian matrix is:
▿ 2 f ( x , t ) = κ 2 t + κ x * - 1 x t x t - x 2 t 2
To given arbitrary real vector z=[z 1, z 2], have
Namely for negative semidefinite matrix, f (x, t) is the concave function about (x, t).In like manner, R can be proved p1, k1, k, p ' p1, k), R k P U 21 ( τ 21 , k , p p 2 , k ′ ) , R k S T 2 ( τ 21 , k , P p 2 , k ′ ) , R k P U 22 ( τ 22 , k , p s 1 , k ′ ) And R s,k3, k, p ' s2, k) be the convex function of corresponding independent variable.
Step 5: application dual decomposition method, introduces dual variable for each constraints in above-mentioned convex problem and Lagrangian L (s), whole problem can be disassembled into k subproblem L k(s k, p k, τ k), that is:
At internal layer, fixing dual variable s k, to each Lagrangian L k(s k, p k, τ k) Parallel application KKT condition, obtain the optimal value of corresponding former independent variable at skin, each former independent variable is collected, optimize whole updating dual variable according to subgradient algorithm, namely for the step-length that value is less.Iterate, until make both reach optimum simultaneously.Particularly, for internal layer iteration, by former independent variable (τ k, p ' k) be divided into τ kwith p ' ktwo groups of alternative optimization.Wherein fix τ k, obtain p ' by following various further optimization k;
p p 1 , k ′ = τ 1 , k α 1 , k [ ( λ k + μ k ) α 1 , k log ( 2 ) ( γ + ω k - Σ j = 1 K υ k | h j , k | 2 η ϵ ) - 1 ] + ,
p p 2 , k ′ = τ 21 , k - b k + b k 2 - 4 a k c k 2 a k , Wherein a k=log (2) (γ+κ k) α kβ k,
b k=log(2)(γ+κ k)(α kk)-(γ+κ kkβ k,c k=log(2)(γ+κ k)-(λ kβ kkα k),
p s 1 , k ′ = τ 22 , k ψ k [ μ k ψ k 1 o g ( 2 ) υ k - 1 ] + , ψ k = | h s p , k | 2 σ k 2 ,
Then p ' is fixed k, obtain τ by following various further optimization k, successively; Optimize until the two reaches optimum simultaneously, that is:
k=2…K.
Step 4 of the present invention comprises: prove R p1, k1, k, p ' p1, k), and R s,k3, k, p ' s2, k) for the concrete derivation of convex function be:
By observing above-mentioned function, all there is following form,
f ( x , t ) = t l o g ( 1 + α x t )
Wherein (x, t) is independent variable, and α >=0 is constant, and its Hessian matrix is
▿ 2 f ( x , t ) = κ 2 t + κ x * - 1 x t x t - x 2 t 2
To given arbitrary real vector z=[z 1, z 2], have
z T ▿ 2 f ( x , t ) z = - κ 2 ( tz 1 - xz 2 ) 2 t 2 ( t + κ x ) ≤ 0
Namely for negative semidefinite matrix, f (x, t) is the concave function about (x, t); In like manner, R can be proved p1, k1, k, p ' p1, k), R k P U 21 ( τ 21 , k , p p 2 , k ′ ) , R k S T 2 ( τ 21 , k , p p 2 , k ′ ) , R k P U 22 ( τ 22 , k , p s 1 , k ′ ) And R s,k3, k, p ' s2, k) be the convex function of corresponding independent variable.
Comprise in step 5 of the present invention: for internal layer iteration, by former independent variable (τ k, p ' k) be divided into τ kwith p ' ktwo groups of alternative optimization, wherein fix τ k, obtain p ' by following various further optimization k, namely;
p p 1 , k ′ = τ 1 , k α 1 , k [ ( λ k + μ k ) α 1 , k log ( 2 ) ( γ + ω k - Σ j = 1 K υ k | h j , k | 2 η ϵ ) - 1 ] + ,
p p 2 , k ′ = τ 21 , k - b k + b k 2 - 4 a k c k 2 a k , Wherein a k=log (2) (γ+κ k) α kβ k,
b k=log(2)(γ+κ k)(α kk)-(γ+κ kkβ k,c k=log(2)(γ+κ k)-(λ kβ kkα k),
p s 1 , k ′ = τ 22 , k ψ k [ μ k ψ k 1 o g ( 2 ) υ k - 1 ] + , ψ k = | h s p , k | 2 σ k 2 ,
Then p ' is fixed k, obtain τ by following various further optimization k, optimize until the two reaches optimum simultaneously successively, that is:
k=2…K.
The present invention is applied in the cooperation transmission mode between the primary and secondary user under wireless messages and synchronous energy transmission sight, effectively improves the throughput of communication system and the efficiency of system.
Beneficial effect:
1, the present invention is by introducing time user as cooperating relay, effectively improves system transfer rate and expands area coverage, in the transmission performance improving wireless communication system, having bright prospects.
2, the present invention is directed to wireless messages and synchronous energy transmission sight, by introducing the dual cooperation transmission mode of wireless messages and energy between primary and secondary user, effectively improve the energy efficiency of wireless communication system.
Accompanying drawing explanation
Fig. 1 is the system block diagram of the OFDM cognition network in the embodiment of the present invention with collection of energy.
Fig. 2 is the schematic diagram of timesharing communication for coordination scheme between multiple primary and secondary user in OFDM cognition network.
Fig. 3 be in OFDM cognition network in primary and secondary synergic user communication scheme based on convex optimization Resourse Distribute flow chart.
Embodiment
Below in conjunction with Figure of description, the invention is described in further detail.
As shown in Figure 1, network comprises primary user's transmitting terminal PT, K primary user's receiving terminal PU, K time user's transmitting terminal ST, one customer objective receiving terminal SU.All primary and secondary users are single antenna.Wherein primary user's transmitting terminal PT and time customer objective receiving terminal SU sends and Received signal strength K sub-carrier channels respectively; And primary user's receiving terminal PU kwith secondary user's transmitting terminal ST kbe operated in a kth subcarrier, and secondary user's transmitting terminal ST kcan to primary user's receiving terminal PU kinformation is carried out decoding and is forwarded and harvest energy from acknowledge(ment) signal.Secondary user sends ST kafter assisting primary user's transmitting terminal PT to complete communication, take each subcarrier and transmit time user's self information to secondary user's receiving terminal SU.
Step 1: at energy cooperation transmit stage (that is: time slot τ 1, k), primary user PT transmitting terminal passes through a kth subcarrier, with power p p1, kto primary user's receiving terminal PU kwith secondary user's transmitting terminal ST kbroadcast message x p1, k.Primary user's receiving terminal PU kwith secondary user's transmitting terminal ST kreceived signal strength be respectively y k P U 1 = p p 1 , k h p , k x p 1 , k + z k 1 With y k S T 1 = p p 1 , k h p s , k x p 1 , k + w k 1 . In this stage, the Received signal strength speed of primary user's receiving terminal is meanwhile, the signal that secondary user's transmitting terminal is received is converted to electric energy, namely
Step 2: in Cooperative For Information transmit stage, secondary user's transmitting terminal, as relaying, forwards the signal of primary user's transmitting terminal with semiduplex working method decoding.Particularly, at time slot τ 21, k, primary user's transmitting terminal passes through a kth subcarrier, with power p p2, kto primary user's receiving terminal PU kwith secondary user's transmitting terminal ST ktransmit x p2, k.Primary user's receiving terminal PU kwith secondary user's transmitting terminal ST kreceived signal strength be respectively y k P U 21 = p p 2 , k h p , k x p 2 , k + z k 2 With y k S T 2 = p p 2 , k h p s , k x p 2 , k + w k 2 , Corresponding signal rate is respectively
R k P U 21 ( τ 21 , k , p p 2 , k ) = τ 21 , k log 2 ( 1 + p p 2 , k | h p , k | 2 σ k 2 ) With R k S T 2 ( τ 21 , k , p p 2 , k ) = τ 21 , k log 2 ( 1 + p p 2 , k | h p s , k | 2 σ k 2 ) .
At ensuing time slot τ 22, k, secondary user's transmitting terminal ST kby a kth subcarrier, with power p s1, kto primary user's receiving terminal PU kdecoding forwards x p2, k, now primary user's transmitting terminal keeps idle condition.At this time slot, primary user's receiving terminal PU kreceived signal strength be y k P U 22 = p s 1 , k h s p , k x p 2 , k + z k 3 , Corresponding signal rate is R k P U 22 ( τ 22 , p s 1 , k ) = τ 22 log 2 ( 1 + p s 1 , k | h s p , k | 2 σ k 2 ) . Therefore, in reached at the signal rate of this cooperation stage primary user's receiving terminal be P p 2 , k ( τ 21 , τ 22 , p p 2 , k p s 1 , k ) = min [ R k P U 21 ( τ 21 , k , p p 2 , k ) + R k P U 22 ( τ 22 , k , p s 1 , k ) , R k S T 2 ( τ 21 , k , p p 2 , k ) ] .
Step 3: at secondary user profile individual transmission stage τ 3, that is: after ensureing that primary user's achievable rate requires, secondary user's transmitting terminal ST kby a kth subcarrier, with power p s2, ksignal x is sent to secondary user's receiving terminal SU s,k, now primary user's transmitting terminal keeps idle condition.In this stage, the Received signal strength of secondary user's receiving terminal SU is corresponding achievable rate is according to constraints, make time maximized optimal resource allocation strategy of user's achievable rate (τ 3, p s2, k), can obtain by solving following formula, that is:
max τ k , p k Σ k = 1 K R s , k ( τ 3 , k , p s 2 , k )
s . t . C 1 : R p 1 , k ( τ 1 , k , p p 1 , k ) + R k S T 2 ( τ 21 , k , p p 2 , k ) ≥ R p k , ∀ k
C 2 : R p 1 , k ( τ 1 , k , p p 1 , k ) + R k P U 21 ( τ 21 , k , p p 2 , k ) + R k P U 22 ( τ 22 , k , p s 1 , k ) ≥ R p k , ∀ k
C 3 : p s 1 , k τ 22 , k + p s 2 , k τ 3 , k ≤ Σ j = 1 K ( p p 1 , k | h j , k | 2 + σ j , k ) τ 1 , j η ϵ , ∀ k
C 4 : Σ k = 1 K p p 1 , k τ 1 , k + Σ k = 1 K p p 2 , k τ 21 , k ≤ P t
C 5 : 0 ≤ p p 1 , k ≤ p m a x , ≤ p p 2 , k ≤ p m a x , ∀ k
C 6 : τ 1 , k + τ 21 , k + τ 22 , k + τ 3 1 , k ≤ 1 , ∀ k
C 7 : τ 1 , k = τ 1 , 1 , ∀ k ∈ [ 2 , K ]
C 8 : 0 ≤ τ i , k ≤ 1 , ∀ i ∈ { 1 , 21 , 22 , 3 } , k
Step 4: above-mentioned non-convex problem is changed, makes p ' p1, k=p p1, kτ 1, k, p ' p2, k=p p2, kτ 21, k, p ' s1, k=p s1, kτ 22, kwith p ' s2, k=p s2, kτ 3, k.R p1,k1,k,p p1,k), R k P U 21 ( τ 21 , k , p p 2 , k ) , R k S T 2 ( τ 21 , k , p p 2 , k ) , R k P U 22 ( τ 22 , k , p s 1 , k ) , R s,k3, k, p s2, k) can be expressed as about (τ k, p ' k) concave function, namely R k P U 21 ( τ 21 , k , p p 2 , k ′ ) = τ 21 , k log 2 ( 1 + p p 2 , k ′ | h p , k | 2 τ 21 , k σ k 2 ) , R k S T 2 ( τ 21 , k , p p 2 , k ′ ) = τ 21 , k log 2 ( 1 + p p 2 , k ′ | h p s , k | 2 τ 21 , k σ k 2 ) , R k U 22 ( τ 22 , k , p p 2 , k ′ ) = τ 22 , k log 2 ( 1 + p s 1 , k ′ | h p s , k | 2 τ 22 , k σ k 2 ) With R s , k ( τ 3 , k , p s 2 , k ′ ) = τ 3 , k log 2 ( 1 + p s 2 , k ′ | h p s , k | 2 τ 3 , k σ k 2 ) . Thus, non-convex problem is rewritten as convex problem.
Step 5: application dual decomposition method, introduces dual variable for each constraints in above-mentioned convex problem and Lagrangian L (s), whole problem can be disassembled into k subproblem L k(s k, p k, τ k), as shown in the formula.At internal layer, fixing dual variable s k, to each Lagrangian L k(s k, p k, τ k) Parallel application KKT condition, obtain the optimal value of corresponding former independent variable at skin, each former independent variable is collected, optimize whole updating dual variable according to subgradient algorithm, namely for the step-length that value is less.Iterate, until make both reach optimum simultaneously.
Particularly, for internal layer iteration, by former independent variable (τ k, p ' k) be divided into τ kwith p ' ktwo groups of alternative optimization.Wherein fix τ k, obtain p ' by following various further optimization k;
p p 1 , k ′ = τ 1 , k α 1 , k [ ( λ k + μ k ) α 1 , k l o g ( 2 ) ( γ + ω k - Σ j = 1 K υ k | h j , k | 2 η ϵ ) - 1 ] + ,
p p 2 , k ′ = τ 21 , k - b k + b k 2 - 4 a k c k 2 a k , Wherein a k=log (2) (γ+κ k) α kβ k,
b k=log(2)(γ+κ k)(α kk)-(γ+κ kkβ k,c k=log(2)(γ+κ k)-(λ kβ kkα k),
p s 1 , k ′ = τ 22 , k ψ k [ μ k ψ k 1 o g ( 2 ) υ k - 1 ] + , ψ k = | h s p , k | 2 σ k 2 ,
Then p ' is fixed k, obtain τ by following various further optimization k, successively; Optimize until the two reaches optimum simultaneously.
k=2…K.
Finally, former independent variable (τ, p ') and dual variable s reach optimum simultaneously, and calculate reaching and speed of time user thus.
Further, in step 4 of the present invention, R is proved p1, k1, k, p ' p1, k), and R s,k3, k, p ' s2, k) for the concrete derivation of convex function be:
By observing above-mentioned function, all there is following form,
f ( x , t ) = t l o g ( 1 + α x t )
Wherein (x, t) is independent variable, and α >=0 is constant, and its Hessian matrix is
▿ 2 f ( x , t ) = κ 2 t + κ x * - 1 x t x t - x 2 t 2
To given arbitrary real vector z=[z 1, z 2], have
z T ▿ 2 f ( x , t ) z = - κ 2 ( tz 1 - xz 2 ) 2 t 2 ( t + κ x ) ≤ 0
Namely for negative semidefinite matrix, f (x, t) is the concave function about (x, t); In like manner, R can be proved p1, k1, k, p ' p1, k), R k P U 21 ( τ 21 , k , p p 2 , k ′ ) , R k S T 2 ( τ 21 , k , p p 2 , k ′ ) , R k P U 22 ( τ 22 , k , p s 1 , k ′ ) And R s,k3, k, p ' s2, k) be the convex function of corresponding independent variable.
Further, in step 5 of the present invention, for internal layer iteration, by former independent variable (τ k, p ' k) be divided into τ kwith p ' ktwo groups of alternative optimization, wherein fix τ k, obtain p ' by following various further optimization k, namely;
p p 1 , k ′ = τ 1 , k α 1 , k [ ( λ k + μ k ) α 1 , k l o g ( 2 ) ( γ + ω k - Σ j = 1 K υ k | h j , k | 2 η ϵ ) - 1 ] + ,
p p 2 , k ′ = τ 21 , k - b k + b k 2 - 4 a k c k 2 a k , Wherein a k=log (2) (γ+κ k) α kβ k,
b k=log(2)(γ+κ k)(α kk)-(γ+κ kkβ k,c k=log(2)(γ+κ k)-(λ kβ kkα k),
p s 1 , k ′ = τ 22 , k ψ k [ μ k ψ k log ( 2 ) υ k - 1 ] + , ψ k = | h s p , k | 2 σ k 2 ,
Then p ' is fixed k, obtain τ by following various further optimization k, optimize until the two reaches optimum simultaneously successively;
k=2…K.
Embodiments described herein are only preferred implementation; and be not the restriction of scope; any based on the present invention's improvement of doing of spirit or equivalently to replace, only otherwise depart from the spirit and scope of the present invention, all should be encompassed within scope.

Claims (4)

1., based on an implementation method for the timesharing communication for coordination of OFDM cognition network, it is characterized in that, said method comprising the steps of:
Step 1: at energy cooperation transmit stage, that is: time slot τ 1, k, primary user's transmitting terminal PT passes through a kth subcarrier, with power p p1, kto primary user's receiving terminal PU kwith secondary user's transmitting terminal ST kbroadcast message x p1, k; Primary user's receiving terminal PU kwith secondary user's transmitting terminal ST kreceived signal strength be respectively y k P U 1 = p p 1 , k h p , k x p 1 , k + z k 1 With y k S T 1 = p p 1 , k h p s , k x p 1 , k + w k 1 ; In this stage, the Received signal strength speed of primary user's receiving terminal is meanwhile, the signal that secondary user's transmitting terminal is received is converted to electric energy, namely
Step 2: in Cooperative For Information transmit stage, secondary user's transmitting terminal, as relaying, forwards the signal of primary user's transmitting terminal with semiduplex working method decoding; At time slot τ 21, k, primary user's transmitting terminal PT passes through a kth subcarrier, with power p p2, kto primary user's receiving terminal PU kwith secondary user's transmitting terminal ST ktransmit x p2, k; Primary user's receiving terminal PU kwith secondary user's transmitting terminal ST kreceived signal strength be respectively y k P U 21 = p p 2 , k h p , k x p 2 , k + z k 2 With y k S T 2 = p p 2 , k h p s , k x p 2 , k + w k 2 , Corresponding signal rate is respectively:
R k P U 21 ( τ 21 , k , p p 2 , k ) = τ 21 , k log 2 ( 1 + p p 2 , k | h p , k | 2 σ k 2 ) With R k S T 2 ( τ 21 , k , p p 2 , k ) = τ 21 , k log 2 ( 1 + p p 2 , k | h p s , k | 2 σ k 2 ) ;
At ensuing time slot τ 22, k, secondary user's transmitting terminal ST kby a kth subcarrier, with power p s1, kto primary user's receiving terminal PU kdecoding forwards x p2, k, now primary user's transmitting terminal PT keeps idle condition, at this time slot, and primary user's receiving terminal PU kreceived signal strength be y k P U 22 = p s 1 , k h s p , k x p 2 , k + z k 3 , Corresponding signal rate is R k P U 22 ( τ 22 , p s 1 , k ) = τ 22 log 2 ( 1 + p s 1 , k | h s p , k | 2 σ k 2 ) ; In this cooperation stage, reached at the signal rate of primary user's receiving terminal is P p 2 , k ( τ 21 , τ 22 , p p 2 , k p s 1 , k ) = min [ R k P U 21 ( τ 21 , k , p p 2 , k ) + R k P U 22 ( τ 22 , k , p s 1 , k ) , R k S T 2 ( τ 21 , k , p p 2 , k ) ] ;
Step 3: at secondary user profile individual transmission stage τ 3, k, that is: after ensureing that primary user's achievable rate requires, secondary user's transmitting terminal ST kby a kth subcarrier, with power p s2, ksignal x is sent to secondary user's receiving terminal SU s,k, now primary user's transmitting terminal PT keeps idle condition; In this stage, the Received signal strength of secondary user's receiving terminal SU is corresponding achievable rate is according to constraints, make time maximized optimal resource allocation strategy of user's achievable rate (τ 3, p s2, k), obtain by solving following formula:
m a x τ k , p k Σ k = 1 K R s , k ( τ 3 , k , p s 2 , k )
s . t . C 1 : R p 1 , k ( τ 1 , k , p p 1 , k ) + R k S T 2 ( τ 21 , k , p p 2 , k ) ≥ R p k , ∀ k
C 2 : R p 1 , k ( τ 1 , k , p p 1 , k ) + R k P U 21 ( τ 21 , k , p p 2 , k ) + R k P U 22 ( τ 22 , k , p s 1 , k ) ≥ R p k , ∀ k
C 3 : p s 1 , k τ 22 , k + p s 2 , k τ 3 , k ≤ Σ j = 1 K ( p p 1 , k | h j , k | 2 + σ j , k ) τ 1 , j η ϵ , ∀ k
C 4 : Σ k = 1 K p p 1 , k τ 1 , k + Σ k = 1 K p p 2 , k τ 21 , k ≤ P t
C 5 : 0 ≤ p p 1 , k ≤ p m a x , ≤ p p 2 , k ≤ p m a x , ∀ k
C 6 : τ 1 , k + τ 21 , k + τ 22 , k + τ 3 1 , k ≤ 1 , ∀ k
C 7 : τ 1 , k = τ 1 , 1 , ∀ k ∈ [ 2 , K ]
C 8 : 0 ≤ τ i , k ≤ 1 , ∀ i ∈ { 1 , 21 , 22 , 3 } , k
Step 4: above-mentioned non-convex problem is changed, makes p ' p1, k=p p1, kτ 1, k, p ' p2, k=p p2, kτ 21, k, p ' s1, k=p s1, kτ 22, kwith p ' s2, k=p s2, kτ 3, k, R p1, k1, k, p p1, k), r s,k3, k, p s2, k) be expressed as about (τ k, p ' k) concave function, that is: R p 1 , k ( τ 1 , k , p p 1 , k ′ ) = τ 1 , k log 2 ( 1 + p p 1 , k ′ | h p , k | 2 τ 1 , k σ k 2 ) , R k P U 21 ( τ 21 , k , p p 2 , k ′ ) = τ 21 , k log 2 ( 1 + p p 2 , k ′ | h p , k | 2 τ 21 , k σ k 2 ) , R k S T 2 ( τ 21 , k , p p 2 , k ′ ) = τ 21 , k log 2 ( 1 + p p 2 , k ′ | h p s , k | 2 τ 21 , k σ k 2 ) , R k U 22 ( τ 22 , k , p p 2 , k ′ ) = τ 22 , k log 2 ( 1 + p s 1 , k ′ | h p s , k | 2 τ 22 , k σ k 2 ) With R s , k ( τ 3 , k , p s 2 , k ′ ) = τ 3 , k log 2 ( 1 + p s 2 , k ′ | h p s , k | 2 τ 3 , k σ k 2 ) , Thus, non-convex problem is rewritten as convex problem;
Step 5: application dual decomposition method, introduces dual variable for each constraints in above-mentioned convex problem and Lagrangian L (s), whole problem is disassembled into k subproblem L k(s k, p k, τ k), that is:
At internal layer, fixing dual variable s k, to each Lagrangian L k(s k, p k, τ k) Parallel application KKT condition, obtain the optimal value of corresponding former independent variable at skin, each former independent variable is collected, optimize whole updating dual variable according to subgradient algorithm, namely for the step-length that value is less, iterate, until make both reach optimum simultaneously.
2. the implementation method of a kind of timesharing communication for coordination based on OFDM cognition network according to claim 1, it is characterized in that, described step 4 comprises: prove R p1, k1, k, p ' p1, k), and R s,k3, k, p ' s2, k) for the concrete derivation of convex function be:
By observing above-mentioned function, all there is following form,
f ( x , t ) = t l o g ( 1 + α x t )
Wherein (x, t) is independent variable, and α >=0 is constant, and its Hessian matrix is
▿ 2 f ( x , t ) = κ 2 t + κ x * - 1 x t x t - x 2 t 2
To given arbitrary real vector z=[z 1, z 2], have
z T ▿ 2 f ( x , t ) z = - κ 2 ( tz 1 - xz 2 ) 2 t 2 ( t + κ x ) ≤ 0
I.e. ▽ 2f (x, t) is negative semidefinite matrix, and f (x, t) is the concave function about (x, t); In like manner, R can be proved p1, k1, k, p ' p1, k), with for the convex function of corresponding independent variable.
3. the implementation method of a kind of timesharing communication for coordination based on OFDM cognition network according to claim 1, it is characterized in that, described step 5 comprises: for internal layer iteration, by former independent variable (τ k, p ' k) be divided into τ kwith p ' ktwo groups of alternative optimization, wherein fix τ k, obtain p ' by following various further optimization k, namely;
p p 1 , k ′ = τ 1 , k α 1 , k [ ( λ k + μ k ) α 1 , k l o g ( 2 ) ( γ + ω k - Σ j = 1 K υ k | h j , k | 2 η ϵ ) - 1 ] + ,
p p 2 , k ′ = τ 21 , k - b k + b k 2 - 4 a k c k 2 a k , Wherein a k=log (2) (γ+κ k) α kβ k,
b k=log(2)(γ+κ k)(α kk)-(γ+κ kkβ k,c k=log(2)(γ+κ k)-(λ kβ kkα k),
p s 1 , k ′ = τ 22 , k ψ k [ μ k ψ k log ( 2 ) υ k - 1 ] + , ψ k = | h s p , k | 2 σ k 2 ,
Then p ' is fixed k, obtain τ by following various further optimization k, optimize until the two reaches optimum simultaneously successively, that is:
k=2…K.
4. the implementation method of a kind of timesharing communication for coordination based on OFDM cognition network according to claim 1, is characterized in that: described method is applied in the cooperation transmission mode between the primary and secondary user under wireless messages and synchronous energy transmission sight.
CN201510443233.3A 2015-07-24 2015-07-24 A kind of implementation method of the timesharing communication for coordination based on OFDM cognition network Active CN105072621B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510443233.3A CN105072621B (en) 2015-07-24 2015-07-24 A kind of implementation method of the timesharing communication for coordination based on OFDM cognition network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510443233.3A CN105072621B (en) 2015-07-24 2015-07-24 A kind of implementation method of the timesharing communication for coordination based on OFDM cognition network

Publications (2)

Publication Number Publication Date
CN105072621A true CN105072621A (en) 2015-11-18
CN105072621B CN105072621B (en) 2019-06-18

Family

ID=54501872

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510443233.3A Active CN105072621B (en) 2015-07-24 2015-07-24 A kind of implementation method of the timesharing communication for coordination based on OFDM cognition network

Country Status (1)

Country Link
CN (1) CN105072621B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105554832A (en) * 2015-12-16 2016-05-04 山东大学 Cooperative communication system with two relay nodes for alternative energy collection and information relaying and communication method thereof
CN105634541A (en) * 2015-12-29 2016-06-01 北京邮电大学 Full-duplex simultaneous wireless information and power transfer method and nodes
CN106304112A (en) * 2016-08-14 2017-01-04 辛建芳 A kind of cellular network energy efficiency optimization method based on relay cooperative
CN106658528A (en) * 2016-12-01 2017-05-10 广东技术师范学院 Cooperative transmission method and device of cognitive radio network based on renewable energy
CN107332602A (en) * 2017-06-20 2017-11-07 华中科技大学 Full duplex relaying energy under the conditions of energy constraint reclaims communication means and system certainly
CN107707290A (en) * 2017-10-11 2018-02-16 中山大学新华学院 Based on two-channel trunking method
CN108540247A (en) * 2018-01-10 2018-09-14 河海大学常州校区 Frequency spectrum perception and information transferring method with collection of energy in cognition wireless network
CN109547132A (en) * 2018-11-19 2019-03-29 浙江工业大学 It is a kind of that energy communication means is wirelessly taken based on the two-way cooperation of orthogonal frequency division multiplexing amplification forwarding

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103458470A (en) * 2013-07-25 2013-12-18 北京邮电大学 QoS-based transmission method in cognitive relay system
CN103916949A (en) * 2013-01-04 2014-07-09 北京邮电大学 Power distribution method and device for two-way relay transmission in wireless cognitive network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103916949A (en) * 2013-01-04 2014-07-09 北京邮电大学 Power distribution method and device for two-way relay transmission in wireless cognitive network
CN103458470A (en) * 2013-07-25 2013-12-18 北京邮电大学 QoS-based transmission method in cognitive relay system

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
GUFTAAR AHMAD SARDAR SIDHU, FEIFEI GAO,WEI WANG, AND WEN CHEN: "Resource Allocation in Relay-Aided OFDM Cognitive Radio Networks", 《IEEE》 *
GUFTAAR AHMAD SARDAR SIDHU1, FEIFEI GAO, WEN CHEN, AND WEI WANG: "Joint Subcarrier Pairing and Power Loading in Relay Aided Cognitive Radio Networks", 《IEEE》 *
SHUO LI, BINGQUAN LI, CHENGWEN XING, ZESONG FEI AND SHAODAN: "Joint Resource Allocation for Learning-based Cognitive Radio Networks with MIMO-OFDM Relay-Aided Transmissions", 《IEEE》 *
卢为党1,2,吴宣利2,沙学军2,张乃通2: "基于OFDM 协作中继的机会主义频谱共享协议及其最优资源分配", 《通信学报》 *
罗荣华1,2,杨震1,: "基于最佳中继选择的认知网络功率分配", 《机器仪表学报》 *
赵晓晖,沙京祺: "基于DF中继的认知OFDM 协作系统的资源分配算法", 《吉林大学学报(工学版)》 *

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105554832A (en) * 2015-12-16 2016-05-04 山东大学 Cooperative communication system with two relay nodes for alternative energy collection and information relaying and communication method thereof
CN105634541A (en) * 2015-12-29 2016-06-01 北京邮电大学 Full-duplex simultaneous wireless information and power transfer method and nodes
CN106304112B (en) * 2016-08-14 2019-09-03 正链科技(深圳)有限公司 A kind of cellular network energy efficiency optimization method based on relay cooperative
CN106304112A (en) * 2016-08-14 2017-01-04 辛建芳 A kind of cellular network energy efficiency optimization method based on relay cooperative
CN106658528A (en) * 2016-12-01 2017-05-10 广东技术师范学院 Cooperative transmission method and device of cognitive radio network based on renewable energy
CN106658528B (en) * 2016-12-01 2023-08-25 广东技术师范学院 Renewable energy source based cognitive wireless network cooperative transmission method and device
CN107332602B (en) * 2017-06-20 2018-03-27 华中科技大学 Full duplex relaying energy under the conditions of energy constraint reclaims communication means and system certainly
CN107332602A (en) * 2017-06-20 2017-11-07 华中科技大学 Full duplex relaying energy under the conditions of energy constraint reclaims communication means and system certainly
CN107707290A (en) * 2017-10-11 2018-02-16 中山大学新华学院 Based on two-channel trunking method
CN108540247A (en) * 2018-01-10 2018-09-14 河海大学常州校区 Frequency spectrum perception and information transferring method with collection of energy in cognition wireless network
CN108540247B (en) * 2018-01-10 2021-03-05 河海大学常州校区 Spectrum sensing and information transmission method with energy collection in cognitive wireless network
CN109547132A (en) * 2018-11-19 2019-03-29 浙江工业大学 It is a kind of that energy communication means is wirelessly taken based on the two-way cooperation of orthogonal frequency division multiplexing amplification forwarding
CN109547132B (en) * 2018-11-19 2021-04-06 浙江工业大学 Wireless energy-carrying communication method based on orthogonal frequency division multiplexing amplification forwarding bidirectional cooperation

Also Published As

Publication number Publication date
CN105072621B (en) 2019-06-18

Similar Documents

Publication Publication Date Title
CN105072621A (en) Time-sharing cooperative communication implementation method based on OFDM cognitive network
CN105207754B (en) Method for sending information, message receiving method, apparatus and system
Jia et al. Cooperative relay for cognitive radio networks
CN105337651B (en) The user choosing method of non-orthogonal multiple access system downlink under a kind of Limited Feedback
CN105451322B (en) A kind of channel distribution and Poewr control method based on QoS in D2D network
CN102664855B (en) Orthogonal frequency division multiplexing (OFDM)-based channel assignment method in two-layer network
US8238301B2 (en) Method, system, and wireless frame structure for supporting different mode of multiple access
CN105379145A (en) Method and device for transmitting data in WLAN system
CN104301984A (en) Power control method based on time domain half-duplex relay in D2D cellular network
CN103379502B (en) The frequency spectrum resource allocation method of D2D technology is introduced in a kind of cellular network
CN103298086B (en) Wireless network multichannel combination communication method
CN104717755A (en) Downlink frequency spectrum resource distribution method with D2D technology introduced in cellular network
CN106851847A (en) Base station, wireless communications method, wireless communication system and wireless terminal
CN103200578B (en) A kind of variable bandwidth channel distribution method based on cognition wireless local area network (LAN)
CN104703270B (en) User's access suitable for isomery wireless cellular network and power distribution method
CN104080126B (en) Cellular network power-economizing method based on coordinated multipoint transmission
Liu et al. Energy-efficient resource allocation in full-duplex relaying networks
CN110278576A (en) A kind of wireless energy acquisition non-orthogonal multiple access system resource allocation methods
CN108370557A (en) The method and apparatus of operating resource in a wireless communication system
CN106714293A (en) Resource distribution method for relay network with energy harvesting nodes based on QoS demand
CN103117844B (en) Based on the multi-housing-area orthogonal frequency-division multiplexing system resource allocation methods of relaying
CN104244413A (en) Subframe configuration indication method and system in device-to-device (D2D) communication
CN106255194A (en) Federated resource in co-operative cellular network cooperation distribution method under hybrid power supply pattern
CN104581837A (en) Data distribution method with energy-saving effect by means of D2D cooperative communication at equal data block transmission time
CN103249124B (en) Dense distribution formula wireless communications method and system thereof

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

Address after: 210003 new model road 66, Gulou District, Nanjing, Jiangsu

Applicant after: Nanjing Post & Telecommunication Univ.

Address before: 210023 9 Wen Yuan Road, Qixia District, Nanjing, Jiangsu.

Applicant before: Nanjing Post & Telecommunication Univ.

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant