Satellite communication (SatCom) has attracted much attention due to its inherent characteristics. Security issues have gained severe concerns in SatCom since it is susceptible to be illegally eavesdropped by malicious ground stations within large-scale wireless coverage. In this paper, we investigate the physical layer security of a multiuser SatCom system in the presence of multiple eavesdroppers. Particularly, we propose a threshold-based scheduling scheme, where the geographically clustered eavesdroppers with both the colluded and collaborated eavesdropping scenarios are assumed. Specifically, closed-form expression for the secrecy outage probability (SOP) is derived for the passive eavesdropping scenario when the channel state information (CSI) of the eavesdroppers is unavailable. Moreover, we obtain a closed-form expression for the average secrecy capacity (ASC) of the considered system under the proposed user scheduling scheme. In order to get further insights of the proposed scheduling scheme at high signal-to-noise ratios (SNRs), the asymptotic analysis for the SOP and ASC is also demonstrated. Moreover, the reduced percentage with respect to number of user examination is also given, which validates the simplicity and efficiency of our proposed scheme compared to the traditional approaches. Numerical results deduce that with the proposed scheme, a comparable system performance with regard to the maximal selection (MS) scheme can be achieved.

We investigate the secrecy performance of dual-hop amplify-and-forward multi-antenna relaying systems over Rayleigh fading channels, considering the direct link between the source and the destination. In order to exploit the available direct link and the multiple antennas for secrecy improvement, different linear processing schemes at the relay and different diversity combining techniques at the destination are proposed, namely: 1) zero-forcing/maximal ratio combining (ZF/MRC); 2) ZF/selection combining (ZF/SC); 3) maximal ratio transmission/MRC (MRT/MRC); and 4) MRT/SC. For all these schemes, we present new closed-form approximations for the secrecy outage probability. Moreover, we investigate a benchmark scheme, i.e., cooperative jamming/ZF (CJ/ZF), where the secrecy outage probability is obtained in exact closed-form. In addition, we present asymptotic secrecy outage expressions for all the proposed schemes in the high signal-to-noise ratio (SNR) regime, in order to characterize key design parameters, such as secrecy diversity order and secrecy array gain. The outcomes of this paper can be summarized as follows: 1) MRT/MRC and MRT/SC achieve a full diversity order of M + 1, ZF/MRC and ZF/SC achieve a diversity order of M, while CJ/ZF only achieves unit diversity order, where M is the number of antennas at the relay; 2) ZF/MRC (ZF/SC) outperforms the corresponding MRT/MRC(MRT/SC) in the low SNR regime, while becomes inferior to the corresponding MRT/MRC (MRT/SC) in the high SNR; and 3) all the proposed schemes tend to outperform the CJ/ZF with moderate number of antennas, and linear processing schemes with MRC attain better performance than those with SC.

In this paper, we consider the secure multi-user downlink communication scheme against eavesdroppers in Integrated Sensing and Communication (ISAC) systems, where the ISAC base station (BS) transmits ISAC waveform to serve communication users and sense targets, and artificial noise (AN) is employed to guarantee the transmission secrecy. In particular, we study the robust ISAC beamforming design under the assumption of imperfect legitimate users’ and eavesdroppers’ channel state information (CSI). Specifically, we aim to minimize the squared error between designed and desired beampatterns under the probabilistic outage constraints concerning the secrecy performance as well as power budget constraint. To deal with the non-convex problem, we utilize the semidefinite relaxation (SDR) technique and Bernstein-type inequality to convert the problem to a tractable form. Numerical results show that the proposed robust beamforming design algorithm is able to approach the performance under perfect CSI, and illustrates the trade-off between sensing and secrecy performances.

Recently, non-orthogonal multiple access (NOMA)-enabled cognitive satellite-unmanned aerial vehicle (UAV)-terrestrial networks have attracted extensive attention for the advantages of enhancing spectrum efficiency and coping with the exponential growth of access users. In this paper, we propose a joint subchannel assignment and power allocation algorithm for NOMA-enabled cognitive satellite-UAV-terrestrial networks to further enhance the transmission performance, where imperfect channel state information is taken into consideration. Specifically, we formulate a mixed integer non-linear programming resource allocation problem to optimize the sum rate of the secondary network, in which the demands of the interference temperature constraint for primary users, the minimum transmission rate of each secondary user, the maximal transmitter power of the UAV, and the maximal number of secondary users that each subchannel can serve are satisfied. To tackle this tough non-convex problem, we first decouple it into two subproblems, namely, subchannel assignment and power allocation. Next, a heuristic subchannel assignment algorithm and a Taylor series and successive convex approximation-based power allocation algorithm are designed to solve the above subproblems, respectively. By alternately optimizing the sum rate of the secondary network, we finally solve the mixed integer non-linear programming optimization problem. Numerical results reveal the impacts of key parameters on system performance and indicate that our proposed scheme outperforms benchmarks in large-scale networks.

In this paper, we consider covert communications for bistatic backscatter systems, where a tag transmits information passively to a reader by reflecting incident carrier signals with artificial noise (AN) generated from a dedicated carrier emitter (CE) under the supervision of a warden. By exploiting the channel uncertainty introduced by CE, we analytically derive the warden's minimum sum of error probabilities to evaluate communication covertness. We find that communication covertness can be improved by reducing the tag's reflection coefficient, but is not affected by the CE's transmit power. Therefore, in order to achieve energy-efficient design, we optimize the tag's reflection coefficient to minimize the CE's transmit power under the constraints of communication covertness and reliability. Our analysis shows that the minimum CE's transmit power can be further reduced with a minor loss of the achievable covert rate.