arXiv subjects

Mathini Sellathurai

Publications and source records attributed to Mathini Sellathurai.

22 records · Page 2Linked to original sources

arXiv2019

UAV-Aided Jamming for Secure Ground Communication with Unknown Eavesdropper Location

This paper investigates unmanned aerial vehicle (UAV)-aided jamming technique for enabling physical layer keyless security in scenarios where the exact eavesdropper location is unknown. We assume that the unknown eavesdropper location is within an ellipse characterizing the coverage region of the transmitter. By sequentially optimizing the transmit power, the flight path of the UAV and its jamming power, we aim at maximizing the average secrecy rate with arbitrary eavesdropper location. Simulation results demonstrate that the optimal flight path obtains better secrecy rate performance compared to that using direct UAV flight path encasing the transmitter and the legitimate receiver. Most importantly, even with the unknown eavesdropper location, we obtained a secrecy rate that is comparable to a scenario when the eavesdropper's location is known. However, the average secrecy rate with the unknown eavesdropper location varies depending on the proximity of the eavesdropper to the known location of the transmitter. We also observe that due to the UAV-aided jamming, the average secrecy rate stabilizes at some point even though the average received envelope power of the eavesdropper increases. This essentially demonstrates the effectiveness of the proposed scheme.

cs.IT↗

arXiv2019

Low-Complexity Hybrid Beamforming for Massive MIMO Systems in Frequency-Selective Channels

Hybrid beamforming for frequency-selective channels is a challenging problem as the phase shifters provide the same phase shift to all of the subcarriers. The existing approaches solely rely on the channel's frequency response and the hybrid beamformers maximize the average spectral efficiency over the whole frequency band. Compared to state-of-the-art, we show that substantial sum-rate gains can be achieved, both for rich and sparse scattering channels, by jointly exploiting the frequency and time domain characteristics of the massive multiple-input multiple-output (MIMO) channels. In our proposed approach, the radio frequency (RF) beamformer coherently combines the received symbols in the time domain and, thus, it concentrates signal's power on a specific time sample. As a result, the RF beamformer flattens the frequency response of the "effective" transmission channel and reduces its root mean square delay spread. Then, a baseband combiner mitigates the residual interference in the frequency domain. We present the closed-form expressions of the proposed beamformer and its performance by leveraging the favorable propagation condition of massive MIMO channels and we prove that our proposed scheme can achieve the performance of fully-digital zero-forcing when number of employed phase shifter networks is twice the resolvable multipath components in the time domain.

cs.IT↗

arXiv2019

Online Learning Models for Content Popularity Prediction In Wireless Edge Caching

Caching popular contents in advance is an important technique to achieve the low latency requirement and to reduce the backhaul costs in future wireless communications. Considering a network with base stations distributed as a Poisson point process (PPP), optimal content placement caching probabilities are derived for known popularity profile, which is unknown in practice. In this paper, online prediction (OP) and online learning (OL) methods are presented based on popularity prediction model (PPM) and Grassmannian prediction model (GPM), to predict the content profile for future time slots for time-varying popularities. In OP, the problem of finding the coefficients is modeled as a constrained non-negative least squares (NNLS) problem which is solved with a modified NNLS algorithm. In addition, these two models are compared with log-request prediction model (RPM), information prediction model (IPM) and average success probability (ASP) based model. Next, in OL methods for the time-varying case, the cumulative mean squared error (MSE) is minimized and the MSE regret is analyzed for each of the models. Moreover, for quasi-time varying case where the popularity changes block-wise, KWIK (know what it knows) learning method is modified for these models to improve the prediction MSE and ASP performance. Simulation results show that for OP, PPM and GPM provides the best ASP among these models, concluding that minimum mean squared error based models do not necessarily result in optimal ASP. OL based models yield approximately similar ASP and MSE, while for quasi-time varying case, KWIK methods provide better performance, which has been verified with MovieLens dataset.

cs.IT↗

arXiv2017

Hybrid Beamforming with Reduced Number of Phase Shifters for Massive MIMO Systems

In this paper, two novel hybrid beamforming methods are proposed to reduce the cost and power consumption of hybrid beamformers with subconnected phase shifter network structure in massive multiple-input multiple-output (MIMO) systems. This is achieved by replacing some of the phase shifters with switches which, in general, are cheaper and have lower power consumption compared to phase shifters. The proposed methods and the closed-form expressions of their performance are derived according to the properties of the elements of the singular vectors of the channel matrix. In the first approach, it is shown that by combining the subconnected phase shifter network with a fully-connected switch architecture, the number of the phase shifters can be reduced up to 50\% while the spectral efficiency is preserved. Then, in order to simplify the structure of the switch network, the fully-connected switches is replaced by subconnected switch network, e.g. binary switches. The analytical and simulation results indicate that just by using 25% of phase shifters 90% spectral efficiency can be achieved. Finally, simulation results indicate that similar behavior is observed when the wireless channel is considered to be sparse or correlated.

cs.IT↗