CN103856299A - Signal safe transmission method of MIMO amplifying forwarding relay network - Google Patents

Signal safe transmission method of MIMO amplifying forwarding relay network Download PDF

Info

Publication number
CN103856299A
CN103856299A CN201410025414.XA CN201410025414A CN103856299A CN 103856299 A CN103856299 A CN 103856299A CN 201410025414 A CN201410025414 A CN 201410025414A CN 103856299 A CN103856299 A CN 103856299A
Authority
CN
China
Prior art keywords
node
matrix
mimo
overbar
sending node
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
CN201410025414.XA
Other languages
Chinese (zh)
Other versions
CN103856299B (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.)
Xian Jiaotong University
Original Assignee
Xian Jiaotong 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 Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN201410025414.XA priority Critical patent/CN103856299B/en
Publication of CN103856299A publication Critical patent/CN103856299A/en
Application granted granted Critical
Publication of CN103856299B publication Critical patent/CN103856299B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention provides a signal safe transmission method of an MIMO amplifying forwarding relay network. According to the method, in the process of designing a precoding matrix, the GSVD-ZF-SVD joint strategy is adopted to parallelize a system, the expression mode of the safety speed of the system is simplified, and an optimization problem is solved under power constraint; in the power distribution process, the non-convexity of the original problem makes direct solutions difficult to work out, each sub-problem can have the only optimal solution due to the adoption of alternating iteration and optimization, and a point of convergence can be finally obtained through alternating iteration. In the method, joint precoding of a sending node end and a relay node is considered, channels are parallelized through the GSVD-ZF-SVD method, and therefore problem analysis is simplified. Power distribution is optimized. Calculation complexity is small.

Description

A kind of signals security transmission method of MIMO amplification forwarding junction network
Technical field
The invention belongs to radio transmission technical field, particularly a kind of signals security transmission method of MIMO amplification forwarding junction network.
Background technology
Safety problem is a basic problem in radio communication.The opening of wireless medium, has brought larger challenge to fail safe.The physical layer safe practice of radio communication is a new wireless signal safe transmission technology.It does not rely on and utilizes secret key encryption to realize Security Data Transmission, but by appropriate design signal, distribution power and modulation coding mode, improve the safe speed of signal transmission, the information that prevents stolen hearer eavesdrop, thereby promoted the safety of communication.In recent years, radio physical layer has obtained safely the very big concern of academia.
Multiple-input and multiple-output (MIMO) technology and trunking traffic technology are two means that promote the physical layer safety of radio communication.They can, by utilizing spatial degrees of freedom, make the design of signal more flexible, safe speed that can both raising radio transmission.Both combinations can further be promoted to the physical layer transmission safety of radio communication.But, the physical layer safe transmission signal of a MIMO junction network is directly carried out to optimal design very difficult, cannot obtain an effective result, therefore the result of study of this respect is less at present.
J.Huang, A.L.Swindlehutst document " Cooperative jamming for secure communications in MIMO relay network; " IEEE Trans.Signal Processing, vol.59, no.10, pp.4871-4884, has considered to utilize repeat transmitted interference signal to realize signals security transmission in Oct.2011.But what consider is the trunking plan that relaying adopts decoding to forward.Decoding forwarding scheme requires via node to decode to information, and this increases the complexity of system, and the time delay of simultaneity factor increases, and also must guarantee to be correctly decoded at via node.
Liu Yang, Song Mei, the people such as Zhang Yong have mentioned the problem of relaying safety in patent of invention " the safe retransmission method of wireless relay based on hierarchical modulation ", but do not consider to utilize MIMO technology, and in addition, what inventor considered is also to decode at via node.
Summary of the invention
The object of the present invention is to provide a kind of signals security transmission method of MIMO amplification forwarding junction network, to improve the fail safe of communication; The present invention is that the radio physical layer under MIMO junction network is proposed safely to algorithm complex is lower and can realize the method for higher rate.
To achieve these goals, the present invention adopts following technical scheme:
A kind of signals security transmission method of MIMO amplification forwarding junction network, described MIMO amplification forwarding junction network comprises a sending node, a via node, an eavesdropping node and a receiving node, each node is all equipped with many antennas, and number of antennas is respectively N a, N r, N e, N b;
Described signals security transmission method comprises the following steps:
1) first stage, sending node carries out linear predictive coding to transmission information, and the information that via node and eavesdropping node receive sending node transmitting is respectively: y r=H aRfs+n r,
Figure BDA0000459177460000021
wherein H aR, H aEbe the channel matrix of sending node to via node and eavesdropping node, F is sending node Linear precoding matrix, and s is sending node transmitting dope vector, and covariance matrix is
Figure BDA0000459177460000022
n r,
Figure BDA0000459177460000023
be additive Gaussian noise vector, covariance matrix is
Figure BDA0000459177460000024
y r,
Figure BDA0000459177460000025
to receive vector;
2) second stage, via node, by the signal receiving, carries out amplification forwarding, and pre-coding matrix is W, and the information that receiving node and eavesdropping node receive is for being respectively:
y B=H RBWH ARFs+H RBWn R+n B, y E ( 2 ) = H RE WH AR Fs + H RE Wn R + n E ( 2 ) .
Wherein H rB, H rEthe channel matrix of via node to receiving node and eavesdropping node, n b,
Figure BDA0000459177460000027
be additive white Gaussian noise, covariance matrix is
Figure BDA0000459177460000028
y b,
Figure BDA0000459177460000029
to receive vector;
The eavesdropping node reception information of equivalence is:
y E = y E ( 1 ) y E ( 2 ) = H E s + n E , H E = H AE F H RE WH AR F , n E = n E ( 1 ) H RE Wn R + n E ( 2 )
3) under power constraint, maximize the speed of safe transmission, optimized power is distributed, and realizes maximum safe speed:
R s=max(I(y B;s)-I(y E;s)) +
s . t . σ s 2 tr ( FF H ) ≤ P 1
tr ( σ s 2 WH AR FF H H AR H W H + σ n 2 WW H ) ≤ P 2
The present invention further improves and is: the step that obtains the pre-coding matrix of sending node and via node comprises:
First to channel matrix H aR, H aEcarrying out generalized singular value decomposition obtains:
H AR=UΛ ARΦ
H AE=VΛ AEΦ
Wherein Φ=R Ψ ha N a× N anonsingular matrix, U, V is unitary matrice Λ aRand Λ aEfor:
Λ AR = 0 0 D AR 0 0 I q × q N R × M
Λ AE = D AE 0 0 0 ( N E - s ) × q N E × M
Wherein q+s=N a, K=N a=M,
D aR=diag (d aR, 1, d aR, 2..., d aR, s), D aE=diag (d aE, 1, d aE, 2..., d aE, s), wherein d aR, iascending order is arranged, d aE, idescending; Designing the pre-coding matrix of making a start is:
F = ΨR - 1 | | R - 1 | | P a
Wherein P a = diag ( p a , 1 , p a , 2 , · · · , p a , K ) ;
If via node to the singular value decomposition of validated user channel matrix is
Figure BDA0000459177460000042
Σ RB = 0 Σ ‾ RB , Σ ‾ RB = diag ( λ RB , 1 , λ RB , 2 , · · · , λ RB , K ) , Design pre-coding matrix W makes to eavesdrop node and does not receive any information in second stage, even
Figure BDA0000459177460000045
Figure BDA0000459177460000046
h rEthe projection matrix of kernel, makes H rEw=0; Then utilize singular value decomposition, design relaying pre-coding matrix is
W ‾ = V ‾ P r U H
W = H RE ⊥ V ‾ P r U H
Wherein,
Figure BDA0000459177460000049
so just complete the design of the pre-coding matrix of sending node and via node;
The present invention further improves and is: in step 3), obtaining safe speed and power constraint thereof is:
max p a , k , p r , k R s = 1 2 Σ k = 1 K [ log ( 1 + ρ ‾ p r , k p a , k λ RB , k 2 d ‾ AR , k 2 1 + p r , k λ RB , k 2 ) - log ( 1 + ρ ‾ p a , k d ‾ AE , k 2 ) ]
s . t . P A = σ s 2 Σ k = 1 K p a , k ≤ P 1
P R = σ n 2 Σ k = 1 K ( ρ ‾ p r , k p a , k d ‾ AR , k 2 + p r , k ) ≤ P 2
Wherein P 1, P 2respectively the gross power of sending node and via node,
Figure BDA00004591774600000413
D ‾ AR = diag ( d AR , 1 , d AR , 2 , · · · , d AR , s , 1 , · · · , 1 ) , D ‾ AE = diag ( d AE , 1 , d AE , 2 , · · · , d AE , s , 0 , · · · , 0 )
Figure BDA00004591774600000416
be respectively
Figure BDA00004591774600000417
k diagonal element.
The present invention further improves and is: safe speed and power constraint thereof are adopted to the alternately method of iterative; First carry out substitution of variable z k=p a,k, r k = ρ ‾ p r , k p a , k d ‾ AR , k 2 + p r , k , P ‾ 1 = P 1 / σ s 2 , P ‾ 2 = P 2 / σ n 2 , Above-mentioned optimization problem is out of shape, as given z k, optimize r kthe problem of being optimized is:
max r k Σ k = 1 K log ( 1 + λ RB , k 2 r k 1 + λ RB , k 2 r k + ρ ‾ d ‾ AR , k 2 z k )
s . t . Σ k = 1 K r k ≤ P ‾ 2 , r k ≥ 0 , k = 1,2 , · · · , K .
Its solution is
r k * ( v ) = 1 2 λ RB , k 2 [ ( ρ ‾ d ‾ AR , k 2 z k ) 2 + 4 ρ ‾ d ‾ AR , k 2 z k λ RB , k 2 v - ρ ‾ d ‾ AR , k 2 z k - 2 ] +
Wherein [x] +represent to get the greater between x and 0, variable ν need to meet following formula
Σ k = 1 K r k * ( v ) = P ‾ 2
As fixing r k, optimize z k, the problem of being optimized is
max z k Σ k = 1 K [ log ( 1 + a k z k 1 + b k + c k z k ) - log ( 1 + c k z k ) ]
s . t . Σ k = 1 K z k ≤ P ‾ 1 , z k ≥ 0 , k = 1,2 , · · · , K .
The present invention further improves and is: when sending node is than the few or identical situation of eavesdropping node antenna, separate to be:
(1) when Σ k ∈ Ω P ‾ c , k ≤ P ‾ 1 Time, separate and be wherein set omega is all d of meeting k=a kb k-b kc k-c kthe k composition of >0, P ‾ c , k = - 2 a k c k + 4 a k 2 c k 2 + 4 a k 2 c k d k 2 a k 2 c k
(2) when Σ k ∈ Ω P ‾ c , k > P ‾ 1 Time, separate and be wherein
Figure BDA00004591774600000512
be ln 2 ( 1 + a k z k ) ( 1 + b k + a k z k ) ( 1 + c k z k ) μ + a k 2 c k z k 2 + 2 a k c k z k - d k = 0 Three solutions, and meet Σ k = 1 K z k * = P ‾ 1 ;
When sending node has the situation of more antennas than eavesdropping node antenna, separate to be:
Figure BDA0000459177460000061
Wherein set omega 0={ k:k ∈ Ω, c k=0}, Ω +={ k:k ∈ Ω, c k>0};
By replacing iteration, end product converges to a some place, obtains power division.
Compared with the existing methods, the invention has the beneficial effects as follows:
1, consider the associating precoding of sending node end and via node, utilized GSVD-ZF-SVD method, by channel parallelization, simplified the analysis difficulty of problem; And carry out optimum power division.Under the prerequisite of safe transmission, realize flank speed transmission.
2, computation complexity is lower: alternately the result of iteration optimization has two, and one is to obtain closed solutions, and one is the result that obtains a similar water filling, and computation complexity is low.
Accompanying drawing explanation
Fig. 1 is the related system model of the inventive method.
Fig. 2 is the parallel channel figure of equivalence in the present invention.
Fig. 3 a and Fig. 3 b are existing methodical simulation results, and wherein: Fig. 3 a has provided the change curve of safe speed and via node power constraint, Fig. 3 b has provided the change curve of safe speed and sending node end power constraint.
Embodiment
Below in conjunction with accompanying drawing and specific embodiment, the present invention is described in further detail.
The present invention relates to system model as shown in Figure 1, have a sending node (Alice), a via node (Relay), a receiving node (Bob) and an eavesdropping node (Eve), each node disposes multiple antennas, and number of antennas is respectively N a, N r, N e, N b.Via node adopts the relaying strategy of AF (amplification forwarding) to carry out to received signal amplification forwarding.By (sending node-trunk channel matrix, sending node-tapping channel matrix) utilized to generalized singular value decomposition (GSVD), match at sending node end design pre-coding matrix, obtain sending node pre-coding matrix and be
Figure BDA0000459177460000071
at via node, via node utilizes ZF-SVD method design pre-coding matrix to the information receiving, and obtains relaying pre-coding matrix and is thereby realize the parallelization of channel, as shown in Figure 2.
A, when sending node end number of antennas is not as eavesdropping node is many time, the power division obtaining is:
(1) when Σ k ∈ Ω P ‾ c , k ≤ P ‾ 1 Time, separate and be
Figure BDA0000459177460000074
wherein set omega is all d of meeting k=a kb k-b kc k-c kthe k composition of >0, P ‾ c , k = - 2 a k c k + 4 a k 2 c k 2 + 4 a k 2 c k d k 2 a k 2 c k
(2) when Σ k ∈ Ω P ‾ c , k > P ‾ 1 Time, separate and be wherein
Figure BDA0000459177460000078
be ln 2 ( 1 + a k z k ) ( 1 + b k + a k z k ) ( 1 + c k z k ) μ + a k 2 c k z k 2 + 2 a k c k z k - d k = 0 Three solutions, and meet Σ k = 1 K z k * = P ‾ 1 .
B and when sending node end number of antennas is more time, obtain power division to be:
Figure BDA00004591774600000711
Can see, in the time that sending node number of antennas is less, sending node end power is not The more the better, and it exists an optimal value, and this can reflect from Fig. 3 b.In this case, if sending node end power all uses, first stage leakage rate is increased, and the rate of information throughput of second stage is subject to the constraint of via node power, and the safe speed of system has been reduced on the contrary.And in the time that sending node number of antennas is more, there will be c k=0 situation, in this time, eavesdropping node is actually information not available, thereby all distributes the sending node power to there will not be the anti-situation of falling of speed.These discussion can be found out from Fig. 3.No matter which kind of situation, final safe speed all can tend to be steady, and this is the reason of sending node end or via node power limited.
The signals security transmission method of a kind of MIMO amplification forwarding of the present invention junction network, comprises the following steps:
1) first stage, sending node carries out linear predictive coding to transmission information, and via node and eavesdropping node receive respectively the information y of sending node transmitting r=H aRfs+n r,
Figure BDA0000459177460000081
wherein H aR, H aEbe channel matrix, F is sending node Linear precoding matrix, and s is sending node transmitting dope vector, n r,
Figure BDA0000459177460000082
additive Gaussian noise vector, y r,
Figure BDA0000459177460000083
to receive vector.
2) second stage, via node, by the signal receiving, carries out amplification forwarding, and pre-coding matrix is W, and the information that receiving node and eavesdropping node receive is y b=H rBwH aRfs+H rBwn r+ n b, y E ( 2 ) = H RE WH AR Fs + H RE Wn R + n E ( 2 ) . So just can obtain equivalent eavesdropping node reception information is
y E = y E ( 1 ) y E ( 2 ) = H E s + n E , H E = H AE F H RE WH AR F , n E = n E ( 1 ) H RE Wn R + n E ( 2 )
3) under power constraint, maximize the speed of safe transmission, optimized power is distributed, and realizes maximum safe speed:
R s=max(I(y B;s)-I(y E;s)) +
s . t . σ s 2 tr ( FF H ) ≤ P 1
tr ( σ s 2 WH AR FF H H AR H W H + σ n 2 WW H ) ≤ P 2
According to above-mentioned method, first need to obtain the pre-coding matrix of sending node and via node, then carry out optimum power division.
Adopt the method for GSVD-ZF-SVD:
1, first to channel matrix H aR, H aEcarrying out generalized singular value decomposition obtains:
H AR=UΛ ARΦ
H AE=VΛ AEΦ
Wherein Φ=R Ψ ha N a× N anonsingular matrix, Λ aRand Λ aEthere is following form
Λ AR = 0 0 D AR 0 0 I q × q N R × M
Λ AE = D AE 0 0 0 ( N E - s ) × q N E × M
Wherein q+s=N a, K=N a=M,
D aR=diag (d aR, 1, d aR, 2..., d aR, s), D aE=diag (d aE, 1, d aE, 2..., d aE, s), wherein d aR, iascending order is arranged, d aE, idescending.
Design sending node pre-coding matrix is:
F = ΨR - 1 | | R - 1 | | P a
Wherein P a = diag ( p a , 1 , p a , 2 , · · · , p a , K ) .
2, establishing via node to the singular value decomposition of receiving node channel matrix is
Figure BDA0000459177460000097
design pre-coding matrix W makes to eavesdrop node and does not receive any information in second stage, even
Figure BDA0000459177460000102
h rEthe projection matrix of kernel, makes H rEw=0.Then utilize singular value decomposition, design relaying pre-coding matrix is
W ‾ = V ‾ P r U H
So just complete the design of the pre-coding matrix of sending node and via node.
3,, in order to realize optimum power division, in the above in the situation of pre-coding matrix of design, obtain safe speed and power constraint thereof and be
max p a , k , p r , k R s = 1 2 Σ k = 1 K [ log ( 1 + ρ ‾ p r , k p a , k λ RB , k 2 d ‾ AR , k 2 1 + p r , k λ RB , k 2 ) - log ( 1 + ρ ‾ p a , k d ‾ AE , k 2 ) ]
s . t . P A = σ s 2 Σ k = 1 K p a , k ≤ P 1
P R = σ n 2 Σ k = 1 K ( ρ ‾ p r , k p a , k d ‾ AR , k 2 + p r , k ) ≤ P 2
Above direct solution, optimization problem difficulty is larger, adopts the alternately method of iterative.Be substitution of variable z k=p a,k, r k = ρ ‾ p r , k p a , k d ‾ AR , k 2 + p r , k , P ‾ 1 = P 1 / σ s 2 , P ‾ 2 = P 2 / σ n 2 , Above-mentioned optimization problem is out of shape, as given z k, optimize r kthe problem of being optimized is:
max r k Σ k = 1 K log ( 1 + λ RB , k 2 r k 1 + λ RB , k 2 r k + ρ ‾ d ‾ AR , k 2 z k )
s . t . Σ k = 1 K r k ≤ P ‾ 2 , r k ≥ 0 , k = 1,2 , · · · , K .
Its solution is
r k * ( v ) = 1 2 λ RB , k 2 [ ( ρ ‾ d ‾ AR , k 2 z k ) 2 + 4 ρ ‾ d ‾ AR , k 2 z k λ RB , k 2 v - ρ ‾ d ‾ AR , k 2 z k - 2 ] +
Wherein [x] +represent to get the greater between x and 0, variable ν need to meet following formula
Σ k = 1 K r k * ( v ) = P ‾ 2
As fixing r k, optimize z k, the problem of being optimized is
max z k Σ k = 1 K [ log ( 1 + a k z k 1 + b k + c k z k ) - log ( 1 + c k z k ) ]
s . t . Σ k = 1 K z k ≤ P ‾ 1 , z k ≥ 0 , k = 1,2 , · · · , K .
When sending node is than the few or identical situation of eavesdropping node antenna, separate to be
(1) when Σ k ∈ Ω P ‾ c , k ≤ P ‾ 1 Time, separate and be
Figure BDA0000459177460000114
wherein set omega is all d of meeting k=a kb k-b kc k-c kthe k composition of >0, P ‾ c , k = - 2 a k c k + 4 a k 2 c k 2 + 4 a k 2 c k d k 2 a k 2 c k
(2) when Σ k ∈ Ω P ‾ c , k > P ‾ 1 Time, separate and be
Figure BDA0000459177460000117
wherein
Figure BDA0000459177460000118
be ln 2 ( 1 + a k z k ) ( 1 + b k + a k z k ) ( 1 + c k z k ) μ + a k 2 c k z k 2 + 2 a k c k z k - d k = 0 Three solutions, and meet Σ k = 1 K z k * = P ‾ 1 .
When sending node has the situation of more antennas than eavesdropping node antenna, separate to be
Figure BDA00004591774600001111
Wherein set omega 0={ k:k ∈ Ω, c k=0}, Ω +={ k:k ∈ Ω, c k>0}.
By replacing iteration, end product converges to a some place, obtains power division.
The present invention proposes a kind of signals security transmission method of MIMO amplification forwarding junction network, in the time of design pre-coding matrix, adopt the federation policies of GSVD-ZF-SVD, make system parallelization, simplify the expression-form of system safety speed, under the condition of power constraint, solved an optimization problem.In carrying out power division, the non-convexity of former problem makes direct solution be difficult to carry out, and adopts the alternately mode of iteration optimization, and each subproblem can obtain unique optimal solution, and finally alternately iteration can obtain a convergence point, and this convergence point is a critical point certainly.When eavesdropping node number of antennas is no less than sending node end, when via node power is fixing, there is an optimal value in the power of making a start.

Claims (5)

1. a signals security transmission method for MIMO amplification forwarding junction network, is characterized in that, described MIMO amplification forwarding junction network comprises a sending node, a via node, an eavesdropping node and a receiving node, each node is all equipped with many antennas, and number of antennas is respectively N a, N r, N e, N b;
Described signals security transmission method comprises the following steps:
1) first stage, sending node carries out linear predictive coding to transmission information, and the information that via node and eavesdropping node receive sending node transmitting is respectively: y r=H aRfs+n r, wherein H aR, H aEbe the channel matrix of sending node to via node and eavesdropping node, F is sending node Linear precoding matrix, and s is sending node transmitting dope vector, and covariance matrix is
Figure FDA0000459177450000012
n r,
Figure FDA0000459177450000013
be additive Gaussian noise vector, covariance matrix is
Figure FDA0000459177450000014
y r,
Figure FDA0000459177450000015
to receive vector;
2) second stage, via node, by the signal receiving, carries out amplification forwarding, and pre-coding matrix is W, and the information that receiving node and eavesdropping node receive is for being respectively:
y B=H RBWH ARFs+H RBWn R+n B,
Figure FDA0000459177450000016
Wherein H rB, H rEthe channel matrix of via node to receiving node and eavesdropping node, n b,
Figure FDA0000459177450000017
be additive white Gaussian noise, covariance matrix is
Figure FDA0000459177450000018
y b,
Figure FDA0000459177450000019
to receive vector;
The eavesdropping node reception information of equivalence is:
Figure FDA00004591774500000111
Figure FDA00004591774500000112
3) under power constraint, maximize the speed of safe transmission, optimized power is distributed, and realizes maximum safe speed:
R s=max(I(y B;s)-I(y E;s)) +
Figure FDA00004591774500000113
Figure FDA00004591774500000114
2. the signals security transmission method of a kind of MIMO amplification forwarding junction network according to claim 1, is characterized in that, the step that obtains the pre-coding matrix of sending node and via node comprises:
First to channel matrix H aR, H aEcarrying out generalized singular value decomposition obtains:
H AR=UΛ ARΦ
H AE=VΛ AEΦ
Wherein Φ=R Ψ ha N a× N anonsingular matrix, U, V is unitary matrice, Λ aRand Λ aEfor:
Figure FDA0000459177450000021
Wherein q+s=N a, K=N a=M,
D aR=diag (d aR, 1, d aR, 2..., d aR, s), D aE=diag (d aE, 1, d aE, 2..., d aE, s), wherein d aR, iascending order is arranged, d aE, idescending; Designing the pre-coding matrix of making a start is:
Figure FDA0000459177450000023
Wherein
Figure FDA0000459177450000024
If via node to the singular value decomposition of validated user channel matrix is
Figure FDA0000459177450000025
Figure FDA0000459177450000027
design pre-coding matrix W makes to eavesdrop node and does not receive any information in second stage, even
Figure FDA0000459177450000028
Figure FDA0000459177450000029
h rEthe projection matrix of kernel, makes H rEw=0; Then utilize singular value decomposition, design relaying pre-coding matrix is
Figure FDA00004591774500000210
Figure FDA00004591774500000211
Wherein,
Figure FDA0000459177450000031
so just complete the design of the pre-coding matrix of sending node and via node.
3. the signals security transmission method of a kind of MIMO amplification forwarding junction network according to claim 1, is characterized in that, obtains safe speed and power constraint thereof to be in step 3):
Figure FDA0000459177450000032
Figure FDA0000459177450000033
Wherein P 1, P 2respectively the gross power of sending node and via node,
Figure FDA0000459177450000036
Figure FDA0000459177450000038
be respectively
Figure FDA0000459177450000039
k diagonal element.
4. the signals security transmission method of a kind of MIMO amplification forwarding junction network according to claim 3, is characterized in that, safe speed and power constraint thereof are adopted to the alternately method of iterative; First carry out substitution of variable z k=p a,k,
Figure FDA00004591774500000310
Figure FDA00004591774500000311
above-mentioned optimization problem is out of shape, as given z k, optimize r kthe problem of being optimized is:
Figure FDA00004591774500000312
Figure FDA00004591774500000313
Its solution is
Figure FDA00004591774500000314
Wherein [x] +represent to get the greater between x and 0, variable ν need to meet following formula
Figure FDA0000459177450000041
As fixing r k, optimize z k, the problem of being optimized is
Figure FDA0000459177450000043
5. the signals security transmission method of a kind of MIMO amplification forwarding junction network according to claim 4, is characterized in that,
When sending node is than the few or identical situation of eavesdropping node antenna, separate to be:
(1) when
Figure FDA0000459177450000044
time, separate and be wherein set omega is all d of meeting k=a kb k-b kc k-c kthe k composition of >0,
Figure FDA0000459177450000046
(2) when
Figure FDA0000459177450000047
time, separate and be wherein
Figure FDA0000459177450000049
be
Figure FDA00004591774500000410
three solutions, and meet
Figure FDA00004591774500000411
When sending node has the situation of more antennas than eavesdropping node antenna, separate to be:
Figure FDA0000459177450000051
Wherein set omega 0={ k:k ∈ Ω, c k=0}, Ω +={ k:k ∈ Ω, c k>0};
By replacing iteration, end product converges to a some place, obtains power division.
CN201410025414.XA 2014-01-20 2014-01-20 Signal safe transmission method of MIMO amplifying forwarding relay network Expired - Fee Related CN103856299B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410025414.XA CN103856299B (en) 2014-01-20 2014-01-20 Signal safe transmission method of MIMO amplifying forwarding relay network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410025414.XA CN103856299B (en) 2014-01-20 2014-01-20 Signal safe transmission method of MIMO amplifying forwarding relay network

Publications (2)

Publication Number Publication Date
CN103856299A true CN103856299A (en) 2014-06-11
CN103856299B CN103856299B (en) 2017-02-08

Family

ID=50863547

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410025414.XA Expired - Fee Related CN103856299B (en) 2014-01-20 2014-01-20 Signal safe transmission method of MIMO amplifying forwarding relay network

Country Status (1)

Country Link
CN (1) CN103856299B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105978610A (en) * 2016-05-13 2016-09-28 国网江苏省电力公司电力科学研究院 Base-station forwarding multi-antenna processing method concerning wireless physical layer safety
CN106059705A (en) * 2016-05-17 2016-10-26 北京邮电大学 Relay physical layer safe transmission method
CN106953819A (en) * 2017-03-31 2017-07-14 南京邮电大学 Physical layer secret communication method based on multi radio cooperation precoding
CN108462958A (en) * 2018-03-21 2018-08-28 太原科技大学 A kind of safety of physical layer Transmission system based on non-orthogonal multiple access
CN108847872A (en) * 2018-06-07 2018-11-20 四川大学 Optimization method based on convex upper bound wireless power amplification forward pass relay system transceiver
CN111246460A (en) * 2020-01-16 2020-06-05 电子科技大学 Low-complexity and low-time-delay secure transmission method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101291197A (en) * 2008-03-05 2008-10-22 中科院嘉兴中心微系统所分中心 Distributing and transmitting scheme with amplified forwarding power for wireless sensor network of two-hops
US20100284446A1 (en) * 2009-05-06 2010-11-11 Fenghao Mu Method and Apparatus for MIMO Repeater Chains in a Wireless Communication Network
CN103179585A (en) * 2013-03-08 2013-06-26 北京邮电大学 Quick channel simulation method and quick channel simulation device of amplify-forward relay system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101291197A (en) * 2008-03-05 2008-10-22 中科院嘉兴中心微系统所分中心 Distributing and transmitting scheme with amplified forwarding power for wireless sensor network of two-hops
US20100284446A1 (en) * 2009-05-06 2010-11-11 Fenghao Mu Method and Apparatus for MIMO Repeater Chains in a Wireless Communication Network
CN103179585A (en) * 2013-03-08 2013-06-26 北京邮电大学 Quick channel simulation method and quick channel simulation device of amplify-forward relay system

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
J. HUANG, A.L. SWINDLEHURST: "Cooperative Jamming for Secure Communications in MIMO Relay Networks", 《IEEE TRANS. SIGNAL PROCESSING》 *
杨鼎成等: "MIMO双向中继网络的预编码设计与功控策略", 《西南交通大学学报》 *
罗苗,王慧明, 殷勤业: "基于协作波束形成的中继阻塞混合无线物理层安全传输", 《中国科学》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105978610A (en) * 2016-05-13 2016-09-28 国网江苏省电力公司电力科学研究院 Base-station forwarding multi-antenna processing method concerning wireless physical layer safety
CN106059705A (en) * 2016-05-17 2016-10-26 北京邮电大学 Relay physical layer safe transmission method
CN106059705B (en) * 2016-05-17 2018-10-26 北京邮电大学 A kind of relaying safe transmission method of physical layer
CN106953819A (en) * 2017-03-31 2017-07-14 南京邮电大学 Physical layer secret communication method based on multi radio cooperation precoding
CN106953819B (en) * 2017-03-31 2019-12-24 南京邮电大学 Physical layer secret communication method based on multi-radio cooperation precoding
CN108462958A (en) * 2018-03-21 2018-08-28 太原科技大学 A kind of safety of physical layer Transmission system based on non-orthogonal multiple access
CN108847872A (en) * 2018-06-07 2018-11-20 四川大学 Optimization method based on convex upper bound wireless power amplification forward pass relay system transceiver
CN111246460A (en) * 2020-01-16 2020-06-05 电子科技大学 Low-complexity and low-time-delay secure transmission method
CN111246460B (en) * 2020-01-16 2020-12-08 电子科技大学 Low-complexity and low-time-delay secure transmission method

Also Published As

Publication number Publication date
CN103856299B (en) 2017-02-08

Similar Documents

Publication Publication Date Title
Zhang et al. Cooperative jamming aided robust secure transmission for wireless information and power transfer in MISO channels
CN103856299A (en) Signal safe transmission method of MIMO amplifying forwarding relay network
Tian et al. Robust AN-aided secure transmission scheme in MISO channels with simultaneous wireless information and power transfer
Chae et al. Simultaneous wireless information and power transfer for Internet of Things sensor networks
Li et al. Cooperative rate-splitting for secrecy sum-rate enhancement in multi-antenna broadcast channels
Xu et al. Robust transceiver design for wireless information and power transmission in underlay MIMO cognitive radio networks
CN105491563B (en) Method and system for improving security rate of MISO security communication system by utilizing artificial noise
Ali et al. Deep learning based power optimizing for NOMA based relay aided D2D transmissions
Thai et al. Secret group key generation in physical layer for mesh topology
Wang et al. Optimal transceiver designs for wireless-powered full-duplex two-way relay networks with SWIPT
Ye et al. On the capacity of reconfigurable intelligent surface assisted MIMO symbiotic communications
Tseng et al. Robust Tomlinson-Harashima source and linear relay precoders design in amplify-and-forward MIMO relay systems
CN105007141B (en) The information transferring method of multiuser MIMO relay system
Wang et al. Multicast secrecy rate maximization for reconfigurable intelligent surface backscatter communication
CN102790658A (en) Source and relay combined signal processing method in two-way relay system
Li et al. A special class of fractional QCQP and its applications on cognitive collaborative beamforming
Hu et al. Power splitting and relay optimization for two-way relay SWIPT systems
CN102801456A (en) Combined downlink precoding method of single-cell relay communication cellular system
CN103199962A (en) Signal processing method for safe capacity in Coordinated Multi-Point Transmission (CoMP) system
Maleki et al. Distributed robust beamforming in multi-user relay network
Wang et al. Secure resource allocation for polarization-based non-linear energy harvesting over 5G cooperative cognitive radio networks
CN105656530A (en) Method and system for improving security rate of MIMO security communication system
Hasabelnaby et al. Multi-pair computation for two-way intra cloud radio-access network communications
Park Secrecy sum rates of MIMO multi-receiver wiretap channels
Fadlallah et al. Interference alignment for a multi-user SISO interference channel

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into 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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20170208

Termination date: 20200120