- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
International Journal of Antennas and Propagation
Volume 2013 (2013), Article ID 546260, 7 pages
Secrecy Balancing over Two-User MISO Interference Channels with Rician Fading
School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China
Received 11 January 2013; Accepted 8 July 2013
Academic Editor: Cheng-Xiang Wang
Copyright © 2013 Jiqing Ni et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
This paper considers a 2-user multiple-input single-output (MISO) interference channel with confidential messages (IFC-CM), in which the Rician channel model is assumed. The coordinated beamforming vectors at the two transmitters have the similar parameterizations as those for perfect CSI, which could be optimized jointly and achieved by agreeing on the real parameters between the two users. Our main contribution is that a quadratic relationship between the two real-valued parameters can be derived for the Rician channel to reach the ergodic secrecy rate balancing point. Simulation results present the secrecy performance over the 2-user MISO IFC-CM scenario.
Security can be provided in the physical layer instead of using passwords or keys, where signal processing techniques can be adopted to degrade an eavesdropper's channel so that meaningful detection at the eavesdropper is difficult or even impossible. Information-theoretic security, widely known as physical-layer security, was first introduced in the 1970s by Wyner . In particular, the notion of secrecy capacity, which is the maximum achievable rate that can be kept confidential to the eavesdropper, was defined. Later, the work was extended to the Gaussian wiretap channel in . In , Csiszar and Korner considered a more general wiretap channel model and showed that secure communication is in fact possible without using key encryption in the presence of the eavesdropper. Recently, the advances in multiple-input multiple-output (MIMO), multicell communication and relay offer new opportunities for physical-layer security.
For MIMO wiretap channel,  studied the performance tradeoffs and derived upper and lower bounds on the secrecy capacity both for finite systems and in the large-system limit. Using artificial noise to confuse the eavesdropper, masked MIMO beamforming has also been considered in multicast system [5, 6]. For cooperative communication employing relays,  established the utility of user cooperation in facilitating secure communication and derived an outer-bound on the optimal rate-equivocation region based on a four-terminal relay-eavesdropper channel. In , the optimization of cooperative jamming (CJ) is examined to enhance the physical-layer security of a wiretap fading channel via distributed relays. Also, He and Yener in  provided an achievable secrecy rate region for the general channel with an untrusted relay. Most recently, physical layer secrecy has been also applied to other communication systems, such as two-way relay , satellite communications , and interference channel with confidential messages (IFC-CM) .
In , the achievable secrecy rate region and an outer bound for the IFC-CM were presented, while  derived the inner and outer bounds of a one-sided IFC-CM and analyzed the gap between them. A -user Gaussian IFC with secrecy constraints was investigated in  and by using an interference alignment scheme with secrecy precoding at each transmitter, and it was revealed that a nonzero secure degree of freedom can be achieved. The scenario was extended to the -user Gaussian many-to-one IFC in  where the achievable secrecy sum-rate over all users was shown to be achievable by using nested lattice codes.
From the signal-processing perspective, secure (or secret) communications has also received much attention. Literature  has studied the power control problem and artificial noise parameter optimization for the max-min point and the single-user point over the two-user symmetric IFC-CM without multiple antennas. For the two-user MISO IFC-CM,  analyzed the key points on the Pareto boundary of the secrecy rate region for the two-user IFC with multiple-input single-output (MISO) antennas. Also, the multiple-input multiple-output (MIMO) Gaussian IFC-CM was investigated in  where a game-theoretic approach was proposed to permit the two transmitters to compromise to an operating point that better balances the network performance.
The focus of this paper is on a two-user interference channel with confidential messages (IFC-CM) in which each receiver is to decode its own message but could eavesdrop the message intended for the other user, where the imperfect CSI with Rician fading is assumed. First, the beamforming vectors corresponding to the Pareto-optimal ergodic secrecy rate points are characterized similar to the perfect CSI case. The coordinated optimal beamforming vectors at the two transmitters could be achieved by agreeing on the real parameters between the two users. Further, a quadratic relationship between the two real valued parameters can be derived, and the ergodic secrecy-rate balancing point which provides a secrecy rate-fair operating point will be determined by searching only one real-valued parameter.
The remainder of this paper is organized as follows. In Section 2, we present the system model. In Section 3, the Pareto boundary of the secrecy rate region is characterized, and some special operating points are considered. Section 4 extends the work to the statistical CSI, and the closed-form ergodic secrecy rate expressions are derived. Section 5 presents simulation results, and conclusions are drawn in Section 6 finally.
Notations. Throughout, vectors are denoted by boldface small letters while matrices are written in boldface capital letters. We use the superscripts , , and to denote, respectively, the complex conjugate, transpose and Hermitian transpose operations. An identity matrix is denoted by .
2. MISO IFC-CM Model
We consider a two-user MISO IFC-CM, which may arise from a downlink cellular network with two multiantenna base stations (BSs) each transmitting to one desirable mobile station (MS). The message sent by each BS is confidential and required to be kept confidential to the other unintended MS. Due to the broadcast nature of wireless channels, however, the MSs may eavesdrop on the transmitted signals not intended for them and thus be regarded as eavesdroppers to each other, as is shown in Figure 1. Note that the two BSs trust each other so that they could design the coordinated beamformers together to optimize the secrecy rates. The MS receivers are assumed to have a single antenna, and each BS is equipped with transmit antennas.
Based on the model, the received signals at the two MSs can be written as where () denotes the complex channel vector between BS and MS , denotes the information symbol intended for MS sent by BS , is the complex Gaussian noise with zero mean and variance , and denotes the transmit beamforming vector at the th BS and, without loss of generality, satisfies the peak power constraint . The noises and the channels are all independent to each other.
The received signal at each MS contains the desirable message and also the message intended for the other MS, and the channel can therefore be viewed as a virtual multiple-access channel (MAC) with the achievable rate already known in , which is given in the following lemma for completeness.
Lemma 1 (capacity for MAC ). For a -user MAC with channels and transmit covariance matrices , for , joint decoding with successive interference cancelation can achieve all the corner points of the capacity region. Given a decoding order in which user is decoded first, user is decoded second, and so on, the achievable rate for user is given by
Lemma 1 states that the decoding order has no impact on the channel sum-rate but determines the achievable rate for each user. Specifically, the decoding order for the intended message and the eavesdropped message determines the message rate and the equivocation rate. We assume that the intended message is decoded first by treating the eavesdropped message as noise, and then the eavesdropped message is decoded without any interference. Then, the eavesdropped signals at the MSs can be equivalently expressed as The level of secrecy can be quantified by secrecy rate which is given by  where denotes the message rate and denotes the equivocation rate. With the intended message being decoded first, the secrecy rates for MS 1 and MS 2 can be, respectively, written as
Based on the decoding order, the smallest and the largest are obtained at the MS receivers, and the achievable secrecy rates in (5) correspond to the inner bound for the secrecy rates over the general Gaussian MISO IFC-CM , which provides a worst-case scenario for analysis and optimization of the beamforming vectors. A similar argument has been used in  to justify their formulation.
We can define the achievable secrecy rate region to be the set of all secrecy rate pairs where the MISO beamforming vectors satisfy the power constraints at the BSs:
The outer boundary of this region is called the Pareto boundary, because it consists of the operating points for which it is impossible to improve one secrecy rate, without simultaneously decreasing the other secrecy rate. More precisely, we define the Pareto optimality of an operating point as follows.
Definition 2. A secrecy rate tuple is Pareto optimal if there is no other tuple such that and where the inequality operates component wisely.
It is noted that for a fixed channel, the secrecy rate region is compact because the set subject to the power constraint is compact and the mapping from to is continuous.
3. Ergodic Secrecy Rate Region with Rician Channel
3.1. Rician Channel Model
We consider that the channel vectors follow the Rician channel model, that is, where is channel mean vector, denotes channel error vector and its entries are modelled as independent nonzero-mean random variables, is the error coefficient and without losing generality, and is assumed to be same for all the channels.
3.2. Ergodic Secrecy Rate Region
The ergodic secrecy rates are obtained by taking the expectation over the distribution of the channels, that is, The achievable ergodic secrecy rate region can be expressed as the set of all the ergodic secrecy rates:
Consider first, and it has where the second and third terms could be tackled using  which involves a single integral which can be effectively calculated by using high-precision numerical integral methods . Also note that it is monotonic increasing with . While for the first term, it is more difficult to reexpress it with simpler expression, but we know that belongs to noncentral chi-squared distribution, that is, the sum of the squares of independent Gaussian random variables having unit variance and nonzero means , the expectation is monotonic increasing with each mean. Although we do not present the closed form of the ergodic secrecy rate, but the monotony is very useful for us to further characterize the achievable ergodic secrecy rate region. has similar monotony.
3.3. Characterization of Ergodic Secrecy Rate Region
It shows that any point on the Pareto boundary should be achieved with full power and the corresponding beamforming vectors have the same characterization as perfect CSI case. To proceed, we first state the following lemma, which deals with the monotony of . The lemma is stated for ; similar results hold for .
Lemma 3. is monotonic increasing with and monotonic decreasing with and .
Proof . From discussions in the previous subsection, we know that is monotonic increasing with , and is monotonic increasing with and . Thus, it is easy to see is monotonic increasing with and decreasing with .
Next we consider the term , which is included in both the first term and second term in (10). We will show it using the method that for fixed , it has that is monotonic decreasing with . Further for any positive random variable , the monotony still holds, that is, the term is monotonic decreasing with . Note that since the expectation over does not affect the monotony of this term. Thus, we have that is monotonic decreasing with , which completes the proof.
From the monotonicity of , we see that the same conflicting situation happens as the perfect CSI case associated with the beamforming vectors. By utilizing the similar method, any beamforming vector leading to a Pareto-optimal ergodic secrecy rate tuple can be expressed as a linear combination of stochastic maximal-ratio combining (MRC) and stochastic zero-forcing (ZF) beamformers, which are defined as
Theorem 4. Any Pareto-optimal ergodic secrecy rate point is achievable with the beamforming strategy:
where are real-valued parameters.
Proof. The proof is essentially the same as that of its perfect CSI case. Hence, we only provide an outline here. The proof uses the method of contradiction.
To do so, we write any optimal beamforming vector as where and choosing in the nullspace of such that . Clearly, achieves the same secrecy rate performance as . Hence, the optimal beamforming vector should lie in the space spanned by and .
Next, we prove that the Pareto-optimal ergodic secrecy rate point can be obtained only when full power is used. To show this, we first consider and assume . Construct such that . Based on the monotony of the associated terms, it can prove that if , then it is possible to choose a new , such that is increased and is unchanged. Therefore, in order to reach the Pareto boundary, the transmitter should operate at full power. And any optimal beamformer in the space of could be formulated as the form in (14a). See  for more details regarding the proof.
It is worth highlighting that previous Theorem 4 aligns with the result for the two-user MISO IFC-CM with perfect CSI ; this is because that they have the similar monotony with the terms associated with beamformers. This theorem also shows that we only need to vary the scalar real-valued parameters and in order to achieve any specific point on the Pareto boundary of the ergodic secrecy rate region. That is, these two BSs could achieve this specific points by setting and together.
4. Ergodic Secrecy Rate Balancing Point
4.1. Ergodic Secrecy Balancing
In the IFC model, user fairness is an important metric which can be achieved by balancing the user secrecy rates so that the weaker user is not overly compromised. Technically, this can be obtained by maximizing the worse-user's secrecy rate. That is, The secrecy rate balancing point can be realized by setting, if a solution exists, which can be simplified as Then, a simple relationship between and can be achieved.
Proof. We first introduce the following terms :
Substituting in (14a) into and , we have where and . The functions , can be expressed and defined in a similar way with parameters and .
By substituting (20) into (18), we have It can be easily seen that the left-hand-side (LHS) and the RHS of (23) are functions of only and , respectively. Let the RHS of (23) be . Then, we have Inserting (21) and (22) into (24) and simplifying the expression, we get the quadratic equation (19) with the coefficients as
Next, we show by the method of contradiction that the secrecy rate balancing point corresponds to a unique solution in the feasible set if (19) is solvable. Assume that (19) has two solutions, and , both corresponding to the secrecy balancing point, that is, . However, from Lemma 3, is a continuous monotonously decreasing function of which means that for different and , . This contradicts the assumption which completes the proof.
For a given can be determined by solving a similar quadratic equation. Through Proposition 5, the secrecy rate balancing point can be determined by searching only one real-valued parameter in the feasible set. The secrecy rate balancing point achievable by is the one that gives the maximal secrecy rate among all of the points that satisfy . For the special case that there is no satisfying the quadratic equation (19) for any in the feasible set, it reduces to the single-user ergodic secrecy rate maximal point where the worse-user's secrecy rate is maximized. The single-user ergodic secrecy rate maximal point is where or is selected. Note that denotes the maximal ergodic secrecy rate for , and corresponds to the case that the BS chooses the stochastic ZF beamforming to minimize the interference for the other link.
4.2. Single-User Maximal Ergodic Secrecy Rate
At the single-user ergodic secrecy rate maximal point, one BS should choose the stochastic ZF beamforming strategy while the other BS tries to maximize the ergodic secrecy rate. In our two-user IFC-CM model, there are two single-user ergodic secrecy rate maximal points for and , respectively. As the special case of secrecy balancing, the operating point is where or is selected.
can be formulated as a function of with . In this case, there always exists an optimal , , ensuring that . The optimal can be easily obtained by searching over the feasible set . Similarly, the single-user secrecy rate maximal point for can be derived by setting and . The single-user ergodic secrecy rate maximal points for and are endpoints on the Pareto boundary of the ergodic secrecy rate region. It can be also understood since there are no other operating points that could improve or further even sacrificing the other user's secrecy rate performance.
4.3. Other Key Points
4.3.1. Stochastic ZF
At this key point, both BSs choose the stochastic ZF beamformers, which can be achieved by simply setting . The secrecy ZF point is not on the Pareto boundary but in the interior of the ergodic secrecy rate region. Also, it is clear that at high SNR or for a large number of antennas, the secrecy ZF point will not be far away from the optimal point.
4.3.2. Nash Equilibrium
At the Nash equilibrium, the users (or BSs) selfishly optimize their beamforming vectors to maximize their own secrecy rates assuming that beamforming of the other user is fixed . We can iteratively search optimal and to reach the Nash-equilibrium point. This point is not optimal and thus in the interior of the ergodic secrecy rate region.
4.3.3. Sum Ergodic Secrecy Rate
The sum secrecy rate point is the point at which is maximized. Geometrically, this is where the Pareto boundary of the secrecy rate region, , osculates a straight line with slope . It goes without saying that the sum secrecy rate point is on the Pareto boundary of .
5. Simulation Results
Simulation results are provided to study the ergodic secrecy rate region for the two-user Gaussian MISO IFC-CM by the Pareto-boundary characterization for the cases with Rician channel. In the simulations, unless specified otherwise, we assume that the number of transmit antennas at each BS is 2 and the channel mean vector is randomly generated from an i.i.d. complex Gaussian distribution with zero mean and unit variance. Note that is set as 0.1 in the all simulations.
Figure 2 shows an example of the ergodic secrecy rate region for a two-user Gaussian MISO IFC-CM over Rician fading with SNR at 0 dB. The achievable ergodic secrecy rate region generated from Theorem 4 by varying and in , and as we can see, the Pareto boundary including all the key operating points can be obtained through the parameterization. Also, the ergodic secrecy rate balancing point is on the Pareto boundary and it is where the Pareto boundary intersects the line . In comparison, the sum secrecy rate point is the point where the Pareto boundary touches the straight line of slope . Results illustrate that the secrecy rate balancing point gives a lower sum secrecy rate compared to the sum secrecy rate point, but the worst-user secrecy rate is maximized. Also, the Nash-equilibrium point and the stochastic ZF point are in the interior of the secrecy rate region, that is, not Pareto optimal.
Figure 3 provides another example of the ergodic secrecy rate region but with SNR at 5 dB with same channel realization. As can be seen, when the SNR is increased, the corresponding ergodic secrecy rates are all improved and the stochastic ZF point in particular gets closer to the Pareto boundary.
Figure 4 considers the special case that the ergodic secrecy rate balancing point reduces to the single-user ergodic secrecy rate maximal point, which occurs when there is no solution to (18) for . Geometrically, the Pareto boundary of has no intersection point with the straight line , which can be observed in the figure. Thus, the ergodic secrecy rate balancing point is reduced to the closest single-user ergodic secrecy rate maximal point.
In this paper, we studied the two-user MISO IFC-CM with Rician fading assumption. We revealed that the optimal beamforming vectors corresponding to the Pareto optimal point have the same parameterizations as those for perfect CSI. The secrecy rate balancing point, which provides the highest user fairness, was investigated. In particular, a quadratic relationship between the two real-valued parameters can be derived for the Rician channel to reach the ergodic secrecy rate balancing point. Simulation results show the secrecy performance of the proposed method.
This work was supported in part by China National S&T Major Project 2013ZX03003002-003, the National Natural Science Foundation of China under Grant no. 61101130, and the Excellent Young Scholar Research Funding of Beijing Institute of Technology under Grant no. 2013CX04038.
- A. D. Wyner, “Wire-tap channel,” Bell System Technical Journal, vol. 54, no. 8, pp. 1355–1387, 1975.
- S. K. Leung-Yan-Cheong and M. E. Hellman, “Gaussian wire-tap channel,” IEEE Transactions on Information Theory, vol. IT-24, no. 4, pp. 451–456, 1978.
- I. Csiszar and J. Korner, “Broadcast channels with confidential messages,” IEEE Transactions on Information Theory, vol. IT-24, no. 3, pp. 339–348, 1978.
- S. Goel and R. Negi, “Guaranteeing secrecy using artificial noise,” IEEE Transactions on Wireless Communications, vol. 7, no. 6, pp. 2180–2189, 2008.
- M. Pei, J. Wei, K.-K. Wong, and X. Wang, “Masked beamforming for multiuser MIMO wiretap channels with imperfect CSI,” IEEE Transactions on Wireless Communications, vol. 11, no. 2, pp. 544–549, 2012.
- A. Khisti and G. W. Wornell, “Secure transmission with multiple antennas I: the MISOME wiretap channel,” IEEE Transactions on Information Theory, vol. 56, no. 7, pp. 3088–3104, 2010.
- L. Lai and H. El Gamal, “The relay-eavesdropper channel: cooperation for secrecy,” IEEE Transactions on Information Theory, vol. 54, no. 9, pp. 4005–4019, 2008.
- G. Zheng, L.-C. Choo, and K.-K. Wong, “Optimal cooperative jamming to enhance physical layer security using relays,” IEEE Transactions on Signal Processing, vol. 59, no. 3, pp. 1317–1322, 2011.
- X. He and A. Yener, “Cooperation with an untrusted relay: a secrecy perspective,” IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3807–3827, 2010.
- H. Wang, Q. Yin, and X. Xia, “Distributed beamforming for physical-layer security of two-way relay networks,” IEEE Transactions on Signal Processing, vol. 60, no. 7, pp. 3532–3545, 2012.
- G. Zheng, P.-D. Arapoglou, and B. Ottersten, “Physical layer security in multibeam satellite systems,” IEEE Transactions on Wireless Communications, vol. 11, no. 2, pp. 852–863, 2012.
- R. Liu, I. Maric, P. Spasojevic, and R. D. Yates, “Discrete memoryless interference and broadcast channels with confidential messages: secrecy rate regions,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2493–2507, 2008.
- Z. Li, R. D. Yates, and W. Trappe, “Secrecy capacity region of a class of one-sided interference channel,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '08), pp. 379–383, Toronto, Canada, July 2008.
- O. O. Koyluoglu, H. El Gamal, L. Lai, and H. V. Poor, “Interference alignment for secrecy,” IEEE Transactions on Information Theory, vol. 57, no. 6, pp. 3323–3332, 2011.
- X. He and A. Yener, “The gaussian many-to-one interference channel with confidential messages,” IEEE Transactions on Information Theory, vol. 57, no. 5, pp. 2730–2745, 2011.
- J. Zhu, J. Mo, and M. Tao, “Cooperative secret communication with artificial noise in symmetric interference channel,” IEEE Communications Letters, vol. 14, no. 10, pp. 885–887, 2010.
- Z. Fei, J. Ni, D. Zhao, C. Xing, N. Wang, and J. Kuang, “Ergodic secrecy rate of two-user MISO interference channels with statistical CSI,” submitted to Science China Information Sciences.
- S. A. A. Fakoorian and A. L. Swindlehurst, “MIMO interference channel with confidential messages: achievable secrecy rates and precoder design,” IEEE Transactions on Information Forensics and Security, vol. 6, no. 3, pp. 640–649, 2011.
- S. Vishwanath, N. Jindal, and A. Goldsmith, “Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels,” IEEE Transactions on Information Theory, vol. 49, no. 10, pp. 2658–2668, 2003.
- J. Li and A. P. Petropulu, “Ergodic secrecy rate for multiple-antenna wiretap channels with rician fading,” IEEE Transactions on Information Forensics and Security, vol. 6, no. 3, pp. 861–867, 2011.
- D. H. Bailey, K. Jeyabalan, and X. S. Li, “A comparison of three high-precision quadrature schemes,” Experimental Mathematics, vol. 14, no. 3, pp. 317–329, 2005.
- M. Alexander, F. A. Graybill, and D. C. Boes, Introduction to the Theory of Statistics, McGraw-Hill, 1974.
- E. A. Jorswieck and R. Mochaourab, “Secrecy rate region of MISO interference channel: pareto boundary and non- cooperative games,” in Proceedings of the International Workshop Smart Antennas, Berlin, Germany, 2009.
- J. Lindblom, E. Karipidis, and E. G. Larsson, “Closed-form parameterization of the Pareto boundary for the two-user MISO interference channel,” in Proceedings of the 36th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '11), pp. 3372–3375, Prague, Czech Republic, May 2011.
- P. Dubey, “Inefficiency of Nash equilibria,” Mathematics of Operations Research, vol. 11, no. 1, pp. 1–8, 1986.
- E. G. Larsson and E. A. Jorswieck, “Competition versus cooperation on the MISO interference channel,” IEEE Journal on Selected Areas in Communications, vol. 26, no. 7, pp. 1059–1069, 2008.