CN106102044B - A kind of multi-user's junction network downlink cooperation physical layer method for secret protection - Google Patents

A kind of multi-user's junction network downlink cooperation physical layer method for secret protection Download PDF

Info

Publication number
CN106102044B
CN106102044B CN201610345251.2A CN201610345251A CN106102044B CN 106102044 B CN106102044 B CN 106102044B CN 201610345251 A CN201610345251 A CN 201610345251A CN 106102044 B CN106102044 B CN 106102044B
Authority
CN
China
Prior art keywords
msub
mrow
mover
node
user
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201610345251.2A
Other languages
Chinese (zh)
Other versions
CN106102044A (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 CN201610345251.2A priority Critical patent/CN106102044B/en
Publication of CN106102044A publication Critical patent/CN106102044A/en
Application granted granted Critical
Publication of CN106102044B publication Critical patent/CN106102044B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/02—Protecting privacy or anonymity, e.g. protecting personally identifiable information [PII]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04K—SECRET COMMUNICATION; JAMMING OF COMMUNICATION
    • H04K3/00—Jamming of communication; Counter-measures
    • H04K3/40—Jamming having variable characteristics
    • H04K3/43—Jamming having variable characteristics characterized by the control of the jamming power, signal-to-noise ratio or geographic coverage area
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04K—SECRET COMMUNICATION; JAMMING OF COMMUNICATION
    • H04K3/00—Jamming of communication; Counter-measures
    • H04K3/60—Jamming involving special techniques
    • H04K3/62—Jamming involving special techniques by exposing communication, processing or storing systems to electromagnetic wave radiation, e.g. causing disturbance, disruption or damage of electronic circuits, or causing external injection of faults in the information

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a kind of multi-user's junction network downlink cooperation physical layer method for secret protection, comprise the following steps：1) validated user node is chosenAnd collaboration user nodeSource node S and validated user nodeRespectively information symbol x is sent to relay node RSAnd work noise signalCollaboration user node at the same timeArtificial noise signal is sent to relay node R2) relay node receives validated user nodeCollaboration user nodeAnd the mixed signal yR that source node S sends over, and the mixed signal yR is amplified, all user nodes are relayed to, while collaboration user node sends artificial noise signal3) validated user node carries out self-interference elimination according to the signal received, obtains the sufficient statistic for symbol detectionThen according to the sufficient statistic for being used for symbol detectionEstimated information symbol xS, this method can ensure the information transmission security of multi-user's junction network downlink.

Description

A kind of multi-user's junction network downlink cooperation physical layer method for secret protection
Technical field
The invention belongs to wireless communication technology field, and it is hidden to be related to a kind of multi-user's junction network downlink cooperation physical layer Private guard method.
Background technology
Multi-user's relay system is widely present in LTE-A and 5G networks, yet with the opening of wireless medium, is used Family relay system is highly susceptible to the attack of listener-in.The signal of validated user is sent to, can also be received by other users, At this moment scheduled user not will appear as potential listener-in, bring security risk.For problems, mostly used in the past Cryptography encryption technology, different secret keys is distributed for each user, and validated user is ensured by the high decoding complexity of secret key The privacy of information.However, with the fast development of high-performance computer, it is this to be subject to dependent on the encryption technology for calculating safety Increasing challenge.Characteristic of the safety of physical layer technology since wireless channel can be utilized, there is provided the peace independent of calculating All risk insurance hinders, while realizes that flexible, fine and diversified security configuration is of increased attention.
Have document currently for multi-user's relay system and propose some transmission technologys based on safety of physical layer, including Beam forming, Power Control and cooperation interference etc..Cooperation perturbation technique (MUCJ) of the one of which based on multi-user is ensureing peace There is remarkable result in all directions, while there is relatively low implementation complexity.But this scheme is there is also problem, the peace that it is ensured The full security for depending critically upon channel information between user, in some cases, when channel information between listener-in learns user, This scheme can not ensure the privacy of validated user receive information.For example, in cellular networks, base station is often needed with validated user Handshake procedure is wanted to establish communication, the pilot signal that listener-in can utilize validated user to send in this process estimates use Channel information between family.It is therefore proposed that a kind of relatively reliable, independent of channel information security cooperation transmission method, is protected The information transmission security of barrier multi-user's junction network downlink is of great significance.
The content of the invention
A kind of the shortcomings that it is an object of the invention to overcome the above-mentioned prior art, there is provided multi-user's junction network downlink chain Road cooperation physical layer method for secret protection, this method can ensure the information transmission security of multi-user's junction network downlink.
To reach above-mentioned purpose, multi-user's junction network downlink cooperation physical layer secret protection side of the present invention Multi-user's junction network includes source node S, relay node R and N number of user node U in methodj, wherein, j=1 ..., N, source node S It is not present tie link between each user node, the receiver additive noise at i-th of user node is ni, noise power For N0, the transmission power of all user nodes is P, and multi-user's junction network is worked under TDD mode, and each scheduling is single Information transmission in member comprises the following steps：
1) validated user node is chosenAnd collaboration user nodeSource node S and validated user nodeRespectively to Relay node R sends information symbol xSAnd work noise signalCollaboration user node at the same timeSent to relay node R artificial Noise signal
2) relay node R receives validated user nodeCollaboration user nodeAnd the mixing that source node S sends over Signal yR, and by the mixed signal yRIt is amplified, relays to all user nodes, while collaboration user nodeSend Man made noise's signal
3) validated user nodeReceive relay node R and collaboration user nodeThe signal sended over, further according to connecing Received signal carries out self-interference elimination, obtains the sufficient statistic for symbol detectionThen basis is used for symbol detection Sufficient statisticEstimated information symbol xS, realize the cooperation physical layer secret protection of multi-user's junction network downlink.
Validated user node is chosen according to dispatching criterionAnd collaboration user nodeWherein, dispatching criterion is：
Wherein, ρRmFor relay node R and validated user nodeBetween instantaneous channel gain, ρRkFor relay node R With collaboration user nodeBetween instantaneous channel gain.
The mixed signal y that relay node R is receivedRFor：
Wherein, nRFor the additive noise of relay node R.
Relay node R is by received mixed signal yRIt is amplified, is then forwarded to all user nodes, wherein, relaying The signal S that node R is forwarded to all user nodesR=α yR, wherein, α is power normalization coefficient,hSRFor source node S to the channel coefficients between relay node R,Saved for relaying Point R is to validated user nodeBetween channel coefficients,For relay node R to collaboration user nodeBetween channel Coefficient.
Collaboration user node in step 2)The man made noise of transmissionFor：
Wherein,For collaboration user nodeTo validated user nodeBetween channel coefficients.
Validated user node in step 3)The signal receivedFor：
Wherein,Represent theAdditive noise at a user node.
It is used for the sufficient statistic of symbol detection in step 3)Expression formula be：
The invention has the advantages that：
Multi-user's junction network downlink of the present invention cooperates physical layer method for secret protection in concrete operations, Artificial noise signal is sent by collaboration user node, so as to deteriorate the reception Signal to Interference plus Noise Ratio of listener-in, increase eavesdropping difficulty, carries Security of system is risen, while validated user node is eliminated by self-interference and disturbed, and avoids validated user nodal test performance from being subject to Influence, ensure that the normal information of validated user node receives, while ensure that information passes in the case of not depending on channel condition information Defeated security, is required for the network of pilot signal transmitted progress channel estimation, at the same time suitable for user node and source node The reachable secret speed of system rises with the increase of number of users, is relayed suitable for the radio multi-user with a large number of users In network.At the same time with it is traditional by secret key come safing cryptography encryption technology compared with, the present invention need not be answered Miscellaneous secret key distribution and management, reduce system resource overhead.
Brief description of the drawings
Fig. 1 is multi-user's relay system illustraton of model；
Fig. 2 is the reachable secret speed of system with the change curve of signal-to-noise ratio (SNR)；
Fig. 3 is the reachable secret speed of system with the change curve of system user quantity N；
Fig. 4 is change curve of the system secret outage probability with signal-to-noise ratio.
Embodiment
The present invention is described in further detail below in conjunction with the accompanying drawings：
With reference to figure 1, in multi-user's junction network downlink cooperation physical layer method for secret protection of the present invention Multi-user's junction network includes source node S, relay node R and N number of user node Uj, wherein, j=1 ..., N, source node S with it is each It is not present tie link between user node, the receiver additive noise at i-th of user node is ni, noise power N0, The transmission power of all user nodes is P, and multi-user's junction network is worked under TDD mode, in each scheduling unit Information transmission comprises the following steps：
1) validated user node is chosenAnd collaboration user nodeSource node S and validated user nodeRespectively to Relay node R sends information symbol xSAnd work noise signalCollaboration user node at the same timeSent to relay node R artificial Noise signalWherein, validated user node is chosen according to dispatching criterionAnd collaboration user nodeWherein, scheduling is accurate It is then：
Wherein, ρRmFor relay node R and validated user nodeBetween instantaneous channel gain, ρRkFor relay node R with Collaboration user nodeBetween instantaneous channel gain.
Above dispatching criterion can realize that each user node is saved according to itself and relaying by distributed timing device method The intensity of link sets the time of itself timer between point, and link is stronger, and timing is shorter, and link is weaker, timing It is longer.In assigned timeslot, occur to count the user node overflowed at first as validated user nodeFinally overflow User node as collaboration user nodeEach user node only needs to know itself channel between relay node Information, complexity are relatively low.
2) relay node receives validated user nodeCollaboration user nodeAnd the mixing that source node S sends over Signal yR, and by the mixed signal yRIt is amplified, relays to all user nodes, while collaboration user node sender Work noise signalWherein, the mixed signal y that relay node R is receivedRFor：
Wherein, nRThe additive noise of relay node, relay node R is by received mixed signal yRIt is amplified, then forwards To all user nodes, wherein, the signal S that relay node R is forwarded to all user nodesR=α yR, wherein, α is power normalizing Change coefficient,
Listener-in UeReception signal can be expressed as
At the same time, in order to achieving the purpose that Interference Cancellation, collaboration user node at validated user nodeHair The man made noise sentFor：
To meet above formula, collaboration user node needs to know channel condition informationWithIt can pass through Following methods are realized.Before being communicated, handshake procedure is generally comprised.In this process, RTS/CTS (Request-to- Send/Clear-to-Send) signal will be sent for establishing communication, for multi-user's relay system of the present invention, Relay node R broadcasts RTS signals to all user nodes first, according to validated user determined by itself timer spilling situation Node and collaboration user node send CTS answer signals to relay node R.Believed using the pilot tone included in CTS and RTS signals Number, validated user nodeWith collaboration user nodeRespectively it is estimated that channel coefficientsWithCooperate use at the same time Family nodeIt can also estimateLast validated user nodeWillIt is sent to collaboration user node
3) validated user node receives the signal that relay node and collaboration user node send over, further according to what is received Signal carries out self-interference elimination, obtains the sufficient statistic for symbol detectionThen according to for the abundant of symbol detection StatisticEstimated information symbol xS, realize the cooperation physical layer secret protection of multi-user's junction network downlink.
Wherein, validated user node in step 3)The signal receivedFor：
It is used for the sufficient statistic of symbol detection in step 3)Expression formula be：
Validated user node carries out maximum likelihood (ML) detection, it receives Signal to Interference plus Noise RatioIt can be expressed as：
Wherein, ρij=SNR | hij|2(i, j ∈ { S, R, 1 ..., N }), above formula shows, point of the SINR of validated user node Son is the quadratic expression of SNR, and denominator is the expression of first degree of SNR, it is seen that with the raising of SNR,Constantly increase, validated user section The performance of point gets a promotion, on the other hand, listener-in UeIn the reception signal of second stageFor
In order to achieve the purpose that eavesdropping, listener-in UeSymbol detection, two benches are carried out using the reception signal in two stages Reception signal can be written as vector form
Wherein,weFor coloured noise vector, wherein,
In order to obtain optimal detection performance, listener-in UeNoise whitening is carried out first, and the method for albefaction is by yeIt is multiplied by square Battle arrayObtain
Wherein, KzFor weCovariance matrix, be defined asZ is the white Gauss noise arrow after albefaction Amount, its average is [0,0]T, covariance matrix is unit battle array.Listener-in UeSignal after whitening carries out matched filtering, obtain as It is used for the sufficient statistic of symbol judgement downWherein,
Thus listener-in U is obtainedeReception SINR be
The γ drawn based on above formulaeDefinite expression formula it is sufficiently complex, in order to from γeResult in become apparent from find out The decoding performance of listener-in, ignores its receiver noise, that is, assumesThis is obviously to listener-in UeBe to have Profit, therefore, that we obtain is actually γeThe upper bound be：
Above formula shows, with the raising of SNR,It will level off to a constant, it means that, UeDecoding be interference Limited, noise is not present ideally even in receiver, its performance will not be changed with the raising of SNR It is kind, therefore eavesdropping difficulty is added, ensure the privacy of validated user information.
The present invention provides in the accompanying drawings up to the simulation result of secret speed and secret outage probability, while have chosen two Reference scheme MUCJ and MURS are contrasted, their operation principle is summarized as follows：
MURS schemes are a kind of traditional opportunistic scheduling schemes, and relay node uses the amplification forwarding agreement of standard, its work It is as process：Source node sends data by frame, and the transmission of each frame is divided into two stages.In the transmission beginning of each frame data Before, source node selects relay node to the best user node of user node channel quality as legal according to channel condition information User node communicates.First stage, source node send useful signal to relay node；Second stage, relay node will be received To signal be amplified, and be transmitted to all user nodes；Validated user node receive the broadcast singal of relay node with After be detected judgement.
MUCJ schemes are a kind of multi-user Cooperation jamming programs, its course of work is：Source node sends data by frame, each The transmission of frame is divided into two stages.In the first stage, a user node is dispatched as legal in base station according to channel condition information User node communicates, and then source node and validated user node send useful signal and man made noise to relay node respectively Signal；In second stage, the mixed signal received is amplified and is transmitted to all user nodes by relay node.Validated user section Point carries out self-interference elimination first after receiving broadcast singal, then does symbol detection.
Simulated environment is：All user nodes are all distributed in a two-dimensional plane coordinate system, unless stated otherwise, source section Point S and relay node R is located at (0,0) and (0.5,0) respectively, and all user nodes are randomly dispersed in (1,0) as the center of circle, with 0.2 is channel coefficients in the border circular areas of radiusWherein,dijFor user node i and The distance between user node j, -3 represent large scale fading coefficients, assume that listener-in knows user in the emulation of all schemes Between channel information.
Fig. 2 shows, with the raising of signal-to-noise ratio, reachable secret speed of the invention rises, and reference scheme is reachable private Close speed maintains one close to zero constant, it means that the present invention is stolen hearer even in channel information between user node and obtains Still the information security of validated user node can be ensured when knowing, the reachable secret rate capability of simultaneity factor can be with noise The raising of ratio and improved, there is obvious advantage compared with reference scheme.
Fig. 3 shows, with the increase of number of users in system, reachable secret speed of the invention rises, and reference scheme Reachable secret speed decline as number of users increases, therefore the present invention can extract multi-user diversity, particularly suitable for Apply in the scene with a large number of users.
Fig. 4 shows that secret outage probability of the invention declines with the raising of signal-to-noise ratio, and reference scheme is then tieed up substantially Hold at one close to 1 constant, when signal-to-noise ratio is 30dB, secret outage probability of the invention is close to 10-4, and reference scheme is still It is maintained at 10-1More than.
Based on the above results, compared with reference scheme, the present invention has significant in terms of guaranteeing safety with reliability Superiority.

Claims (2)

  1. The physical layer method for secret protection 1. a kind of multi-user's junction network downlink cooperates, it is characterised in that multi-user relays Network system includes source node S, relay node R and N number of user node Uj, wherein, j=1 ..., N, source node S are saved with each user Tie link is not present between point, and the receiver additive noise at i-th of user node is ni, noise power N0, institute it is useful The transmission power of family node is P, and multi-user's junction network is worked under TDD mode, and the information in each scheduling unit passes It is defeated to comprise the following steps：
    1) validated user node is chosenAnd collaboration user nodeSource node S and validated user nodeRespectively to relaying Node R sends information symbol xSAnd man made noise's signalCollaboration user node at the same timeSend to relay node R and manually make an uproar Acoustical signal
    2) relay node R receives validated user nodeCollaboration user nodeAnd the mixed signal that source node S sends over yR, and by the mixed signal yRIt is amplified, relays to all user nodes, while collaboration user nodeSend artificial Noise signal
    3) validated user nodeReceive relay node R and collaboration user nodeThe signal sended overFurther according to connecing Received signalSelf-interference elimination is carried out, obtains the sufficient statistic for symbol detectionThen according to for according with Number detection sufficient statisticEstimated information symbol xS, realize that multi-user's junction network downlink cooperation physical layer is hidden Private protection；
    Validated user node is chosen according to dispatching criterionAnd collaboration user nodeWherein, dispatching criterion is：
    <mrow> <mover> <mi>m</mi> <mo>^</mo> </mover> <mo>=</mo> <mi>arg</mi> <munder> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> <mrow> <mn>1</mn> <mo>&amp;le;</mo> <mi>m</mi> <mo>&amp;le;</mo> <mi>N</mi> </mrow> </munder> <mo>{</mo> <msub> <mi>&amp;rho;</mi> <mrow> <mi>R</mi> <mi>m</mi> </mrow> </msub> <mo>}</mo> </mrow>
    <mrow> <mover> <mi>k</mi> <mo>^</mo> </mover> <mo>=</mo> <mi>arg</mi> <munder> <mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> </mrow> <mrow> <mn>1</mn> <mo>&amp;le;</mo> <mi>k</mi> <mo>&amp;le;</mo> <mi>N</mi> <mo>,</mo> <mi>k</mi> <mo>&amp;NotEqual;</mo> <mi>m</mi> </mrow> </munder> <mo>{</mo> <msub> <mi>&amp;rho;</mi> <mrow> <mi>R</mi> <mi>k</mi> </mrow> </msub> <mo>}</mo> </mrow>
    Wherein, ρRmFor relay node R and validated user nodeBetween instantaneous channel gain, ρRkIt is relay node R with cooperating User nodeBetween instantaneous channel gain；
    The mixed signal y that relay node R is receivedRFor：
    <mrow> <msub> <mi>y</mi> <mi>R</mi> </msub> <mo>=</mo> <msqrt> <mi>P</mi> </msqrt> <msub> <mi>h</mi> <mrow> <mi>S</mi> <mi>R</mi> </mrow> </msub> <msub> <mi>x</mi> <mi>S</mi> </msub> <mo>+</mo> <msqrt> <mi>P</mi> </msqrt> <msub> <mi>h</mi> <mrow> <mi>R</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </mrow> </msub> <msub> <mi>&amp;omega;</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </msub> <mo>+</mo> <msqrt> <mi>P</mi> </msqrt> <msub> <mi>h</mi> <mrow> <mi>R</mi> <mover> <mi>k</mi> <mo>^</mo> </mover> </mrow> </msub> <msubsup> <mi>w</mi> <mover> <mi>k</mi> <mo>^</mo> </mover> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>R</mi> </msub> </mrow>
    Wherein, nRFor the additive noise of relay node R, hSRFor source node S to the channel coefficients between relay node R,For Relay node R is to validated user nodeBetween channel coefficients,For relay node R to collaboration user nodeBetween Channel coefficients；
    It is used for the sufficient statistic of symbol detection in step 3)Expression formula be：
    <mrow> <msubsup> <mi>y</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> <mrow> <mo>(</mo> <mi>r</mi> <mi>e</mi> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>=</mo> <mi>&amp;alpha;</mi> <msqrt> <mi>P</mi> </msqrt> <msub> <mi>h</mi> <mrow> <mi>R</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </mrow> </msub> <msub> <mi>h</mi> <mrow> <mi>S</mi> <mi>R</mi> </mrow> </msub> <msub> <mi>x</mi> <mi>S</mi> </msub> <mo>+</mo> <msub> <mi>&amp;alpha;h</mi> <mrow> <mi>R</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </mrow> </msub> <msub> <mi>n</mi> <mi>R</mi> </msub> <mo>+</mo> <msub> <mi>n</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </msub> </mrow>
    Wherein, α is power normalization coefficient,Represent validated userPlace Receiver additive noise；
    Validated user node in step 3)The signal receivedFor：
    <mfenced open = "" close = ""> <mtable> <mtr> <mtd> <mrow> <msub> <mi>y</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </msub> <mo>=</mo> <msub> <mi>h</mi> <mrow> <mi>R</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </mrow> </msub> <msub> <mi>S</mi> <mi>R</mi> </msub> <mo>+</mo> <msub> <mi>h</mi> <mrow> <mover> <mi>k</mi> <mo>^</mo> </mover> <mover> <mi>m</mi> <mo>^</mo> </mover> </mrow> </msub> <msubsup> <mi>&amp;omega;</mi> <mover> <mi>k</mi> <mo>^</mo> </mover> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>=</mo> <mi>&amp;alpha;</mi> <msqrt> <mi>P</mi> </msqrt> <msub> <mi>h</mi> <mrow> <mi>R</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </mrow> </msub> <msub> <mi>h</mi> <mrow> <mi>S</mi> <mi>R</mi> </mrow> </msub> <msub> <mi>x</mi> <mi>S</mi> </msub> <mo>+</mo> <mi>&amp;alpha;</mi> <msqrt> <mi>P</mi> </msqrt> <msubsup> <mi>h</mi> <mrow> <mi>R</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </mrow> <mn>2</mn> </msubsup> <msub> <mi>w</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </msub> <mo>+</mo> <msub> <mi>&amp;alpha;h</mi> <mrow> <mi>R</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </mrow> </msub> <msub> <mi>n</mi> <mi>R</mi> </msub> <mo>+</mo> <msub> <mi>n</mi> <mover> <mi>m</mi> <mo>^</mo> </mover> </msub> </mrow> </mtd> </mtr> </mtable> </mfenced>
    Wherein,For collaboration user nodeTo validated user nodeBetween channel coefficients, SRFor relay node R to The signal of all node forwardings.
  2. The physical layer method for secret protection 2. multi-user's junction network downlink according to claim 1 cooperates, its feature It is, relay node R is by received mixed signal yRIt is amplified, is then forwarded to all user nodes, wherein, relay node The signal S that R is forwarded to all user nodesR=α yR。
CN201610345251.2A 2016-05-23 2016-05-23 A kind of multi-user's junction network downlink cooperation physical layer method for secret protection Active CN106102044B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610345251.2A CN106102044B (en) 2016-05-23 2016-05-23 A kind of multi-user's junction network downlink cooperation physical layer method for secret protection

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610345251.2A CN106102044B (en) 2016-05-23 2016-05-23 A kind of multi-user's junction network downlink cooperation physical layer method for secret protection

Publications (2)

Publication Number Publication Date
CN106102044A CN106102044A (en) 2016-11-09
CN106102044B true CN106102044B (en) 2018-04-17

Family

ID=57229322

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610345251.2A Active CN106102044B (en) 2016-05-23 2016-05-23 A kind of multi-user's junction network downlink cooperation physical layer method for secret protection

Country Status (1)

Country Link
CN (1) CN106102044B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107342803B (en) * 2017-06-29 2019-12-24 西安交通大学 Physical layer secure transmission method based on distributed spatial modulation in relay network
CN107911150B (en) * 2017-11-10 2020-10-09 广州大学 Wireless energy-carrying cooperative communication method
CN108134997B (en) * 2017-12-18 2020-05-22 西安交通大学 Asymmetric privacy protection method based on constellation overlapping and noise aggregation

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103702322A (en) * 2013-12-11 2014-04-02 西安交通大学 Physical layer security transmission method for resisting sniffing of unreliable relay nodes
CN104540124A (en) * 2014-12-19 2015-04-22 山东大学 Multi-relay physical layer safety method based on known eavesdropping end channel information
CN104967991A (en) * 2015-05-06 2015-10-07 西安交通大学 Secure communication method among multiple pairs of users in bidirectional relay network
CN105163310A (en) * 2015-09-30 2015-12-16 西安交通大学 Constellation rotation assisted wireless physical layer secure transmission method in two-way relay system

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103441786B (en) * 2013-09-02 2016-10-05 湘潭大学 The system of selection of cooperative node under a kind of collaboration MIMO wireless sensor network environment
CN104104422B (en) * 2014-07-08 2017-10-20 华侨大学 A kind of multiple antennas untrusted relay system and its transmission method based on Limited Feedback

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103702322A (en) * 2013-12-11 2014-04-02 西安交通大学 Physical layer security transmission method for resisting sniffing of unreliable relay nodes
CN104540124A (en) * 2014-12-19 2015-04-22 山东大学 Multi-relay physical layer safety method based on known eavesdropping end channel information
CN104967991A (en) * 2015-05-06 2015-10-07 西安交通大学 Secure communication method among multiple pairs of users in bidirectional relay network
CN105163310A (en) * 2015-09-30 2015-12-16 西安交通大学 Constellation rotation assisted wireless physical layer secure transmission method in two-way relay system

Also Published As

Publication number Publication date
CN106102044A (en) 2016-11-09

Similar Documents

Publication Publication Date Title
Men et al. Non-orthogonal multiple access for multiple-antenna relaying networks
Hu et al. Proactive monitoring via jamming in amplify-and-forward relay networks
Yue et al. Outage performance of full/half-duplex user relaying in NOMA systems
Kim et al. Secrecy performance of finite-sized cooperative single carrier systems with unreliable backhaul connections
Li et al. Cooperative jamming for secure communications in MIMO cooperative cognitive radio networks
Chen et al. Security at physical layer in NOMA relaying networks with cooperative jamming
CN113132975B (en) Safe transmission method of multi-antenna cooperative non-orthogonal multiple access system
CN106992836A (en) Full duplex scrambling transmission method in a kind of untrusted junction network
Abbasi et al. Secrecy analysis of a NOMA system with full duplex and half duplex relay
CN104837110A (en) Transfer strategy realization method based on interruption performance improvement in cellular D2D communication system
Cheng et al. QoS-aware power allocations for maximizing effective capacity over virtual-MIMO wireless networks
CN106102044B (en) A kind of multi-user&#39;s junction network downlink cooperation physical layer method for secret protection
CN106900030A (en) Based on repetition policy selection and resource allocation safe transmission method in relaying OFDM networks
CN104168574B (en) Uplink transmission method based on adaptable interference selection in mixed cellular system
Zhang et al. Uplink achievable rate and power allocation in cooperative LTE-advanced networks
CN106357377A (en) Full-duplex and half-duplex mixed relay implementing method based on diversity gain
Yang et al. Secrecy enhancement of multiuser MISO networks using OSTBC and artificial noise
Li et al. Impact of correlated fading channels on cognitive relay networks with generalized relay selection
Li et al. Closed-form secrecy outage analysis of cellular downlink systems in the presence of co-channel interference
Bai et al. On covert communication performance with outdated CSI in wireless greedy relay systems
Nguyen et al. Enhancing physical layer security for cooperative non-orthogonal multiple access networks with artificial noise
Wang et al. Performance analysis of NOMA for multiple-antenna relaying networks with energy harvesting over Nakagami-m fading channels
Shim et al. A physical layer security-based transmit antenna selection scheme for NOMA systems
CN105978610B (en) It is a kind of meter and radio physical layer safety base station forwarding multiple antennas processing method
Kim et al. Distributed cyclic delay diversity systems with spatially distributed interferers

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant