 Research
 Open Access
 Published:
Individual secrecy of fading homogeneous multiple access wiretap channel with successive interference cancellation
EURASIP Journal on Wireless Communications and Networking volume 2017, Article number: 165 (2017)
Abstract
We investigate individual secrecy performance in a Kuser quasistatic Rayleigh fading homogeneous multiple access wiretap channel (MACWT), where a legitimate receiver employs successive interference cancellation (SIC) decoding. We first evaluate individual secrecy performance under an arbitrary SIC order by deriving closedform expressions with respect to secrecy outage probability and effective secrecy throughput (EST) as main metrics. The resulting closedform expressions disclose a significant impact on the secrecy performance from the order of SIC decoding. Therefore, we propose three SIC decoding order scheduling schemes: (1) roundrobin scheme, absolutely fair and served as a benchmark; (2) suboptimal scheme, based on each user’s main channel condition; and (3) optimal scheme, based on each user’s achievable secrecy rate. Comparison results show that the last two schemes outperform the first one with regard to both the EST and the multiuser diversity gain, whereas the performance of the suboptimal scheme is highly close to that of the optimal scheme which is usually impractical due to a requirement for the eavesdropper’s channel state information (CSI).
Introduction
Since Wyner introduced the notion of the wiretap channel in his seminal work [1], the studies of keyless physicallayer secrecy transmission have made tremendous progress. He initially characterized a rateequivocation region for a degraded wiretap channel, which was extended to a more general nondegraded version in [2]. The Gaussian wiretap channel was investigated in [3], which confirmed that the secrecy capacity is the difference between the capacities of main and eavesdropper channels. Thus, a more favorable main channel means the existence of a positive secrecy capacity. However, during wireless transmission, fading channels rather than stationary channels with Gaussian noise are a natural situation, where a more favorable main channel is not always guaranteed. Consequently, researchers characterized another two secrecy metrics, secrecy outage probability and ergodic secrecy capacity [4, 5]. Besides, one interesting measure, effective secrecy throughput (EST), was introduced in [6] by Nan Yang et al. evaluating an average secrecy rate at which messages are transmitted to a legitimate receiver confidentially.
A great deal of research work addressed how to improve secrecy performance, some from the perspective of precoding and beamforming [7–10], some via the utilization of artificial noise or jamming [11–14], and some jointly applying these approaches [15–18]. Overall, the purpose of exploiting these techniques is to enlarge the capacity difference between main and eavesdropper channels. One can further refer to a recent survey of physicallayer security which has been investigated from information theory to security engineering in [19].
Inspired by a capacity improvement on an individual user in a multiuser system with a successive interference cancellation (SIC) receiver [20], in this work, we consider a secrecy scenario as depicted in Fig. 1, where K transmitters send confidential messages to a legitimate receiver who employs SIC decoding with the existence of an eavesdropper. We investigate the impacts of the SIC order and multiuser diversity on individual secrecy performance and propose three SIC order scheduling schemes.
The system model in this work is a typical multiple access wiretap channel (MACWT)^{1}, which has been intensively studied recently. However, all of these references [21–34] considered problems from an informationtheoretical perspective and characterized the setting as a whole. Ender Tekin et al. characterized secrecy rate regions and an upper bound for the secrecy sumrate for a Gaussian MACWT via the Gaussian encoding in [21]. They also addressed a fading MACWT in [22], providing achievable ergodic secrecy rate regions as well as its outer bounds and giving optimal power allocations to maximize the sumrate. Hassan ZivariFard et al. [23] investigated a 2user MACWT with a common message which can be decoded by both the legitimate receiver and the eavesdropper, and derived general inner and outer bounds on a secrecy capacity region for both discrete memoryless and Gaussian cases. The authors further addressed this type of MACWT (with a common message) in [24], where only one transmitter’s private messages should be kept secret from the adversary. They derived general inner and outer bounds for both imperfect and perfect secrecy conditions for the adversary under discrete memoryless, less noisy, and Gaussian versions of the MACWT. Yet, the secure degrees of freedom (DoF) of such Gaussian signalingbased schemes are zero, which means the schemes are suboptimal and leads to further work for new encoding techniques. One commonly used encoding technique is the real interference alignment [25–27]. Other techniques, e.g., uniform distributed source coding and polar coding, are also developed and applied for the MACWT [28–30]. Moreover, two alignment techniques, scalingbased alignment (SBA), and ergodic secret alignment (ESA), were proposed in [31] to achieve an ergodic secrecy rate region for a 2user fading MACWT. The SBA performs repetition coding at two consecutive time instances while the ESA performs repetition coding at two carefully chosen time instances. Another research direction of interest on the MACWT is secure DoF, which was also fully studied in recent years [25, 32–34]. Xie and Ulukus [25] derived the sum secure DoF of a Kuser Gaussian MACWT. The entire secure DoF region of the Kuser Gaussian MACWT was determined in [32]. Mukherjee and Ulukus [33] considered the secure DoF of the case with no eavesdropper’s channel state information (CSI). The results showed the sum secure DoF is less than that of the case with a subset or all of the transmitters knowing the eavesdropper’s CSI. The secure DoF of a MIMO MACWT was studied in [34], showing that the optimal sum secure DoF is affected by the number of eavesdropper antennas.
The problems in this work are also different from the existing literature regarding multiuser uplink wiretap channels [35–37]. Jin et al. [35] and Zou et al. [36] ignored cochannel interference deliberately in the system models. Although cochannel interference was considered in [37], where uplink secure communications in a cellular network are studied, such cochannel interference is not from the users in a cell but from neighboring base stations.
Secrecy problems related to SIC were studied in [38], where the authors only considered the case of two transmitterreceiver pairs and tried to find the coordinated beamforming vectors at the transmitters to reach an ergodic secrecy rate balancing point. In [39], we investigated individual secrecy performance for a Kuser MACWT, where the legitimate receiver possesses multiple antennas and employs two specific decoding methods, zeroforcing (ZF), and minimum meansquare error (MMSE), jointly with SIC. For simplicity, we ignored the cochannel interference to the eavesdropper during modeling. We later complicated the eavesdropper setting from a singleantenna to multiantenna scenario in [40], where, besides the derivations of individual secrecy performance, we further proposed one SIC order scheduling scheme based on each user’s relative distance to the eavesdropper over the legitimate receiver, and gave a solution to the problem of uplink optimal power allocation.
In this paper, we continue to study individual secrecy performance for the Kuser MACWT with SIC. We take into account the cochannel inference to the eavesdropper for evaluating the secrecy performance. Moreover, we propose three new SIC decoding order scheduling schemes. Both the main and eavesdropper channels are assumed to experience quasistatic Rayleigh fading, just as in [39, 40]. We further assume the users are homogeneous, i.e., all the users experience the same received power on average at each of the receivers (the legitimate receiver and the eavesdropper). We call such a network as the homogeneous MACWT, which is assumed throughout this paper. Similar to [39, 40], secrecy outage probability and effective secrecy throughput are utilized as our key measures in evaluating the secrecy performance.
It is worthwhile to mention that an assumption of homogeneous (also call “symmetric” in some literature) networks is widely used to address wireless communication issues. In [41], homogeneous users were assumed in the system model to address a secrecy issue of multiuser downlinks. Reid et al. [42], Nitinawarat [43], Chou et al. [44] studied related wireless communication problems based on symmetric multiple access channels. A 2user symmetric MACWT was investigated in [45], while reference [46] modeled a Kuser symmetric MIMO MACWT for analyzing secure DoF.
To demonstrate how the SIC order impacts the individual secrecy performance, we derive the closedform expressions of the secrecy outage probability and the effective secrecy throughput with a specified SIC order. Observing these closedfrom expressions, we can assess the impact of the SIC order.
To compare these three SIC order scheduling schemes, we first make succinct comparisons of the EST of the best case (i.e., no cochannel interference) for each scheme, since the performance of the best case predominates the other cases, which will be seen clearly later in this paper. Then, with the aid of simulations, we make full performance comparisons of these schemes regarding the maximum sumEST and the multiuser diversity gain.
The main contributions of the paper are summarized as follows:

1)
Model the fading homogeneous MACWT and derive closedform expressions of the cumulative distribution function (CDF) of signaltointerferenceplusnoise ratios (SINRs) for any individual transmitter at the legitimate receiver and the eavesdropper, respectively.

2)
Evaluate the impacts of the SIC order and multiuser diversity on the secrecy performance in terms of secrecy outage probability, effective secrecy throughput, and other secrecy performance metrics by deriving the corresponding closedform expressions.

3)
Propose and evaluate three SIC decoding order scheduling schemes, namely, roundrobin scheme, suboptimal scheme, and optimal scheme.
The rest of the paper is organized as follows: in Section 2, we model the quasistatic Rayleigh fading homogeneous MACWT. Section 3 investigates the individual secrecy performance. Three SIC order scheduling schemes are proposed in Section 4. Numerical results and further discussions are presented in Section 5. Finally, Section 6 concludes the work.
Notation: \(\mathcal {A} \backslash \mathcal {B}\) denotes set \(\mathcal {A}\) minus set \(\mathcal {B}\). \(\mathcal {CN}\), Exp, and \(\chi ^{2}_{m}\) specify the circular symmetric complex Gaussian distribution, the exponential distribution and the chisquared distribution with m degrees of freedom, respectively. log denotes the base 2 logarithm. [·]^{+}=max(0,·). E(·) specifies the expectation operator.
Fading homogeneous MACWT modeling
As illustrated in Fig. 1, K earth stations (U _{1},…,U _{ K }) are intended to transmit their confidential messages to a legitimate satellite (Bob) through main multiple access links, while an illegal satellite (Eve) attempts to intercept data from a specific user U _{ k }, \(k\in \mathcal {K}\triangleq \left \{ 1,\ldots,K \right \}\), through a corresponding wiretap link with the existence of cochannel interference. Assuming that all of the nodes (K users, i.e., earth stations, Bob, and Eve) are equipped with a single antenna, the main channel coefficient between U _{ k } and Bob is denoted as h _{ k }, while g _{ k } denotes the eavesdropper channel coefficient between U _{ k } and Eve. We suppose Bob has instantaneous knowledge of the realization of h _{ k }, but only has the statistic of g _{ k }. The signal transmitted from U _{ k } is denoted as x _{ k }, which has an identical average power constraint of P for all \(k\in \mathcal {K}\).
Therefore, the instantaneous composite signals received at Bob and Eve can be formulated as
where w _{ b } and w _{ e } are circular symmetric complex Gaussian random variables with the variances of N _{ b } and N _{ e }, respectively, i.e., \(w_{b}\sim \mathcal {CN}\left (0,N_{b}\right)\) and \(w_{e}\sim \mathcal {CN}\left (0,N_{e}\right)\).
We assume both the main and wiretap links experience quasistatic Rayleigh fading.^{2} As such, h _{ k }^{2} and g _{ k }^{2} are exponentially distributed, the means of which are denoted as \(\delta _{k}^{2}\) and \(\sigma _{k}^{2}\), respectively.
We further assume all the K users are situated in a small region (e.g., a diameter of several kilometers) relative to the distances between the users and both satellites (maybe several hundred or thousand kilometers). Such a scenario may exist in a military base or a television station where multiple earth stations need to transmit their signals to a relay satellite. The assumption implies all the users are approximately equidistant from each of the satellites. Thus, all these users can be considered to be homogeneous, i.e., the average power received at Bob/Eve from each user is the same, as long as they have identical average transmit power.
Interestingly, in this case, the K singleantenna users can also correspond to one Kantenna transmitter, where each antenna transmits one independent data stream. Therefore, the system can also be regarded as a multipleinputsingleoutput (MISO) wiretap channel, where the eavesdropper attempts to intercept messages from one specific data stream. Different from issues of the MISO wiretap channel in [6, 47–49], we focus on the impact of the SIC order on the individual secrecy performance (i.e., secrecy performance of each data stream in this equivalent MISO wiretap channel model).
Achievable individual secrecy rate with SIC
In traditional multiuser decoding, a receiver decodes each user’s data by treating all other users’ data as noise. Such a method is not capacityachieving. In this network model, Bob employs SIC decoding by subtracting alreadydecoded data from the composite signal, reducing the amount of cochannel interference for the next user’s decoding. Therefore, the main capacity of an individual user is determined not only by its signaltonoise ratio (SNR) but also by its own order in SIC decoding. When a user is decoded at first, it is just the same as the traditional way of decoding for that user, achieving the worst case. In contrast, it achieves the best case, i.e., no cochannel interference, if it is decoded at last. In general, we can express the main capacity of an individual user (i.e., U _{ k }) with SIC as
where \(\xi _{k}=\frac {\left h_{k}\right ^{2}P}{N_{b}}\) (\(\forall k\in \mathcal {K} \)) is the instantaneous SNR of U _{ k } at Bob with the mean of \(\overline {\xi _{k}}=\frac {\delta _{k}^{2}P}{N_{b}}=1/\lambda _{k}\); \(\Im \subseteq \mathcal {K}\backslash \left \{ k \right \}\), implying U _{ k } is decoded just before the users in the set I (index) during SIC decoding; and \(\gamma _{k}^{(\Im)} \) denotes the SINR of U _{ k } at Bob, the superscript of which indicates where the cochannel interference comes from.
It is reasonable to assume that Eve cannot do any SIC decoding before it is able to intercept a message successfully from any user. Consequently, the wiretap capacity for U _{ k } can be expressed as
where \(\eta _{k} = \frac {\left g_{k}\right ^{2}P}{N_{e}}\) (\(\forall k\in \mathcal {K} \)) is the instantaneous SNR of U _{ k } at Eve with the mean of \(\overline {\eta _{k}}=\frac {\sigma _{k}^{2}P}{N_{e}}=1/\mu _{k}\), and ρ _{ k } denotes the SINR of U _{ k } at Eve.
Thereby, in this MACWT channel, the instantaneous achievable individual secrecy rate with SIC can be formulated as [21, 50]
Statistics of SINRs
Since the derivation of the secrecy outage probability requires the statistics of \(\gamma _{k}^{(\Im)}\) and ρ _{ k }, we decide to derive them in advance in this subsection.
Before deriving the statistic of \(\gamma _{k}^{(\Im)}\), we first investigate the random variables ξ _{1},ξ _{2},…,ξ _{ K }. As ξ _{ k }∝h _{ k }^{2} (\(\forall k\in \mathcal {K}\)), the random variables (ξ _{1},ξ _{2},…,ξ _{ K }) are mutually independent and exponentially distributed, i.e., ξ _{ k }∼Exp(λ _{ k }) (\(\forall k\in \mathcal {K}\)). The CDF of \(\gamma _{k}^{(\Im)}\) can be obtained,
Similarly, the random variables η _{1},η _{2},…,η _{ K } are exponentially and independently distributed, i.e., η _{ k }∼Exp(μ _{ k }) (\(\forall k\in \mathcal {K}\)). The CDF of ρ _{ k } can be formulated in the same fashion,
The detailed derivations of (6) and (7) can be found in Appendix A.
Due to the homogeneousness, λ _{1}=λ _{2}=…=λ _{ K } and μ _{1}=μ _{2}=…=μ _{ K }. Thus, (6) and (7) can be further simplified to
Here, the subscript k is omitted, as each user has the same attributes, and the superscript I is changed into its cardinality n, i.e., the number of cochannel interferers.
Their probability density functions (PDFs) can be yielded by differentiating the related CDFs in (8) and (9), respectively.
Notably, the subscript k of notations will be automatically omitted in the rest of the paper if necessary.
Individual secrecy performance with SIC
This section investigates the individual secrecy performance, termed secrecy performance for short hereinafter, under an arbitrary SIC order in terms of secrecy outage probability, effective secrecy throughput, and some other secrecy performance metrics. The closedform expressions are derived and related performance analysis is explored.
Secrecy outage probability
The secrecy outage probability is the probability of the achievable secrecy rate that is less than a predefined secrecy rate R _{ s },
Here, \(C_{s}^{(n)}\) denotes the instantaneous achievable individual secrecy rate with n cochannel interferers, and its prototype definition can be found in (5).
Due to the independence between the main and wiretap links, the random variables γ ^{(n)} and ρ are also independent. Along with (8), (9), (10) and (11), the secrecy outage probability can be derived as follows:
where
The function U(k,θ) has the following definition,
The integral result of this function can be looked up from ([51], Eq. (3.353.2)),
Here, Ei(x) is the exponential integral function with the definition
By observing (16), it is easy to find that U(k,θ) is a decreasing function of θ and/or k. Particularly, U(k,θ)→0 as k or θ→∞. Since the term I _{2} in (13) is a nonnegative linear combination of the decreasing function U(k,θ), it decreases with n or R _{ s } increasing by fixing the other arguments. So does the term I _{1}. Moreover, the item I _{1} has an exponential decay with either n or R _{ s } increasing.
Thereby, we can attain that \(P_{\text {so}}^{(n)}\left (R_{s}\right)\) is an increasing function of n and/or R _{ s }.
In the pathloss model, we realize \(\lambda \propto d_{b}^{\alpha }\) and \(\mu \propto d_{e}^{\alpha }\) (here, suppose N _{ b }=N _{ e }), where d _{ b } denotes the straightline distance between an individual user and Bob, d _{ e } is each user’s distance to Eve, and α is the pathloss exponent. μ can then be transformed into the form of (d _{ e }/d _{ b })^{α} λ. Substituting it into the corresponding expressions in (14) and (15), we can obtain the result in (13) from the perspective of locations. On the other hand, such a form of expression makes it possible for Bob to reversely derive the insecure range of any individual user for a certain secrecy qualityofservice (QoS) (secrecy outage probability under a predefined secrecy rate). Concretely, for a specified SIC order as well as a certain secrecy QoS, the distance d _{ e } is available via numerical rootfinding, and it is exactly the radius of an insecure range centered on that user.
Accordingly, the secrecy transmission probability can be deduced,
which is, obviously, a decreasing function of n and/or R _{ s }.
Effective secrecy throughput
In accordance with [6], the EST is the product of a secrecy rate R _{ s } and the corresponding secrecy transmission probability Pst(n)(R _{ s }),
Since Pst(n)(R _{ s }) is a decreasing function of n, T ^{(n)}(R _{ s }) declines with an increase in n. Moreover, Pst(n)(R _{ s }) decreases exponentially with R _{ s } increasing. Thus, multiplying it with R _{ s } makes the product increase at first and then decrease quickly, which denotes the existence of the maximum EST over R _{ s }.
The maximum EST is expressed as
Apparently, the optimal secrecy rate \(R_{s}^{*(n)}\) to achieve the maximum EST is not identical for different numbers of cochannel interferers n. Interestingly, \(R_{s}^{*(n)}\) with a small value of n is higher than that with a big one, because Pst(n)(R _{ s }) under a small value of n decays more slowly over R _{ s }. We can view such a phenomenon more clearly in Fig. 2.
For the pathloss model, it is possible for each of the users to calculate its optimal secrecy rate with the locations of Bob and Eve. Yet, it is usually difficult for each user to obtain Eve’s location. In practice, the estimation of the optimal secrecy rate for each user can be done by Bob instead, and each user tunes to its optimal secrecy rate to gain the maximum EST with an instruction from Bob.
More numerical details for the EST and the estimations of optimal secrecy rates will be examined later in Section 5.
Other secrecy performance metrics
One of the most important metrics is the positive secrecy rate probability (denoted as Pps(n)) which is equivalent to the probability of γ ^{(n)}>ρ. It can be easily obtained, \(P_{\text {ps}}^{(n)}=P_{{\text {st}}}^{(n)}\left (0 \right)\).
Another interesting performance measure is the εoutage secrecy rate which is defined as the highest secrecy rate when the secrecy outage probability is not greater than ε. It can be formulated by
Although we cannot achieve the closedform expression of the εoutage secrecy rate due to the complexity of (13), it is possible to obtain the result by numerical rootfinding.
Asymptotic behaviors
We proceed with the asymptotic behaviors of the secrecy performance for an extreme value of K or μ while limiting the other parameters.
Observing (17), an interesting equation can be obtained,
By applying (23), we rewrite (13) as
where,
Obviously, (24) is a decreasing function of K and/or μ.
Note that Φ→0, as K or μ→∞. Thus, we can obtain the following asymptotic expression of the secrecy outage probability,
which is completely reduced to the transmission outage probability.
Accordingly, the asymptotic expression of the EST can be formulated as
Further, we get the asymptotic expression of the maximum EST,
where \(R_{s}^{*(n)}\) is the optimal secrecy rate to achieve the maximum value of this asymptotic EST, and it should not be greater than the related main capacity.
By observing (27), we note the EST declines dramatically with the weight of \(2^{nR_{s}}\phantom {\dot {i}\!}\). For n=3 and R _{ s }=1 bps/Hz, \({\lim }_{K or \mu \rightarrow {\infty }}T^{(3)}\left (1\right)\) is only about 1/8 of that for the best case (n=0). In other words, the EST with n=0 overwhelms the other cases.
Remark 1
As the SIC order in this section is assumed to be random, the individual secrecy performance obtained above is an average result.
Remark 2
Although it is predictable that a decrease in n and/or an increase in K improve the individual secrecy performance in this SICbased homogeneous MACWT network, the closedform expressions clearly show how the SIC order and the multiuser diversity impact the secrecy performance. Moreover, it provides a foundation for understanding the SIC order scheduling schemes proposed in the upcoming section.
SIC order scheduling schemes
As the order of SIC affects the secrecy performance significantly, we further explore SIC order scheduling policies from the perspective of Bob. Three SIC order scheduling schemes are studied in this section. First, we consider a conventional roundrobin scheduling scheme, which is also used as a benchmark. Next, a suboptimal scheduling scheme is proposed, which schedules on the basis of users’ main channel conditions. Finally, we study an optimal scheduling scheme, which is based on achievable individual secrecy rates. We refer to all these three schemes as roundrobin scheme, suboptimal scheme, and optimal scheme for short, respectively. It is essential to clarify that the scheme name optimal scheme does not mean the best scheme of all (including not mentioned in this work) but only signifies superiority over the other two schemes.
Roundrobin scheme
In this scheme, all the K users take the same chance for all possible SIC orders, which brings extreme fairness for each user. Specifically, there are exactly K! corner points in the Kuser capacity region with SIC decoding, each one corresponding to an SIC order among the users ([20], Chapter 6.1.4). Bob takes turns to access each of the K! corner points for an equal period of time (i.e., \(\frac {1}{K!}\) of scheduling duration), which makes every user experience each of the total K! SIC orders for equal time. It seems impossible for Bob to take all the turns around within one time slot, especially with a large K. Such a problem can be solved by changing the scheduling duration from one time slot to an appropriate number of time slots, e.g., K! time slots, one time slot for each corner point.
As is known to all, a secrecy outage event occurs, when an achievable secrecy rate falls below a predefined secrecy rate R _{ s }. Nevertheless, the secrecy outage probability on each corner point is not necessarily the same. In fact, the secrecy outage probabilities on most of the corner points are different. Thus, an average secrecy outage probability is usually used as a performance metric in this case.
A straightforward way to get the average secrecy outage probability of an individual user for a predefined secrecy rate R _{ s } is to calculate the secrecy outage probability on each corner point separately, add up all the results, and average over the total number of corner points K!. As the system in this work is homogeneous, there exactly exist (K−1)! corner points for an individual user with n cochannel interferers (i.e., the total number of SIC orders in which the specified user is decoded at (n+1)^{th} from the end). Therefore, the average secrecy outage probability of an individual user can be formulated as
Subsequently, the average individual EST can be easily obtained, the maximum expression of which is denoted as
However, the maximum value acquired by (30) is suboptimal, as the optimal secrecy rate \(R_{s}^{*}\) for the above maximum value is fixed for all possible n. The optimal maximum value can be obtained by taking n into account for each optimal secrecy rate, just as in Subsection 3.2,
where \(R_{s}^{*(n)}\) and \(T_{\text {max}}^{(n)}\left (R_{s}^{*(n)} \right)\) is given in (21).
Accordingly, the maximum sumEST in this scheme can be achieved by multiplying the maximum average EST with K,
which is equivalent to the sum of the maximum EST of an individual user over all possible n.
Although the roundrobin scheme is a good way for fairness, it is not an optimal option for achieving the maximum sumEST from Bob’s point of view. We next introduce the other two schemes, i.e., the suboptimal scheme and the optimal scheme, which achieve more maximum sumEST. The former needs no CSI of Eve for Bob, while the latter requires Eve’s CSI. Although the optimal scheme is usually impractical, we still study it for the purpose of comparisons.
Suboptimal scheme
The suboptimal scheme is based on instantaneous main channel gains in a certain time slot. To be concrete, the SIC order is sorted by Bob according to each user’s instantaneous channel gain from the lowest to the highest. That is, the user with the lowest instantaneous channel gain is decoded at first (no interference cancellation), while the user with the highest gain is decoded at last (no cochannel interference).
The reason why Bob sorts the SIC order that way (from the lowest gain to the highest) is that the EST of an individual user with the best case (decoded at last, i.e., n=0, we call such EST as bestcaseEST later) overwhelms the other cases for the same SNR. Meanwhile, the EST increases with an increase in SNR. Therefore, Bob allocates the best case to the user with the best main channel condition (i.e., achieving the highest SNR for the same transmit power), expecting to achieve more maximum sumEST.
Although it is difficult to derive the closedform expressions of the EST for all possible cases (from the best to the worst case) in this scheme, the closedform expression of one special case, i.e., the best case for the user with the best channel condition, can be derived,^{3}
where
The process of the derivation can be found in Appendix B.
Note that \(\Theta _{1}^{\prime }\left (1 \right) = \Theta _{1}\left (0 \right)\) and \(\Theta _{2}^{\prime }\left (1 \right) = \Theta _{2}\left (0 \right)\). We transform (33) into
where
We can acquire that the first term in (36) has a Kfold gain over T ^{(0)}(R _{ s }), which means the multiuser diversity gain is achieved significantly in this scheme.
Since the maximum bestcaseEST predominates the maximum sumEST for both the roundrobin and suboptimal schemes, it is illustrative to contrast the performance of these two schemes with respect to the maximum bestcaseEST instead of the maximum sumEST. According to (36), \(T_{{\text {max}}}^{\dagger (0)}\left (R_{s}^{*(0)}\right)\) is significantly greater than \(T_{{\text {max}}}^{(0)}\left (R_{s}^{*(0)}\right)\). As such, we can infer that the performance of the suboptimal scheme outperforms that of the roundrobin scheme significantly with regard to the maximum sumEST. More numerical analysis will be continued in Section 5.
Let us further explore the asymptotic expression of T ^{†(0)}(R _{ s }), as K→∞.
By applying (23) to (34) and (35), we obtain,
which approaches to 1, as K→∞.
Then, the asymptotic expression of (33) can be derived as,
Subject to the constraint of the main capacities, the maximum value of \({\lim }_{K\rightarrow {\infty }}T^{\dagger (0)}\left (R_{s} \right)\) is given by,
Optimal scheme
The optimal scheme schedules the SIC order based on achievable individual secrecy rates, which implies a need for Eve’s CSI. Concretely, Bob sorts the SIC order according to each user’s instantaneous achievable secrecy rate (n=0) from the lowest to the highest, i.e., the user with the highest achievable secrecy rate is decoded at last. For the same reason that the bestcaseEST predominates the sumEST for this scheme, we compare the performance of this scheme with the above two schemes in terms of bestcaseEST for simplicity. Before achieving the closedform expression of the bestcaseEST of the user with the highest achievable secrecy rate, we first derive the corresponding secrecy outage probability, which is formulated as^{4}
where \(C_{s,i}^{(0)}\) denotes the i ^{th} user’s achievable secrecy rate with no cochannel interference.
Subsequently, the bestcaseEST for this scheme can be expressed as
which is obviously bigger than T ^{(0)}(R _{ s }) by observing (20). Next, we try to prove that T ^{‡(0)}(R _{ s }) is also not less than T ^{†(0)}(R _{ s }).
Proof
We first rewrite the expression of Pso‡(0)(R _{ s }) as
Due to the Jensen’s inequality and the convexity of (·)^{K}, \( \left [\mathbf {E}\left (1e^{\lambda \left (2^{R_{s}}\rho +2^{R_{s}}1\right)} \right)\right ]^{K} \leq \mathbf {E} \left (\left (1e^{\lambda \left (2^{R_{s}}\rho +2^{R_{s}}1\right)} \right)^{K} \right)\) \(\overset {(a)}{=}P_{{\text {so}}}^{\dagger (0)}(R_{s})\), where (a) can be obtained from (53) in Appendix A. We then get T ^{‡(0)}(R _{ s })≥T ^{†(0)}(R _{ s }), which completes the proof. □
Nevertheless, T ^{†(0)}(R _{ s }) is very close to T ^{‡(0)}(R _{ s }) even with moderate values of SNR and K. In other words, the suboptimal scheme is close to the optimal scheme with respect to the EST. It is worth explaining why the performance (in terms of EST) gap between the practical suboptimal scheme and the ideal optimal scheme is not so much significant.
As mentioned previously, the suboptimal scheme sorts the SIC order by users’ channel gains (equivalently, main capacities) from the lowest to the highest, while the optimal scheme schedules via users’ achievable secrecy rates. In light of (5), the user with the highest achievable secrecy rate also has an appreciably high probability of being with the highest main capacity. Similarly, the user with the lowest achievable secrecy rate has an appreciably high probability of owning the lowest main capacity. It is applicable for the other cases between the highest achievable secrecy rate and the lowest. Therefore, we can achieve very similar performance statistically just by using users’ channel gains instead of achievable secrecy rates for scheduling. In other words, we can obtain the conclusion that the suboptimal scheme is highly close to the optimal scheme with respect to the EST. Such a conclusion will be confirmed once more in Section 5.
Numerical results and discussions
In this section, numerical results are presented to further examine and verify the analytical results mentioned above. On account of the consistency of the secrecy outage probability and the effective secrecy throughput as well as the limited space, we only demonstrate the numerical results in terms of effective secrecy throughput. Additionally, the performance comparison of these three SIC order scheduling schemes regarding the maximum sumEST is examined as well. We make an additional discussion to end this section.
By setting the average received SNR of an individual user at Bob, i.e., \(\overline {\xi }\), as the benchmark, the average received SNR at Eve is specified as \(\overline {\eta } = \beta \overline {\xi }\), i.e., λ/μ=β. Hereinafter, the “SNR” refers in particular to \(\overline {\xi }\). We assume the default value of K is 10.
Secrecy performance
Effective secrecy throughput
Figure 2 depicts EST curves versus R _{ s } for different values of n and SNR. Here, β=1 is supposed. Note that the curve increases first and then decreases for each value of n and SNR, which confirms the inference in Subsection 3.2 that there exists a maximum value for each EST curve, namely, \(T_{{\text {max}}}^{(n)}\left (R_{s}^{*(n)} \right)\). Another verification is also done that the optimal secrecy rate \(R_{s}^{*(n)}\) to achieve the maximum EST for different numbers of cochannel interferers is different. The lesser the n is, the higher the \(R_{s}^{*(n)}\) becomes. Observing the comparisons from Fig. 2 a to c, it is easy to find T ^{(n)}(R _{ s }) for each specific n increases when the SNR increases. Interestingly, the gap between \(T_{{\text {max}}}^{(0)} \left (R_{s}^{*(0)} \right)\) and any other \(T_{{\text {max}}}^{(n)}\left (R_{s}^{*(n)} \right)\) (where n is not equal to 0) becomes bigger and bigger with an increase in SNR. Also, it confirms that \(T_{{\text {max}}}^{(0)}\left (R_{s}^{*(0)} \right)\) overwhelms the maximum EST for other cases. This is why we make the performance comparisons of the scheduling schemes by mainly evaluating T ^{(0)}(R _{ s }), T ^{†(0)}(R _{ s }), and T ^{‡(0)}(R _{ s }).
Optimal secrecy rate estimation
We here demonstrate how Bob estimates the optimal secrecy rate for each user from a viewpoint of locations. Since each user’s location is available to Bob, the distance between any individual user to Bob can be acquired by Bob itself. Likewise, each user’s distance to Eve can also be calculated by Bob, as long as Bob has the information of Eve’s location. Obviously, it is much more feasible for Bob to detect Eve’s location than knowing its CSI.
To be more specific, we take a simple example. Suppose Bob is 200 km right above the users and Eve is 132 km away from Bob in the horizontal direction. Hence, d _{ b }=200 km, d _{ e }≈240 km and d _{ e }/d _{ b }≈1.2. We further assume the pathloss exponent α=2.5, and the SNR perceived at Bob is 3 dB. Then, the maximum EST and the corresponding optimal secrecy rate for each n can be estimated via numerical rootfinding. The results are listed in Table 1. We can also obtain the results for other values of distance ratio. The complete relationships between distance ratios and EST curves are demonstrated in Fig. 3.
We note that the distance ratio does not affect the EST significantly. When Eve is extremely far away, with the limitation of the main capacities, the EST is still limited. Otherwise, when Eve is very close to the users, the EST is also not reduced too much. That is because the cochannel interference at Eve is increased as well when the SNR at Eve rises up.
Comparison of scheduling schemes
Figure 4 illustrates the bestcaseEST curves for these three SIC order scheduling schemes, i.e., roundrobin scheme, suboptimal scheme and optimal scheme, for three different cases of SNR, with an assumption of β=1. The bestcaseEST for the roundrobin scheme (T ^{(0)}(R _{ s }), green curves) is much lesser than that for the suboptimal (red curves) or optimal (blue curves) scheme. The gaps of the maximum bestcaseEST between the roundrobin scheme and the other two schemes enlarge when the SNR increases. In contrast, the bestcaseEST for the suboptimal scheme (T ^{†(0)}(R _{ s })) is very close to that for the optimal scheme (T ^{‡(0)}(R _{ s })), which shows the more practical suboptimal scheme is a good option to replace the ideal but impractical optimal scheme.
In Fig. 5, it shows that T ^{†(0)}(R _{ s }) (blue linemarker curves) and T ^{‡(0)}(R _{ s }) (red linemarker curves) increases significantly with K increasing while T ^{(0)}(R _{ s }) (black curves) does not increase much. Such a phenomenon shows that the multiuser diversity impacts the roundrobin scheme very little, while the other two schemes achieve significant multiuser diversity gains. Similarly, the multiuser diversity gain for T ^{†(0)}(R _{ s }) is very close to that for T ^{‡(0)}(R _{ s }). Moreover, the gaps between T ^{†(0)}(R _{ s }) or T ^{‡(0)}(R _{ s }) and T ^{(0)}(R _{ s }) expand drastically with K increasing.
In order to compare the performance of the scheduling schemes in terms of the maximum sumEST numerically, we first calculate \(T_{{\text {max}}}^{(n)}(R_{s}^{*(n)})\) for all n with four different cases of SNR by numerical rootfinding. The results are listed in Table 2. Here, β=1. Observing the data, it confirms once more that the maximum sumEST is dominated by the maximum bestcaseEST. Similarly, the maximum values of bestcaseEST for the other two schemes, Tmax†(0) and Tmax‡(0), are also calculated by numerical rootfinding and listed in the righthand columns of Table 3. From the table, we find Tmax†(0) or Tmax‡(0) is even larger than the maximum sumEST for the roundrobin scheme (listed in the second column of Table 3) except the case of SNR = − 3 dB for Tmax†(0), where Tmax†(0) is only a little less. Since the expressions of the maximum sumEST for the suboptimal and optimal schemes are \(\sum _{n=0}^{K1}T_{{\text {max}}}^{\dagger (n)}\) and \(\sum _{n=0}^{K1}T_{{\text {max}}}^{\ddagger (n)}\), respectively, it obviously verify the maximum sumEST for the suboptimal or optimal scheme is much larger than that for the roundrobin scheme. In other words, the suboptimal or optimal scheme is much better than the roundrobin scheme from the perspective of the maximum sumEST in this model of MACWT.
To further evaluate the values of Tmax†(n) and Tmax‡(n) for the other cases (i.e., n=1,…,K), we perform simulations consisting of 2000 independent trials to obtain the average results of the EST curves for both schemes. Figure 6 demonstrates the simulation results (the cases for n>2 are ignored, due to their low values for the curves) on basis of SNR = 3 dB. From Fig. 6, we observe the simulation curves for T ^{†(0)}(R _{ s }) (black dashdot lines) and T ^{‡(0)}(R _{ s }) (red dashed lines) almost converge to those from the analytical results (blue circles for the suboptimal scheme and magenta diamonds for the optimal scheme), which shows the simulation results are reliable. Meanwhile, the simulation curves for both the suboptimal (black dashdot lines) and optimal (red dashed lines) schemes are highly close to each other for n>0, just like the case of n=0. Although, for a big value of n, the maximum values of EST for these two schemes are poorer than the roundrobin scheme, by observing the simulation results, Tmax†(1) and Tmax‡(1) are still superior to Tmax(1), and the maximum EST of either scheme for n = 2 is not too much less than that for the roundrobin scheme.
To demonstrate the impacts of the multiuser diversity on T ^{†(n)} and T ^{‡(n)} for the other cases (i.e., n=1,…,K), we perform the simulation once more and achieve the results as plotted in Fig. 7 (partly, black curves for the suboptimal scheme and red curves for the optimal scheme), which shows the multiuser diversity gain for T ^{†(n)} is also very close to that for T ^{‡(n)} for n=1,…,K.
Discussions
Although the performance of the suboptimal or optimal scheme precedes the roundrobin scheme in achieving the maximum sumEST for Bob, the values of EST for the users with bad channels are very low, which makes them be overheard easily. It seems unfair to these users. On the other hand, the absolutely fair roundrobin is full of complexity in computing. Is there a scheduling scheme that can solve such a dilemma? It is easy to come up with a policy reversing the SIC order in the suboptimal scheme, i.e., sorting the SIC order from the highest channel gain to the lowest. We just call it alternative scheme. It is also difficult to derive the closedform expressions of the EST for all cases of n for this scheme. Nevertheless, their simulation results can be obtained and demonstrated in Fig. 8, with the same simulation conditions as Fig. 6. We note, although the problem of fairness is improved, the performance is very bad such that not only the values of EST for the users with bad channel conditions are not improved too much but also the values of EST for the betterconditioned users are harmed significantly. The maximum EST for n=0 is only about 0.06 bps/Hz, which indicates a good SIC order to a poorconditioned user cannot improve its performance too much. On the other hand, the best channel condition in this scheme does not bring to the user high enough maximum EST (see curve with n = 9), which is less than that for n = 4, as its SIC order (decoded firstly) retards the performance. We also note the highest maximum EST occurs at n = 4 with a poor value less than 0.18 bps/Hz. All in all, the secrecy performance regarding the maximum sumEST for this scheme is significantly worse than the other three schemes mentioned above.
Therefore, in this model of MACWT, to promote the security of the network, the users with bad conditions can play a role of jammers [21]. When their channel conditions improve, they can change their role of the jammers into the normal users, while other badconditioned users switch to the role of jammers.
Overall, the numerical results and observations in this section are consistent with our expectations.
Conclusions
In this work, we considered the quasistatic Rayleigh fading homogeneous MACWT with SIC decoding at the legitimate satellite and investigated the individual secrecy performance under an arbitrary SIC order by deriving the closedform expressions of the secrecy outage probability and the effective secrecy throughput. We provided valuable insights into the impacts of the SIC order and the multiuser diversity on the secrecy performance. Three SIC order scheduling schemes were studied such that the suboptimal scheme and the optimal scheme have better performance in achieving the maximum sumEST and the multiuser diversity gain while the roundrobin scheme is a good option for fairness. In addition, the suboptimal scheme achieves the performance highly close to the ideal but usually impractical optimal scheme in terms of the EST and the multiuser diversity gain. We verified our analysis with the aid of numerical results.
Endnotes
^{1} The abbreviation of multiple access wiretap channel is a bit of confusion. It seems MAWC is more appropriate, yet, MACWT is more frequently used in the existing literature.
^{2} The satellite channel model varies from different environments, which is beyond the scope of this paper. We just simplify it to be Rayleigh fading the same as some other literature, e.g., [52, 53] concerning low earth orbit (LEO) satellite communications.
^{3} The superscript of † is used to specify corresponding notations for this scheme.
^{4} The superscript of ‡ is used to differ corresponding notations from the other two schemes.
Appendix A
Assume a random variable X∼Exp(λ _{0}), and a random variable \(Y_{n}=\sum _{i=1}^{n}\xi _{i}\), where ξ _{1},ξ _{2},…,ξ _{ n } are independently and exponentially distributed, i.e., ξ _{ i }∼Exp(λ _{ i }) (i=1,…,n) and λ _{ i }≠λ _{ j },∀i≠j. Further assume X and Y _{ n } are independent.
Thus, the CDF of a random variable \(Z_{n}=\frac {X}{1+Y_{n}}\) can be expressed as
where,
The PDF of Y _{ n } is derived in [54],
where
Substitute (47) into L _{1}, and obtain,
where π _{ i }=λ _{ i }+λ _{0} z, i=1,…,n, and,
We note that the function f _{2}(y) has the same structure as f _{1}(y). Hence, L _{2} is similar to (46), which is a PDF. In particular, when applying a zerotoinfinity integral of this PDF, we get L _{3}=1, simplifying (48) into
Furthermore, substitute (50) into (44), achieving,
Finally, substituting specific parameters into (51) obtains both (6) and (7).
By the way, during the derivation of the PDF of Y _{ n }, we assume that the mean of ξ _{ i } (i=1,…,n) in Y _{ n } is not equal to each other, that is, λ _{ i }≠λ _{ j },∀i≠j. Actually, we can loose the assumption to the general case that there are m of them with the same mean. We set \(Y_{n}=Y_{nm}^{\prime }+Y_{m}^{\prime \prime }\), where \(Y_{nm}^{\prime }\) denotes the sum of all n−m random variables with different means, while \(Y_{m}^{\prime \prime }\) denotes the sum of all m random variables with the same mean. The PDF of \(Y_{nm}^{\prime }\) can be obtained from (46), whereas \(Y_{m}^{\prime \prime }\sim \chi ^{2}_{2m}\). And the PDF of Y _{ n } can be obtained by the convolution of the PDF of \(Y_{nm}^{\prime }\) and that of \(Y_{m}^{\prime \prime }\),
As a result, substituting (52) into (44) yields the same result as (51).
Appendix B
According to the statistics of the variables ξ _{ i } (\(i\in \mathcal {K}\)) and ρ, we first derive the secrecy outage probability of the user who has the best channel condition and is decoded at last (no cochannel interference at all),
where \(\Theta _{1}^{\prime }\left (i \right)\) and \(\Theta _{2}^{\prime }\left (i \right)\) is given in (34) and (35), respectively. The step (a) is obtained by applying the Newton binomial theorem.
Therefore, the corresponding EST can be expressed as (33).
References
 1
AD Wyner, The wiretap channel. Bell Syst. Tech. J.54:, 1355–1387 (1975).
 2
I Csiszar, J Korner, Broadcast channels with confidential messages. IEEE Trans. Inf. Theory. 24(3), 339–348 (1978).
 3
SK LeungYanCheong, ME Hellman, The gaussian wiretap channel. IEEE Trans. Inf. Theory. IT24(4), 451–456 (1978).
 4
J Barros, MRD Rodrigues, in 2006 IEEE International Symposium on Information Theory. Secrecy capacity of wireless channels (IEEE, Seattle, 2006), pp. 356–360.
 5
PK Gopala, L Lai, HE Gamal, On the secrecy capacity of fading channels. IEEE Trans. Inf. Theory. 54(10), 4687–4698 (2008).
 6
N Yang, S Yan, J Yuan, R Malaney, I Land, Artificial noise: transmission optimization in multiinput singleoutput wiretap channels. IEEE Trans. Commun.63(5), 1771–1783 (2015).
 7
M Jilani, T Ohtsuki, Joint svdgsvd precoding technique and secrecy capacity lower bound for the mimo relay wiretap channel. EURASIP Journal on Wireless Communications and Networking. 2012(1), 361 (2012).
 8
F Zhu, F Gao, M Yao, Zeroforcing beamforming for physical layer security of energy harvesting wireless communications. EURASIP J. Wireless Commun. Netw.2015(1), 58 (2015).
 9
W Wu, B Wang, Robust secrecy beamforming for wireless information and power transfer in multiuser miso communication system. EURASIP J. Wireless Commun. Netw.2015(1), 161 (2015).
 10
C Wang, HM Wang, DWK Ng, XG Xia, C Liu, Joint beamforming and power allocation for secrecy in peertopeer relay networks. IEEE Trans. Wirel. Commun.14(6), 3280–3293 (2015).
 11
W Li, M Ghogho, B Chen, C Xiong, Secure communication via sending artificial noise by the receiver: Outage secrecy capacity/region analysis. IEEE Commun. Lett.16(10), 1628–1631 (2012).
 12
Z Lin, Y Cai, W Yang, X Xu, Opportunistic relaying and jamming with robust design in hybrid full/halfduplex relay system. EURASIP J. Wireless Commun. Netw.2016(1), 129 (2016).
 13
M Wiese, J Notzel, H Boche, A channel under simultaneous jamming and eavesdropping attack — correlated random coding capacities under strong secrecy criteria. IEEE Trans. Inf. Theory. 62(7), 3844–3862 (2016).
 14
Y Wang, Z Miao, R Sun, L Jiao, Distributed coalitional game for friendly jammer selection in ultradense networks. EURASIP J. Wireless Commun. Netw.2016(1), 211 (2016).
 15
Z Li, T Jing, X Cheng, Y Huo, W Zhou, D Chen, in 2015 IEEE International Conference on Communications (ICC). Cooperative jamming for secure communications in mimo cooperative cognitive radio networks (IEEE, London, 2015), pp. 7609–7614.
 16
B Li, Z Fei, Robust beamforming and cooperative jamming for secure transmission in df relay systems. EURASIP J. Wireless Commun. Netw.2016(1), 68 (2016).
 17
L Li, Y Xu, Z Chen, J Fang, Robust transmit design for secure af relay networks with imperfect csi. EURASIP J. Wireless Commun. Netw.2016:, 142 (2016).
 18
N Yang, M Elkashlan, TQ Duong, J Yuan, R Malaney, Optimal transmission with artificial noise in misome wiretap channels. IEEE Trans. Veh. Technol.65(4), 2170–2181 (2016).
 19
M Bloch, J Barros, Physicallayer security: from information theory to security engineering (Cambridge University Press, Cambridge, 2011).
 20
D Tse, P Viswanath, Fundamentals of wireless communication (Cambridge University Press, Cambridge, 2005).
 21
E Tekin, A Yener, The general gaussian multipleaccess and twoway wiretap channels: Achievable rates and cooperative jamming. IEEE Trans. Inf. Theory. 54(6), 2735–2751 (2008).
 22
E Tekin, A Yener, in Proc. Annual Allerton Conf. Secrecy sumrates for the multipleaccess wiretap channel with ergodic block fading (IEEE, Illinois, 2007), pp. 856–863.
 23
H ZivariFard, B Akhbari, M AhmadianAttari, MR Aref, Multiple access channel with common message and secrecy constraint. IET Commun.10(1), 98–110 (2016).
 24
H ZivariFard, B Akhbari, M AhmadianAttari, MR Aref, Imperfect and perfect secrecy in compound multiple access channel with confidential message. IEEE Trans. Inf. Forensics Secur.11(6), 1239–1251 (2016).
 25
J Xie, S Ulukus, in 2013 IEEE International Symposium on Information Theory. Secure degrees of freedom of the gaussian multiple access wiretap channel (IEEE, Istanbul, 2013), pp. 1337–1341.
 26
Y Fan, X Liao, Z Gao, L Sun, in 2016 IEEE International Conference on Communications Workshops (ICC). Physical layer security based on real interference alignment in kuser mimo y wiretap channels (IEEE, Kuala Lumpur, 2016), pp. 207–212.
 27
P Mukherjee, S Ulukus, in 2016 IEEE International Conference on Communications (ICC). Real interference alignment for the mimo multiple access wiretap channel (IEEE, Kuala Lumpur, 2016), pp. 1–6.
 28
RA Chou, MR Bloch, in 2014 IEEE Conference on Communications and Network Security. Uniform distributed source coding for the multiple access wiretap channel (IEEE, San Francisco, 2014), pp. 127–132.
 29
M Hajimomeni, H Aghaeinia, IM Kim, K Kim, Cooperative jamming polar codes for multipleaccess wiretap channels. IET Commun.10(4), 407–415 (2016).
 30
YP Wei, S Ulukus, Polar coding for the general wiretap channel with extensions to multiuser scenarios. IEEE J. Selected Areas Commun.34(2), 278–291 (2016).
 31
R Bassily, S Ulukus, Ergodic secret alignment. IEEE Trans. Inf. Theory. 58(3), 1594–1611 (2012).
 32
J Xie, S Ulukus, in 2013 Asilomar Conference on Signals, Systems and Computers. Secure degrees of freedom region of the gaussian multiple access wiretap channel (IEEE, Pacific Grove, 2013), pp. 293–297.
 33
P Mukherjee, S Ulukus, in 2015 IEEE International Symposium on Information Theory (ISIT). Secure degrees of freedom of the multiple access wiretap channel with no eavesdropper csi (IEEE, Hong Kong, 2015), pp. 2311–2315.
 34
P Mukherjee, S Ulukus, in 2015 49th Asilomar Conference on Signals, Systems and Computers. Secure degrees of freedom of the mimo multiple access wiretap channel (IEEE, Pacific Grove, 2015), pp. 554–558.
 35
H Jin, WY Shin, BC Jung, On the multiuser diversity with secrecy in uplink wiretap networks. IEEE Commun. Lett.17(9), 1778–1781 (2013).
 36
Y Zou, J Zhu, G Wang, H Shao, in 2014 IEEE/CIC International Conference on Communications in China (ICCC). Secrecy outage probability analysis of multiuser multieavesdropper wireless systems (IEEE, Shanghai, 2014), pp. 309–313.
 37
Y Jiang, J Zhu, Y Zou, in 2015 IEEE 14th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC). Secrecy outage analysis of multiuser cellular networks in the face of cochannel interference (IEEE, Beijing, 2015), pp. 441–446.
 38
Z Ni, J Fei, C Xing, D Zhao, N Wang, J Kuang, Secrecy balancing over twouser miso interference channels with rician fading. Int. J. Antennas Propag.2013(2013), 1–7.
 39
K Jiang, T Jing, Z Li, Y Huo, F Zhang, in INFOCOM. Analysis of secrecy performance in fading multiple access wiretap channel with sic receiver (IEEE, Atlanta, 2017), pp. 1602–1610.
 40
K Jiang, T Jing, F Zhang, Y Huo, Z Li, Zfsic based individual secrecy in simo multiple access wiretap channel. IEEE Access. 5:, 7244–7253 (2017).
 41
N Li, X Tao, Q Cui, J Xu, in 2015 IEEE Wireless Communications and Networking Conference (WCNC). Secure transmission with artificial noise in the multiuser downlink: Secrecy sumrate and optimal power allocation (IEEE, New Orleans, 2015), pp. 1416–1421.
 42
AB Reid, AJ Grant, PD Alexander, List detection for the ksymmetric multipleaccess channel. IEEE Trans. Inf. Theory. 51(8), 2930–2936 (2005).
 43
S Nitinawarat, in 2011 IEEE International Symposium on Information Theory Proceedings. On maximal error capacity regions of symmetric gaussian multipleaccess channels (IEEESt. Petersburg, 2011), pp. 2258–2262.
 44
RA Chou, MR Bloch, J Kliewer, in 2014 IEEE Information Theory Workshop (ITW 2014). Lowcomplexity channel resolvability codes for the symmetric multipleaccess channel (IEEE, Hobart, 2014), pp. 466–470.
 45
S Salehkalaibar, MR Aref, Lossy transmission of correlated sources over multipleaccess wiretap channels. IET Commun.9(6), 754–770 (2015).
 46
AS Bendary, YZ Mohasseb, H Dahshan, in 2016 IEEE Conference on Communications and Network Security (CNS). On the secure degrees of freedom for the kuser symmetric mimo wiretap mac channel (IEEE, Philadelphia, 2016), pp. 591–595.
 47
M Chraiti, A Ghrayeb, C Assi, in 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP). Achieving full secure degreesoffreedom for the miso wiretap channel with an unknown eavesdropper, (2016), pp. 997–1001.
 48
A Chaaban, Z Rezki, B Alomair, MS Alouini, in 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP). The miso wiretap channel with channel uncertainty: Asymptotic perspectives (IEEE, Washington, 2016), pp. 959–963.
 49
Z Rezki, A Chaaban, B Alomair, MS Alouini, in 2016 IEEE Global Communications Conference (GLOBECOM). The miso wiretap channel with noisy main channel estimation in the high power regime (IEEE, Washington, 2016), pp. 1–5.
 50
E Tekin, A Yener, The gaussian multiple access wiretap channel. IEEE Trans. Inf. Theory. 54(12), 5747–5755 (2008).
 51
IS Gradshteyn, IM Ryzhik, Table of integrals, series and products, 7th (Academic Press, New York, 2007).
 52
N Lebedev, JF Diouris, in Conference record of the thirtyfourth Asilomar conference on signals, systems and computers. Capacity study of a leo satellite link with multiple antennas user terminals (IEEE, Pacific Grove, 2000), pp. 511–515.
 53
LH Abderrahmane, DEB Hamed, M Benyettou, in 2008 IEEE Aerospace Conference. Design of an adaptive communication system for implementation on board a future algerian leo satellite (IEEE, Big Sky, 2008), pp. 1–5.
 54
S Shulong, On distribution of sums of n independent random variables subject to exponential distribution. J. Liaoning Normal Univ.13(4), 51–58 (1990).
Acknowledgements
This work was supported by the National Natural Science Foundation of China (Grant Nos. 61572070 and 61371069) and the Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20130009110015).
Author information
Affiliations
Contributions
KJ conceived the idea of the system model and designed the proposed schemes. FZ performed simulations of the proposed schemes. YH and ZL provided substantial comments on the work. TJ supported and supervised the research. All of the authors participated in the project, and they read and approved the final manuscript.
Corresponding author
Correspondence to Kaiwei Jiang.
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Jiang, K., Jing, T., Li, Z. et al. Individual secrecy of fading homogeneous multiple access wiretap channel with successive interference cancellation. J Wireless Com Network 2017, 165 (2017) doi:10.1186/s1363801709477
Received:
Accepted:
Published:
Keywords
 Multiple access wiretap channel
 Successive interference cancellation
 Secrecy performance
 Scheduling scheme