اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn Secrecy Rate of the Generalized Artificial-Noise Assisted Secure Beamforming for Wiretap Channels
92
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we consider the secure transmission in fast Rayleigh fading channels with full knowledge of the main channel and only the statistics of the eavesdroppers channel state information at the transmitter. For the multiple-input, single-output, single-antenna eavesdropper systems, we generalize Goel and Negis celebrated artificial-noise (AN) assisted beamforming, which just selects the directions to transmit AN heuristically. Our scheme may inject AN to the direction of the message, which outperforms Goel and Negis scheme where AN is only injected in the directions orthogonal to the main channel. The ergodic secrecy rate of the proposed AN scheme can be represented by a highly simplified power allocation problem. To attain it, we prove that the optimal transmission scheme for the message bearing signal is a beamformer, which is aligned to the direction of the legitimate channel. After characterizing the optimal eigenvectors of the covariance matrices of signal and AN, we also provide the necessary condition for transmitting AN in the main channel to be optimal. Since the resulting secrecy rate is a non-convex power allocation problem, we develop an algorithm to efficiently solve it. Simulation results show that our generalized AN scheme outperforms Goel and Negis, especially when the quality of legitimate channel is much worse than that of eavesdroppers. In particular, the regime with non-zero secrecy rate is enlarged, which can significantly improve the connectivity of the secure network when the proposed AN assisted beamforming is applied.
قيم البحث
اقرأ أيضاً
Reconfigurable intelligent surface (RIS) assisted radio is considered as an enabling technology with great potential for the sixth-generation (6G) wireless communications standard. The achievable secrecy rate (ASR) is one of the most fundamental metr
ics to evaluate the capability of facilitating secure communication for RIS-assisted systems. However, the definition of ASR is based on Shannons information theory, which generally requires long codewords and thus fails to quantify the secrecy of emerging delay-critical services. Motivated by this, in this paper we investigate the problem of maximizing the secrecy rate under a delay-limited quality-of-service (QoS) constraint, termed as the effective secrecy rate (ESR), for an RIS-assisted multiple-input single-output (MISO) wiretap channel subject to a transmit power constraint. We propose an iterative method to find a stationary solution to the formulated non-convex optimization problem using a block coordinate ascent method (BCAM), where both the beamforming vector at the transmitter as well as the phase shifts at the RIS are obtained in closed forms in each iteration. We also present a convergence proof, an efficient implementation, and the associated complexity analysis for the proposed method. Our numerical results demonstrate that the proposed optimization algorithm converges significantly faster that an existing solution. The simulation results also confirm that the secrecy rate performance of the system with stringent delay requirements reduce significantly compared to the system without any delay constraints, and that this reduction can be significantly mitigated by an appropriately placed large-size RIS.
Secrecy issues of free-space optical links realizing information theoretically secure communications as well as high transmission rates are discussed. We numerically study secrecy communication rates of optical wiretap channel based on on-off keying
modulation under typical conditions met in satellite-ground links. It is shown that under reasonable degraded conditions on a wiretapper, information theoretically secure communications should be possible in a much wider distance range than a range limit of quantum key distribution, enabling secure optical links between geostationary earth orbit satellites and ground stations with currently available technologies. We also provide the upper bounds on the decoding error probability and the leaked information to estimate a necessary code length for given required levels of performances. This result ensures that a reasonable length wiretap channel code for our proposed scheme must exist.
Recently, the secrecy capacity of the multi-antenna wiretap channel was characterized by Khisti and Wornell [1] using a Sato-like argument. This note presents an alternative characterization using a channel enhancement argument. This characterization
relies on an extremal entropy inequality recently proved in the context of multi-antenna broadcast channels, and is directly built on the physical intuition regarding to the optimal transmission strategy in this communication scenario.
This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure error-correcti
ng code has a nested code structure. Two secure nested coding schemes are studied for a type II Gaussian wiretap channel. The nesting is based on cosets of a good code sequence for the first scheme and on cosets of the dual of a good code sequence for the second scheme. In each case, the corresponding achievable rate-equivocation pair is derived based on the threshold behavior of good code sequences. The two secure coding schemes together establish an achievable rate-equivocation region, which almost covers the secrecy capacity-equivocation region in this case study. The proposed secure coding scheme is extended to a type II binary symmetric wiretap channel. A new achievable perfect secrecy rate, which improves upon the previously reported result by Thangaraj et al., is derived for this channel.
We investigate transmission optimization for intelligent reflecting surface (IRS) assisted multi-antenna systems from the physical-layer security perspective. The design goal is to maximize the system secrecy rate subject to the source transmit power
constraint and the unit modulus constraints imposed on phase shifts at the IRS. To solve this complicated non-convex problem, we develop an efficient alternating algorithm where the solutions to the transmit covariance of the source and the phase shift matrix of the IRS are achieved in closed form and semi-closed forms, respectively. The convergence of the proposed algorithm is guaranteed theoretically. Simulations results validate the performance advantage of the proposed optimized design.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
