arXiv subjects

Mohamed-Slim Alouini

Publications and source records attributed to Mohamed-Slim Alouini.

At least 469 records · Page 26Linked to original sources

arXiv2018

Performance Analysis of Connectivity and Localization in Multi-Hop Underwater Optical Wireless Sensor Networks

Underwater optical wireless links have limited range and intermittent connectivity due to the hostile aquatic channel impairments and misalignment between the optical transceivers. Therefore, multi-hop communication can expand the communication range, enhance network connectivity, and provide a more precise network localization scheme. In this regard, this paper investigates the connectivity of underwater optical wireless sensor networks (UOWSNs) and its impacts on the network localization performance. Firstly, we model UOWSNs as randomly scaled sector graphs where the connection between sensors is established by point-to-point directed links. Thereafter, the probability of network connectivity is analytically derived as a function of network density, communication range, and optical transmitters' divergence angle. Secondly, the network localization problem is formulated as an unconstrained optimization problem and solved using the conjugate gradient technique. Numerical results show that different network parameters such as the number of nodes, divergence angle, and transmission range significantly influence the probability of a connected network. Furthermore, the performance of the proposed localization technique is compared to well-known network localization schemes and the results show that the localization accuracy of the proposed technique outperforms the literature in terms of network connectivity, ranging error, and number of anchors.

cs.NI↗

arXiv2018

Generalized Beamspace Modulation Using Multiplexing: A Breakthrough in mmWave MIMO

Spatial multiplexing (SMX) multiple-input multiple-output (MIMO) over the best beamspace was considered as the best solution for millimeter wave (mmWave) communications regarding spectral efficiency (SE), referred as the best beamspace selection (BBS) solution. The equivalent MIMO water-filling (WF-MIMO) channel capacity was treated as an unsurpassed SE upper bound. Recently, researchers have proposed various schemes trying to approach the benchmark and the performance bound. But, are they the real limit of mmWave MIMO systems with reduced radio-frequency (RF) chains? In this paper, we challenge the benchmark and the corresponding bound by proposing a better transmission scheme that achieves higher SE, namely the Generalized Beamspace Modulation using Multiplexing (GBMM). Inspired by the concept of spatial modulation, besides the selected beamspace, the selection operation is used to carry information. We prove that GBMM is superior to BBS in terms of SE and can break through the well known `upper bound'. That is, GBMM renews the upper bound of the SE. We investigate SE-oriented precoder activation probability optimization, fully-digital precoder design, optimal power allocation and hybrid precoder design for GBMM. A gradient ascent algorithm is developed to find the optimal solution, which is applicable in all signal-to-noise-ratio (SNR) regimes. The best solution is derived in the high SNR regime. Additionally, we investigate the hybrid receiver design and deduce the minimum number of receive RF chains configured to gain from GBMM in achievable SE. We propose a coding approach to realize the optimized precoder activation. An extension to mmWave broadband communications is also discussed. Comparisons with the benchmark (i.e., WF-MIMO channel capacity) are made under different system configurations to show the superiority of GBMM.

eess.SP↗

arXiv2018

Downlink Non-Orthogonal Multiple Access (NOMA) in Poisson Networks

A network model is considered where Poisson distributed base stations transmit to $N$ power-domain non-orthogonal multiple access (NOMA) users (UEs) each {that employ successive interference cancellation (SIC) for decoding}. We propose three models for the clustering of NOMA UEs and consider two different ordering techniques for the NOMA UEs: mean signal power-based and instantaneous signal-to-intercell-interference-and-noise-ratio-based. For each technique, we present a signal-to-interference-and-noise ratio analysis for the coverage of the typical UE. We plot the rate region for the two-user case and show that neither ordering technique is consistently superior to the other. We propose two efficient algorithms for finding a feasible resource allocation that maximize the cell sum rate $\mathcal{R}_{\rm tot}$, for general $N$, constrained to: 1) a minimum throughput $\mathcal{T}$ for each UE, 2) identical throughput for all UEs. We show the existence of: 1) an optimum $N$ that maximizes the constrained $\mathcal{R}_{\rm tot}$ given a set of network parameters, 2) a critical SIC level necessary for NOMA to outperform orthogonal multiple access. The results highlight the importance in choosing the network parameters $N$, the constraints, and the ordering technique to balance the $\mathcal{R}_{\rm tot}$ and fairness requirements. We also show that interference-aware UE clustering can significantly improve performance.

cs.IT↗

arXiv2018

Self-Organized Scheduling Request for Uplink 5G Networks: A D2D Clustering Approach

In one of the several manifestations, the future cellular networks are required to accommodate a massive number of devices; several orders of magnitude compared to today's networks. At the same time, the future cellular networks will have to fulfill stringent latency constraints. To that end, one problem that is posed as a potential showstopper is extreme congestion for requesting uplink scheduling over the physical random access channel (PRACH). Indeed, such congestion drags along scheduling delay problems. In this paper, the use of self-organized device-to-device (D2D) clustering is advocated for mitigating PRACH congestion. To this end, the paper proposes two D2D clustering schemes, namely; Random-Based Clustering (RBC) and Channel-Gain-Based Clustering (CGBC). Accordingly, this paper sheds light on random access within the proposed D2D clustering schemes and presents a case study based on a stochastic geometry framework. For the sake of objective evaluation, the D2D clustering is benchmarked by the conventional scheduling request procedure. Accordingly, the paper offers insights into useful scenarios that minimize the scheduling delay for each clustering scheme. Finally, the paper discusses the implementation algorithm and some potential implementation issues and remedies.

cs.IT↗

arXiv2018

Unified Statistical Channel Model for Turbulence-Induced Fading in Underwater Wireless Optical Communication Systems

A unified statistical model is proposed to characterize turbulence-induced fading in underwater wireless optical communication (UWOC) channels in the presence of air bubbles and temperature gradient for fresh and salty waters, based on experimental data. In this model, the channel irradiance fluctuations are characterized by the mixture Exponential-Generalized Gamma (EGG) distribution. We use the expectation maximization (EM) algorithm to obtain the maximum likelihood parameter estimation of the new model. Interestingly, the proposed model is shown to provide a perfect fit with the measured data under all channel conditions for both types of water. The major advantage of the new model is that it has a simple mathematical form making it attractive from a performance analysis point of view. Indeed, we show that the application of the EGG model leads to closed-form and analytically tractable expressions for key UWOC system performance metrics such as the outage probability, the average bit-error rate, and the ergodic capacity. To the best of our knowledge, this is the first-ever comprehensive channel model addressing the statistics of optical beam irradiance fluctuations in underwater wireless optical channels due to both air bubbles and temperature gradient.

cs.IT↗

arXiv2018

Learn to Fly: A Distributed Mechanism for Joint 3D Placement and Users Association in UAVs-assisted Networks

In this paper, we study the joint 3D placement of unmanned aerial vehicles (UAVs) and UAVs-users association under bandwidth limitation and quality of service constraint. In particular, in order to allow to UAVs to dynamically improve their 3D locations in a distributed fashion while maximizing the network's sum-rate, we break the underlying optimization into 3 subproblems where we separately solve the 2D UAVs positioning, the altitude optimization, and the UAVs-users association. First, given fixed 3D positions of UAVs, we propose a fully distributed matching based association that alleviates the bottlenecks of bandwidth allocation and guarantees the required quality of service. Next, to address the 2D positions of UAVs, we adopt a modified version of K-means algorithm, with a distributed implementation, where UAVs dynamically change their 2D positions in order to reach the barycenter of the cluster that is composed of the served ground users. In order to optimize the UAVs altitudes, we study a naturally defined game-theoretic version of the problem and show that under fixed UAVs 2D coordinates, a predefined association scheme, and limited-interference, the UAVs altitudes game is a non-cooperative potential game where the players (UAVs) can maximize the limited-interference sum-rate by only optimizing a local utility function. Therefore, we adopt the best response dynamics to reach a Nash equilibrium of the game which is also a local optimum of the social welfare function. Our simulation results show that, using the proposed approach, the network's sum rate of the studied scenario is improved as compared with the trivial case where the classical version of K-means is adopted and users are assigned, at each iteration, to the closest UAV.

eess.SP↗

arXiv2018

Spatiotemporal Model for Uplink IoT Traffic: Scheduling & Random Access Paradox

The Internet-of-things (IoT) is the paradigm where anything will be connected. There are two main approaches to handle the surge in the uplink (UL) traffic the IoT is expected to generate, namely, Scheduled UL (SC-UL) and random access uplink (RA-UL) transmissions. SC-UL is perceived as a viable tool to control Quality-of-Service (QoS) levels while entailing some overhead in the scheduling request prior to any UL transmission. On the other hand, RA-UL is a simple single-phase transmission strategy. While this obviously eliminates scheduling overheads, very little is known about how scalable RA-UL is. At this critical junction, there is a dire need to analyze the scalability of these two paradigms. To that end, this paper develops a spatiotemporal mathematical framework to analyze and assess the performance of SC-UL and RA-UL. The developed paradigm jointly utilizes stochastic geometry and queueing theory. Based on such a framework, we show that the answer to the "scheduling vs. random access paradox" actually depends on the operational scenario. Particularly, RA-UL scheme offers low access delays but suffers from limited scalability, i.e., cannot support a large number of IoT devices. On the other hand, SC-UL transmission is better suited for higher device intensities and traffic rates.

cs.IT↗

arXiv2018

Outlier Detection and Optimal Anchor Placement for 3D Underwater Optical Wireless Sensor Networks Localization

Location is one of the basic information required for underwater optical wireless sensor networks (UOWSNs) for different purposes such as relating the sensing measurements with precise sensor positions, enabling efficient geographic routing techniques, and sustaining link connectivity between the nodes. Even though various two-dimensional UOWSNs localization methods have been proposed in the past, the directive nature of optical wireless communications and three-dimensional (3D) deployment of sensors require to develop 3D underwater localization methods. Additionally, the localization accuracy of the network strongly depends on the placement of the anchors. Therefore, we propose a robust 3D localization method for partially connected UOWSNs which can accommodate the outliers and optimize the placement of the anchors to improve the localization accuracy. The proposed method formulates the problem of missing pairwise distances and outliers as an optimization problem which is solved through half quadratic minimization. Furthermore, analysis is provided to optimally place the anchors in the network which improves the localization accuracy. The problem of optimal anchor placement is formulated as a combination of Fisher information matrices for the sensor nodes where the condition of D-optimality is satisfied. The numerical results indicate that the proposed method outperforms the literature substantially in the presence of outliers.

eess.SP↗

arXiv2018

LMMSE Receivers in Uplink Massive MIMO Systems with Correlated Rician Fading

We carry out a theoretical analysis of the uplink (UL) of a massive MIMO system with per-user channel correlation and Rician fading, using two processing approaches. Firstly, we examine the linear minimum-mean-square-error receiver under training-based imperfect channel estimates. Secondly, we propose a statistical combining technique that is more suitable in environments with strong Line-of-Sight (LoS) components. We derive closed-form asymptotic approximations of the UL spectral efficiency (SE) attained by each combining scheme in single and multi-cell settings, as a function of the system parameters. These expressions are insightful in how different factors such as LoS propagation conditions and pilot contamination impact the overall system performance. Furthermore, they are exploited to determine the optimal number of training symbols which is shown to be of significant interest at low Rician factors. The study and numerical results substantiate that stronger LoS signals lead to better performances, and under such conditions, the statistical combining entails higher SE gains than the conventional receiver.

cs.IT↗

arXiv2018

Full-Duplex Energy-Harvesting Enabled Relay Networks in Generalized Fading Channels

This paper analyzes the performance of a full-duplex decode-and-forward relaying network over the generalized κ-μfading channel. The relay is energy-constrained and relies entirely on harvesting the power signal transmitted by the source based on the time-switching relaying protocol. A unified analytical expression for the ergodic outage probability is derived for the system under consideration. This is then used to derive closed-form analytical expressions for three special cases of the κ-μfading model, namely, Nakagami-m, Rice and Rayleigh. Monte Carlo simulations are provided throughout to verify the correctness of our analysis.

eess.SP↗

arXiv2018

On Optimizing VLC Networks for Downlink Multi-User Transmission: A Survey

The evolving explosion in high data rate services and applications will soon require the use of untapped, abundant unregulated spectrum of the visible light for communications to adequately meet the demands of the fifth-generation (5G) mobile technologies. Radio-frequency (RF) networks are proving to be scarce to cover the escalation in data rate services. Visible light communication (VLC) has emerged as a great potential solution, either in replacement of, or complement to, existing RF networks, to support the projected traffic demands. Despite of the prolific advantages of VLC networks, VLC faces many challenges that must be resolved in the near future to achieve a full standardization and to be integrated to future wireless systems. Here, we review the new, emerging research in the field of VLC networks and lay out the challenges, technological solutions, and future work predictions. Specifically, we first review the VLC channel capacity derivation, discuss the performance metrics and the associated variables; the optimization of VLC networks are also discussed, including resources and power allocation techniques, user-to-access point (AP) association and APs-to-clustered-users-association, APs coordination techniques, non-orthogonal multiple access (NOMA) VLC networks, simultaneous energy harvesting and information transmission using the visible light, and the security issue in VLC networks. Finally, we propose several open research problems to optimize the various VLC networks by maximizing either the sum rate, fairness, energy efficiency, secrecy rate, or harvested energy.

cs.IT↗

arXiv2018

Precise Performance Analysis of the LASSO under Matrix Uncertainties

In this paper, we consider the problem of recovering an unknown sparse signal $\xv_0 \in \mathbb{R}^n$ from noisy linear measurements $\yv = \Hm \xv_0+ \zv \in \mathbb{R}^m$. A popular approach is to solve the $\ell_1$-norm regularized least squares problem which is known as the LASSO. In many practical situations, the measurement matrix $\Hm$ is not perfectely known and we only have a noisy version of it. We assume that the entries of the measurement matrix $\Hm$ and of the noise vector $\zv$ are iid Gaussian with zero mean and variances $1/n$ and $σ_{\zv}^2$. In this work, an imperfect measurement matrix is considered under which we precisely characterize the limiting behavior of the mean squared error and the probability of support recovery of the LASSO. The analysis is performed when the problem dimensions grow simultaneously to infinity at fixed rates. Numerical simulations validate the theoretical predictions derived in this paper.

cs.IT↗

arXiv2018

Half-Duplex and Full-Duplex AF and DF Relaying with Energy-Harvesting in Log-Normal Fading

Energy-harvesting (EH) and wireless power transfer in cooperative relaying networks have recently attracted a considerable amount of research attention. Most of the existing work on this topic however focuses on Rayleigh fading channels, which represent outdoor environments. In contrast, this paper is dedicated to analyze the performance of dual-hop relaying systems with EH over indoor channels characterized by log-normal fading. Both half-duplex (HD) and full-duplex (FD) relaying mechanisms are studied in this work with decode-and-forward (DF) and amplify-and-forward (AF) relaying protocols. In addition, three EH schemes are investigated, namely, time switching relaying, power splitting relaying and ideal relaying receiver which serves as a lower bound. The system performance is evaluated in terms of the ergodic outage probability for which we derive accurate analytical expressions. Monte Carlo simulations are provided throughout to validate the accuracy of our analysis. Results reveal that, in both HD and FD scenarios, AF relaying performs only slightly worse than DF relaying which can make the former a more efficient solution when the processing energy cost at the DF relay is taken into account. It is also shown that FD relaying systems can generally outperform HD relaying schemes as long as the loop-back interference in FD is relatively small. Furthermore, increasing the variance of the log-normal channel has shown to deteriorate the performance in all the relaying and EH protocols considered.

eess.SP↗

arXiv2018

On the Asymptotic Throughput of the k-th Best Secondary User Selection in Cognitive Radio Systems

We analyze the asymptotic average and effective throughputs of a multiuser diversity scheme for a secondary multiuser network consisting of multiple secondary users (transmitters) and one secondary receiver. Considering a transmit power adaptation strategy at the secondary users to satisfy the instantaneous interference constraint at the primary receiver, the secondary receiver selects the $k$-th best secondary user for transmission, namely, the one with the $k$-th highest signal-to-noise ratio (SNR). We use extreme value theory to show that the $k$-th highest SNR converges uniformly in distribution to an inverse gamma random variable for a fixed $k$ and large number of secondary users. We use this result to derive closed-form asymptotic expressions for the average and effective throughputs of the $k$-th best secondary user.

cs.IT↗

arXiv2018

Wireless Power Transfer in Cooperative DF Relaying Networks with Log-Normal Fading

Energy-harvesting and wireless power transfer in cooperative relaying networks have recently attracted a considerable amount of research attention. Most of the existing work on this topic however focuses on Rayleigh fading channels which represents outdoor environments. Unlike these studies, in this paper we analyze the performance of wireless power transfer in two-hop decode-and-forward (DF) cooperative relaying systems in indoor channels characterized by log-normal fading. Three well-known energy-harvesting protocols are considered in our evaluations: a) time-switching relaying (TSR), b) power-splitting relaying (PSR) and c) ideal relaying receiver (IRR). The performance is evaluated in terms of the ergodic outage probability for which we derive accurate analytical expressions for the three systems under consideration. Results reveal that careful selection of the energy-harvesting time and power-splitting factors in the TSR- and PSR-based system are important to optimize performance. It is also presented that the optimized PSR system has near-ideal performance and that increasing the source transmit power and/or the energy-harvester efficiency can further improve performance.

eess.SP↗

arXiv2018

Opportunistic Scheduling in Underlay Cognitive Radio based MIMO-RF/FSO Networks

This work proposes an optimal metric for opportunistic scheduling of secondary user transmitters (SU-TXs) in underlay cognitive radio based multiple-input multiple-output radio frequency/free space optical (MIMO-RF/FSO) decode-and-forward system with fixed and proportional interference power constraints. To analyze the performance of the proposed system, the closed-form expressions are derived for the exact and asymptotic outage probabilities considering orthogonal space-time block coded transmission over Nakagami-$m$ fading RF links. Further, the FSO link between the relay and destination eNodeB is modeled as the Generalized Málaga $(\mathcal{M})$ turbulence channel with pointing errors. Finally, simulation results are presented to develop several interesting insights into the end-to-end system performance and the selection probabilities of SU-TXs. It is also shown that the proposed system outperforms the ones existing in the current literature.

cs.IT↗

arXiv2018

Over-Sampling Codebook-Based Hybrid Minimum Sum-Mean-Square-Error Precoding for Millimeter-Wave 3D-MIMO

Hybrid precoding design is challenging for millimeter-wave (mmWave) massive MIMO. Most prior hybrid precoding schemes are designed to maximize the sum spectral efficiency (SSE), while seldom investigate the bit-error-rate (BER). Therefore, we propose an over-sampling codebook (OSC)-based hybrid minimum sum-mean-square-error (min-SMSE) precoding scheme for mmWave multi-user three-dimensional (3D)-MIMO systems to optimize the BER, where multi-user transmission with multiple data streams for each user is considered. Specifically, given the effective baseband channel consisting of the real channel and analog precoding, we first design the digital precoder/combiner based on min-SMSE criterion to optimize the BER. To further reduce the SMSE between the transmit and receive signals, we propose an OSC-based joint analog precoder/combiner (JAPC) design. Simulation results show that the proposed scheme can achieve the better performance than its conventional counterparts.

cs.IT↗

arXiv2018

Ergodic Capacity Analysis of Free-Space Optical Links With Nonzero Boresight Pointing Errors

A unified capacity analysis of a free-space optical (FSO) link that accounts for nonzero boresight pointing errors and both types of detection techniques (i.e. intensity modulation/direct detection as well as heterodyne detection) is addressed in this work. More specifically, an exact closed-form expression for the moments of the end-to-end signal-to-noise ratio (SNR) of a single link FSO transmission system is presented in terms of well-known elementary functions. Capitalizing on these new moments expressions, we present approximate and simple closed-form results for the ergodic capacity at high and low SNR regimes. All the presented results are verified via computer-based Monte-Carlo simulations.

cs.IT↗