arXiv subjects

Mohamed-Slim Alouini

Publications and source records attributed to Mohamed-Slim Alouini.

At least 505 records · Page 28Linked to original sources

arXiv2017

Improper Signaling for Virtual Full-Duplex Relay Systems

Virtual full-duplex (VFD) is a powerful solution to compensate the rate loss of half-duplex relaying without the need to full-duplex capable nodes. Inter-relay interference (IRI) challenges the operation of VFD relaying systems. Recently, improper signaling is employed at both relays of the VFD to mitigate the IRI by imposing the same signal characteristics for both relays. To further boost the achievable rate performance, asymmetric time sharing VFD relaying system is adopted with different improper signals at the half-duplex relays. The joint tuning of the three design parameters improves the achievable rate performance at different ranges of IRI and different relays locations. Extensive simulation results are presented and analyzed to show the achievable rate gain of the proposed system and understand the system behavior.

cs.IT↗

arXiv2017

Max-Min SINR in Large-Scale Single-Cell MU-MIMO: Asymptotic Analysis and Low Complexity Transceivers

This work focuses on the downlink and uplink of large-scale single-cell MU-MIMO systems in which the base station (BS) endowed with $M$ antennas communicates with $K$ single-antenna user equipments (UEs). Particularly, we aim at reducing the complexity of the linear precoder and receiver that maximize the minimum signal-to-interference-plus-noise ratio subject to a given power constraint. To this end, we consider the asymptotic regime in which $M$ and $K$ grow large with a given ratio. Tools from random matrix theory (RMT) are then used to compute, in closed form, accurate approximations for the parameters of the optimal precoder and receiver, when imperfect channel state information (modeled by the generic Gauss-Markov formulation form) is available at the BS. The asymptotic analysis allows us to derive the asymptotically optimal linear precoder and receiver that are characterized by a lower complexity (due to the dependence on the large scale components of the channel) and, possibly, by a better resilience to imperfect channel state information. However, the implementation of both is still challenging as it requires fast inversions of large matrices in every coherence period. To overcome this issue, we apply the truncated polynomial expansion (TPE) technique to the precoding and receiving vector of each UE and make use of RMT to determine the optimal weighting coefficients on a per-UE basis that asymptotically solve the max-min SINR problem. Numerical results are used to validate the asymptotic analysis in the finite system regime and to show that the proposed TPE transceivers efficiently mimic the optimal ones, while requiring much lower computational complexity.

cs.IT↗

arXiv2017

On the Degrees-of-Freedom of the MIMO Three-Way Channel with Intermittent Connectivity

The degrees-of-freedom (DoF) of the multi-antenna three-way channel (3WC) with an intermittent node is studied. Special attention is given to the impact of adaptation. A nonadaptive transmission scheme based on interference alignment, zero-forcing, and erasure-channel treatment is proposed, and its corresponding DoF region is derived. Then, it is shown that this scheme achieves the sum-DoF of the intermittent channel, in addition to the DoF region of the nonintermittent one. Thus, adaptation is not necessary from those perspectives. To the contrary, it is shown that adaptation is necessary for achieving the DoF region of the intermittent case. This is shown by deriving an outer bound for the intermittent channel with nonadaptive encoding, and giving a counterexample of an adaptive scheme which achieves DoF tuples outside this bound. This highlights the importance of cooperation in this intermittent network.

cs.IT↗

arXiv2017

Numerically Stable Evaluation of Moments of Random Gram Matrices with Applications

This paper is focuses on the computation of the positive moments of one-side correlated random Gram matrices. Closed-form expressions for the moments can be obtained easily, but numerical evaluation thereof is prone to numerical stability, especially in high-dimensional settings. This letter provides a numerically stable method that efficiently computes the positive moments in closed-form. The developed expressions are more accurate and can lead to higher accuracy levels when fed to moment based-approaches. As an application, we show how the obtained moments can be used to approximate the marginal distribution of the eigenvalues of random Gram matrices.

cs.IT↗

arXiv2016

Blind Measurement Selection: A Random Matrix Theory Approach

This paper considers the problem of selecting a set of $k$ measurements from $n$ available sensor observations. The selected measurements should minimize a certain error function assessing the error in estimating a certain $m$ dimensional parameter vector. The exhaustive search inspecting each of the $n\choose k$ possible choices would require a very high computational complexity and as such is not practical for large $n$ and $k$. Alternative methods with low complexity have recently been investigated but their main drawbacks are that 1) they require perfect knowledge of the measurement matrix and 2) they need to be applied at the pace of change of the measurement matrix. To overcome these issues, we consider the asymptotic regime in which $k$, $n$ and $m$ grow large at the same pace. Tools from random matrix theory are then used to approximate in closed-form the most important error measures that are commonly used. The asymptotic approximations are then leveraged to select properly $k$ measurements exhibiting low values for the asymptotic error measures. Two heuristic algorithms are proposed: the first one merely consists in applying the convex optimization artifice to the asymptotic error measure. The second algorithm is a low-complexity greedy algorithm that attempts to look for a sufficiently good solution for the original minimization problem. The greedy algorithm can be applied to both the exact and the asymptotic error measures and can be thus implemented in blind and channel-aware fashions. We present two potential applications where the proposed algorithms can be used, namely antenna selection for uplink transmissions in large scale multi-user systems and sensor selection for wireless sensor networks. Numerical results are also presented and sustain the efficiency of the proposed blind methods in reaching the performances of channel-aware algorithms.

cs.IT↗

arXiv2016

A Hybrid Energy Sharing Framework for Green Cellular Networks

Cellular operators are increasingly turning towards renewable energy (RE) as an alternative to using traditional electricity in order to reduce operational expenditure and carbon footprint. Due to the randomness in both RE generation and mobile traffic at each base station (BS), a surplus or shortfall of energy may occur at any given time. To increase energy self-reliance and minimize the network's energy cost, the operator needs to efficiently exploit the RE generated across all BSs. In this paper, a hybrid energy sharing framework for cellular network is proposed, where a combination of physical power lines and energy trading with other BSs using smart grid is used. Algorithms for physical power lines deployment between BSs, based on average and complete statistics of the net RE available, are developed. Afterwards, an energy management framework is formulated to optimally determine the quantities of electricity and RE to be procured and exchanged among BSs, respectively, while considering battery capacities and real-time energy pricing. Three cases are investigated where RE generation is unknown, perfectly known, and partially known ahead of time. Results investigate the time varying energy management of BSs and demonstrate considerable reduction in average energy cost thanks to the hybrid energy sharing scheme.

cs.NI↗

arXiv2016

Green Networking in Cellular HetNets: A Unified Radio Resource Management Framework with Base Station ON/OFF Switching

In this paper, the problem of energy efficiency in cellular heterogeneous networks (HetNets) is investigated using radio resource and power management combined with the base station (BS) ON/OFF switching. The objective is to minimize the total power consumption of the network while satisfying the quality of service (QoS) requirements of each connected user. We consider the case of co-existing macrocell BS, small cell BSs, and private femtocell access points (FAPs). Three different network scenarios are investigated, depending on the status of the FAPs, i.e., HetNets without FAPs, HetNets with closed FAPs, and HetNets with semi-closed FAPs. A unified framework is proposed to simultaneously allocate spectrum resources to users in an energy efficient manner and switch off redundant small cell BSs. The high complexity dual decomposition technique is employed to achieve optimal solutions for the problem. A low complexity iterative algorithm is also proposed and its performances are compared to those of the optimal technique. The particularly interesting case of semi-closed FAPs, in which the FAPs accept to serve external users, achieves the highest energy efficiency due to increased degrees of freedom. In this paper, a cooperation scheme between FAPs and mobile operator is also investigated. The incentives for FAPs, e.g., renewable energy sharing and roaming prices, enabling cooperation are discussed to be considered as a useful guideline for inter-operator agreements.

cs.NI↗

arXiv2016

Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs

Recent studies on cloud-radio access networks assume either signal-level or scheduling-level coordination. This paper considers a hybrid coordinated scheme as a means to benefit from both policies. Consider the downlink of a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and, therefore, allows for joint signal processing within the cloud transmission. Across the multiple clouds, however, only scheduling-level coordination is permitted, as low levels of backhaul communication are feasible. The frame structure of every BS is composed of various time/frequency blocks, called power-zones (PZs), which are maintained at a fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled to a single cloud at most, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs' frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The considered scheduling problem is, then, shown to be equivalent to a maximum-weight independent set problem in the constructed graph, which can be solved using efficient techniques. The paper then proposes solving the problem using both optimal and heuristic algorithms that can be implemented in a distributed fashion across the network. The proposed distributed algorithms rely on the well-chosen structure of the constructed conflict graph utilized to solve the maximum-weight independent set problem. Simulation results suggest that the proposed optimal and heuristic hybrid scheduling strategies provide appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

cs.IT↗

arXiv2016

Robust Beamforming in Cache-Enabled Cloud Radio Access Networks

Popular content caching is expected to play a major role in efficiently reducing backhaul congestion and achieving user satisfaction in next generation mobile radio systems. Consider the downlink of a cache-enabled cloud radio access network (CRAN), where each cache-enabled base station (BS) is equipped with limited-size local cache storage. The central computing unit (cloud) is connected to the BSs via a limited capacity backhaul link and serves a set of single-antenna mobile users (MUs). This paper assumes that only imperfect channel state information (CSI) is available at the cloud. It focuses on the problem of minimizing the total network power and backhaul cost so as to determine the beamforming vector of each user across the network, the quantization noise covariance matrix, and the BS clustering subject to imperfect channel state information and fixed cache placement assumptions. The paper suggests solving such a difficult, non-convex optimization problem using the semidefinite relaxation (SDR). The paper then uses the $\ell_0$-norm approximation to provide a feasible, sub-optimal solution using the majorization-minimization (MM) approach. Simulation results particularly show how the cache-enabled network significantly improves the backhaul cost especially at high signal-to-interference-plus-noise ratio (SINR) values as compared to conventional cache-less CRANs.

cs.IT↗

arXiv2016

Velocity-Aware Handover Management in Two-Tier Cellular Networks

While network densification is considered an important solution to cater the ever-increasing capacity demand, its effect on the handover (HO) rate is overlooked. In dense 5G networks, HO delays may neutralize or even negate the gains offered by network densification. Hence, user mobility imposes a nontrivial challenge to harvest capacity gains via network densification. In this paper, we propose a velocity-aware HO management scheme for two-tier downlink cellular network to mitigate the HO effect on the foreseen densification throughput gains. The proposed HO scheme sacrifices the best BS connectivity, by skipping HO to some BSs along the user's trajectory, to maintain longer connection durations and reduce HO rates. Furthermore, the proposed scheme enables cooperative BS service and strongest interference cancellation to compensate for skipping the best connectivity. To this end, we consider different HO skipping scenarios and develop a velocity-aware mathematical model, via stochastic geometry, to quantify the performance of the proposed HO scheme in terms of the coverage probability and user throughput. The results highlight the HO rate problem in dense cellular environments and show the importance of the proposed HO schemes. Finally, the value of BS cooperation along with handover skipping is quantified for different user mobility profiles.

cs.NI↗

arXiv2016

Modeling Cellular Networks with Full Duplex D2D Communication: A Stochastic Geometry Approach

Full-duplex (FD) communication is optimistically promoted to double the spectral efficiency if sufficient self-interference cancellation (SIC) is achieved. However, this is not true when deploying FD-communication in a large-scale setup due to the induced mutual interference. Therefore, a large-scale study is necessary to draw legitimate conclusions about gains associated with FD-communication. This paper studies the FD operation for underlay device-to-device (D2D) communication sharing the uplink resources in cellular networks. We propose a disjoint fine-tuned selection criterion for the D2D and FD modes of operation. Then, we develop a tractable analytical paradigm, based on stochastic geometry, to calculate the outage probability and rate for cellular and D2D users. The results reveal that even in the case of perfect SIC, due to the increased interference injected to the network by FD-D2D communication, having all proximity UEs transmit in FD-D2D is not beneficial for the network. However, if the system parameters are carefully tuned, non-trivial network spectral-efficiency gains (64 shown) can be harvested. We also investigate the effects of imperfect SIC and D2D-link distance distribution on the harvested FD gains.

cs.IT↗

arXiv2016

Mobility-Aware Modeling and Analysis of Dense Cellular Networks with C-plane/U-plane Split Architecture

The unrelenting increase in the population of mobile users and their traffic demands drive cellular network operators to densify their network infrastructure. Network densification shrinks the footprint of base stations (BSs) and reduces the number of users associated with each BS, leading to an improved spatial frequency reuse and spectral efficiency, and thus, higher network capacity. However, the densification gain come at the expense of higher handover rates and network control overhead. Hence, users mobility can diminish or even nullifies the foreseen densification gain. In this context, splitting the control plane (C-plane) and user plane (U-plane) is proposed as a potential solution to harvest densification gain with reduced cost in terms of handover rate and network control overhead. In this article, we use stochastic geometry to develop a tractable mobility-aware model for a two-tier downlink cellular network with ultra-dense small cells and C-plane/U-plane split architecture. The developed model is then used to quantify the effect of mobility on the foreseen densification gain with and without C-plane/U-plane split. To this end, we shed light on the handover problem in dense cellular environments, show scenarios where the network fails to support certain mobility profiles, and obtain network design insights.

cs.IT↗

arXiv2016

Tractable Stochastic Geometry Model for IoT Access in LTE Networks

The Internet of Things (IoT) is large-scale by nature. This is not only manifested by the large number of connected devices, but also by the high volumes of traffic that must be accommodated. Cellular networks are indeed a natural candidate for the data tsunami the IoT is expected to generate in conjunction with legacy human-type traffic. However, the random access process for scheduling request represents a major bottleneck to support IoT via LTE cellular networks. Accordingly, this paper develops a mathematical framework to model and study the random access channel (RACH) scalability to accommodate IoT traffic. The developed model is based on stochastic geometry and discrete time Markov chains (DTMC) to account for different access strategies and possible sources of inter-cell and intra-cell interferences. To this end, the developed model is utilized to assess and compare three different access strategies, which incorporate a combination of transmission persistency, back-off, and power ramping. The analysis and the results showcased herewith clearly illustrate the vulnerability of the random access procedure as the IoT intensity grows. Finally, the paper offers insights into effective scenarios for each transmission strategy in terms of IoT intensity and RACH detection thresholds.

cs.IT↗

arXiv2016

Cooperative Handover Management in Dense Cellular Networks

Network densification has always been an important factor to cope with the ever increasing capacity demand. Deploying more base stations (BSs) improves the spatial frequency utilization, which increases the network capacity. However, such improvement comes at the expense of shrinking the BSs' footprints, which increases the handover (HO) rate and may diminish the foreseen capacity gains. In this paper, we propose a cooperative HO management scheme to mitigate the HO effect on throughput gains achieved via cellular network densification. The proposed HO scheme relies on skipping HO to the nearest BS at some instances along the user's trajectory while enabling cooperative BS service during HO execution at other instances. To this end, we develop a mathematical model, via stochastic geometry, to quantify the performance of the proposed HO scheme in terms of coverage probability and user throughput. The results show that the proposed cooperative HO scheme outperforms the always best connected based association at high mobility. Also, the value of BS cooperation along with handover skipping is quantified with respect to the HO skipping only that has recently appeared in the literature. Particularly, the proposed cooperative HO scheme shows throughput gains of 12% to 27% and 17% on average, when compared to the always best connected and HO skipping only schemes at user velocity ranging from 80 km/h to 160 Km/h, respectively.

cs.IT↗

arXiv2016

In-Band $α$-Duplex Scheme for Cellular Networks: A Stochastic Geometry Approach

In-band full-duplex (FD) communications have been optimistically promoted to improve the spectrum utilization and efficiency. However, the penetration of FD communications to the cellular networks domain is challenging due to the imposed uplink/downlink interference. This paper presents a tractable framework, based on stochastic geometry, to study FD communications in cellular networks. Particularly, we assess the FD communications effect on the network performance and quantify the associated gains. The study proves the vulnerability of the uplink to the downlink interference and shows that the improved FD rate gains harvested in the downlink (up to $97\%$) comes at the expense of a significant degradation in the uplink rate (up to $94\%$). Therefore, we propose a novel fine-grained duplexing scheme, denoted as $α$-duplex scheme, which allows a partial overlap between the uplink and the downlink frequency bands. We derive the required conditions to harvest rate gains from the $α$-duplex scheme and show its superiority to both the FD and half-duplex (HD) schemes. In particular, we show that the $α$-duplex scheme provides a simultaneous improvement of $28\%$ for the downlink rate and $56\%$ for the uplink rate. Finally, we show that the amount of the overlap can be optimized based on the network design objective.

cs.IT↗

arXiv2016

Precoding design for single-RF massive MIMO systems: A large system analysis

This work revisits a recently proposed precoding design for massive multiple-input multiple output (MIMO) systems that is based on the use of an instantaneous total power constraint. The main advantages of this technique lie in its suitability to single RF MIMO systems coupled with a very-high power efficiency. Such features have been proven using simulations for uncorrelated channels. Based on tools from random matrix theory, we propose in this work to analyze the performance of this precoder for more involved channels accounting for spatial correlation. The obtained expressions are then optimized in order to maximize the signal-to-interference-plus-noise ratio (SINR). Simulation results are provided in order to illustrate the performance of the optimized precoder in terms of peak-to-average power ratio (PAPR) and signal-to-interference-plus-noise ratio (SINR).

cs.IT↗

arXiv2016

Fluctuations of the SNR at the output of the MVDR with Regularized Tyler Estimators

This paper analyzes the statistical properties of the signal-to-noise ratio (SNR) at the output of the Capon's minimum variance distortionless response (MVDR) beamformers when operating over impulsive noises. Particularly, we consider the supervised case in which the receiver employs the regularized Tyler estimator in order to estimate the covariance matrix of the interference-plus-noise process using $n$ observations of size $N\times 1$. The choice for the regularized Tylor estimator (RTE) is motivated by its resilience to the presence of outliers and its regularization parameter that guarantees a good conditioning of the covariance estimate. Of particular interest in this paper is the derivation of the second order statistics of the SINR. To achieve this goal, we consider two different approaches. The first one is based on considering the classical regime, referred to as the $n$-large regime, in which $N$ is assumed to be fixed while $n$ grows to infinity. The second approach is built upon recent results developed within the framework of random matrix theory and assumes that $N$ and $n$ grow large together. Numerical results are provided in order to compare between the accuracies of each regime under different settings.

cs.IT↗

arXiv2016

Handover Management in Dense Cellular Networks: A Stochastic Geometry Approach

Cellular operators are continuously densifying their networks to cope with the ever-increasing capacity demand. Furthermore, an extreme densification phase for cellular networks is foreseen to fulfill the ambitious fifth generation (5G) performance requirements. Network densification improves spectrum utilization and network capacity by shrinking base stations' (BSs) footprints and reusing the same spectrum more frequently over the spatial domain. However, network densification also increases the handover (HO) rate, which may diminish the capacity gains for mobile users due to HO delays. In highly dense 5G cellular networks, HO delays may neutralize or even negate the gains offered by network densification. In this paper, we present an analytical paradigm, based on stochastic geometry, to quantify the effect of HO delay on the average user rate in cellular networks. To this end, we propose a flexible handover scheme to reduce HO delay in case of highly dense cellular networks. This scheme allows skipping the HO procedure with some BSs along users' trajectories. The performance evaluation and testing of this scheme for only single HO skipping shows considerable gains in many practical scenarios.

cs.NI↗