اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMaximizing Secrecy Rate of an OFDM-based Multi-hop Underwater Acoustic Sensor Network
320
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we consider an eavesdropping attack on a multi-hop, UnderWater Acoustic Sensor Network (UWASN) that consists of $M+1$ underwater sensors which report their sensed data via Orthogonal Frequency Division Multiplexing (OFDM) scheme to a sink node on the water surface. Furthermore, due to the presence of a passive malicious node in nearby vicinity, the multi-hop UnderWater Acoustic (UWA) channel between a sensor node and the sink node is prone to eavesdropping attack on each hop. Therefore, the problem at hand is to do (helper/relay) node selection (for data forwarding onto the next hop) as well as power allocation (across the OFDM sub-carriers) in a way that the secrecy rate is maximized at each hop. To this end, this problem of Node Selection and Power Allocation (NSPA) is formulated as a mixed binary-integer optimization program, which is then optimally solved via decomposition approach, and by exploiting duality theory along with the Karush-Kuhn-Tucker conditions. We also provide a computationally-efficient, sub-optimal solution to the NSPA problem, where we reformulate it as a mixed-integer linear program and solve it via decomposition and geometric approach. Moreover, when the UWA channel is multipath (and not just line-of-sight), we investigate an additional, machine learning-based approach to solve the NSPA problem. Finally, we compute the computational complexity of all the three proposed schemes (optimal, sub-optimal, and learning-based), and do extensive simulations to compare their performance against each other and against the baseline schemes (which allocate equal power to all the sub-carriers and do depth-based node selection). In a nutshell, this work proposes various (optimal and sub-optimal) methods for providing information-theoretic security at the physical layer of the protocol stack through resource allocation.
قيم البحث
اقرأ أيضاً
Differential orthogonal frequency division multiplexing (OFDM) is practically attractive for underwater acoustic communications since it has the potential to obviate channel estimation. However, similar to coherent OFDM, it may suffer from severe int
er-carrier interference over time-varying channels. To alleviate the induced performance degradation, we adopt the newly-emerging partial FFT demodulation technique in this paper and propose an eigendecomposition-based algorithm to compute the combining weights. Compared to existing adaptive methods, the new algorithm can avoid error propagation and eliminate the need for parameter tuning. Moreover, it guarantees global optimality under the narrowband Doppler assumption, with the optimal weight vector of partial FFT demodulation achieved by the eigenvector associated with the smallest eigenvalue of the pilot detection error matrix. Finally, the algorithm can also be extended straightforwardly to perform subband-wise computation to counteract wideband Doppler effects.
This paper studies low-latency streaming codes for the multi-hop network. The source is transmitting a sequence of messages (streaming messages) to a destination through a chain of relays where each hop is subject to packet erasures. Every source mes
sage has to be recovered perfectly at the destination within a delay constraint of $T$ time slots. In any sliding window of $T+1$ time slots, we assume no more than $N_j$ erasures introduced by the $j$th hop channel. The capacity in case of a single relay (a three-node network) was derived by Fong [1], et al. While the converse derived for the three-node case can be extended to any number of nodes using a similar technique (analyzing the case where erasures on other links are consecutive), we demonstrate next that the achievable scheme, which suggested a clever symbol-wise decode and forward strategy, can not be straightforwardly extended without a loss in performance. The coding scheme for the three-node network, which was shown to achieve the upper bound, was ``state-independent (i.e., it does not depend on specific erasure pattern). While this is a very desirable property, in this paper, we suggest a ``state-dependent (i.e., a scheme which depends on specific erasure pattern) and show that it achieves the upper bound up to the size of an additional header. Since, as we show, the size of the header does not depend on the field size, the gap between the achievable rate and the upper bound decreases as the field size increases.
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.
In this paper, based on directional modulation (DM), robust beamforming matrix design for sum secrecy rate maximization is investigated in multi-user systems. The base station (BS) is assumed to have the imperfect knowledge of the direction angle tow
ard each eavesdropper, with the estimation error following the Von Mises distribution. To this end, a Von Mises distribution-Sum Secrecy Rate Maximization (VMD-SSRM) method is proposed to maximize the sum secrecy rate by employing semi-definite relaxation and first-order approximation based on Taylor expansion to solve the optimization problem. Then in order to optimize the sum secrecy rate in the case of the worst estimation error of direction angle toward each eavesdropper, we propose a maximum angle estimation error-SSRM (MAEE-SSRM) method. The optimization problem is constructed based on the upper and lower bounds of the estimated eavesdropping channel related coefficient and then solved by the change of the variable method. Simulation results show that our two proposed methods have better sum secrecy rate than zero-forcing (ZF) method and signal-to-leakage-and-noise ratio (SLNR) method. Furthermore, the sum secrecy rate performance of our VMD-SSRM method is better than that of our MAEE-SSRM method.
The extremely long underwater channel delay spread causes severe inter-symbol interference (ISI) for underwater acoustic communications. Passive time reversal processing (PTRP) can effectively reduce the channel time dispersion in a simple way via co
nvolving the received packet with a time reversed probe signal. However the probe signal itself may introduce extra noise and interference (self-correlation of the probe signal). In this paper, we propose a virtual time reversal processing (VTRP) for single input single output (SISO) Orthogonal Frequency Division Multiplexing (OFDM) systems. It convolves the received packet with the reversed estimated channel, instead of the probe signal to reduce the interference. Two sparse channel estimation methods, matching pursuit (MP), and basis pursuit de-noising (BPDN), are adopted to estimate the channel impulse response (CIR). We compare the performance of VTRP with the PTRP and without any time reversal processing through MATLAB simulations and the pool experiments. The results reveal that VTRP has outstanding performance over time-invariant channels.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
