arXiv subjects

Salah Eddine Hajri

Publications and source records attributed to Salah Eddine Hajri.

10 recordsLinked to original sources

arXiv2019

On Optimal Scheduling for Joint Spatial Division and Multiplexing Approach in FDD Massive MIMO

Massive MIMO is widely considered as a key enabler of the next generation 5G networks. With a large number of antennas at the Base Station, both spectral and energy efficiencies can be enhanced. Unfortunately, the downlink channel estimation overhead scales linearly with the number of antennas. This burden is easily mitigated in TDD systems by the use of the channel reciprocity property. However, this is unfeasible for FDD systems and the method of two-stage beamforming was therefore developed to reduce the amount of channel state information feedback. The performance of this scheme being highly dependent on the users grouping and scheduling mechanims, we introduce in this paper a new similarity measure coupled with a novel clustering procedure to achieve the appropriate users grouping. We also proceed to formulate the optimal users scheduling policy in JSDM and prove that it is NP-hard. This result is of paramount importance since it suggests that, unless P=NP, there are no polynomial time algorithms that solve the general scheduling problem to global optimality and the use of sub-optimal scheduling strategies is more realistic in practice. We therefore use graph theory to develop a sub-optimal users scheduling scheme that runs in polynomial time and outperforms the scheduling schemes previously introduced in the literature for JSDM in both sum-rate and throughput fairness.

cs.IT↗

arXiv2018

Enhancing Favorable Propagation in Cell-Free Massive MIMO Through Spatial User Grouping

Cell-Free (CF) Massive multiple-input multiple-output(MIMO) is a distributed antenna system, wherein a large number of back-haul linked access points randomly distributed over a coverage area serve simultaneously a smaller number of users. CF Massive MIMO inherits favorable propagation of Massive MIMO systems. However, the level of favorable propagation which highly depends on the network topology and environment may be hindered by user' spatial correlation. In this paper, we investigate the impact of the network configuration on the level of favorable propagation for a CF Massive MIMO network. We formulate a user grouping and scheduling optimization problem that leverages users' spatial diversity. The formulated design optimization problem is proved to be NP-hard in general. To circumvent the prohibitively high computational cost, we adopt the semidefinite relaxation method to find a sub-optimal solution. The effectiveness of the proposed strategies is then verified through numerical results which demonstrate a non-negligible improvement in the performance of the studied scenario.

cs.IT↗

arXiv2018

A Spatial Basis Coverage Approach For Uplink Training And Scheduling In Massive MIMO Systems

Massive multiple-input multiple-output (massive MIMO) can provide large spectral and energy efficiency gains. Nevertheless, its potential is conditioned on acquiring accurate channel state information (CSI). In time division duplexing (TDD) systems, CSI is obtained through uplink training which is hindered by pilot contamination. The impact of this phenomenon can be relieved using spatial division multiplexing, which refers to partitioning users based on their spatial information and processing their signals accordingly. The performance of such schemes depend primarily on the implemented grouping method. In this paper, we propose a novel spatial grouping scheme that aims at managing pilot contamination while reducing the required training overhead in TDD massive MIMO. Herein, user specific decoding matrices are derived based on the columns of the discrete Fourier transform matrix (DFT), taken as a spatial basis. Copilot user groups are then formed in order to obtain the best coverage of the spatial basis with minimum overlapping between decoding matrices. We provide two algorithms that achieve the desired grouping and derive their respective performance guarantees. We also address inter-cell copilot interference through efficient pilot sequence allocation, leveraging the formed copilot groups. Various numerical results are provided to showcase the efficiency of the proposed algorithms.

cs.IT↗

arXiv2018

Heterogeneous Doppler Spread-based CSI Estimation Planning for TDD Massive MIMO

Massive multi-input multi-output (Massive MIMO) has been recognized as a key technology to meet the demand for higher data capacity and massive connectivity. Nevertheless, the number of active users is restricted due to training overhead and the limited coherence time. Current wireless systems assume the same coherence slot duration for all users, regardless of their heterogeneous Doppler spreads. In this paper, we exploit this neglected degree of freedom in addressing the training overhead bottleneck. We propose a new uplink training scheme where the periodicity of pilot transmission differs among users based on their actual channel coherence times. Since the changes in the wireless channel are, primarily, due to movement, uplink training decisions are optimized, over long time periods, while considering the evolution of the users channels and locations. Owing to the different rates of the wireless channel and location evolution, a two time scale control problem is formulated. In the fast time scale, an optimal training policy is derived by choosing which users are requested to send their pilots. In the slow time scale, location estimation decisions are optimized. Simulation results show that the derived training policies provide a considerable improvement of the cumulative average spectral efficiency even with partial location knowledge.

cs.IT↗

arXiv2017

Graph Theory Based Approach to Users Grouping and Downlink Scheduling in FDD Massive MIMO

Massive MIMO is considered as one of the key enablers of the next generation 5G networks.With a high number of antennas at the BS, both spectral and energy efficiencies can be improved. Unfortunately, the downlink channel estimation overhead scales linearly with the number of antenna. This does not create complications in Time Division Duplex (TDD) systems since the channel estimate of the uplink direction can be directly utilized for link adaptation in the downlink direction. However, this channel reciprocity is unfeasible for the Frequency Division Duplex (FDD) systems where different physical transmission channels are existent for the uplink and downlink. In the aim of reducing the amount of Channel State Information (CSI) feedback for FDD systems, the promising method of two stage beamforming transmission was introduced. The performance of this transmission scheme is however highly influenced by the users grouping and selection mechanisms. In this paper, we first introduce a new similarity measure coupled with a novel clustering technique to achieve the appropriate users partitioning. We also use graph theory to develop a low complexity groups scheduling scheme that outperforms currently existing methods in both sum-rate and throughput fairness. This performance gain is demonstrated through computer simulations.

cs.IT↗

arXiv2017

Energy Efficiency in Cache Enabled Small Cell Networks With Adaptive User Clustering

Using a network of cache enabled small cells, traffic during peak hours can be reduced considerably through proactively fetching the content that is most probable to be requested. In this paper, we aim at exploring the impact of proactive caching on an important metric for future generation networks, namely, energy efficiency (EE). We argue that, exploiting the correlation in user content popularity profiles in addition to the spatial repartitions of users with comparable request patterns, can result in considerably improving the achievable energy efficiency of the network. In this paper, the problem of optimizing EE is decoupled into two related subproblems. The first one addresses the issue of content popularity modeling. While most existing works assume similar popularity profiles for all users in the network, we consider an alternative caching framework in which, users are clustered according to their content popularity profiles. In order to showcase the utility of the proposed clustering scheme, we use a statistical model selection criterion, namely Akaike information criterion (AIC). Using stochastic geometry, we derive a closed-form expression of the achievable EE and we find the optimal active small cell density vector that maximizes it. The second subproblem investigates the impact of exploiting the spatial repartitions of users with comparable request patterns. After considering a snapshot of the network, we formulate a combinatorial optimization problem that enables to optimize content placement such that the used transmission power is minimized. Numerical results show that the clustering scheme enable to considerably improve the cache hit probability and consequently the EE compared with an unclustered approach. Simulations also show that the small base station allocation algorithm results in improving the energy efficiency and hit probability.

cs.IT↗

arXiv2017

Enhancing massive MIMO: A new approach for Uplink training based on heterogeneous coherence time

Massive multiple-input multiple-output (MIMO) is one of the key technologies in future generation networks. Owing to their considerable spectral and energy efficiency gains, massive MIMO systems provide the needed performance to cope with the ever increasing wireless capacity demand. Nevertheless, the number of scheduled users stays limited in massive MIMO both in time division duplexing (TDD) and frequency division duplexing (FDD) systems. This is due to the limited coherence time, in TDD systems, and to limited feedback capacity, in FDD mode. In current systems, the time slot duration in TDD mode is the same for all users. This is a suboptimal approach since users are subject to heterogeneous Doppler spreads and, consequently, different coherence times. In this paper, we investigate a massive MIMO system operating in TDD mode in which, the frequency of uplink training differs among users based on their actual channel coherence times. We argue that optimizing uplink training by exploiting this diversity can lead to considerable spectral efficiency gain. We then provide a user scheduling algorithm that exploits a coherence interval based grouping in order to maximize the achievable weighted sum rate.

cs.IT↗

arXiv2017

Power Control in Massive MIMO with Dynamic User Population

This paper considers the problem of power control in Massive MIMO systems taking into account the pilot contamination issue and the arrivals and departures of users in the network. Contrary to most of existing work in MIMO systems that focuses on the physical layer with fixed number of users, we consider in this work that the users arrive dynamically and leave the network once they are served. We provide a power control strategy, having a polynomial complexity, and prove that this policy stabilizes the network whenever possible. We then provide a distributed implementation of the power control policy requiring low information exchange between the BSs and show that it achieves the same stability region as the centralized policy.

cs.NI↗

arXiv2016

Caching Improvement Using Adaptive User Clustering

In this article we explore one of the most promising technologies for 5G wireless networks using an underlay small cell network, namely proactive caching. Using the increase in storage technologies and through studying the users behavior, peak traffic can be reduced through proactive caching of the content that is most probable to be requested. We propose a new method, in which, instead of caching the most popular content, the users within the network are clustered according to their content popularity and the caching is done accordingly. We present also a method for estimating the number of clusters within the network based on the Akaike information criterion. We analytically derive a closed form expression of the hit probability and we propose an optimization problem in which the small base stations association with clusters is optimized.

cs.NI↗

arXiv2015

An Exclusion zone for Massive MIMO With Underlay D2D Communication

Fifth generation networks will incorporate a variety of new features in wireless networks such as data offloading, D2D communication, and Massive MIMO. Massive MIMO is specially appealing since it achieves huge gains while enabling simple processing like MRC receivers. It suffers, though, from a major shortcoming refereed to as pilot contamination. In this paper we propose a frame-work in which, a D2D underlaid Massive MIMO system is implemented and we will prove that this scheme can reduce the pilot contamination problem while enabling an optimization of the system spectral efficiency. The D2D communication will help maintain the network coverage while allowing a better channel estimation to be performed.

cs.IT↗