arXiv subjects

Shahram Shahbazpanahi

Publications and source records attributed to Shahram Shahbazpanahi.

14 recordsLinked to original sources

arXiv2025

Handoff Design in User-Centric Cell-Free Massive MIMO Networks Using DRL

In the user-centric cell-free massive MIMO (UC-mMIMO) network scheme, user mobility necessitates updating the set of serving access points to maintain the user-centric clustering. Such updates are typically performed through handoff (HO) operations; however, frequent HOs lead to overheads associated with the allocation and release of resources. This paper presents a deep reinforcement learning (DRL)-based solution to predict and manage these connections for mobile users. Our solution employs the Soft Actor-Critic algorithm, with continuous action space representation, to train a deep neural network to serve as the HO policy. We present a novel proposition for a reward function that integrates a HO penalty in order to balance the attainable rate and the associated overhead related to HOs. We develop two variants of our system; the first one uses mobility direction-assisted (DA) observations that are based on the user movement pattern, while the second one uses history-assisted (HA) observations that are based on the history of the large-scale fading (LSF). Simulation results show that our DRL-based continuous action space approach is more scalable than discrete space counterpart, and that our derived HO policy automatically learns to gather HOs in specific time slots to minimize the overhead of initiating HOs. Our solution can also operate in real time with a response time less than 0.4 ms.

cs.IT↗

arXiv2024

Handoffs in User-Centric Cell-Free MIMO Networks: A POMDP Framework

We study the problem of managing handoffs (HOs) in user-centric cell-free massive MIMO (UC-mMIMO) networks. Motivated by the importance of controlling the number of HOs and by the correlation between efficient HO decisions and the temporal evolution of the channel conditions, we formulate a partially observable Markov decision process (POMDP) with the state space representing the discrete versions of the large-scale fading and the action space representing the association decisions of the user with the access points (APs). We develop a novel algorithm that employs this model to derive a HO policy for a mobile user based on current and future rewards. To alleviate the high complexity of our POMDP, we follow a divide-and-conquer approach by breaking down the POMDP formulation into sub-problems, each solved separately. Then, the policy and the candidate pool of APs for the sub-problem that produced the best total expected reward are used to perform HOs within a specific time horizon. We then introduce modifications to our algorithm to decrease the number of HOs. The results show that half of the number of HOs in the UC-mMIMO networks can be eliminated. Namely, our novel solution can control the number of HOs while maintaining a rate guarantee, where a 47%-70% reduction of the cumulative number of HOs is observed in networks with a density of 125 APs per km2. Most importantly, our results show that a POMDP-based HO scheme is promising to control HOs.

cs.IT↗

arXiv2022

POMDP-based Handoffs for User-Centric Cell-Free MIMO Networks

We propose to control handoffs (HOs) in user-centric cell-free massive MIMO networks through a partially observable Markov decision process (POMDP) with the state space representing the discrete versions of the large-scale fading (LSF) and the action space representing the association decisions of the user with the access points. Our proposed formulation accounts for the temporal evolution and the partial observability of the channel states. This allows us to consider future rewards when performing HO decisions, and hence obtain a robust HO policy. To alleviate the high complexity of solving our POMDP, we follow a divide-and-conquer approach by breaking down the POMDP formulation into sub-problems, each solved individually. Then, the policy and the candidate cluster of access points for the best solved sub-problem is used to perform HOs within a specific time horizon. We control the number of HOs by determining when to use the HO policy. Our simulation results show that our proposed solution reduces HOs by 47% compared to time-triggered LSF-based HOs and by 70% compared to data rate threshold-triggered LSF-based HOs. This amount can be further reduced through increasing the time horizon of the POMDP.

cs.IT↗

arXiv2021

User-centric Cell-free Massive MIMO Networks: A Survey of Opportunities, Challenges and Solutions

Densification of network base stations is indispensable to achieve the stringent Quality of Service (QoS) requirements of future mobile networks. However, with a dense deployment of transmitters, interference management becomes an arduous task. To solve this issue, exploring radically new network architectures with intelligent coordination and cooperation capabilities is crucial. This survey paper investigates the emerging user-centric cell-free massive Multiple-input multiple-output (MIMO) network architecture that sets a foundation for future mobile networks. Such networks use a dense deployment of distributed units (DUs) to serve users; the crucial difference from the traditional cellular paradigm is that a specific serving cluster of DUs is defined for each user. This framework provides macro diversity, power efficiency, interference management, and robust connectivity. Most importantly, the user-centric approach eliminates cell edges, thus contributing to uniform coverage and performance for users across the network area. We present here a guide to the key challenges facing the deployment of this network scheme and contemplate the solutions being proposed for the main bottlenecks facing cell-free communications. Specifically, we survey the literature targeting the fronthaul, then we scan the details of the channel estimation required, resource allocation, delay, and scalability issues. Furthermore, we highlight some technologies that can provide a management platform for this scheme such as distributed software-defined network (SDN). Our article serves as a check point that delineates the current status and indicates future directions for this area in a comprehensive manner.

cs.IT↗

arXiv2021

Analysis and Design of Distributed MIMO Networks with a Wireless Fronthaul

We consider the analysis and design of distributed wireless networks wherein remote radio heads (RRHs) coordinate transmissions to serve multiple users on the same resource block (RB). Specifically, we analyze two possible multiple-input multiple-output wireless fronthaul solutions: multicast and zero forcing (ZF) beamforming. We develop a statistical model for the fronthaul rate and, coupled with an analysis of the user access rate, we optimize the placement of the RRHs. This model allows us to formulate the location optimization problem with a statistical constraint on fronthaul outage. Our results are cautionary, showing that the fronthaul requires considerable bandwidth to enable joint service to users. This requirement can be relaxed by serving a low number of users on the same RB. Additionally, we show that, with a fixed number of antennas, for the multicast fronthaul, it is prudent to concentrate these antennas on a few RRHs. However, for the ZF beamforming fronthaul, it is better to distribute the antennas on more RRHs. For the parameters chosen, using a ZF beamforming fronthaul improves the typical access rate by approximately 8% compared to multicast. Crucially, our work quantifies the effect of these fronthaul solutions and provides an effective tool for the design of distributed networks.

cs.IT↗

arXiv2021

Distributed Resource Allocation Optimization for User-Centric Cell-Free MIMO Networks

We develop two distributed downlink resource allocation algorithms for user-centric, cell-free, spatially-distributed, multiple-input multiple-output (MIMO) networks. In such networks, each user is served by a subset of nearby transmitters that we call distributed units or DUs. The operation of the DUs in a region is controlled by a central unit (CU). Our first scheme is implemented at the DUs, while the second is implemented at the CUs controlling these DUs. We define a hybrid quality of service metric that enables distributed optimization of system resources in a proportional fair manner. Specifically, each of our algorithms performs user scheduling, beamforming, and power control while accounting for channel estimation errors. Importantly, our algorithm does not require information exchange amongst DUs (CUs) for the DU-distributed (CU-distributed) system, while also smoothly converging. Our results show that our CU-distributed system provides 1.3- to 1.8-fold network throughput compared to the DU-distributed system, with minor increases in complexity and front-haul load - and substantial gains over benchmark schemes like local zero-forcing. We also analyze the trade-offs provided by the CU-distributed system, hence highlighting the significance of deploying multiple CUs in user-centric cell-free networks.

cs.IT↗

arXiv2021

RWP+: A New Random Waypoint Model for High-Speed Mobility

In this letter, we emulate real-world statistics for mobility patterns on road systems. We then propose modifications to the assumptions of the random waypoint (RWP) model to better represent high-mobility profiles. We call the model under our new framework as RWP+. Specifically, we show that the lengths of the transitions which constitute a trip, are best represented by a lognormal distribution, and that the velocities are best described by a linear combination of normal distributions with different mean values. Compared to the assumptions used in the literature for mobile cellular networks, our modeling provides mobility metrics, such as handoff rates, that better characterize actual emulated trips from the collected statistics.

cs.IT↗

arXiv2021

Downlink Resource Allocation in Multiuser Cell-free MIMO Networks with User-centric Clustering

In this paper, we optimize user scheduling, power allocation and beamforming in distributed multiple-input multiple-output (MIMO) networks implementing user-centric clustering. We study both the coherent and non-coherent transmission modes, formulating a weighted sum rate maximization problem for each; finding the optimal solution to these problems is known to be NP-hard. We use tools from fractional programming, block coordinate descent, and compressive sensing to construct an algorithm that optimizes the beamforming weights and user scheduling and converges in a smooth non-decreasing pattern. Channel state information (CSI) being crucial for optimization, we highlight the importance of employing a low-overhead pilot assignment policy for scheduling problems. In this regard, we use a variant of hierarchical agglomerative clustering, which provides a suboptimal, but feasible, pilot assignment scheme; for our cell-free case, we formulate an area-based pilot reuse factor. Our results show that our scheme provides large gains in the long-term network sum spectral efficiency compared to benchmark schemes such as zero-forcing and conjugate beamforming (with round-robin scheduling) respectively. Furthermore, the results show the superiority of coherent transmission compared to the non-coherent mode under ideal and imperfect CSI for the area-based pilot-reuse factors we consider.

cs.IT↗

arXiv2021

Optimizing RRH Placement Under a Noise-Limited Point-to-Point Wireless Backhaul

In this paper, we study the deployment decisions and location optimization for the remote radio heads (RRHs) in coordinated distributed networks in the presence of a wireless backhaul. We implement a scheme where the RRHs use zero-forcing beamforming (ZF-BF) for the access channel to jointly serve multiple users, while on the backhaul the RRHs are connected to their central units (CUs) through point-to-point wireless links. We investigate the effect of this scheme on the deployment of the RRHs and on the resulting achievable spectral efficiency over the access channel (under a backhaul outage constraint). Our results show that even for noise-limited backhaul links, a large bandwidth must be allocated to the backhaul to allow freely distributing the RRHs in the network. Additionally, our results show that distributing the available antennas on more RRHs is favored as compared to a more co-located antenna system. This motivates further works to study the efficiency of wireless backhaul schemes and their effect on the performance of coordinated distributed networks with joint transmission.

cs.IT↗

arXiv2021

Resource Allocation and Scheduling in Non-coherent User-centric Cell-free MIMO

We study the problem of user-scheduling and resource allocation in distributed multi-user, multiple-input multiple-output (MIMO) networks implementing user-centric clustering and non-coherent transmission. We formulate a weighted sum-rate maximization problem which can provide user proportional fairness. As in this setup, users can be served by many transmitters, user scheduling is particularly difficult. To solve this issue, we use block coordinate descent, fractional programming, and compressive sensing to construct an algorithm that performs user-scheduling and beamforming. Our results show that the proposed framework provides an 8- to 10-fold gain in the long-term user spectral efficiency compared to benchmark schemes such as round-robin scheduling. Furthermore, we quantify the performance loss due to imperfect channel state information and pilot training overhead using a defined area-based pilot-reuse factor.

cs.IT↗

arXiv2020

Statistical Analysis of Downlink Zero-Forcing Beamforming

We analyze the mean and the variance of the useful signal and interference powers in a multi-cell network using zero-forcing beamforming (ZF-BF) with two beamformer normalization approaches. While the mean has been the main focus in earlier studies on ZF-BF, analysis of the variance has not been tackled. Our analysis provides a complete statistical study, sheds light on the importance of the variance by deriving closed-form expressions for the signals' two moments, and provides a practical use for these expressions; we use the gamma or lognormal distribution for the interference power to analytically calculate the outage.

cs.IT↗

arXiv2019

A Worst-Case Performance Optimization Based Design Approach to Robust Symbol-Level Precoding for Downlink MU-MIMO

This paper addresses the optimization problem of symbol-level precoding (SLP) in the downlink of a multiuser multiple-input multiple-output (MU-MIMO) wireless system while the precoder's output is subject to partially-known distortions. In particular, we assume a linear distortion model with bounded additive noise. The original signal-to-interference-plus-noise ratio (SINR) -constrained SLP problem minimizing the total transmit power is first reformulated as a penalized unconstrained problem, which is referred to as the relaxed robust formulation. We then adopt a worst-case design approach to protect the users' intended symbols and the targeted constructive interference with a desired level of confidence. Due to the non-convexity of the relaxed robust formulation, we propose an iterative algorithm based on the block coordinate ascent-descent method. We show through simulation results that the proposed robust design is flexible in the sense that the CI constraints can be relaxed so as to keep a desirable balance between achievable rate and power consumption. Remarkably, the new formulation yields more energy-efficient solutions for appropriate choices of the penalty parameter, compared to the original problem.

eess.SP↗

arXiv2013

Mobility Diversity in Mobile Wireless Networks

We introduce the novel concept of mobility diversity for mobile sensor or communication networks as the diversity introduced by transmitting data over different topologies of the network. We show how node mobility can provide diversity by changing the topology of the network. More specifically, we consider a mobile network of a sensor node and a number of sink nodes which are all moving randomly according to different Wiener process mobility models. Assuming that the network topology evolves with time and assuming that the connectivity of the sensor node to at least one sink node is needed for successful communication, we calculate three performance measures for this network, i) the expected number of time instants, where the sensor node is connected to at least one sink node, ii) the probability of outage, being the probability that no sink node is in the vicinity of the sensor node during the observation interval, and finally, iii) the maximum number of consequent failures in the communication. Our theoretical and numerical analysis show that increasing the mobility parameter of the sensor node increases the average number of successful transmissions, decreases the probability of outage, and reduces the maximum delay in the senor-sink communication.

cs.NI↗

arXiv2009

Filter-And-Forward Distributed Beamforming in Relay Networks with Frequency Selective Fading

A new approach to distributed cooperative beamforming in relay networks with frequency selective fading is proposed. It is assumed that all the relay nodes are equipped with finite impulse response (FIR) filters and use a filter-and-forward (FF) strategy to compensate for the transmitter-to-relay and relay-to-destination channels. Three relevant half-duplex distributed beamforming problems are considered. The first problem amounts to minimizing the total relay transmitted power subject to the destination quality-of-service (QoS) constraint. In the second and third problems, the destination QoS is maximized subject to the total and individual relay transmitted power constraints, respectively. For the first and second problems, closed-form solutions are obtained, whereas the third problem is solved using convex optimization. The latter convex optimization technique can be also directly extended to the case when the individual and total power constraints should be jointly taken into account. Simulation results demonstrate that in the frequency selective fading case, the proposed FF approach provides substantial performance improvements as compared to the commonly used amplify-and-forward (AF) relay beamforming strategy.

nlin.AO↗