arXiv subjects

Muhammad Mahboob Ur Rahman

Publications and source records attributed to Muhammad Mahboob Ur Rahman.

32 records · Page 2Linked to original sources

arXiv2023

On the Downlink Coverage Performance of RIS-Assisted THz Networks

This letter provides a stochastic geometry (SG)-based coverage probability (CP) analysis of an indoor terahertz (THz) downlink assisted by a single reconfigurable intelligent surface (RIS) panel. Specifically, multiple access points (AP) deployed on the ceiling of a hall (each equipped with multiple antennas) need to serve multiple user equipment (UE) nodes. Due to presence of blockages, a typical UE may either get served via a direct link, the RIS, or both links (the composite link). The locations of the APs and blockages are modelled as a Poisson point process (PPP) and SG framework is utilized to compute the CP, at a reference UE for all the three scenarios. Monte-Carlo simulation results validate our theoretical analysis.

eess.SP↗

arXiv2023

Pathloss-based non-Line-of-Sight Identification in an Indoor Environment: An Experimental Study

This paper reports the findings of an experimental study on the problem of line-of-sight (LOS)/non-line-of-sight (NLOS) classification in an indoor environment. Specifically, we deploy a pair of NI 2901 USRP software-defined radios (SDR) in a large hall. The transmit SDR emits an unmodulated tone of frequency 10 KHz, on a center frequency of 2.4 GHz, using three different signal-to-noise ratios (SNR). The receive SDR constructs a dataset of pathloss measurements from the received signal as it moves across 15 equi-spaced positions on a 1D grid (for both LOS and NLOS scenarios). We utilize our custom dataset to estimate the pathloss parameters (i.e., pathloss exponent) using the least-squares method, and later, utilize the parameterized pathloss model to construct a binary hypothesis test for NLOS identification. Further, noting that the pathloss measurements slightly deviate from Gaussian distribution, we feed our custom dataset to four machine learning (ML) algorithms, i.e., linear support vector machine (SVM) and radial basis function SVM (RBF-SVM), linear discriminant analysis (LDA), quadratic discriminant analysis (QDA), and logistic regression (LR). It turns out that the performance of the ML algorithms is only slightly superior to the Neyman-Pearson-based binary hypothesis test (BHT). That is, the RBF-SVM classifier (the best performing ML classifier) and the BHT achieve a maximum accuracy of 88.24% and 87.46% for low SNR, 83.91% and 81.21% for medium SNR, and 87.38% and 86.65% for high SNR.

eess.SP↗

arXiv2023

A Deep Learning & Fast Wavelet Transform-based Hybrid Approach for Denoising of PPG Signals

This letter presents a novel hybrid method that leverages deep learning to exploit the multi-resolution analysis capability of the wavelets, in order to denoise a photoplethysmography (PPG) signal. Under the proposed method, a noisy PPG sequence of length N is first decomposed into L detailed coefficients using the fast wavelet transform (FWT). Then, the clean PPG sequence is reconstructed as follows. A custom feedforward neural network (FFNN) provides the binary weights for each of the wavelet sub-signals outputted by the inverse-FWT block. This way, all those sub-signals which correspond to noise or artefacts are discarded during reconstruction. The FFNN is trained on the Beth Israel Deaconess Medical Center (BIDMC) dataset under the supervised learning framework, whereby we compute the mean squared-error (MSE) between the denoised sequence and the reference clean PPG signal, and compute the gradient of the MSE for the back-propagation. Numerical results show that the proposed method effectively denoises the corrupted PPG and video-PPG signal.

cs.IT↗

arXiv2022

Underwater and Air-Water Wireless Communication: State-of-the-art, Channel Characteristics, Security, and Open Problems

We present a first detailed survey on underwater and air-water (A-W) wireless communication networks (WCNs) that mainly focuses on the security challenges and the countermeasures proposed to date. For clarity of exposition, this survey paper is mainly divided into two parts. The first part of the paper focuses on the state-of-the-art underwater and A-W WCNs whereby we outline the benefits and drawbacks of the four promising underwater and A-W candidate technologies: radio frequency (RF), acoustic, optical and magnetic induction (MI), along with their channel characteristics. To this end, we also describe the indirect (relay-aided) and direct mechanisms for the A-W WCNs along with their channel characteristics. This sets the stage for the second part of the paper whereby we provide a thorough comparative discussion of a vast set of works that have reported the security breaches (as well as viable countermeasures) for many diverse configurations of the underwater and A-W WCNs. Specifically, we provide a detailed literature review of the various kinds of active and passive attacks which hamper the confidentiality, integrity, authentication and availability of both underwater and A-W WCNs. Finally, we highlight some research gaps in the open literature and identify security related some open problems for the future work.

eess.SP↗

arXiv2019

Channel Impulse Response-based Physical Layer Authentication in a Diffusion-based Molecular Communication System

Consider impersonation attack by an active malicious nano node (Eve) on a diffusion based molecular communication (DbMC) system---Eve transmits during the idle slots to deceive the nano receiver (Bob) that she is indeed the legitimate nano transmitter (Alice). To this end, this work exploits the 3-dimensional (3D) channel impulse response (CIR) with $L$ taps as device fingerprint for authentication of the nano transmitter during each slot. Specifically, Bob utilizes the Alice's CIR as ground truth to construct a binary hypothesis test to systematically accept/reject the data received in each slot. Simulation results highlight the great challenge posed by impersonation attack--i.e., it is not possible to simultaneously minimize the two error probabilities. In other words, one needs to tolerate on one error type in order to minimize the other error type.

cs.CR↗

arXiv2019

Channel Impulse Response-based Source Localization in a Diffusion-based Molecular Communication System

This work localizes a molecular source in a diffusion based molecular communication (DbMC) system via a set of passive sensors and a fusion center. Molecular source localization finds its applications in future healthcare systems, including proactive diagnostics. In this paper, we propose two distinct methods which both utilize (the peak of) the channel impulse response measurements to uniquely localize the source, under assumption that the molecular source of interest lies within the open convex-hull of the sensor/anchor nodes. The first method is a one-shot, triangulation-based approach which estimates the unknown location of the molecular source using least-squares method. The corresponding Cramer-Rao bound (CRB) is also derived. The second method is an iterative approach, which utilizes gradient descent law to minimize a non-convex cost function. Simulation results reveal that the triangulation-based method performs very close to the CRB, for any given signal- to-noise ratio. Additionally, the gradient descent-based method converges to the true optima/source location uniformly (in less than hundred iterations).

eess.SP↗

arXiv2018

Impersonation Detection in Line-of-Sight Underwater Acoustic Sensor Networks

This work considers a line-of-sight underwater acoustic sensor network (UWASN) consisting of $M$ underwater sensor nodes randomly deployed according to uniform distribution within a vertical half-disc (the so-called trusted zone). The sensor nodes report their sensed data to a sink node on water surface on a shared underwater acoustic (UWA) reporting channel in a time-division multiple-access (TDMA) fashion, while an active-yet-invisible adversary (so-called Eve) is present in the close vicinity who aims to inject malicious data into the system by impersonating some Alice node. To this end, this work first considers an additive white Gaussian noise (AWGN) UWA channel, and proposes a novel, multiple-features based, two-step method at the sink node to thwart the potential impersonation attack by Eve. Specifically, the sink node exploits the noisy estimates of the distance, the angle of arrival, and the location of the transmit node as device fingerprints to carry out a number of binary hypothesis tests (for impersonation detection) as well as a number of maximum likelihood hypothesis tests (for transmitter identification when no impersonation is detected). We provide closed-form expressions for the error probabilities (i.e., the performance) of most of the hypothesis tests. We then consider the case of a UWA with colored noise and frequency-dependent pathloss, and derive a maximum-likelihood (ML) distance estimator as well as the corresponding Cramer-Rao bound (CRB). We then invoke the proposed two-step, impersonation detection framework by utilizing distance as the sole feature. Finally, we provide detailed simulation results for both AWGN UWA channel and the UWA channel with colored noise. Simulation results verify that the proposed scheme is indeed effective for a UWA channel with colored noise and frequency-dependent pathloss.

cs.CR↗

arXiv2018

Power Imbalance Detection in Smart Grid via Grid Frequency Deviations: A Hidden Markov Model based Approach

We detect the deviation of the grid frequency from the nominal value (i.e., 50 Hz), which itself is an indicator of the power imbalance (i.e., mismatch between power generation and load demand). We first pass the noisy estimates of grid frequency through a hypothesis test which decides whether there is no deviation, positive deviation, or negative deviation from the nominal value. The hypothesis testing incurs miss-classification errors---false alarms (i.e., there is no deviation but we declare a positive/negative deviation), and missed detections (i.e., there is a positive/negative deviation but we declare no deviation). Therefore, to improve further upon the performance of the hypothesis test, we represent the grid frequency's fluctuations over time as a discrete-time hidden Markov model (HMM). We note that the outcomes of the hypothesis test are actually the emitted symbols, which are related to the true states via emission probability matrix. We then estimate the hidden Markov sequence (the true values of the grid frequency) via maximum likelihood method by passing the observed/emitted symbols through the Viterbi decoder. Simulations results show that the mean accuracy of Viterbi algorithm is at least $5$\% greater than that of hypothesis test.

eess.SP↗

arXiv2018

User Assignment in C-RAN Systems: Algorithms and Bounds

In this work, we investigate the problem of mitigating interference between so called antenna domains of a cloud radio access network (C-RAN). In contrast to previous work, we turn to an approach utilizing primarily the optimal assignment of users to central processors in a C-RAN deployment. We formulate this user assignment problem as an integer optimization problem, and propose an iterative algorithm for obtaining a solution. Motivated by the lack of optimality guarantees on such solutions, we opt to find lower bounds on the problem, and the resulting interference leakage in the network. We thus derive the corresponding Dantzig-Wolfe decomposition, formulate the dual problem, and show that the former offers a tighter bound than the latter. We highlight the fact that the bounds in question consist of linear problems with an exponential number of variables, and adapt the column generation method for solving them. In addition to shedding light on the tightness of the bounds in question, our numerical results show significant sum-rate gains over several comparison schemes. Moreover, the proposed scheme delivers similar performance as W-MMSE with a significantly lower complexity (around 10 times less).

cs.IT↗

arXiv2017

Random Forest Resource Allocation for 5G Systems: Performance and Robustness Study

Next generation cellular networks will have to leverage large cell densifications to accomplish the ambitious goals for aggregate multi-user sum rates, for which CRAN architecture is a favored network design. This shifts the attention back to applicable resource allocation (RA), which need to be applicable for very short radio frames, large and dense sets of radio heads, and large user populations in the coordination area. So far, mainly CSI-based RA schemes have been proposed for this task. However, they have considerable complexity and also incur a significant CSI acquisition overhead on the system. In this paper, we study an alternative approach which promises lower complexity with also a lower overhead. We propose to base the RA in multi-antenna CRAN systems on the position information of user terminals only. We use Random Forests as supervised machine learning approach to determine the multi-user RAs. This likely leads to lower overhead costs, as the acquisition of position information requires less radio resources in comparison to the acquisition of instantaneous CSI. The results show the following findings: I) In general, learning-based RA schemes can achieve comparable spectral efficiency to CSI-based scheme; II) If taking the system overhead into account, learning-based RA scheme utilizing position information outperform legacy CSI-based scheme by up to 100%; III) Despite their dependency on the training data, Random Forests based RA scheme is robust against position inaccuracies and changes in the propagation scenario; IV) The most important factor influencing the performance of learning-based RA scheme is the antenna orientation, for which we present three approaches that restore most of the original performance results. To the best of our knowledge, these insights are new and indicate a novel as well as promising approach to master the complexity in future cellular networks.

cs.IT↗

arXiv2017

Distributed Beamforming with Wirelessly Powered Relay Nodes

This paper studies a system where a set of $N$ relay nodes harvest energy from the signal received from a source to later utilize it when forwarding the source's data to a destination node via distributed beamforming. To this end, we derive (approximate) analytical expressions for the mean SNR at destination node when relays employ: i) time-switching based energy harvesting policy, ii) power-splitting based energy harvesting policy. The obtained results facilitate the study of the interplay between the energy harvesting parameters and the synchronization error, and their combined impact on mean SNR. Simulation results indicate that i) the derived approximate expressions are very accurate even for small $N$ (e.g., $N=15$), ii) time-switching policy by the relays outperforms power-splitting policy by at least $3$ dB.

cs.IT↗

arXiv2016

Exploiting Lack of Hardware Reciprocity for Sender-Node Authentication at the PHY Layer

This paper proposes to exploit the so-called {\it reciprocity parameters} (modelling non-reciprocal communication hardware) to use them as decision metric for binary hypothesis testing based authentication framework at a receiver node Bob. Specifically, Bob first learns the reciprocity parameters of the legitimate sender Alice via initial training. Then, during the test phase, Bob first obtains a measurement of reciprocity parameters of channel occupier (Alice, or, the intruder Eve). Then, with ground truth and current measurement both in hand, Bob carries out the hypothesis testing to automatically accept (reject) the packets sent by Alice (Eve). For the proposed scheme, we provide its success rate (the detection probability of Eve), and its performance comparison with other schemes.

cs.CR↗

arXiv2016

Coordination and Antenna Domain Formation in Cloud-RAN systems

We study here the problem of Antenna Domain Formation (ADF) in cloud RAN systems, whereby multiple remote radio-heads (RRHs) are each to be assigned to a set of antenna domains (ADs), such that the total interference between the ADs is minimized. We formulate the corresponding optimization problem, by introducing the concept of \emph{interference coupling coefficients} among pairs of radio-heads. We then propose a low-overhead algorithm that allows the problem to be solved in a distributed fashion, among the aggregation nodes (ANs), and establish basic convergence results. Moreover, we also propose a simple relaxation to the problem, thus enabling us to characterize its maximum performance. We follow a layered coordination structure: after the ADs are formed, radio-heads are clustered to perform coordinated beamforming using the well known Weighted-MMSE algorithm. Finally, our simulations show that using the proposed ADF mechanism would significantly increase the sum-rate of the system (with respect to random assignment of radio-heads).

cs.IT↗

arXiv2015

RRH clustering and transmit precoding for interference-limited 5G CRAN downlink

In this work, we consider cloud RAN architecture and focus on the downlink of an antenna domain (AD) exposed to external interference from neighboring ADs. With system sum-rate as performance metric, and assuming that perfect channel state information is available at the aggregation node (AN), we implement i) a greedy user association algorithm, and ii) a greedy remote radio-head (RRH) clustering algorithm at the AN. We then vary the size of individual RRH clusters, and evaluate and compare the sum-rate gains due to two distinct transmit precoding schemes namely i) zero forcing beamforming (ZFBF), ii) coordinated beamforming (CB), when exposed to external interference of same kind. From system-level simulation results, we learn that in an interference-limited regime: i) RRH clustering helps, i.e., {\it cost-adjusted} performance when RRHs cooperate is superior to the performance when they don't, ii) for transmit precoding, the CB scheme is to be preferred over the ZFBF scheme. Finally, we discuss in detail the cost of RRH clustering, i.e., the piloting overhead (and the elements driving it), incorporate its impact on system sum-rate, and discuss its implications on the baseband processing capabilities of the RRHs.

cs.IT↗