CN109640321B - Cooperative interference physical layer secure transmission method based on optimal relay selection - Google Patents

Cooperative interference physical layer secure transmission method based on optimal relay selection Download PDF

Info

Publication number
CN109640321B
CN109640321B CN201811554599.8A CN201811554599A CN109640321B CN 109640321 B CN109640321 B CN 109640321B CN 201811554599 A CN201811554599 A CN 201811554599A CN 109640321 B CN109640321 B CN 109640321B
Authority
CN
China
Prior art keywords
relay
node
destination node
matrix
state information
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
CN201811554599.8A
Other languages
Chinese (zh)
Other versions
CN109640321A (en
Inventor
高明
刘宇
葛建华
丁威
付少忠
李靖
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201811554599.8A priority Critical patent/CN109640321B/en
Publication of CN109640321A publication Critical patent/CN109640321A/en
Application granted granted Critical
Publication of CN109640321B publication Critical patent/CN109640321B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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
    • H04K1/00—Secret communication
    • H04K1/02—Secret communication by adding a second signal to make the desired signal unintelligible
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point

Landscapes

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

Abstract

The invention provides a cooperative interference physical layer secure transmission method based on optimal relay selection, which mainly solves the problems of low confidentiality rate and high transmission cost of a wireless communication system in the prior art. The implementation scheme is as follows: the destination node D acquires the channel state information from each relay to the destination node D and the channel state information from each relay to the eavesdropping node E, and selects the optimal relay R according to the channel state information; r generating an artificial noise signal V; the sending node A sends an information signal, and meanwhile, the optimal relay R sends an artificial noise signal; the destination node D receives the information signal, and the eavesdropping node E receives the interference of the artificial noise signal V while receiving the information signal. The invention sends artificial noise signals by selecting the optimal relay, interferes the eavesdropping node, weakens the link quality of the eavesdropping channel, reduces the transmission complexity and the transmission cost of the system, improves the confidentiality rate of the system, and can be used for a confidentiality communication system with a plurality of relays.

Description

Cooperative interference physical layer secure transmission method based on optimal relay selection
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a physical layer secure transmission method which can be used for a secret communication system with a plurality of relays.
Background
Due to the openness of wireless communication systems, information transmitted by a sender may be received by a legitimate recipient and may be stolen by a potential eavesdropper. Therefore, security of information transmission becomes an important issue in wireless communication. In addition to traditional application layer encryption techniques based on encryption algorithms, secure transmission of information can also be addressed using physical layer security techniques. The physical layer security technology can obtain reliable information to be transmitted to a legal receiving end by utilizing the characteristics of randomness, multipath effect and the like of a wireless channel, and meanwhile, the maximum rate of the reliable information which is not stolen by an eavesdropper is avoided, so that the secure communication is ensured.
In 1975, the american patent for information theory Wyner proposed an eavesdropping channel model and demonstrated that when the channel quality of the main channel is better than the eavesdropping channel quality, it can be transmitted securely at a rate greater than 0, the upper bound of which is called the privacy capacity. The achievement lays a theoretical foundation for the research of the physical layer safety. However, if the link quality of the eavesdropping channel is better than the main channel, the confidential information cannot be transmitted at a positive rate, and thus the confidential communication cannot be performed. The cooperative interference technique is a method for coping with the above scenario. In the cooperative interference technique, there are a plurality of relays that interfere with an eavesdropper by sending artificial noise signals, thereby weakening the eavesdropping channel to achieve the premise of secret transmission. In 2010, Lun Dong, h.vincent Poor and the like propose a coordinated cooperative interference scheme, that is, under the condition that global channel state information CSI is known, each relay coordinately designs the weight of an interference signal transmitted by itself, so that the security rate is maximized.
In practical communication systems, each relay typically only knows its own channel state information to legitimate recipients, and no global channel state information. The document "unordered Cooperative sampling for Secret Communications" describes an Uncoordinated Cooperative interference scheme of multi-antenna relays, in which each relay knows channel state information from itself to a legitimate receiver, but does not know channel state information from itself to an eavesdropper. The relays do not need to coordinate with each other, and only need to reasonably design artificial noise vectors, so that the interference of the relays to the legal receivers is 0. In the scheme, the relay does not need to know the channel state information from the relay to the eavesdropper, so that the whole communication process consumes less resources and has lower complexity. But this method has a disadvantage in that it distributes power evenly to each relay without considering the differences between different relays, resulting in a lower privacy rate of the system.
Disclosure of Invention
The invention aims to overcome the defects in the prior art and provides a cooperative interference physical layer secure transmission method based on optimal relay selection, so that the confidentiality rate is maximized, and the security of a system is further improved.
In order to achieve the purpose, the technical scheme of the invention comprises the following steps:
(1) the destination node D obtains the channel state information h from each relay to itselfkAnd channel state information g relayed to each eavesdropping node EkAnd the number of antennas of each relay is recorded as NkWherein k 1., N denotes the number of relays:
(1a) each relay respectively sends pilot signals to a destination node D and an eavesdropping node E;
(1b) the destination node D and the eavesdropping node E estimate the channel state information relayed to the destination node D and the eavesdropping node E according to the received pilot signals, and the channel state information is respectively marked as hk、gkAnd all are fed back to the relay;
(1c) relay will hk、gkSending the data to a destination node;
(2) the destination node D obtains the channel state information h from the relay to the destination node DkAnd channel state information g relayed to the eavesdropping node EkAnd selecting the optimal relay:
(2a) the destination node D relays to the destination node D according to the channel state information h of the destination node DkCalculate hkCorresponding null space matrix Ek；
(2b) The comparison parameters defining the kth relay are:
Figure GDA0003046197170000021
the destination node D selects the largest value from the N comparison parameters, and records it as s, and takes the relay corresponding to s as the selected optimal relay, which is recorded as R, where | | | | represents the two-norm of the vector,
Figure GDA0003046197170000022
represents a conjugate transpose of the vector;
(3) the artificial noise signal V is generated by the optimal relay R:
(3a) calculating a zero space matrix of a channel h from the optimal relay to a destination node, and recording the zero space matrix as E';
(3b) let the power constraint of each relay be PkThe number of optimally repeated antennas is denoted as N*T represents a complex Gaussian random variable obeying a mean value of 0 and a covariance matrix as an identity matrix, then
Figure GDA0003046197170000023
(4) The sending node A sends an information signal, and meanwhile, the optimal relay R sends an artificial noise signal;
(5) the destination node D receives the information signal sent by the sending node A and the artificial noise signal sent by the optimal relay R, and the artificial noise signal v is in the channel h from the optimal relay to the destination nodekThe null space of the network node B can not interfere the target node D, and only the eavesdropping node E can be interfered, thereby realizing the secret communication of the system.
Compared with the prior art, the invention has the following advantages:
1. in a cooperative interference scene of a plurality of multi-antenna relays, the invention fully considers different points among the relays and selects the optimal relay to send the interference signal: because each relay experiences different channel fading, the optimal relay which can maximize the secret rate can be selected according to the different points, so that the eavesdropping channel can be weakened to the maximum extent, meanwhile, the main channel is not influenced, and the safe communication of the system is ensured. Simulation results show that compared with the existing scheme, the method has higher confidentiality rate, and therefore, the method has better safety performance;
2. the invention only needs one optimal relay to send the artificial noise signal, and compared with the method that all relays need to send the artificial noise signal in the existing scheme, the invention greatly simplifies the transmission complexity and reduces the transmission cost.
Drawings
FIG. 1 is a schematic diagram of the SISOSE eavesdropping model used in the present invention;
FIG. 2 is a block diagram of an implementation flow of the present invention;
FIG. 3 is a diagram of simulation results of the present invention.
Detailed Description
The invention is described in further detail below with reference to the figures and the specific embodiments.
Referring to fig. 1, the SISOSE wiretapping model used in the present invention comprises a transmitting node a equipped with 1 antenna, a destination node D equipped with 1 antenna and a wiretapping node E equipped with 1 antenna, and N relays RkN, where N denotes the number of relays, and the number of antennas per relay is N, respectivelyk。
The channel from the sending node A to the destination node D is called legal channel, and the corresponding channel state information is marked as h0(ii) a The channel from the sending node A to the eavesdropping node E is called an eavesdropping channel, and the corresponding channel state information is recorded as g0。
The channel state information of the kth relay to the destination node D is recorded as
Figure GDA0003046197170000031
Wherein
Figure GDA0003046197170000032
Representing 1 XN subject to complex Gaussian distributionkThe k-th channel state information relayed to the destination node D to the eavesdropping node E is recorded as
Figure GDA0003046197170000033
Transmitting node transmitting symbol
Figure GDA0003046197170000034
Wherein x represents a random variable and satisfies E { | x! non-calculation2}＝1，PsRefers to the transmission power of the transmitting node A, and the transmission power of each relay is Pk。
The destination node is not only a legal receiver, but also a control center of the system, and is responsible for selecting the optimal relay.
Referring to fig. 2, the cooperative interference physical layer secure transmission method based on optimal relay selection according to the present invention is implemented as follows:
step 1, the destination node D obtains the relay RkChannel state information h to selfkAnd relay RkChannel state information g to eavesdropping node Ek。
1a) Each relay RkRespectively sending pilot signals to a destination node D and an eavesdropping node E;
1b) the destination node D and the eavesdropping node E estimate the channel state information of the relay according to the received pilot signals to respectively obtain the relay RkChannel state information h to destination node DkAnd relay RkChannel state information g to eavesdropping node EkAnd feeding back the two vectors to the relay;
1c) channel state information vector h to be received by the relayk、gkAnd sending to the destination node D.
And 2, selecting the optimal relay which can enable the system security rate to be maximum from the N relays by the destination node D.
2a) The destination node D calculates the channel state information hkCorresponding null space matrix Ek：
2a1) To hkPerforming singular value decomposition, i.e.
Figure GDA0003046197170000041
Where X is a scalar, Σ is 1 × NkIs a row vector of (a), Y is hkIs calculated from the matrix of right singular vectors of (a),
Figure GDA0003046197170000042
is the conjugate transpose of Y, is Nk×NkA unitary matrix of (a);
2a2) taking column 2 to N of YkThe columns form a matrix, denoted Ek，EkIs hkA null-space matrix of (a);
2b) defining a comparison parameter for each relay
Figure GDA0003046197170000043
Where | | | | represents the two-norm of the vector，
Figure GDA0003046197170000044
Represents a conjugate transpose of the matrix; the destination node D respectively calculates for N relays
Figure GDA0003046197170000045
2c) Destination node D from N skThe largest relay is selected, and the relay corresponding to the largest relay is the optimal relay to be selected. And 3, generating an artificial noise signal by the optimal relay R.
3a) The optimal relay R acquires the channel state information h from the optimal relay R to the destination node D:
3a1) recording the number of the antennas of the optimal relay as N*Then the channel vector h optimally relayed to the destination node E is 1 XN*The row vector of (a) is obtained by carrying out singular value decomposition on h
Figure GDA0003046197170000046
Where U is a scalar and F is 1 XN*W is a matrix of right singular vectors of h,
Figure GDA0003046197170000047
denotes the conjugate transpose of W, is N*×N*A unitary matrix of (a);
3a2) take column 2 to Nth of W*The columns form a matrix, which is marked as E ', and E' is a zero space matrix of h;
3b) the optimal relay R calculates a null-space matrix E of h according to the channel state information h:
3b1) recording the number of the antennas of the optimal relay as N*Performing singular value decomposition on h to obtain
Figure GDA0003046197170000048
Where U is a scalar and F is 1 XN*W is a matrix of right singular vectors of h,
Figure GDA0003046197170000049
the conjugate transpose of W isN*×N*A unitary matrix of (a);
3b2) take column 2 to Nth of W*The columns form a matrix, which is marked as E ', and E' is a zero space matrix of h;
3c) optimal repeating of the generated artificial noise signal:
when the link quality of the legitimate channel is better than that of the eavesdropping channel, secure communication can be achieved. But due to the randomness of the wireless channel and the possible variations in the eavesdropper's location, the link quality of the eavesdropping channel may be better than the legitimate channel. At this time, the node E needs to be intercepted by artificial interference by means of artificial noise signals generated by the relay, so that the quality of a link of an intercepted channel is poor; meanwhile, with the help of the zero space theory of the matrix, the artificial noise signal can not affect the destination node D, and the legal channel is not weakened, so that the secret communication is realized, and the realization is as follows:
3c1) according to the precondition that artificial noise signals V generated by the relay cannot influence a legal channel h, V is in a null space of channel state information h, and V is obtained to be wET, wherein w represents the power constraint of the optimal relay, and T is a random vector subject to complex Gaussian distribution with the mean value of 0 and a covariance matrix as a unit matrix;
3c2) and solving the power constraint w of the optimal relay according to the goal of the privacy rate maximization:
w satisfies
Figure GDA0003046197170000051
Is obtained by simplification
Figure GDA0003046197170000052
3c3) Substituting the determined w into the artificial noise signal V obtained in 3c1), wE' T, generating the artificial noise signal V:
Figure GDA0003046197170000053
step 4, the sending node A sends the information signal
Figure GDA0003046197170000054
While the optimal relay R sends an artificial noise signal V.
And 5, receiving the information signal sent by the sending node A and the artificial noise signal sent by the optimal relay R by the target node D and the eavesdropping node E.
Through the design, the artificial noise signal V is in the null space of the channel state information h, that is, hV is 0, so the artificial noise signal V does not affect the destination node D; because the interception channel and the legal channel are irrelevant, the artificial noise signal V can interfere the interception node E, so that the link quality of the legal channel is better than that of the interception channel, and the confidential communication of the information signal is realized.
The technical effects of the invention are explained in combination with simulation experiments as follows:
1. simulation conditions are as follows:
the simulation experiment is carried out on a hardware platform of which the running system is an Intel (R) core (TM) i3CPU 380@2.53GHz 64-bit Windows operating system, and MATLAB is adopted as simulation software. The simulation adopts SISOSE in FIG. 1 and has a wiretap model of a plurality of relays, the number of antennas of the sending node A, the destination node D and the wiretap node E is 1, the number of multi-antenna relays is 5, the number of antennas is 2, and the sending power is 1 w. All channels obey a complex gaussian distribution and the relay only knows the channel state information from itself to the destination node D. 1000 monte carlo simulations were performed.
2. Simulation and content result analysis:
the curve of the secret rate of the invention and the existing scheme along with the change of the signal-to-noise ratio of the destination node is drawn, and the result is shown in figure 3.
The abscissa in fig. 3 represents the signal-to-noise ratio γ of the destination node0The unit is dB, the ordinate represents the privacy rate of the SISOSE eavesdropping model, and the unit is bits/s/Hz. As can be seen from FIG. 3, the present invention and the prior art scheme are at γ0At 5dB, the privacy rates are 1.38bits/s/Hz and 1.13bits/s/Hz, respectively, at gamma0The privacy rates at 10dB are 2.09bits/s/Hz and 1.66bits/s/Hz respectively, and the privacy rates of the invention and the prior scheme are bothWhich increases with increasing signal-to-noise ratio. However, compared with the prior scheme, the invention has the advantages that the confidentiality rate is obviously improved, and the confidentiality rate is improved along with gamma0The advantages are more obvious. The invention can obviously improve the safety performance of the communication system.
The invention has not been described in detail in part of the common general knowledge of those skilled in the art.
The foregoing description is only an example of the present invention, and it will be apparent to those skilled in the art that various modifications and variations in form and detail can be made without departing from the principle and structure of the invention, but these modifications and variations are within the scope of the invention as defined in the appended claims.

Claims (3)

1. A cooperative interference physical layer secure transmission method based on optimal relay selection is characterized by comprising the following steps:
(1) the destination node D obtains the channel state information h from each relay to itselfkAnd channel state information g relayed to each eavesdropping node EkAnd the number of antennas of each relay is recorded as NkWherein k 1., N denotes the number of relays:
(1a) each relay respectively sends pilot signals to a destination node D and an eavesdropping node E;
(1b) the destination node D and the eavesdropping node E estimate the channel state information relayed to the destination node D and the eavesdropping node E according to the received pilot signals, and the channel state information is respectively marked as hk、gkAnd all are fed back to the relay;
(1c) relay will hk、gkSending the data to a destination node;
(2) the destination node D obtains the channel state information h from the relay to the destination node DkAnd channel state information g relayed to the eavesdropping node EkAnd selecting the optimal relay:
(2a) the destination node D relays to the destination node D according to the channel state information h of the destination node DkCalculate hkCorresponding null space matrix Ek；
(2b) The comparison parameters defining the kth relay are:
Figure FDA0003046197160000011
the destination node D selects the largest value from the N comparison parameters, and records it as s, and takes the relay corresponding to s as the selected optimal relay, which is recorded as R, where | | | | represents the two-norm of the vector,
Figure FDA0003046197160000013
represents a conjugate transpose of the vector;
(3) the artificial noise signal V is generated by the optimal relay R:
(3a) calculating a zero space matrix of a channel h from the optimal relay to a destination node, and recording the zero space matrix as E';
(3b) let the power constraint of each relay be PkThe number of antennas per relay is denoted as NkT represents a complex Gaussian random variable subject to a mean of 0 and a covariance matrix as an identity matrix, then
Figure FDA0003046197160000012
(4) The sending node A sends an information signal, and meanwhile, the optimal relay R sends an artificial noise signal;
(5) the destination node D receives the information signal sent by the sending node A and the artificial noise signal sent by the optimal relay R, and the artificial noise signal V is in the channel h from the optimal relay to the destination nodekThe null space of the network node B can not interfere the target node D, and only the eavesdropping node E can be interfered, thereby realizing the secret communication of the system.
2. The method of claim 1, wherein h is calculated in (2a)kCorresponding null space matrix EkIt is implemented as follows:
(2a1) the number of k relay antennas is counted as NkThen h iskIs 1 XNkRow vector of, to hkPerforming singular value decomposition to obtain
Figure FDA0003046197160000021
Where X is a scalar, Σ is 1 × NkIs a vector of (a), Y is hkIs calculated from the matrix of right singular vectors of (a),
Figure FDA0003046197160000022
the conjugate transpose of Y is Nk×NkA unitary matrix of (a);
(2a2) taking column 2 to N of YkThe columns form a matrix, denoted Ek，EkIs hkA null space matrix of (a).
3. The method of claim 1, wherein the optimal relay R in (3a) computes a channel h null-space matrix E' from itself to the destination node D, which is implemented as follows:
(3a1) recording the number of the antennas of the optimal relay as N*Then the channel vector h optimally relayed to the destination node E is 1 XN*The row vector of (a) is obtained by carrying out singular value decomposition on h
Figure FDA0003046197160000023
Where U is a scalar and F is 1 XN*W is a matrix of right singular vectors of h,
Figure FDA0003046197160000024
denotes the conjugate transpose of W, is N*×N*A unitary matrix of (a);
(3a2) take column 2 to Nth of W*The columns form a matrix, denoted as E', which is the zero-space matrix of h.
CN201811554599.8A 2018-12-19 2018-12-19 Cooperative interference physical layer secure transmission method based on optimal relay selection Active CN109640321B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811554599.8A CN109640321B (en) 2018-12-19 2018-12-19 Cooperative interference physical layer secure transmission method based on optimal relay selection

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811554599.8A CN109640321B (en) 2018-12-19 2018-12-19 Cooperative interference physical layer secure transmission method based on optimal relay selection

Publications (2)

Publication Number Publication Date
CN109640321A CN109640321A (en) 2019-04-16
CN109640321B true CN109640321B (en) 2021-07-20

Family

ID=66075248

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811554599.8A Active CN109640321B (en) 2018-12-19 2018-12-19 Cooperative interference physical layer secure transmission method based on optimal relay selection

Country Status (1)

Country Link
CN (1) CN109640321B (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110225579B (en) * 2019-06-12 2021-02-02 西安电子科技大学 Cooperative interference physical layer secure transmission method based on wireless energy supply
CN110572871B (en) * 2019-09-10 2022-05-06 青岛大学 Wireless energy-carrying relay system with multiple eavesdropping nodes and resource allocation method thereof
CN110650480B (en) * 2019-09-24 2022-08-23 南京邮电大学 Wireless network relay and interference node selection method facing safe communication
CN110730452B (en) * 2019-10-25 2023-05-02 中国人民解放军陆军工程大学 Performance analysis method for joint relay and interference selection scheme in wireless communication system
CN111107547B (en) * 2019-12-26 2023-04-18 西安理工大学 Secure transmission method of alternate relay network in eavesdropping environment
CN111935798B (en) * 2020-07-08 2022-09-02 西北工业大学 Fair matching method based on maximum weight matching
CN112911589B (en) * 2021-01-12 2022-09-06 西安电子科技大学 Physical layer secure transmission method and system combining relay transmission and relay interference
CN113595675B (en) * 2021-06-09 2024-01-23 西安电子科技大学 Interference management method and system for maximizing safe data transmission rate
CN114301567B (en) * 2021-12-28 2023-07-28 绿盟科技集团股份有限公司 Communication method and device based on artificial noise

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10069592B1 (en) * 2015-10-27 2018-09-04 Arizona Board Of Regents On Behalf Of The University Of Arizona Systems and methods for securing wireless communications
CN108770069A (en) * 2018-06-06 2018-11-06 哈尔滨工业大学 Power distribution method for the communication of satellite communication network safety of physical layer

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10069592B1 (en) * 2015-10-27 2018-09-04 Arizona Board Of Regents On Behalf Of The University Of Arizona Systems and methods for securing wireless communications
CN108770069A (en) * 2018-06-06 2018-11-06 哈尔滨工业大学 Power distribution method for the communication of satellite communication network safety of physical layer

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于人工噪声的物理层保密性能研究;张力允;《CNKI中国硕士学位论文全文数据库信息科技辑》;20170115;全文 *

Also Published As

Publication number Publication date
CN109640321A (en) 2019-04-16

Similar Documents

Publication Publication Date Title
CN109640321B (en) Cooperative interference physical layer secure transmission method based on optimal relay selection
CN109743729B (en) Secret transmission method of wireless energy-carrying cooperative system
Huang et al. Cooperative jamming for secure communications in MIMO relay networks
Zhang et al. Secure communications over cell-free massive MIMO networks with hardware impairments
Shafiee et al. Towards the secrecy capacity of the Gaussian MIMO wire-tap channel: The 2-2-1 channel
CN104540124B (en) A kind of more relaying safety of physical layer methods of known eavesdropping end channel information
Chen et al. Secure primary transmission assisted by a secondary full-duplex NOMA relay
Liu et al. Physical layer security assisted computation offloading in intelligently connected vehicle networks
Liu et al. Artificial-noise-aided transmission in multi-antenna relay wiretap channels with spatially random eavesdroppers
Guo et al. Estimation in wireless sensor networks with security constraints
Yılmaz et al. Performances of transmit antenna selection, receive antenna selection, and maximal-ratio-combining-based hybrid techniques in the presence of feedback errors
CN106131026A (en) Single-carrier frequency domain equalization system realizes the method for precoding of safety of physical layer transmission
CN110519756A (en) Physical layer safety transmission method of full duplex relay network
CN109450507A (en) Man made noise and self-interference zero forcing joint precoding full duplex transmission method
CN106936482B (en) Large-scale MIMO system active attack detection method based on pilot frequency correlation and power
CN113193891B (en) Physical layer security authentication method for downlink non-orthogonal multiple access unmanned aerial vehicle system
Niu et al. Artificial noise elimination: From the perspective of eavesdroppers
CN108631825A (en) Enhance two-way AF relay cooperatives wireless communication system physical layer safe transmission method
Zhang et al. Secure transmission in multi-pair AF relaying massive MIMO networks against active pilot spoofing attacks
CN111404587A (en) Multi-user MIMO symmetrical channel characteristic obtaining method based on conjugate precoding
CN108347275B (en) Optimal wave beam vector design method and device of wireless energy-carrying communication signal source
Li et al. Secrecy versus computation overhead for wireless networks in the face of co-channel interference
Fan et al. Ergodic Secrecy Rate of $ K $-User MISO Broadcast Channel With Improved Random Beamforming
Sun et al. Performance analysis of secure buffer-aided cognitive radio network
Wu et al. IRS-Assisted Covert Communication with Equal and Unequal Transmit Prior Probabilities

Legal Events

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