arXiv subjects

M. Latva-aho

Publications and source records attributed to M. Latva-aho.

5 recordsLinked to original sources

arXiv2024

Malicious RIS Meets RSMA: Unveiling the Robustness of Rate Splitting to RIS-Induced Attacks

While the robustness of rate-splitting multiple access (RSMA) to imperfect channel state information (CSI) is well-documented, its susceptibility to attacks launched with malicious reconfigurable intelligent surfaces (RISs) remains unexplored. This paper fills this gap by investigating three potential RIS-induced attacks against RSMA in a multi-user multiple-input multiple-output (MIMO) network: random interference, aligned interference, and mitigation attack. The random interference attack employs random RIS coefficients to disrupt RSMA. The other two attacks are triggered by optimizing the RIS through weighted-sum strategies based on the projected gradient method. Simulation results reveal significant degradation caused by all the attacks under perfect CSI conditions. Remarkably, when imperfect CSI is considered, RSMA, owing to its flexible power allocation strategy designed to counter CSI-related interference, can be robust to the attacks even when the base station is blind to them. It is also shown that RSMA can significantly outperform conventional space-division multiple access (SDMA).

eess.SP↗

arXiv2021

Distributed UAV-enabled zero-forcing cooperative jamming scheme for safeguarding future wireless networks

In this work, we investigate the impact of two cooperative unmanned aerial vehicle (UAV)-based jammers on the secrecy performance of a ground wireless network in the presence of an eavesdropper. For that purpose, we investigate the secrecy-area related metrics, Jamming Coverage and Jamming Efficiency. Moreover, we propose a hybrid metric, the so-called Weighted Secrecy Coverage (WSC) and a virtual distributed multiple-input-multiple-output (MIMO)-based zero-forcing precoding scheme to avoid the jamming effects on the legitimate receiver. For evaluating these metrics, we derive a closed-form position-based metric, the secrecy improvement. Our mathematical derivations and comparative simulations show that the proposed zero-forcing scheme leads to an improvement on the secrecy performance in terms of the WSC, and provides conditions for improvement of Jamming Efficiency. They also show positioning trends on the UAVs over a fixed orbit around the legitimate transmitter as well as power allocation trends for optimal secrecy.

cs.IT↗

arXiv2021

Weighted Secrecy Coverage Analysis and the Impact of Friendly Jamming over UAV-Enabled Networks

In 5G and beyond networks, Unmanned Aerial Vehicles (UAV) are an attractive solution to enhance the secrecy of a wireless systems by exploiting their predominant LOS links and spacial manoeuvrability to introduce a friendly jamming. In this work, we investigate the impact of two cooperative UAV-based jammers on the secrecy performance of a ground wireless wiretap channel by considering secrecy-area related metrics, the jamming coverage and jamming efficiency. Moreover, we propose a hybrid metric, the so-called Weighted Secrecy Coverage (WSC) that can be used as a metric for gaining insights on the optimal deployments of the UAV jammers to provide the best exploration of jamming signals. For evaluating these metrics, we derive a closed-form position-based metric, the secrecy improvement, and propose an analogous computationally simpler metric. Our simulations show that a balanced power allocation between the two UAVs leads to the best performances, as well as a symmetrical positioning behind the line of sight between the legitimate transmitter and receiver. Moreover, there exist an optimal UAV height for the jammers. Finally, we propose a sub-optimal and simpler problem for the maximisation of the WSC.

cs.IT↗

arXiv2020

Positioning of Multiple Unmanned Aerial Vehicle Base Stations in future Wireless Network

Unmanned aerial vehicle (UAV) base stations (BSs) are reliable and efficient alternative to full fill the coverage and capacity requirements when the backbone network fails to provide such requirements due to disasters. In this paper, we consider optimal UAV-deployment problem in 3D space for a mmWave network. The objective is to deploy multiple aerial BSs simultaneously to completely serve the ground users. We develop a novel algorithm to find the feasible positions for a set of UAV-BSs from a predefined set of locations, subject to a signal-to-interference-plus-noise ratio (SINR) constraint of every associated user, UAV-BS's limited hovering altitude constraint and restricted operating zone constraint. We cast this 3D positioning problem as an l_0 minimization problem. This is a combinatorial, NP-hard problem. We approximate the l_0 minimization problem as non-combinatorial l_1-norm problem. Therefore, we provide a suboptimal algorithm to find a set of feasible locations for the UAV-BSs to operate. The analysis shows that the proposed algorithm achieves a set of the location to deploy multiple UVA-BSs simultaneously while satisfying the constraints.

eess.SP↗

arXiv2019

An Alternating Algorithm for Uplink Max-Min SINR in Cell-Free Massive MIMO with Local-MMSE Receiver

The problem of max-min signal-to-interference plus noise ratio (SINR) for uplink transmission of cell-free massive multiple-input multiple-output (MIMO) system is considered. We assume that the system is employed with local minimum mean square error (L-MMSE) combining. The objective is to preserve user fairness by solving max-min SINR optimization problem, by optimizing transmit power of each user equipment (UE) and weighting coefficients at central processing unit (CPU), subject to transmit power constraints of UEs. This problem is not jointly convex. Hence, we decompose original problem into two subproblems, particularly for optimizing power allocation and receiver weighting coefficients. Then, we propose an alternating algorithm to solve these two subproblems. The weighting coefficient subproblem is formulated as a generalized eigenvalue problem while power allocation subproblem is approximated as geometric programming (GP). We empirically show that the proposed algorithm achieves higher min-user uplink spectral efficiency (SE) over existing fixed power scheme which is not optimized with respect to the transmit power. Moreover, the convergence of the proposed algorithm is numerically illustrated.

cs.IT↗