Mohammad Salehi

Mohammad Salehi

Auto-generated profile, based on publicly available information

Mohammad Salehi

Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB, Canada

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 March 2019 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
HTHina Tabassum
Hina Tabassum
MSMohammad Salehi
Mohammad Salehi
EHEkram Hossain
Ekram Hossain
This article provides a tutorial on mobility-aware performance analysis of cellular networks considering both the spatially random (where base stations (BSs) are deployed according to a homogeneous point process) and deterministic grid-based network deployment topologies. We first provide a summary of users’ mobility models with no spatiotemporal correlations (e.g., random walk, random way point, random direction), with spatial correlations (e.g., pursue mobility, column mobility), and with temporal correlations (e.g., Gauss-Markov, Levy flight). The differences among various mobility models, their statistical properties, and their pros and cons are presented. We then describe two primary approaches (referred to as trajectory-based and association-based approaches) for mobility-aware performance analysis of both random and deterministic cellular networks. For the first approach (which is more general but less tractable than the other approach), we describe a general methodology and present several case studies for different cellular network tessellations such as square lattice, hexagon lattice, single-tier and multi-tier models in which BSs follow a homogeneous Poisson Point Process (PPP). For the second approach, we also outline the general methodology and highlight some limitations/imperfections of the existing techniques and provide corrections to these imperfections. For both of these approaches, we present selected numerical and simulation results to calibrate the achievable handoff rate and coverage probability in various network settings. Finally, we point out specific emerging fifth generation (5G) cellular wireless applications where the impact of mobility would be significant and outline the challenges associated with mobility-aware analysis of those network applications.

19 May 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MSMohammad Salehi
Mohammad Salehi
EHEkram Hossain
Ekram Hossain
With growth in the number of smart devices and advancements in their hardware, in recent years, data-driven machine learning techniques have drawn significant attention. However, due to privacy and communication issues, it is not possible to collect this data at a centralized location. Federated learning is a machine learning setting where the centralized location trains a learning model over remote devices. Federated learning algorithms cannot be employed in the real world scenarios unless they consider unreliable and resource-constrained nature of the wireless medium. In this paper, we propose a federated learning algorithm that is suitable for cellular wireless networks. We prove its convergence, and provide a sub-optimal scheduling policy that improves the convergence rate. We also study the effect of local computation steps and communication steps on the convergence of the proposed algorithm. We prove, in practice, federated learning algorithms may solve a different problem than the one that they have been employed for if the unreliability of wireless channels is neglected. Finally, through numerous experiments on real and synthetic datasets, we demonstrate the convergence of our proposed algorithm.

6 April 2017 in IEEE Transactions on Communications
Verified
Journal Article
Open access
MSMohammad Salehi
Mohammad Salehi
AMAbbas Mohammadi
Abbas Mohammadi
Martin HaenggiMartin Haenggi
Martin Haenggi
We study the performance of device-to-device (D2D) communication underlaying cellular wireless network in terms of the meta distribution of the signal-to-interference ratio (SIR), which is the distribution of the conditional SIR distribution given the locations of the wireless nodes. Modeling D2D transmitters and base stations as Poisson point processes (PPPs), moments of the conditional SIR distribution are derived in order to calculate analytical expressions for the meta distribution and the mean local delay of the typical D2D receiver and cellular downlink user. It turns out that for D2D users, the total interference from the D2D interferers and base stations is equal in distribution to that of a single PPP, while for downlink users, the effect of the interference from the D2D network is more complicated. We also derive the region of transmit probabilities for the D2D users and base stations that result in a finite mean local delay and give a simple inner bound on that region. Finally, the impact of increasing the base station density on the mean local delay, the meta distribution, and the density of users reliably served is investigated with numerical results.

18 August 2021 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
XLXiao Lu
Xiao Lu
MSMohammad Salehi
Mohammad Salehi
Martin HaenggiMartin Haenggi
Martin Haenggi
EHEkram Hossain
Ekram Hossain
HJHai Jiang
Hai Jiang
The performance of wireless networks is fundamentally limited by the aggregate interference, which depends on the spatial distributions of the interferers, channel conditions, and user traffic patterns (or queueing dynamics). These factors usually exhibit spatial and temporal correlations and thus make the performance of large-scale networks environment-dependent (i.e., dependent on network topology, locations of the blockages, etc.). The correlation can be exploited in protocol designs (e.g., spectrum-, load-, location-, energy-aware resource allocations) to provide efficient wireless services. For this, accurate systemlevel performance characterization and evaluation with spatialtemporal correlation are required. In this context, stochastic geometry models and random graph techniques have been used to develop analytical frameworks to capture the spatial-temporal interference correlation in large-scale wireless networks. The objective of this article is to provide a tutorial on the stochastic geometry analysis of large-scale wireless networks that captures the spatial-temporal interference correlation (and hence the signalto-interference ratio (SIR) correlation). We first discuss the importance of spatial-temporal performance analysis, different parameters affecting the spatial-temporal correlation in the SIR, and the different performance metrics for spatial-temporal analysis. Then we describe the methodologies to characterize spatialtemporal SIR correlations for different network configurations (independent, attractive, repulsive configurations), shadowing scenarios, user locations, queueing behavior, relaying, retransmission, and mobility. We conclude by outlining future research directions in the context of spatial-temporal analysis of emerging wireless communications scenarios.

24 December 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MSMohammad Salehi
Mohammad Salehi
HTHina Tabassum
Hina Tabassum
EHEkram Hossain
Ekram Hossain
We develop an analytical framework to derive the meta distribution and moments of the conditional success probability (CSP), which is defined as success probability for a given realization of the transmitters, in large-scale co-channel uplink and downlink non-orthogonal multiple access (NOMA) networks with one NOMA cluster per cell. The moments of CSP translate to various network performance metrics such as the standard success or signal-to-interference ratio (SIR) coverage probability (which is the 1-st moment), the mean local delay (which is the –1-st moment in a static network setting), and the meta distribution (which is the complementary cumulative distribution function of the success or SIR coverage probability and can be approximated by using the 1-st and 2-nd moments). For the uplink NOMA network, to make the framework tractable, we propose two point process models for the spatial locations of the inter-cell interferers by utilizing the base station (BS)/user pair correlation function. We validate the proposed models by comparing the second moment measure of each model with that of the actual point process for the inter-cluster (or intercell) interferers obtained via simulations. For downlink NOMA, we derive closed-form solutions for the moments of the CSP, success (or coverage) probability, mean local delay, and meta distribution for the users. As an application of the developed analytical framework, we use the closed-form expressions to optimize the power allocations for downlink NOMA users in order to maximize the success probability of a given NOMA user with and without latency constraints. Closed-form optimal solutions for the transmit powers are obtained for two-user NOMA scenario.We note that maximizing the success probability with latency constraints can significantly impact the optimal power solutions for low SIR thresholds and favor orthogonal multiple access (OMA).

14 March 2019 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MSMohammad Salehi
Mohammad Salehi
Hina TabassumHina Tabassum
Hina Tabassum
EHEkram Hossain
Ekram Hossain
We characterize the accuracy of analyzing the performance of a non-orthogonal multiple access (NOMA) system where users are ranked according to their distances instead of instantaneous channel gains, i.e., product of their distancebased path-loss and fading channel gains. Distance-based ranking of users is analytically tractable and can lead to important insights. However, it may not be appropriate in a multipath fading environment where a near user suffers from severe fading while a far user experiences weak fading. Since the ranking of users (and in turn interferers) in a NOMA system has a direct impact on coverage probability analysis, impact of the traditional distancebased ranking, as opposed to instantaneous signal power-based ranking, needs to be understood. This will enable us to identify scenarios where distance-based ranking, which is easier to implement compared to instantaneous signal power-based ranking, is acceptable for system performance analysis. To this end, in this paper, we derive the probability of the event when distance-based ranking yields the same results as instantaneous signal powerbased ranking, which is referred to as the accuracy probability.We characterize the probability of accuracy considering Nakagami-m fading channels and three different spatial distribution models of user locations in NOMA, namely, Poisson Point Process (PPP), Matern Cluster Process (MCP), and Thomas Cluster Process (TCP). For all these models of users’ locations, we assume that the spatial locations of the base stations (BSs) follow a homogeneous PPP. We show that the accuracy probability decreases with the increasing number of users and increases with the pathloss exponent. In addition, through examples, we illustrate the impact of accuracy probability on uplink and downlink coverage probability. Closed-form expressions are presented for Rayleigh fading environment. Effects of fading severity and users’ pairing on the accuracy probability are also investigated.