CN112272073A - Hidden beam forming design method for ideal WCSI hidden communication - Google Patents
Hidden beam forming design method for ideal WCSI hidden communication Download PDFInfo
- Publication number
- CN112272073A CN112272073A CN202011149275.3A CN202011149275A CN112272073A CN 112272073 A CN112272073 A CN 112272073A CN 202011149275 A CN202011149275 A CN 202011149275A CN 112272073 A CN112272073 A CN 112272073A
- Authority
- CN
- China
- Prior art keywords
- bob
- alice
- willie
- beamformer
- carol
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04K—SECRET COMMUNICATION; JAMMING OF COMMUNICATION
- H04K1/00—Secret communication
- H04K1/003—Secret communication by varying carrier frequency at or within predetermined or random intervals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/0413—MIMO systems
- H04B7/0426—Power distribution
- H04B7/043—Power distribution using best eigenmode, e.g. beam forming or beam steering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a hidden beam forming design method aiming at ideal WCSI hidden communication, and considers a universal unicast beam forming network. For the ideal WCSI (Willie's channel state information) case, this problem is addressed under ideal concealment constraints, and a concealed beamformer was developed by using semi-positive definite relaxation and bisection. Zero-forcing beamformer designs with single iteration processing are also presented.
Description
Technical Field
The invention relates to a hidden beam forming design method aiming at ideal WCSI hidden communication.
Background
Due to the nature of wireless communications and their broadcasts, they are vulnerable to malicious security attacks. By using encryption and key exchange techniques, traditional security methods focus primarily on preventing the transmitted wireless signal form from being decoded by unintended users [1], but not hiding them. For many wireless scenarios, such as law enforcement and military communications, the transmitted signal should not be detected in order to perform stealth missions. Thus, the paradigm of covert communications, also known as Low Probability of Detection (LPD) communications, is intended to hide the transmission state and protect the privacy or privacy of the user.
In a typical secret communication scenario, a sender (Alice) wishes to send information to a secret recipient (Bob), but is not detected by an eavesdropper (Willie). Here Willie may or may not be the legitimate recipient, but the purpose is to detect whether propagation from Alice to Bob has occurred based on the observed results. Mathematically, Willie's ultimate goal is to distinguish between two hypotheses by using a particular decision ruleOr alsoWhereinDenotes a null hypothesis, i.e. Alice does not send a private data stream to Bob, butRepresents another assumption, namely that Alice faces Bob [2]]The private data stream is sent. In general, the assumed prior probabilityAndeach equal to 1/2, assuming equality. Thus, Willie's detection error probability is defined as [2]:
Indicating that Alice sent information to Bob,indicating another situation. For a given ε ∈ [0, 1]]If the probability xi of the detection error is not less than 1-epsilon, namely xi is more than or equal to 1-epsilon, secret communication can be realized. Here, epsilon is a predetermined value for specifying a secret communication constraint condition.
Practical secret communications have been studied by studying spread spectrum techniques for decades [3]However, the information theory limit of implicit communication has been recently developed [4]-[6]. In [ 4]]The realizability of Square Root Law (SRL) is established to enable implicit communication over an Additive White Gaussian Noise (AWGN) channel. In the use of n-channel, Alice can send to Bob at mostA bit. In addition, SRL results have been validated in Discrete Memoryless Channels (DMC) [ 5]],[6]Two-hop system [7]Multiple access channels [8 ]]And broadcast channel [9 ]]. In short, these results indicate that despite the noiseless transmission, the average number of concealed bits used per channel asymptotically approaches zero,
fortunately, other work [10]-[22]It is disclosed that Alice can achieve a positive concealment rate when Willie is not certain of its noise statistics, transmitting in at least n channels under secret transmission conditionsBit-general [10 ]]-[13]. Based on the proposed rate control and power control strategies, the authors are [16 ]]The feasibility of secret transmission in amplifying and forwarding one-way relay networks is verified. In case of limited channel usage, at [18 ]]The study of delay intolerant covert communication shows that random transmit power can enhance covert communication. In addition, in [20 ]]The impact of a finite block length (i.e., a finite n) on covert communications was investigated. By using Full Duplex (FD) receivers, [20 ] under fading channels]A check was made for covert communication in which the FD receiver would generate artificial noise to confuse Willie. In [21 ]]The optimality of the gaussian signal was studied by using Kullback-leibler (kl) divergence as the hiding metric. By expressing the LPD communication as the fastest detection problem, [22 ]]The hidden throughput maximization problem was investigated by the authors in (1) using three different detection methods, Shewhart, cumulative sum (CUSUM) and Shiryaev-Roberts (SR) tests. Alice can also use 14 in n channels with the help of a friendly and unknowingly jammer],[15]To makeThe individual masked bits are communicated to Bob. By suppressing Willie's detection by generating artifacts, Alice can reliably and privately transmit information to Bob [17]. Most of the work currently available [4]-[9],[14]-[18],[20]-[22]Perfect Channel State Information (CSI) of all users is used to study the secret transmission, and in this work this strong assumption is relaxed by using multiple antennas, while still guaranteeing switched transmission. In [19 ]]In (1), a single-input single-output (SISO) covert communication scheme is considered, and then an accurate expression of the optimal threshold of the wowden detector is derived. The authors then analyzed the achievable rate with outage constraints under imperfect CSI.
Reference documents:
[1]M.Bloch and J.Barros,Physical-Layer Security:From Information Theory to Security Engineering,U.K.:Cambridge Univ.,2011.
[2]E.L.Lehmann and J.P.Romano,Testing Statistical Hypotheses,Springer New York, 2005.
[3]M.K.Simon,J.K.Omura,R.A.Scholtz,and B.K.Levitt,Spread Spectrum Communications Handbook,New York,NY,USA:McGraw-Hill,Apr.1994.
[4]B.A.Bash,D.Goeckel,and D.Towsley,“Limits of reliable communication with low probability of detection on AWGN channels,”IEEE J.Sel.Areas Commun.,vol.31,no. 9,pp.1921–1930,2013.
[5]M.R.Bloch,“Covert communication over noisy channels:A resolvability perspective,”IEEE Trans.Inf.Theory,vol.62,no.5,pp.2334–2354,2016.
[6]L.Wang,W.Wornell,and L.Zheng,“Fundamental limits of communication with low probability of detection,”IEEE Trans.Inf.Theory,vol.62,no.6,pp.3493–3503,Jun. 2016.
[7]H.Wu,X.Liao,Y.Dang,Y.Shen,and X.Jiang,“Limits of covert communication on two-hop AWGN channels,”in Int.Conf.Netw.Netw.Appl.,pp.42–47,Oct.2017.
[8]K.S.K.Arumugam and M.R.Bloch,“Covert communication over a k-user multiple access channel,”IEEE Trans.Inf.Theory,vol.65,no.11,pp.7020–7044,Nov. 2019.
[9]V.Y.F.Tan and S.Lee,“Time-division is optimal for covert communication over some broadcast channels,”IEEE Trans.Inf.Forensics
Security,vol.14,no.5,pp.1377–1389,2019.
[10]S.Lee,R.J.Baxley,M.A.Weitnauer,and B.Walkenhorst,“Achieving undetectable communication,”IEEE J.Sel.Topics Signal Process.,vol.9,no.7,pp. 1195–1205,2015.
[11]D.Goeckel,B.Bash,S.Guha,and D.Towsley,“Covert communications when the warden does not know the background noise power,”IEEE Commun.Lett.,vol.20,no.2,pp. 236–239,Feb.2016.
[12]P.H.Che,M.Bakshi,C.Chan,and S.Jaggi,“Reliable deniable communication with channel uncertainty,”in Proc.IEEE Inf.Theory
Workshop,pp.30–34,2014.
[13]B.He,S.Yan,X.Zhou,and V.K.N.Lau,“On covert communication with noise uncertainty,”IEEE Commun.Lett.,vol.21,no.4,pp.941–944,Apr.2017.
[14]T.V.Sobers,B.A.Bash,D.Goeckel,S.Guha,and D.Towsley,“Covert communication with the help of an uninformed jammer achieves positive rate,”in Proc. Asilomar Conf.Signals,Syst.,Comput.,pp.625–629,Nov.2015.
[15]T.V.Sobers,B.A.Bash,S.Guha,D.Towsley,and D.Goeckel,“Covert
communication in the presence of an uninformed jammer,”IEEE Trans.
Wireless Commun.,vol.16,no.9,pp.6193–6206,Sep.2017.
[16]J.Hu,S.Yan,X.Zhou,F.Shu,J.Li,and J.Wang,“Covert communication achieved by a greedy relay in wireless networks,”IEEE
Trans.Wireless Commun.,vol.17,no.7,pp.4766–4779,Jul.2018.
[17]R.Soltani,D.Goeckel,D.Towsley,B.A.Bash,and S.Guha,“Covert wireless communication with artificial noise generation,”IEEE Trans.Wireless Commun.,vol.17,no. 11,pp.7252–7267,Nov.2018.
[18]S.Yan,B.He,X.Zhou,Y.Cong,and A.L.Swindlehurst,“Delay-intolerant covert communications with either fixed or random transmit power,”IEEE Trans.Inf.Forensics Security,vol.14,no.1,pp.129–140,
Jan.2019.
[19]K.Shahzad,X.Zhou,and S.Yan,“Covert communication in fading channels under channel uncertainty,”in Proc.IEEE VTC Spring,pp.1–5,Jun.2017.
[20]K.Shahzad,X.Zhou,S.Yan,J.Hu,F.Shu,and J.Li,“Achieving covert wireless communications using a full-duplex receiver,”
IEEE Trans.Wireless Commun.,vol.17,no.12,pp.8517–8530,2018.
[21]S.Yan,Y.Cong,S.V.Hanly,and X.Zhou,“Gaussian signalling for covert communications,”IEEE Trans.Wireless Commun.,vol.18,no.7,pp.3542–3553,2019.
[22]K.Huang,H.Wang,D.Towsley,and H.V.Poor,“LPD communication:A sequential change-point detection perspective,”IEEE Trans.Commun.,vol.68,no.4,pp. 2474–2490,2020.
disclosure of Invention
The purpose of the invention is as follows: in order to solve the technical problems existing in the background technology, the invention provides a hidden beam forming design method aiming at the ideal WCSI hidden communication, which comprises the following steps:
the step 1 comprises the following steps: alice denotes a base station, Carol denotes a regular user, Willie denotes an eavesdropper, Bob denotes a hidden user, and Alice always sends a data stream x to CarolcAnd is incorporated inCase private data stream xbIs sent to Bob, whereDenotes a null hypothesis, i.e. Alice does not send a private data stream to Bob, butRepresenting another assumption that Alice sends a private data stream to Bob. Meanwhile, Willie is observing the communication environment as an eavesdropper and tries to identify whether Alice is transmitting to Bob; alice can use the transmission to Carol as a cover to enable secret communication.
In the step 1, Alice is set to be provided with N antennae, and Carol, Bob and Willie all have only one antenna; order toIn particular, the amount of the solvent to be used,representing a signal xcThe power of (a) is determined,representing a signal xbOf the power of (c). Use ofEvents indicating that Alice really sent information to Bob, usesAn event indicating that Alice does not send information to Bob.
In step 1, from Willie's perspective, Alice's transmission signal x is as follows:
wherein wc,0And wc,1Respectively represent xcUnder the assumption thatAnd assume thatOf a transmit beamformer vector, wbDenotes xbBy P, the transmit beamformer vector oftotalRepresenting the maximum transmit power of Alice, the beamformer vector satisfies: in thatIn case, | wc,0||2≤PtotalAnd inIn case, | wc,1||2+||wb||2≤Ptotal;
For Carol, it receives a signal ycComprises the following steps:
whereinIs the channel coefficient from Alice to Carol,is the noise received by Carol, whereRepresents an N-dimensional complex vector, and represents a complex vector,signal noise z representing CarolcObeying a mean of 0 and a variance ofComplex gaussian distribution of (a);
for Bob, it receives the signal ybComprises the following steps:
whereinIs the channel gain from Alice to Bob,is the noise received by Carol and is,signal noise z representing BobbObeying a mean of 0 and a variance ofComplex gaussian fraction ofAnd (3) cloth.
In step 1, Willie receives signal ywWriting into:
whereinAre the channel coefficients from Alice to Willie,is the noise received by Willie and is,signal noise z representing WilliewObeying a mean of 0 and a variance ofComplex gaussian distribution.
In step 1, Carol is set in accordance with (3)Andat an instantaneous rate of Rc,0(wc,0) And Rc,1(wc,1,wb) Written as:
let p be0(yw) And p1(yw) Are respectively shown inAndlower Willie received signal likelihood function, based on (5), p0(yw) And p1(yw) Respectively as follows:
whereinWhereinSignal noise z representing CarolwOf the noise variance, λ0And λ1Representing the auxiliary variable.
In step 1, Willie wants to minimize the detection error probability ξ by applying the optimal detector, setting:
ξ=1-VT(p0,p1), (9)
wherein VT(p0,p1) Is p0(yw) And p1(yw) The general variation between them, the Pincker inequality is adopted (reference [23 ]]T.m.cover and j.a.thomas, Elements of Information Theory, New York: Wiley, 2006)), gave:
wherein D (p)0||p1) Represents from p0(yw) To p1(yw) KL (Kullback-Leibler) divergence (relative entropy) of D (p)1||p0) Is from p1(yw) To p0(yw) KL divergence of (1);
D(p0||p1) And D (p)1||p0) Respectively as follows:
to achieve covert communication with a given ξ, i.e., ξ ≧ 1- ε, the KL divergence of the likelihood function should satisfy one of the following constraints:
the step 2 comprises the following steps: the ideal WCSI case refers to: willie is a legitimate user and wants to get Bob's personal information, in which case Alice knows channel hwAnd uses it to help Bob avoid wilE, monitoring;
problem (15) is established:
s.t.Rc,1(wc,1,wb)=Rc,0(wc,0), (15b)
D(p0||p1)=0, (15c)
||wb||2+||wc,1||2≤Ptotal (15d)
to solve the problem (15), two beam former design methods are proposed, namely a blind beam former design and a ZF (zero forcing) beam former design, which are respectively as follows:
the hidden beamformer design is as follows:
defining auxiliary variablesAndand introducing an auxiliary variable rbQuestion (15) is restated as the equivalent of question (16):
||wb||2+||wc,1||2≤Ptotal (16e)
applying SDR (semi-positive relaxation) technology (ref [24] z.luo, w.ma, a.m.so, y.ye, and s.zhang,
“Semidefinite relaxation of quadratic optimization problems,”IEEE Signal Process.
mag., vol.27, No.3, pp.20-34,2010.) to relax the problem (16), the following conditions were used:
ignoring the constraint of rank 1, a relaxed form of the problem (16), namely the problem (18), is obtained:
Tr(Wc,1)+Tr(Wb)≤Ptotal, (18e)
Wc,1≥0,Wb≥0 (18f)
order:
the following results were obtained:
s.t.φ(Wb)≥rbθ(Wc,1) (20)
rbIs concave when being more than or equal to 0;
an algorithm 1 is established, wherein the algorithm 1 comprises the following steps:
step a1, selecting ζ>0 (end parameter), lower speed limitAnd upper speed limitMake Bob's optimal speedIs located atPerforming the following steps;
Step a5, if the problem (18) is feasible, get the solution WbAnd Wc,1And is provided withOtherwise, set up
Outputting optimal solution by Algorithm 1Andreconstruction of the beamformer W from the solution given by Algorithm 1c,1And WbIf, ifAnd isThen Also given is an optimal solution to the problem (15), the Singular Value Decomposition (SVD) is used to obtain the optimal beamformer Wc,1And WbI.e. byAndif it is notOrUse of a Gaussian randomization procedure for problem (15) (reference [24]]Z.luo, w.ma, a.m.so, y.ye, and s.zhang, "semimidefinite repetition of quadrature optimization schemes," IEEE Signal process.mag., vol.27, No.3, pp.20-34, 2010 ") to obtain a rank 1 solution;
the ZF (zero forcing) beamformer is designed as follows: the problem (16) is recalculated to the following problem (21):
||wb||2+||wc,1||2≤Ptotal. (21g)
to solve the problem (21), under the constraints of (21d), (21e) and (21f), by minimizing the transmission power | | wc,1||2To optimize the beam former wc,1(ii) a The total transmission power constraint (21g) comprises wbAnd wc,1In order to maximize the objective function (21a),it is desirable to design a beamformer w with minimum transmit powerc,1(ii) a ZF beamformer wc,1The design problem is expressed as:
s.t.(21d),(21e),(21f),
Wc,1≥0, (23e)
is provided withIs the optimal solution to the problem (23) ifThenIs the optimal solution of the problem (15), the optimal beamformer w is obtained by singular value decompositionc,1I.e. byOtherwise, ifUsing a Gaussian randomization procedure (ref 24)]Z.luo, w.ma, a.m.so, y.ye, and s.zhang, "semimidefinite repetition of quadrature optimization schemes," IEEE Signal process. mag., vol.27, No.3, pp.20-34,2010 ") to obtain a rank 1 solution to the problem (22);
by usingBeam shaper for representing problem (23), use ofTo representThe problem (21) is expressed as:
s.t.||wb||2+Pc≤Ptotal (24b)
(21b),(21c),
the method is equivalent to the following steps:
(21b),(21c),(24b)
and (3) optimizing and solving by using a standard convex optimization solver (such as CVX) (reference [25] M.Grant and S.Boyd, "CVX: Matlab software for divided consistent programming, version 2.1," http:// cvxr.com/CVX, Mar.2014.), and finally obtaining the ZF beam shaper of the problem (21).
Has the advantages that: while Willie's CSI (channel state information) is ideal for Alice, the present invention not only proposes a blind beamforming design, but to reduce computational complexity, the present invention proposes a low complexity zero-forcing (ZF) beamformer design with a single iterative process that provides a promising compromise between complexity and performance. Such results can be used as a theoretical basis for evaluating the concealment performance of the beamformer. The simulation results of the present invention further reveal a tradeoff between Willie's reconnaissance performance and Bob's concealment rate.
Drawings
The foregoing and/or other advantages of the invention will become further apparent from the following detailed description of the invention when taken in conjunction with the accompanying drawings.
Fig. 1 is a schematic diagram of a secret communication scenario.
FIG. 2 is the instantaneous rate R of Bob under the hidden beamformer design and ZF (zero forcing) beamformer design proposed by the present inventionb(bits/sec/hz) maximum transmit power P with Alicetotal(dBW) variation graph.
FIG. 3 is the instantaneous rate R of the proposed buried beamformer design of the present invention and the proposed ZF beamformer design at BobbAccording to different ratiosGraph of the variation.
FIG. 4 is the instantaneous rate R of BobbAnd the number of antennas N is shown in the relationship diagram under the design of the hidden beam former and the design of the ZF beam former.
FIG. 5 is a graphical illustration of a cumulative density function.
FIG. 6 is a graph of the epsilon value versus the instantaneous rate R of BobbAnd a relationship diagram of the detection error probability.
FIG. 7 Bob instantaneous Rate RbAnd detecting error v of error probability and CSI (channel state information)wSchematic diagram of the relationship of (1).
FIG. 8 is the instantaneous rate R of BobbThe relationship with the number of antennas N is shown schematically.
Detailed Description
In the invention, the following representation method is adopted: the lower case and upper case letters in bold represent vectors and matrices, respectively. Re (-) and Im (-) denote the real and imaginary parts of their argument, respectively. With mean μ and variance σ2By using a complex-valued circularly symmetric Gaussian distributionTo indicate.
The scenario considered by the present invention is shown in fig. 1, where Alice (base station) always sends a data stream x to Carol (regular user)cAnd is incorporated inCase private data stream xbIs sent to Bob, whereDenotes a null hypothesis, i.e., Alice does not send a private data stream to Bob, butRepresenting another assumption that Alice sends a private data stream to Bob. Meanwhile, Willie is observing the communication environment as an eavesdropper and tries to identify whether Alice is transmitting to Bob; alice can use the transmission to Carol as a cover to enable covert communications. Alice is assumed to be equipped with N antennas, while Carol, Bob and Willie all have only one antenna. For the sake of simplicity, orderIn particular, the amount of the solvent to be used,representing a signal xcThe power of (a) is determined,representing a signal xbOf the power of (c). . Recall thatIn one aspect, Willie's goal is to determine which hypothesis(s) to use by using a particular decision rule: (a)Or) Is correct. For convenience, use is made ofAn event that indicates that Alice does (does not) send information to Bob.
One, signal model and implicit constraint:
from Willie's perspective, Alice's transmission signal is as follows:
for Carol, the received signal is:
for Bob, the received signal is:
the signal received by Willie can be written as:
according to (3), the instantaneous rates for Carol are set to be expressed asAndr ofc,0(wc,0) And Rc,1(wc,1,wb) Written as:
since Willie needs to be based on the signal y it receiveswTo distinguish these two hypotheses, further describe ywThe probability of (c).
Let p be0(yw) And p1(yw) Are respectively shown inAndthe likelihood function of Willie's received signal. Based on (5), p0(yw) And p1(yw) Respectively as follows:
willie wants to minimize the detection error probability ξ by applying the best detector.
To incorporate ξ into the problem formulation, the conditions of the likelihood function are next specified so that implicit communication can be achieved using a given ε. First, setting:
ξ=1-VT(p0,p1), (9)
the method adopts a Pincker inequality to obtain:
D(p0||p1) And D (p)1||p0) Respectively as follows:
the KL (Kullback-Leibler) divergence (relative entropy) of the likelihood function should satisfy one of the following constraints:
D(p0||p1)≤2ε2, (12a)
D(p1||p0)≤2ε2. (12b)
second, CSI availability
It is assumed that Alice can accurately estimate the CSI of Bob and Carol. In most cases, such CSI may be learned at the receiving end and the transmitting end through training and feedback. However, WCSI may not always be accessible to Alice due to the potentially limited cooperation between Alice and Willie. Therefore, the following two cases are considered:
(1) scenario 1. ideal WCSI: consider a situation that is often found in practiceNow, in the scenario where Willie is a legitimate user, wants to get Bob's personal information, in this case Alice knows channel hwAnd uses it to help Bob avoid Willie's listening.
(2) Scenario 2. non-ideal WCSI: in this case, Alice is unaware of the channel to Willie, i.e., Alice is on Alice-to-Willie channel hwAn estimation is made and there is an error in the estimation. The undesirable WCSI is modeled as:
wherein h iswIs the channel gain from Alice to Willie,represents the estimated CSI vector between Alice and Willie, and Δ hwRepresenting the corresponding CSI error vector. In addition, the CSI error vector Δ hwIs characterized by an elliptical area, namely:
wherein is defined aswIs the error vector Δ hwThe set of ranges of (a) is,controlling the axis of the ellipsoid, vw>0 determines the volume of the ellipsoid.
Three, ideal WCSI proposal of concealed transmission
Consider the ideal WCSI (Willie channel state information) scheme (scenario 1) and maximize Bob's concealment rate by optimizing Alice's beamformer. In particular, maximizing Bob's achievable rate R was investigatedbIn order to solve the problem of the target joint beam forming design, the constraint conditions of completely concealed transmission are satisfied, the constraint of Carol QoS and Alice total transmission power is satisfied, and the mathematical expression is as follows:
s.t.Rc,1(wc,1,wb)=Rc,0(wc,0), (15b)
D(p0||p1)=0, (15c)
||wb||2+||wc,1||2≤Ptotal (15d)
constraint D (p)0||p1)=0
And D (p)1||p0) 0 is equivalent for a perfect blind transmission case. To solve the non-convex problem (15), two beamformer design methods are proposed, namely the blind beamformer design and the ZF (zero forcing) beamformer design.
3.1 design of hidden beamformer
To simplify the derivation, auxiliary variables are definedAndand introducing an auxiliary variable rbQuestion (15) is restated in the equivalent form:
||wb||2+||wc,1||2≤Ptotal (16e)
applying SDR (semi-positive relaxation) technique to relax the problem (16), the following conditions were used:
ignoring the constraint of rank 1, a relaxed form of the problem (16) is obtained:
Tr(Wc,1)+Tr(Wb)≤Ptotal, (18e)
Wc,1≥0,Wb≥0 (18f)
note that for any determined rb≧ 0, the problem (18) is a convex-half positive definite program (SDP). Thus, the problem (18) is pseudo-convex, at any given rbNext, by checking its feasibility, its optimal solution can be found.
Then, the maximization problem (18b) can be proved againstrbIs concave. More specifically, let:
Introduction 1: function(s)
s.t.φ(Wb)≥rbθ(Wc,1) (20)
rbWhen the shape is more than or equal to 0, the shape is concave.
And (3) proving that: will function g (r)b) Rewrite to the following compact form:
s.t.a(W)≥xb(W), (41b)
wherein W ═ Wb,Wc,1],a(W):=φ(Wb),b(W):=θ(Wc,1),x≥0。
Next, the concavity of the function f (x) at x ≧ 0 will be examined by the following definition. First, for 0 ≦ θ ≦ 1 and x1,x2Not less than 0, including:
s.t.a(W)≥(θx1+(1-θ)x2)b(W), (42c)
then, there is θ f (x)1) And (1-theta) f (x)2) As follows:
s.t.a(W)≥x1b(W), (44b)
s.t.a(W)≥x2b(W) (44b)
s.t.0≤x1≤c(W), (45b)
0≤x2≤c(W) (45c)
wherein x is1,x2≥0。
When 0. ltoreq. theta.ltoreq.1, x shown in (42c)1And x2Is larger than the feasible region in (45). Comprises the following steps:
θf(x1)+(1-θ)f(x2)≤f(θx1+(1-θ)x2), (47)
indicates that f (x) is concave in x, in other words, the function (18) is at rbIs concave in the middle.
Therefore, first, the problem (18) is converted into a series of rbThe convex sub-problem of more than or equal to 0 can be optimized and solved by a standard convex optimization solver (such as CVX). Next, a binary search method is used to find the proposed hidden beamformer WbAnd Wc,1. The detailed information of the binary search method is summarized as algorithm 1 in Table 1, which outputs the optimal solutionAnd
finally, the beamformer W is reconstructed from the solution given by Algorithm 1c,1And Wb. The design method of the beam former based on SDR (semi-positive definite relaxation) needs to solve a series of problemsColumn feasibility sub-problem. The computational complexity of this approach is high, which requires further development of an alternative approach with lower computational complexity.
3.2 design of proposed zero forcing beamformer
In this section, a ZF (zero forcing) beamformer design with iterative processing is proposed that enables an ideal trade-off between complexity and performance. In particular by designing wbSo thatAndto eliminateAndthe interference signal of (2). At the same time, by design wc,1So thatTo eliminate interference signals
Mathematically, applying the ZF beamformer design principle, the problem (16) is recalculated as:
||wb||2+||wc,1||2≤Ptotal. (21g)
to solve the design problem (21) of the joint ZF beamformer, first under the constraints of (21d), (21e) and (21f), by minimizing the transmission power | | | wc,1||2To optimize the beam former wc,1. This is because the objective function (21a) does not depend on wc,1But increases with the power of the beamformer. The total transmission power constraint (21g) comprises wbAnd wc,1. Therefore, in order to maximize the objective function (21a), it is necessary to design the beamformer w with the minimum transmit powerc,1. Thus, the ZF beamformer wc,1The design problem is expressed as:
s.t.(21d),(21e),(21f),
this is also non-convex. To solve the non-convex problem, the problem (22) is relaxed to convex form by applying SDR (semi-positive relaxation), specifically by relaxingTo Wc,1Not less than 0, the problem (22) is restated as:
Wc,1≥0, (23e)
this is a convex SDP (semi positive plan). Is provided withIs the optimal solution to the problem (23). Due to the fact that the material is loose,may not equal 1. Therefore, ifThenIs the optimal solution of the problem (15), the optimal beamformer w is obtained by singular value decompositionc,1I.e. byOtherwise, ifA gaussian randomization process is employed to obtain a high quality rank 1 solution to the problem (22).
Next, consider wbThe design of (3). LetA beamformer representing the problem (23). LetTo representThe transmission power of (1). The problem (21) is expressed as:
s.t.||wb||2+Pc≤Ptotal (24b)
(21b),(21c),
the method is equivalent to the following steps:
(21b),(21c),(24b)
the solution problem (25) is optimized with a standard convex optimization solver (e.g., CVX). Thus, the ZF transmit beamformer of problem (21) is finally obtained.
Robust concealment transmission scheme for non-ideal WCSI
In practice, the CSI obtained usually is corrupted by some estimation errors (ref 5)],[6]). It is therefore further proposed to propose a robust beamforming design for the optimization problem (15) in non-ideal WCSI scenarios. In this case, it is difficult to achieve perfect secret transmission, i.e., D (p)0||p1) 0. Therefore, the use of the covert constraint D (p) according to (12)0||p1)≤2ε2And D (p)1||p0)≤2ε2(reference [ 4]]-[6],[21]). In addition, based on the developed robust beamformer, Willie's best case is further investigated, in which case Willie can reach the desired detection error probability.
4.1D(p0||p1)≤2ε2In the case of
In the case of imperfect WCSI, the goal is to design w jointly under the QoS, privacy and total power constraints of Carolc,1And wbTo realize Rb(wc,1,wb) And (4) maximizing. Mathematically, the robust rate maximization problem is expressed as the following problem (26):
s.t.Rc,1(wc,1,wb)=Rc,0(wc,0), (26b)
D(p0||p1)≤2ε2, (26c)
||wb||2+||wc,1||2≤Ptotal, (26d)
the problem (26) is not convex and it is therefore difficult to directly obtain an optimal solution. To solve this problem, first, a function is usedAt x>The property at 0 reconstructs the covert constraint (26 d). More specifically, the covert constraintEquivalently converting into:
in the formulaAndis the equationTwo roots of (2). Thus, the constraint (26c) is equivalently re-expressed as:
here, becauseΔ h in constraint (26e)wThere are infinite options that make the problem (26) non-convex and tricky. To overcome this challenge, a method of relaxation and constraint is proposed. Specifically, in the relaxation step, the non-convex robust design problem is converted into a convex SDP (semi-positive definite programming) problem; in the constraint step, an infinite number of complex constraints are converted into a finite number of Linear Matrix Inequalities (LMIs).
equivalently re-expressed by defining a reduce constraint (28) as:
in applying SDR to Wc,1And WbThen, the problem (26) relaxes as follows:
Tr(Wc,1)+Tr(Wb)≤Ptotal, (30d)
Wc,1≥0,Wb≥0, (30e)
(29a),(29b)
in the formulaIs the relaxation variable. The SDR (semi-definite relaxation) problem (30) is pseudo-convex because the objective function and constraints are at Wc,1And WbIs linear. Due to the fact thatThe problem (30) involves an infinite number of constraints and is therefore still computationally difficult. Next, an infinite number of constraints are reconstructed into a set of LMIs using an S-process, which is a processable approximation. The S-lemma is used to reconstruct an infinite number of constraints into a set of LMIs (Linear matrix inequalities), which is a processable approximation. Therein introduction (S-introduction reference [26 ]]D.W.K.Ng,E.S.Lo,and R.Schober,“Robust beamforming for secure communication in systems with wireless information and power transfer, "IEEE Trans. Wireless Commun., vol.13, No.8, pp.4599-4615,2014"), and set function fm(x),m∈{1,2}, Is defined as:
whereinIs a complex Hermitian matrix of which,relation of implication and culIf and only if there is a variable η ≧ 0, such that:
Thus, by using the S-theorem, constraints (29a) and (29b) are recast into a limited number of LMIs, respectively:
thus, a conservative approximation of the problem (30) is obtained as follows:
s.t.(30b),(30c),(30d),(30e),(33a),(33b)
when in useFixed, the problem (34) is a convex SDP (semi-positive definite programming) that is effectively solved by an off-the-shelf convex solver (ref [25]]M.Grant and S.Boyd, "CVX: Matlab software for differentiated summary programming, version 2.1," http:// cvxr.com/CVX, Mar.2014 "). The proposed dichotomy can therefore effectively solve the problem (34), which is summarized in algorithm 2. The algorithm 2 comprises the following steps:
step b1, selecting ζ>0 (end parameter), lower speed limitAnd upper speed limitTo optimize Bob's speedIs located atPerforming the following steps;
Step b5, if the problem (34) is feasible, get the solution WbAnd Wc,1And is provided withOtherwise, set up
Also, ifAnd is An optimal solution to the problem (15) is given and the optimal beamformer w is obtained by singular value decompositionc,1And wbI.e. byAndhowever, ifOrA Gaussian randomization procedure (seeExamination paper [24]Z.luo, w.ma, a.m.so, y.ye, and s.zhang, "semimidefinite repetition of quadrature optimization schemes," IEEE Signal process.mag., vol.27, No.3, pp.20-34, 2010 ") to obtain a high quality rank 1 solution to problem (15).
4.2D(p1||p0)≤2ε2In the case of
In this subsection, constraint D (p) is considered1||p0)≤2ε2The corresponding robust concealment rate maximization problem is expressed as:
s.t.Rc,1(wc,1,wb)=Rc,0(wc,0), (35b)
D(p1||p0)≤2ε2, (35c)
||wb||2+||wc,1||2≤Ptotal, (35d)
Except for the covert constraint, it can be seen that problem (35) is similar to problem (26). Hidden constraint conditionEquivalently, to:
The relaxation and restraint methods are applied to solve the problem (35). For the sake of brevity, detailed derivations are omitted. It is noted that although these methods are similar, the achievable concealment rates are different under the two concealment constraints.
4.3 Ideal detection Properties of Willie
To evaluate the design of the above robust beamformer, Willie's optimal decision threshold, and the corresponding false alarm probability and missed detection probability, were further investigated. Consider the ideal case of Willie, the beamformer w known to Willieb、 wc,0And wc,1This is the worst case for Bob.
According to the Neyman-Pearson criterion (reference [2]), the best criterion to minimize Willie's detection error is the likelihood ratio test (reference [2]), i.e.:
whereinAndrespectively corresponding to the hypothesisAndis determined in two-way. Further (37) is equivalently re-expressed as:
in the formula (I), the compound is shown in the specification,representing the optimal detection threshold of Willie. Here, [ lambda ] is given in (8)0And λ1Dependent on the beamformer vector wb、wc,0、wc,1。
therefore, based on the optimal detection threshold φ*False alarmAnd probability of missed detectionAs follows:
thus, the desired detection performance of Willie can be measured in terms of φ*,Andto characterize. These results can be used as a theoretical basis for evaluating the concealment performance of a robust beamformer design. The detection properties of Willie will be discussed further in the next section.
Five, numerical results
In this section, numerical results are presented and discussed to evaluate the performance of the proposed blind beamformer design, ZF (zero forcing) beamformer design, and robust beamformer design methods for blind communications.
In the simulation, the number of antennas at Alice is set to 5, i.e., N is 5, and the noise variance of three users is normalized to 1, i.e., N is 1Alice to PtotalTotal transmit power of 10dBW and | | wc,0||21 dBW. Furthermore, it is assumed that all channels experience rayleigh flat fading, i.e.
5.1 evaluation of scene 1
The method proposed in scenario 1, i.e. Alice using the perfect WCSI (Willie's channel state information), is evaluated first.
FIG. 2 is the concealment rate R of Bob under the proposed concealment beamformer design and ZF beamformer designb(bits/sec/hz) total transmit power P with Alicetotal(dBW) variation graph. Drawing (A)2 depicts the concealment rate R of Bob under the proposed concealment beamformer design and the proposed ZF beamformer designbRelative to the total transmission power PtotalThe value of the change. It can be seen that with the transmission power P of AlicetotalIncrease of (b), the concealment rate R of BobbIs also increasing, and the R of the proposed buried beamforming design is increasingbR than ZF beamformer designbIs high. In addition, by comparing Carol | | | wc,0||2In thatTransmitting power of two different wave beam formersc,0||2Observed transmit power | | wc,0||2The lower Bob's concealment rate RbThe higher. This is because when the transmission power | | | wc,0||2At lower times, Bob may be allocated more power.
Fig. 3 shows the proposed buried beamformer design and ZF beamformer design versus different ratiosConcealment rate R for lower BobbIn which P istotal10W. In this figure, the equivalent ratio is observedFixed, ZF beamformer designed RbR lower than the hidden beamformer designbThis is consistent with fig. 2. In addition, withIncrease in the ratio, Bob's concealment rate RbAnd decreases. At the same time, the rate gap between the blind beamformer design and the ZF beamformer design is also reduced.
In fig. 4, the concealment rate R of Bob for the proposed concealment beamformer design and ZF beamformer design is plottedbA graph of the number of antennas N of Alice, where Ptotal10W. Observe thatBob's concealment rate R as the number of antennas N increasesbAt the increase, the rate gap from ZF beamformer design also increases. This is because with more antennas, more spatial multiplexing gain can be utilized.
From fig. 2, 3, 4 it is observed that the concealment rate of the proposed concealment beamformer design is always higher than the proposed ZF beamformer design. However, the computational complexity of ZF beamformer designs is significantly lower than that of blind beamformer designs. Specifically, table one shows a comparison of the computation times for the blind beamformer design and the ZF beamformer design, all simulations of both methods were performed using MATLAB2016b, 2.30GHz, 2.29GHz dual CPUs, and 128GB RAM. Table one shows that the computation time for the blind beamformer and ZF beamformer designs increases with the number of antennas N. More importantly, the computation time of the ZF beamformer is less than 1/10 for the blind beamformer design time.
TABLE 1
5.2 evaluation of scene 2
A robust beamformer design under scenario 2, i.e., Alice in the case of imperfect WCSI, is evaluated below.
In FIG. 5, the masking threshold 2 ε20.02, CSI error vw0.005. FIG. 5 shows D (p)0||p1) The Cumulative Density Function (CDF) of (1), wherein the relative entropy requirement is D (p)0||p1)≤0.02,||wc,0||2=8dBW,vw0.005. From these results, it is observed that CDF in KL divergence of the non-robust design cannot guarantee requirements, and the robust beamforming design satisfies KL divergence constraint, i.e., satisfies Willie's error detection probability requirement, thereby achieving the objective.
The left and right panels in FIG. 5 show the obtained D (p), respectively0||p1) And D (p)1||p0) Empirical CDF of, for robust and non-robust settingsMeter, in which the threshold value of concealment is 2 epsilon20.02, i.e. D (p)0||p1) Less than or equal to 0.02 and D (p)1||p0) Less than or equal to 0.02, and the CSI error parameter is vw0.005. Here, the non-robust design refers to a concealed design with perfect WCSI proposed under the same conditions. As can be seen from the left and right diagrams in FIG. 5, the proposed robust design satisfies the concealment constraint, namely D (p)0||p1) Less than or equal to 0.02 and D (p)1||p0) Less than or equal to 0.02. On the other hand, non-robust designs cannot satisfy the concealment constraint, where the result D (p)0||p1) 45% of the total amount of the particles exceeds a concealment threshold 2 epsilon20.02 and result D (p)1||p0) Approximately 50% exceeds the concealment threshold. The left and right diagrams in fig. 5 verify the necessity and effectiveness of the proposed robust design.
The left diagram of fig. 6 depicts the CSI error vwConcealment rate R in case of two KL divergences of 0.005bA relation graph with epsilon value, whereinShown in case D (p)0||p1) False alarm probability of down Shown in case D (p)1||p0) False alarm probability of downOther symbol definitions are similar. The simulation result is consistent with the theoretical analysis, when epsilon becomes larger, the hidden constraint condition is relaxed, and R is causedbBecomes larger. CSI error v in FIG. 6w0.005. In fig. 7, ∈ is 0.1. The right graph of fig. 6 plots the false alarm probabilityAnd probability of missed detectionRelation to the value of ε, where the error of CSI vw0.005. Observe the false alarm probability under any one of the covert constraintsAnd probability of missed detectionBoth decrease with increasing epsilon, whereinIs always less thanThis means that Willie's detection performance will be better when the transition constraints are looser.
Furthermore, the right diagram of fig. 6 also verifies the effectiveness of the proposed robust beamformer design in covert communications, i.e.Thus, from fig. 6, a compromise between Willie's detection performance and Bob's concealment rate is revealed, and the desired compromise can be achieved by an appropriate robust beamformer design.
CSI error v in FIG. 8w=0.005。
The left diagram of FIG. 7 depicts two covert constraints D (p)0||p1)≤2ε2And D (p)1||p0)≤2ε2Hidden Rate R ofbAnd the CSI error vwThe relationship (2) of (c). It is observed that with vwIncrease of (2), concealment rate R of two concealment constraintsbDecreasing, the rate gap increases. In the right diagram of FIG. 7, two covert constraints D (p)0||p1)≤2ε2And D (p)1||p0)≤2ε2In case of false alarm probabilityAnd probability of missed detectionAnd CSI error vwThe relationship (2) of (c). The false alarm probability under two concealed constraint conditions is observedAnd probability of missed detectionAre all following vwIs increased by an increase in whichIs always less thanIn addition, FIG. 7 shows at the concealment rate RbOn the other hand, the error v is increasedwWhich may result in a poor beamformer design. However, such a beamformer may confuse Willie detection, which is also beneficial to Bob. Therefore, this trade-off should also be noted in the design of the beamformer.
Finally, FIG. 8 shows the two concealment constraints D (p)0||p1)≤2ε2And D (p)1||p0)≤2ε2Hidden Rate R ofbRelation with the number of antennas N, wherein wc,0||21dBW,. epsilon. 0.1 and vw0.005. It can be seen from fig. 8 that the higher the number N of antennas, the higher the concealment rate R is achievedbThe higher this is, similar to the situation in fig. 4. From FIGS. 6 to 8, it is observed that the hidden constraint condition D (p)0||p1)≤2ε2Is higher than with the blind constraint D (p)1||p0)≤2ε2The rate of (c). This is because D (p)0||p1)≤2ε2Ratio D (p)1||p0)≤2ε2More strictly, this conclusion is (ref [21 ]]) Was also verified.
The present invention derives Willie's optimal detection threshold and corresponding detection error probability based on reliable beamformer vectors. Such results can be used as a theoretical basis for evaluating the concealment performance of the beamformer. The simulation results of the present invention further reveal a tradeoff between Willie's detection performance and Bob's privacy ratio.
Claims (8)
1. A hidden beam forming design method aiming at ideal WCSI hidden communication is characterized by comprising the following steps:
step 1, establishing a covert communication environment;
and 2, under the condition of ideal WCSI, carrying out hidden beam forming design.
2. The method of claim 1, wherein step 1 comprises: alice denotes a base station, Carol denotes a regular user, Willie denotes an eavesdropper, Bob denotes a hidden user, and Alice always sends a data stream x to CarolcAnd is incorporated inCase private data stream xbIs sent to Bob, whereDenotes a null hypothesis, i.e. Alice does not send a private data stream to Bob, butRepresents another assumption that Alice sends a private data stream to Bob; meanwhile, Willie is observing the communication environment as an eavesdropper and tries to identify whether Alice is transmitting to Bob; alice can use the transmission to Carol as a cover to enable secret communication.
3. The method of claim 2, wherein in step 1, Alice is configured with N antennas, and Carol, Bob and Willie have only one antenna; order to Representing a signal xcThe power of (a) is determined,representing a signal xbThe power of (d); use ofEvents indicating that Alice really sent information to Bob, usesAn event indicating that Alice does not send information to Bob.
4. The method of claim 3, wherein in step 1, from Willie's perspective, Alice's transmission signal x is as follows:
wherein wc,0And wc,1Respectively represent xcUnder the assumption thatAnd assume thatOf a transmit beamformer vector, wbDenotes xbBy P, the transmit beamformer vector oftotalRepresenting the maximum transmit power of Alice, the beamformer vector satisfies: in thatIn case, | wc,0||2≤PtotalAnd inIn case, | wc,1||2+||wb||2≤Ptotal;
For Carol, it receives a signal ycComprises the following steps:
whereinIs the channel coefficient from Alice to Carol,is the noise received by Carol, whereRepresents an N-dimensional complex vector, and represents a complex vector,signal noise z representing CarolcObeying a mean of 0 and a variance ofComplex gaussian distribution of (a);
for Bob, it receives the signal ybComprises the following steps:
6. The method according to claim 5, wherein in step 1, Carol is set according to (3) inAndat an instantaneous rate of Rc,0(wc,0) And Rc,1(wc,1,wb) Written as:
let p be0(yw) And p1(yw) Are respectively shown inAndlower Willie received signal likelihood function, based on (5), p0(yw) And p1(yw) Respectively as follows:
7. The method of claim 6, wherein in step 1, Willie wishes to minimize the probability of detection error ξ by applying an optimal detector, setting:
ξ=1-VT(p0,p1), (9)
wherein VT(p0,p1) Is p0(yw) And p1(yw) The total change between them is obtained by using the Pincker inequality:
wherein D (p)0||p1) Represents from p0(yw) To p1(yw) KL of (a) D (p)1||p0) Is from p1(yw) To p0(yw) KL divergence of (1);
D(p0||p1) And D (p)1||p0) Respectively as follows:
to achieve covert communication with a given ξ, i.e., ξ ≧ 1- ε, the KL divergence of the likelihood function should satisfy one of the following constraints:
8. the method of claim 7, wherein step 2 comprises: the ideal WCSI case refers to: willie is a legitimate user and wants to get Bob's personal information, in which case Alice knows channel hwAnd uses it to help Bob avoid Willie's interception;
problem (15) is established:
s.t.Rc,1(wc,1,wb)=Rc,0(wc,0), (15b)
D(p0||p1)=0, (15c)
||wb||2+||wc,1||2≤Ptotal (15d)
to solve the problem (15), two beam former design methods are proposed, namely a hidden beam former design and a ZF zero forcing beam former design, which are respectively as follows:
the hidden beamformer design is as follows:
defining auxiliary variablesAndand introducing an auxiliary variable rbQuestion (15) is restated as the equivalent of question (16):
||wb||2+||wc,1||2≤Ptotal (16e)
applying SDR semi-positive relaxation technique to relax the problem (16), the following conditions were used:
ignoring the constraint of rank 1, a relaxed form of the problem (16), namely the problem (18), is obtained:
Tr(Wc,1)+Tr(Wb)≤Ptotal, (18e)
Wc,1≥0,Wb≥0 (18f)
order:
the following results were obtained:
s.t.φ(Wb)≥rbθ(Wc,1) (20)
rbIs concave when being more than or equal to 0;
an algorithm 1 is established, wherein the algorithm 1 comprises the following steps:
step a1, selecting ζ>0 (end parameter), lower speed limitAnd upper speed limitMake Bob's optimal speedIs located atPerforming the following steps;
Step a5, if the problem (18) is feasible, get the solution WbAnd Wc,1And is provided withOtherwise, set up
Outputting optimal solution by Algorithm 1Andreconstruction of the beamformer W from the solution given by Algorithm 1c,1And WbIf, ifAnd isThenAlso given is an optimal solution to the problem (15), the Singular Value Decomposition (SVD) is used to obtain the optimal beamformer Wc,1And WbI.e. byAndif it is notOrA gaussian randomization procedure is employed to obtain a rank 1 solution for problem (15);
the ZF zero-forcing beamformer is designed as follows: the problem (16) is recalculated to the following problem (21):
||wb||2+||wc,1||2≤Ptotal (21g)
to solve the problem (21), under the constraints of (21d), (21e) and (21f), by minimizing the transmission power | | wc,1||2To optimize the beam former wc,1(ii) a The total transmission power constraint (21g) comprises wbAnd wc,1In order to maximize the objective function (21a), it is necessary to design the beamformer w with the minimum transmit powerc,1(ii) a ZF beamformer wc,1The design problem is expressed as:
s.t.(21d),(21e),(21f),
Wc,1≥0, (23e)
is provided withIs the optimal solution to the problem (23) ifThenIs the optimal solution of the problem (15), the optimal beamformer w is obtained by singular value decompositionc,1I.e. byOtherwise, ifObtaining a rank 1 solution to the problem (22) using a gaussian randomization process;
by usingBeam shaper for representing problem (23), use ofTo representThe problem (21) is expressed as:
s.t.||wb||2+Pc≤Ptotal (24b)
(21b),(21c),
the method is equivalent to the following steps:
(21b),(21c),(24b)
and (5) optimizing and solving by using a standard convex optimization solver to finally obtain the ZF beam former of the problem (21).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011149275.3A CN112272073B (en) | 2020-10-23 | 2020-10-23 | Hidden beam forming design method for ideal WCSI hidden communication |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011149275.3A CN112272073B (en) | 2020-10-23 | 2020-10-23 | Hidden beam forming design method for ideal WCSI hidden communication |
Publications (2)
Publication Number | Publication Date |
---|---|
CN112272073A true CN112272073A (en) | 2021-01-26 |
CN112272073B CN112272073B (en) | 2021-12-21 |
Family
ID=74342680
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202011149275.3A Active CN112272073B (en) | 2020-10-23 | 2020-10-23 | Hidden beam forming design method for ideal WCSI hidden communication |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112272073B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113055064A (en) * | 2021-03-10 | 2021-06-29 | 中国矿业大学 | Steady beam forming design method for hidden communication of Internet of things |
CN113055065A (en) * | 2021-03-10 | 2021-06-29 | 中国矿业大学 | Internet of things hidden beam forming design method based on intelligent reflector |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107453821A (en) * | 2017-07-05 | 2017-12-08 | 厦门声戎科技有限公司 | A kind of sound concealed communication method based on array orientation |
CN111132297A (en) * | 2019-12-19 | 2020-05-08 | 东南大学 | Beam forming optimization method and device for minimizing transmission power of ultra-dense network |
-
2020
- 2020-10-23 CN CN202011149275.3A patent/CN112272073B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107453821A (en) * | 2017-07-05 | 2017-12-08 | 厦门声戎科技有限公司 | A kind of sound concealed communication method based on array orientation |
CN111132297A (en) * | 2019-12-19 | 2020-05-08 | 东南大学 | Beam forming optimization method and device for minimizing transmission power of ultra-dense network |
Non-Patent Citations (2)
Title |
---|
MOSLEM FOROUZESH ET AL.: "Covert Communication Using Null Space and 3D Beamforming: Uncertainty of Willie’s Location Information", 《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 * |
SHUAI MA ET AL.: "Robust Beamforming Design for Covert Communications", 《IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY》 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113055064A (en) * | 2021-03-10 | 2021-06-29 | 中国矿业大学 | Steady beam forming design method for hidden communication of Internet of things |
CN113055065A (en) * | 2021-03-10 | 2021-06-29 | 中国矿业大学 | Internet of things hidden beam forming design method based on intelligent reflector |
CN113055065B (en) * | 2021-03-10 | 2021-12-10 | 中国矿业大学 | Internet of things hidden beam forming design method based on intelligent reflector |
Also Published As
Publication number | Publication date |
---|---|
CN112272073B (en) | 2021-12-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Jorswieck et al. | Broadcasting into the uncertainty: Authentication and confidentiality by physical-layer processing | |
Li et al. | Using Antenna Array Redundancy and Channel Diversity for Secure Wireless Transmissions. | |
Alageli et al. | SWIPT massive MIMO systems with active eavesdropping | |
Cepheli et al. | A high data rate wireless communication system with improved secrecy: Full duplex beamforming | |
Duly et al. | Closed-loop beam alignment for massive MIMO channel estimation | |
Al-Nahari et al. | Beamforming with artificial noise for secure MISOME cognitive radio transmissions | |
Ma et al. | Robust beamforming design for covert communications | |
Bereyhi et al. | Secure transmission in IRS-assisted MIMO systems with active eavesdroppers | |
CN112272073B (en) | Hidden beam forming design method for ideal WCSI hidden communication | |
Serbetli et al. | MMSE transmitter design for correlated MIMO systems with imperfect channel estimates: Power allocation trade-offs | |
Dizdar et al. | Rate-splitting multiple access for communications and jamming in multi-antenna multi-carrier cognitive radio systems | |
Darsena et al. | Design and performance analysis of channel estimators under pilot spoofing attacks in multiple-antenna systems | |
Su et al. | Performance analysis of rate splitting in K-user interference channel under imperfect CSIT: Average sum rate, outage probability and SER | |
CN112272072B (en) | Robust beam forming design method for non-ideal WCSI covert communication | |
Yu et al. | Covert communication with beamforming over MISO channels in the finite blocklength regime | |
Mukherjee et al. | Equilibrium outcomes of dynamic games in MIMO channels with active eavesdroppers | |
Xu et al. | Robust beamforming design for secure multiuser MISO interference channel | |
Wang et al. | Optimal joint beamforming and jamming design for secure and covert URLLC | |
Yang et al. | Artificial noise with optimal power allocation in multi-input single-output wiretap channels | |
Li et al. | Joint Optimization of Secure Over-the-Air Computation and Reliable Multicasting Assisted by a MIMO Untrusted Two-Way Relay | |
Gong et al. | Robust beamforming design for secrecy in multiuser peer-to-peer wireless relay networks | |
Andrei et al. | Sensing-Assisted Receivers for Resilient-By-Design 6G MU-MIMO Uplink | |
Yuan et al. | Correlated channel model-based secure communications in dual-hop wireless communication networks | |
Pan | Enhance wireless network performance and security with reconfigurable antennas | |
Jamal et al. | Performance analysis of null-steering beamformers in cognitive radio systems |
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 |