Source author record

Marios Kountouris

Marios Kountouris appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

61works
8topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

61 published item(s)

preprint2026arXiv

MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness

Fairness in machine learning remains challenging due to its ethical complexity, the absence of a universal definition, and the need for context-specific bias metrics. Existing methods still struggle with intersectionality, multiclass settings, and limited flexibility and generality. To address these gaps, we introduce MIFair, a unified framework for bias assessment and mitigation based on mutual information. MIFair provides a flexible metric template and an in-processing mitigation method inspired by the Prejudice Remover, defining group fairness as statistical independence between prediction-derived variables and sensitive attributes. We further strengthen its information-theoretic foundation by establishing equivalences with widely used fairness notions such as independence and separation. MIFair naturally supports intersectionality, complex subgroup structures, and multiclass classification and employs regularization-based training to reduce bias according to the selected metric. Its key advantage is its versatility: it consolidates diverse fairness requirements into a single coherent framework, enabling consistent benchmarking and simplifying practical use. Experiments on real-world tabular and image datasets show that MIFair effectively reduces bias, including previously unaddressed multi-attribute scenarios, while maintaining strong predictive performance across the evaluated settings.

preprint2023arXiv

Communication-Efficient Distributionally Robust Decentralized Learning

Decentralized learning algorithms empower interconnected devices to share data and computational resources to collaboratively train a machine learning model without the aid of a central coordinator. In the case of heterogeneous data distributions at the network nodes, collaboration can yield predictors with unsatisfactory performance for a subset of the devices. For this reason, in this work, we consider the formulation of a distributionally robust decentralized learning task and we propose a decentralized single loop gradient descent/ascent algorithm (AD-GDA) to directly solve the underlying minimax optimization problem. We render our algorithm communication-efficient by employing a compressed consensus scheme and we provide convergence guarantees for smooth convex and non-convex loss functions. Finally, we corroborate the theoretical findings with empirical results that highlight AD-GDA's ability to provide unbiased predictors and to greatly improve communication efficiency compared to existing distributionally robust algorithms.

preprint2023arXiv

Multi-User Distributed Computing Via Compressed Sensing

The multi-user linearly-separable distributed computing problem is considered here, in which $N$ servers help to compute the real-valued functions requested by $K$ users, where each function can be written as a linear combination of up to $L$ (generally non-linear) subfunctions. Each server computes a fraction $γ$ of the subfunctions, then communicates a function of its computed outputs to some of the users, and then each user collects its received data to recover its desired function. Our goal is to bound the ratio between the computation workload done by all servers over the number of datasets. To this end, we here reformulate the real-valued distributed computing problem into a matrix factorization problem and then into a basic sparse recovery problem, where sparsity implies computational savings. Building on this, we first give a simple probabilistic scheme for subfunction assignment, which allows us to upper bound the optimal normalized computation cost as $γ\leq \frac{K}{N}$ that a generally intractable $\ell_0$-minimization would give. To bypass the intractability of such optimal scheme, we show that if these optimal schemes enjoy $γ\leq - r\frac{K}{N}W^{-1}_{-1}(- \frac{2K}{e N r} )$ (where $W_{-1}(\cdot)$ is the Lambert function and $r$ calibrates the communication between servers and users), then they can actually be derived using a tractable Basis Pursuit $\ell_1$-minimization. This newly-revealed connection between distributed computation and compressed sensing opens up the possibility of designing practical distributed computing algorithms by employing tools and methods from compressed sensing.

preprint2022arXiv

A Perspective on Time towards Wireless 6G

With the advent of 5G technology, the notion of latency got a prominent role in wireless connectivity, serving as a proxy term for addressing the requirements for real-time communication. As wireless systems evolve towards 6G, the ambition to immerse the digital into the physical reality will increase. Besides making the real-time requirements more stringent, this immersion will bring the notions of time, simultaneity, presence, and causality to a new level of complexity. A growing body of research points out that latency is insufficient to parameterize all real-time requirements. Notably, one such requirement that received a significant attention is information freshness, defined through the Age of Information (AoI) and its derivatives. The objective of this article is to investigate the general notion of timing in wireless communication systems and networks and its relation to effective information generation, processing, transmission, and reconstruction at the senders and receivers. We establish a general statistical framework of timing requirements in wireless communication systems, which subsumes both latency and AoI. The framework is made by associating a timing component with the two basic statistical operations, decision and estimation. We first use the framework to present a representative sample of the existing works that deal with timing in wireless communication. Next, it is shown how the framework can be used with different communication models of increasing complexity, starting from the basic Shannon one-way communication model and arriving to communication models for consensus, distributed learning, and inference. Overall, this paper fills an important gap in the literature by providing a systematic treatment of various timing measures in wireless communication and sets the basis for design and optimization for the next-generation real-time systems.

preprint2022arXiv

Affine Frequency Division Multiplexing for Next Generation Wireless Communications

Affine Frequency Division Multiplexing (AFDM), a new chirp-based multicarrier waveform for high mobility communications, is introduced here. AFDM is based on discrete affine Fourier transform (DAFT), a generalization of discrete Fourier transform, which is characterized by two parameters that can be adapted to better cope with doubly dispersive channels. First, we derive the explicit input-output relation in the DAFT domain showing the effect of AFDM parameters in the input-output relation. Second, we show how the DAFT parameters underlying AFDM have to be set so that the resulting DAFT domain impulse response conveys a full delay-Doppler representation of the channel. Then, we show analytically that AFDM can achieve full diversity in doubly dispersive channels, where full diversity refers to the number of multipath components separable in either the delay or the Doppler domain, due to its full delay-Doppler representation. Furthermore, we present a low complexity detection method taking advantage of zero-padding. We also propose an embedded pilot-aided channel estimation scheme for AFDM, in which both channel estimation and data detection are performed within the same AFDM frame. Finally, simulations corroborate the validity of our analytical results and show the significant performance gains of AFDM over state-of-the-art multicarrier schemes in high mobility scenarios.

preprint2022arXiv

Asynchronous Decentralized Learning over Unreliable Wireless Networks

Decentralized learning enables edge users to collaboratively train models by exchanging information via device-to-device communication, yet prior works have been limited to wireless networks with fixed topologies and reliable workers. In this work, we propose an asynchronous decentralized stochastic gradient descent (DSGD) algorithm, which is robust to the inherent computation and communication failures occurring at the wireless network edge. We theoretically analyze its performance and establish a non-asymptotic convergence guarantee. Experimental results corroborate our analysis, demonstrating the benefits of asynchronicity and outdated gradient information reuse in decentralized learning over unreliable wireless networks.

preprint2022arXiv

Deep Reinforcement Learning for Resource Constrained Multiclass Scheduling in Wireless Networks

The problem of resource constrained scheduling in a dynamic and heterogeneous wireless setting is considered here. In our setup, the available limited bandwidth resources are allocated in order to serve randomly arriving service demands, which in turn belong to different classes in terms of payload data requirement, delay tolerance, and importance/priority. In addition to heterogeneous traffic, another major challenge stems from random service rates due to time-varying wireless communication channels. Various approaches for scheduling and resource allocation can be used, ranging from simple greedy heuristics and constrained optimization to combinatorics. Those methods are tailored to specific network or application configuration and are usually suboptimal. To this purpose, we resort to deep reinforcement learning (DRL) and propose a distributional Deep Deterministic Policy Gradient (DDPG) algorithm combined with Deep Sets to tackle the aforementioned problem. Furthermore, we present a novel way to use a Dueling Network, which leads to further performance improvement. Our proposed algorithm is tested on both synthetic and real data, showing consistent gains against state-of-the-art conventional methods from combinatorics, optimization, and scheduling metrics.

preprint2022arXiv

Low complexity equalization for AFDM in doubly dispersive channels

Affine Frequency Division Multiplexing (AFDM), which is based on discrete affine Fourier transform (DAFT), has recently been proposed for reliable communication in high-mobility scenarios. Two low complexity detectors for AFDM are introduced here. Approximating the channel matrix as a band matrix via placing null symbols in the AFDM frame in the DAFT domain, a low complexity MMSE detection is proposed by means of the $\rm{LDL}$ factorization. Furthermore, exploiting the sparsity of the channel matrix, we propose a low complexity iterative decision feedback equalizer (DFE) based on weighted maximal ratio combining (MRC), which extracts and combines the received multipath components of the transmitted symbols in the DAFT domain. Simulation results show that the proposed detectors have similar performance, while weighted MRC-based DFE has lower complexity than band-matrix-approximation LMMSE when the channel impulse response has gaps.

preprint2022arXiv

Robust Bayesian Learning for Reliable Wireless AI: Framework and Applications

This work takes a critical look at the application of conventional machine learning methods to wireless communication problems through the lens of reliability and robustness. Deep learning techniques adopt a frequentist framework, and are known to provide poorly calibrated decisions that do not reproduce the true uncertainty caused by limitations in the size of the training data. Bayesian learning, while in principle capable of addressing this shortcoming, is in practice impaired by model misspecification and by the presence of outliers. Both problems are pervasive in wireless communication settings, in which the capacity of machine learning models is subject to resource constraints and training data is affected by noise and interference. In this context, we explore the application of the framework of robust Bayesian learning. After a tutorial-style introduction to robust Bayesian learning, we showcase the merits of robust Bayesian learning on several important wireless communication problems in terms of accuracy, calibration, and robustness to outliers and misspecification.

preprint2022arXiv

Semantics-Aware Source Coding in Status Update Systems

We consider a communication system in which the destination receives status updates from an information source that observes a physical process. The transmitter performs semantics-empowered filtering as a means to send only the most "important" samples to the receiver in a timely manner. As a first step, we explore a simple policy where the transmitter selects to encode only a fraction of the least frequent realizations of the observed random phenomenon, treating the remaining ones as not informative. For this timely source coding problem, we derive the optimal codeword lengths in the sense of maximizing a semantics-aware utility function and minimizing a quadratic average length cost. Our numerical results show the optimal number of updates to transmit for different arrival rates and encoding costs and corroborate that semantic filtering results in higher performance in terms of timely delivery of important updates.

preprint2022arXiv

UAV-Aided Decentralized Learning over Mesh Networks

Decentralized learning empowers wireless network devices to collaboratively train a machine learning (ML) model relying solely on device-to-device (D2D) communication. It is known that the convergence speed of decentralized optimization algorithms severely depends on the degree of the network connectivity, with denser network topologies leading to shorter convergence time. Consequently, the local connectivity of real world mesh networks, due to the limited communication range of its wireless nodes, undermines the efficiency of decentralized learning protocols, rendering them potentially impracticable. In this work we investigate the role of an unmanned aerial vehicle (UAV), used as flying relay, in facilitating decentralized learning procedures in such challenging conditions. We propose an optimized UAV trajectory, that is defined as a sequence of waypoints that the UAV visits sequentially in order to transfer intelligence across sparsely connected group of users. We then provide a series of experiments highlighting the essential role of UAVs in the context of decentralized learning over mesh networks.

preprint2020arXiv

Team Deep Mixture of Experts for Distributed Power Control

In the context of wireless networking, it was recently shown that multiple DNNs can be jointly trained to offer a desired collaborative behaviour capable of coping with a broad range of sensing uncertainties. In particular, it was established that DNNs can be used to derive policies that are robust with respect to the information noise statistic affecting the local information (e.g. CSI in a wireless network) used by each agent (e.g. transmitter) to make its decision. While promising, a major challenge in the implementation of such method is that information noise statistics may differ from agent to agent and, more importantly, that such statistics may not be available at the time of training or may evolve over time, making burdensome retraining necessary. This situation makes it desirable to devise a "universal" machine learning model, which can be trained once for all so as to allow for decentralized cooperation in any future feedback noise environment. With this goal in mind, we propose an architecture inspired from the well-known Mixture of Experts (MoE) model, which was previously used for non-linear regression and classification tasks in various contexts, such as computer vision and speech recognition. We consider the decentralized power control problem as an example to showcase the validity of the proposed model and to compare it against other power control algorithms. We show the ability of the so called Team-DMoE model to efficiently track time-varying statistical scenarios.

preprint2016arXiv

An Overview on Resource Allocation Techniques for Multi-User MIMO Systems

Remarkable research activities and major advances have been occurred over the past decade in multiuser multiple-input multiple-output (MU-MIMO) systems. Several transmission technologies and precoding techniques have been developed in order to exploit the spatial dimension so that simultaneous transmission of independent data streams reuse the same radio resources. The achievable performance of such techniques heavily depends on the channel characteristics of the selected users, the amount of channel knowledge, and how efficiently interference is mitigated. In systems where the total number of receivers is larger than the number of total transmit antennas, user selection becomes a key approach to benefit from multiuser diversity and achieve full multiplexing gain. The overall performance of MU-MIMO systems is a complex joint multi-objective optimization problem since many variables and parameters have to be optimized, including the number of users, the number of antennas, spatial signaling, rate and power allocation, and transmission technique. The objective of this literature survey is to provide a comprehensive overview of the various methodologies used to approach the aforementioned joint optimization task in the downlink of MU-MIMO communication systems.

preprint2016arXiv

Cooperative Caching and Transmission Design in Cluster-Centric Small Cell Networks

Wireless content caching in small cell networks (SCNs) has recently been considered as an efficient way to reduce the traffic and the energy consumption of the backhaul in emerging heterogeneous cellular networks (HetNets). In this paper, we consider a cluster-centric SCN with combined design of cooperative caching and transmission policy. Small base stations (SBSs) are grouped into disjoint clusters, in which in-cluster cache space is utilized as an entity. We propose a combined caching scheme where part of the available cache space is reserved for caching the most popular content in every SBS, while the remaining is used for cooperatively caching different partitions of the less popular content in different SBSs, as a means to increase local content diversity. Depending on the availability and placement of the requested content, coordinated multipoint (CoMP) technique with either joint transmission (JT) or parallel transmission (PT) is used to deliver content to the served user. Using Poisson point process (PPP) for the SBS location distribution and a hexagonal grid model for the clusters, we provide analytical results on the successful content delivery probability of both transmission schemes for a user located at the cluster center. Our analysis shows an inherent tradeoff between transmission diversity and content diversity in our combined caching-transmission design. We also study optimal cache space assignment for two objective functions: maximization of the cache service performance and the energy efficiency. Simulation results show that the proposed scheme achieves performance gain by leveraging cache-level and signal-level cooperation and adapting to the network environment and user QoS requirements.

preprint2016arXiv

Coverage and capacity scaling laws in downlink ultra-dense cellular networks

Driven by new types of wireless devices and the proliferation of bandwidth-intensive applications, data traffic and the corresponding network load are increasing dramatically. Network densification has been recognized as a promising and efficient way to provide higher network capacity and enhanced coverage. Most prior work on performance analysis of ultra-dense networks (UDNs) has focused on random spatial deployment with idealized singular path loss models and Rayleigh fading. In this paper, we consider a more precise and general model, which incorporates multi-slope path loss and general fading distributions. We derive the tail behavior and scaling laws for the coverage probability and the capacity considering strongest base station association in a Poisson field network. Our analytical results identify the regimes in which the signal-to-interference-plus-noise ratio (SINR) either asymptotically grows, saturates, or decreases with increasing network density. We establish general results on when UDNs lead to worse or even zero SINR coverage and capacity, and we provide crisp insights on the fundamental limits of wireless network densification.

preprint2016arXiv

Decentralized Opportunistic Access for D2D Underlaid Cellular Networks

We propose a decentralized access control scheme for interference management in D2D (device-to-device) underlaid cellular networks. Our method combines SIR-aware link activation with cellular exclusion regions in a case where D2D links opportunistically access the licensed cellular spectrum. Analytical expressions and tight approximations for the coverage probabilities of cellular and D2D links are derived. We characterize the impact of the guard zone radius and the SIR threshold on the D2D area spectral efficiency and cellular coverage. A tractable approach was proposed in order to find the SIR threshold and guard zone radius, which maximize the area spectral efficiency of the D2D communication while ensuring sufficient coverage probability for cellular uplink users. Simulations validate the accuracy of our analytical results and show the performance gain of our proposed scheme compared to existing state-of-the-art solutions.

preprint2016arXiv

Deploying Dense Networks for Maximal Energy Efficiency: Small Cells Meet Massive MIMO

How would a cellular network designed for maximal energy efficiency look like? To answer this fundamental question, tools from stochastic geometry are used in this paper to model future cellular networks and obtain a new lower bound on the average uplink spectral efficiency. This enables us to formulate a tractable uplink energy efficiency (EE) maximization problem and solve it analytically with respect to the density of base stations (BSs), the transmit power levels, the number of BS antennas and users per cell, and the pilot reuse factor. The closed-form expressions obtained from this general EE maximization framework provide valuable insights on the interplay between the optimization variables, hardware characteristics, and propagation environment. Small cells are proved to give high EE, but the EE improvement saturates quickly with the BS density. Interestingly, the maximal EE is achieved by also equipping the BSs with multiple antennas and operate in a "massive MIMO" fashion, where the array gain from coherent detection mitigates interference and the multiplexing of many users reduces the energy cost per user.

preprint2016arXiv

Edge Caching for Coverage and Capacity-aided Heterogeneous Networks

A two-tier heterogeneous cellular network (HCN) with intra-tier and inter-tier dependence is studied. The macro cell deployment follows a Poisson point process (PPP) and two different clustered point processes are used to model the cache-enabled small cells. Under this model, we derive approximate expressions in terms of finite integrals for the average delivery rate considering inter-tier and intra-tier dependence. On top of the fact that cache size drastically improves the performance of small cells in terms of average delivery rate, we show that rate splitting of limited-backhaul induces non-linear performance variations, and therefore has to be adjusted for rate fairness among users of different tiers.

preprint2016arXiv

Impact of LOS/NLOS Propagation and Path Loss in Ultra-Dense Cellular Networks

Most prior work on performance analysis of ultra-dense cellular networks (UDNs) has considered standard power-law path loss models and non-line-of-sight (NLOS) propagation modeled by Rayleigh fading. The effect of line-of-sight (LOS) on coverage and throughput and its implication on network densification are still not fully understood. In this paper, we investigate the performance of UDNs when the signal propagation includes both LOS and NLOS components. Using a stochastic geometry based cellular network model, we derive expressions for the coverage probability, as well as tight approximations and upper bounds for both closest and strongest base station (BS) association. Our results show that under standard singular path loss model, LOS propagation increases the coverage, especially with nearest BS association. On the contrary, using dual slope path loss, LOS propagation is beneficial with closest BS association and detrimental for strongest BS association.

preprint2016arXiv

On the Delay of Geographical Caching Methods in Two-Tiered Heterogeneous Networks

We consider a hierarchical network that consists of mobile users, a two-tiered cellular network (namely small cells and macro cells) and central routers, each of which follows a Poisson point process (PPP). In this scenario, small cells with limited-capacity backhaul are able to cache content under a given set of randomized caching policies and storage constraints. Moreover, we consider three different content popularity models, namely fixed content popularity, distance-dependent and load-dependent, in order to model the spatio-temporal behavior of users' content request patterns. We derive expressions for the average delay of users assuming perfect knowledge of content popularity distributions and randomized caching policies. Although the trend of the average delay for all three content popularity models is essentially identical, our results show that the overall performance of cached-enabled heterogeneous networks can be substantially improved, especially under the load-dependent content popularity model.

preprint2016arXiv

On the Performance of Delay Aware Shared Access with Priorities

In this paper, we analyze a shared access network with a fixed primary node and randomly distributed secondary nodes whose distribution follows a Poisson point process (PPP). The secondaries use a random access protocol allowing them to access the channel with probabilities that depend on the queue size of the primary. Assuming a system with multipacket reception (MPR) receivers having bursty packet arrivals at the primary and saturation at the secondaries, our protocol can be tuned to alleviate congestion at the primary. We study the throughput of the secondary network and the primary average delay, as well as the impact of the secondary node access probability and transmit power. We formulate an optimization problem to maximize the throughput of the secondary network under delay constraints for the primary node, which in the case that no congestion control is performed has a closed form expression providing the optimal access probability. Our numerical results illustrate the impact of network operating parameters on the performance of the proposed priority-based shared access protocol.

preprint2016arXiv

Optimal Low-Complexity Self-Interference Cancellation for Full-Duplex MIMO Small Cells

Self-interference (SI) significantly limits the performance of full-duplex (FD) radio devices if not properly cancelled. State-of-the-art SI cancellation (SIC) techniques at the receive chain implicitly set an upper bound on the transmit power of the device. This paper starts from this observation and proposes a transmit beamforming design for FD multiple-antenna radios that: i) leverages the inherent SIC capabilities at the receiver and the channel state information; and ii) exploits the potential of multiple antennas in terms of spatial SIC. The proposed solution not only maximizes the throughput while complying with the SIC requirements of the FD device, but also enjoys a very low complexity that allows it to outperform state-of-the-art counterparts in terms of processing time and power requirements. Numerical results show that our transmit beamforming design achieves significant gains with respect to applying zero-forcing to the SI channel when the number of transmit antennas is small to moderate, which makes it particularly appealing for FD small-cell base stations.

preprint2016arXiv

Performance Analysis of Partial Interference Cancellation in Multi-Antenna UDNs

The employment of partial zero-forcing (PZF) receivers at the base stations represents an efficient and low-complexity technique for uplink interference management in cellular networks. In this paper, we focus on the performance analysis of ultra-dense networks (UDNs) in which the multi-antenna receivers adopt PZF. We provide both integral expressions and tight closed-form approximations for the probability of successful transmission, which can be used to accurately evaluate the optimal tradeoff between interference cancellation and array gain. Numerical results show that no more than half of the available degrees of freedom should be used for interference cancellation.

preprint2016arXiv

Performance Evaluation of User Scheduling for Full-Duplex Small Cells in Ultra-Dense Networks

Full-duplex (FD) communication is an emerging technology that can potentially double the throughput of cellular networks. Preliminary studies in single-cell or small FD network deployments have revealed promising rate gains using self-interference cancellation (SIC) techniques and receive processing. Nevertheless, the system-level performance gains of FD small cells in ultra-dense networks (UDNs) have not been fully investigated yet. In this paper, we evaluate the performance of resource allocation in ultra-dense FD small-cell networks using spatial stochastic models for the network layout and 3GPP channel models. More specifically, we consider various UDN scenarios and assess the performance of different low-complexity user-scheduling schemes and power allocation between uplink and downlink. We also provide useful insights into the effect of the SIC capability on the network throughput.

preprint2016arXiv

Probabilistic Caching in Wireless D2D Networks: Cache Hit Optimal vs. Throughput Optimal

Departing from the conventional cache hit optimization in cache-enabled wireless networks, we consider an alternative optimization approach for the probabilistic caching placement in stochastic wireless D2D caching networks taking into account the reliability of D2D transmissions. Using tools from stochastic geometry, we provide a closed-form approximation of cache-aided throughput, which measures the density of successfully served requests by local device caches, and we obtain the optimal caching probabilities with numerical optimization. Compared to the cache-hit-optimal case, the optimal caching probabilities obtained by cache-aided throughput optimization show notable gain in terms of the density of successfully served user requests, particularly in dense user environments.

preprint2016arXiv

Spectrum Pooling in MmWave Networks: Opportunities, Challenges, and Enablers

Motivated by the intrinsic characteristics of mmWave technologies, we discuss the possibility of an authorization regime that allows spectrum sharing between multiple operators, also referred to as spectrum pooling. In particular, considering user rate as the performance measure, we assess the benefit of coordination among the networks of different operators, study the impact of beamforming both at the base stations and at the user terminals, and analyze the pooling performance at different frequency carriers. We also discuss the enabling spectrum mechanisms, architectures, and protocols required to make spectrum pooling work in real networks. Our initial results show that, from a technical perspective, spectrum pooling at mmWave has the potential for a more efficient spectrum use than a traditional exclusive spectrum allocation to a single operator. However, further studies are needed in order to reach a thorough understanding of this matter, and we hope that this paper will help stimulate further research in this area.

preprint2016arXiv

Stable Throughput Region of the Two-User Broadcast Channel

In this paper we consider the two-user broadcast channel and we characterize its stable throughout region. We start the analysis by providing the stability region for the general case without any specific considerations on transmission and reception mechanisms. We also provide conditions for the stable throughput region to be convex. Subsequently, we consider the case where the transmitter uses superposition coding and we consider two special cases for the receivers. The first one is when both receivers treat interference as noise. The second is when the user with a better channel uses successive decoding and the other receiver treats interference as noise.

preprint2016arXiv

The Stability Region of the Two-User Broadcast Channel

In this paper, we characterize the stability region of the two-user broadcast channel. First, we obtain the stability region in the general case. Second, we consider the particular case where each receiver treats the interfering signal as noise, as well as the case in which the packets are transmitted using superposition coding and successive decoding is employed at the strong receiver.

preprint2016arXiv

User Scheduling and Optimal Power Allocation for Full-Duplex Cellular Networks

The problem of user scheduling and power allocation in full-duplex (FD) cellular networks is considered, where a FD base station communicates simultaneously with one half-duplex (HD) user on each downlink and uplink channel. First, we propose low complexity user scheduling algorithms aiming at maximizing the sum rate of the considered FD system. Second, we derive the optimal power allocation for the two communication links, which is then exploited to introduce efficient metrics for FD/HD mode switching in the scheduling procedure, in order to further boost the system rate performance. We analyze the average sum rate of the proposed algorithms over Rayleigh fading and provide closed-form expressions. Our representative performance evaluation results for the algorithms with and without optimal power control offer useful insights on the interplay among rate, transmit powers, self-interference (SI) cancellation capability, and available number of users in the system.

preprint2015arXiv

Cache-enabled Small Cell Networks: Modeling and Tradeoffs

We consider a network model where small base stations (SBSs) have caching capabilities as a means to alleviate the backhaul load and satisfy users' demand. The SBSs are stochastically distributed over the plane according to a Poisson point process (PPP), and serve their users either (i) by bringing the content from the Internet through a finite rate backhaul or (ii) by serving them from the local caches. We derive closed-form expressions for the outage probability and the average delivery rate as a function of the signal-to-interference-plus-noise ratio (SINR), SBS density, target file bitrate, storage size, file length and file popularity. We then analyze the impact of key operating parameters on the system performance. It is shown that a certain outage probability can be achieved either by increasing the number of base stations or the total storage size. Our results and analysis provide key insights into the deployment of cache-enabled small cell networks (SCNs), which are seen as a promising solution for future heterogeneous cellular networks.

preprint2015arXiv

Caching at the Edge: a Green Perspective for 5G Networks

Endowed with context-awareness and proactive capabilities, caching users' content locally at the edge of the network is able to cope with increasing data traffic demand in 5G wireless networks. In this work, we focus on the energy consumption aspects of cache-enabled wireless cellular networks, specifically in terms of area power consumption (APC) and energy efficiency (EE). We assume that both base stations (BSs) and mobile users are distributed according to homogeneous Poisson point processes (PPPs) and we introduce a detailed power model that takes into account caching. We study the conditions under which the area power consumption is minimized with respect to BS transmit power, while ensuring a certain quality of service (QoS) in terms of coverage probability. Furthermore, we provide the optimal BS transmit power that maximizes the area spectral efficiency per unit total power spent. The main takeaway of this paper is that caching seems to be an energy efficient solution.

preprint2015arXiv

Designing Wireless Broadband Access for Energy Efficiency: Are Small Cells the Only Answer?

The main usage of cellular networks has changed from voice to data traffic, mostly requested by static users. In this paper, we analyze how a cellular network should be designed to provide such wireless broadband access with maximal energy efficiency (EE). Using stochastic geometry and a detailed power consumption model, we optimize the density of access points (APs), number of antennas and users per AP, and transmission power for maximal EE. Small cells are of course a key technology in this direction, but the analysis shows that the EE improvement of a small-cell network saturates quickly with the AP density and then "massive MIMO" techniques can further improve the EE.

preprint2015arXiv

Effect of Energy Harvesting on Stable Throughput in Cooperative Relay Systems

In this paper, the impact of energy constraints on a two-hop network with a source, a relay and a destination under random medium access is studied. A collision channel with erasures is considered, and the source and the relay nodes have energy harvesting capabilities and an unlimited battery to store the harvested energy. Additionally, the source and the relay node have external traffic arrivals and the relay forwards a fraction of the source node's traffic to the destination; the cooperation is performed at the network level. An inner and an outer bound of the stability region for a given transmission probability vector are obtained. Then, the closure of the inner and the outer bound is obtained separately and they turn out to be identical. This work is not only a step in connecting information theory and networking, by studying the maximum stable throughput region metric but also it taps the relatively unexplored and important domain of energy harvesting and assesses the effect of that on this important measure.

preprint2015arXiv

Energy Efficiency and Sum Rate Tradeoffs for Massive MIMO Systems with Underlaid Device-to-Device Communications

In this paper, we investigate the coexistence of two technologies that have been put forward for the fifth generation (5G) of cellular networks, namely, network-assisted device-to-device (D2D) communications and massive MIMO (multiple-input multiple-output). Potential benefits of both technologies are known individually, but the tradeoffs resulting from their coexistence have not been adequately addressed. To this end, we assume that D2D users reuse the downlink resources of cellular networks in an underlay fashion. In addition, multiple antennas at the BS are used in order to obtain precoding gains and simultaneously support multiple cellular users using multiuser or massive MIMO technique. Two metrics are considered, namely the average sum rate (ASR) and energy efficiency (EE). We derive tractable and directly computable expressions and study the tradeoffs between the ASR and EE as functions of the number of BS antennas, the number of cellular users and the density of D2D users within a given coverage area. Our results show that both the ASR and EE behave differently in scenarios with low and high density of D2D users, and that coexistence of underlay D2D communications and massive MIMO is mainly beneficial in low densities of D2D users.

preprint2015arXiv

Energy Efficiency and Sum Rate when Massive MIMO meets Device-to-Device Communication

This paper considers a scenario of short-range communication, known as device-to-device (D2D) communication, where D2D users reuse the downlink resources of a cellular network to transmit directly to their corresponding receivers. In addition, multiple antennas at the base station (BS) are used in order to simultaneously support multiple cellular users using multiuser or massive MIMO. The network model considers a fixed number of cellular users and that D2D users are distributed according to a homogeneous Poisson point process (PPP). Two metrics are studied, namely, average sum rate (ASR) and energy efficiency (EE). We derive tractable expressions and study the tradeoffs between the ASR and EE as functions of the number of BS antennas and density of D2D users for a given coverage area.

preprint2015arXiv

Energy-Efficient Future Wireless Networks: A Marriage between Massive MIMO and Small Cells

How would a cellular network designed for high energy efficiency look like? To answer this fundamental question, we model cellular networks using stochastic geometry and optimize the energy efficiency with respect to the density of base stations, the number of antennas and users per cell, the transmit power levels, and the pilot reuse. The highest efficiency is neither achieved by a pure small-cell approach, nor by a pure massive MIMO solution. Interestingly, it is the combination of these approaches that provides the highest energy efficiency; small cells contributes by reducing the propagation losses while massive MIMO enables multiplexing of users with controlled interference.

preprint2015arXiv

Full-Duplex MIMO Small-Cell Networks: Performance Analysis

Full-duplex small-cell relays with multiple antennas constitute a core element of the envisioned 5G network architecture. In this paper, we use stochastic geometry to analyze the performance of wireless networks with full-duplex multiple-antenna small cells, with particular emphasis on the probability of successful transmission. To achieve this goal, we additionally characterize the distribution of the self-interference power of the full-duplex nodes. The proposed framework reveals useful insights on the benefits of full-duplex with respect to half-duplex in terms of network throughput.

preprint2015arXiv

Maximal Ratio Transmission in Wireless Poisson Networks under Spatially Correlated Fading Channels

The downlink of a wireless network where multi-antenna base stations (BSs) communicate with single-antenna mobile stations (MSs) using maximal ratio transmission (MRT) is considered here. The locations of BSs are modeled by a homogeneous Poisson point process (PPP) and the channel gains between the multiple antennas of each BS and the single antenna of each MS are modeled as spatially arbitrarily correlated Rayleigh random variables. We first present novel closed-form expressions for the distribution of the power of the interference resulting from the coexistence of one intended and one unintended MRT over the considered correlated fading channels. The derived expressions are then used to obtain closed-form expressions for the success probability and area spectral efficiency of the wireless communication network under investigation. Simulation results corroborate the validity of the presented expressions. A key result of this work is that the effect of spatial correlation on the network throughput may be contrasting depending on the density of BSs, the signal-to-interference-plus-noise ratio (SINR) level, and the background noise power.

preprint2015arXiv

Relay-assisted Multiple Access with Full-duplex Multi-Packet Reception

The effect of full-duplex cooperative relaying in a random access multiuser network is investigated here. First, we model the self-interference incurred due to full-duplex operation, assuming multi-packet reception capabilities for both the relay and the destination node. Traffic at the source nodes is considered saturated and the cooperative relay, which does not have packets of its own, stores a source packet that it receives successfully in its queue when the transmission to the destination has failed. We obtain analytical expressions for key performance metrics at the relay, such as arrival and service rates, stability conditions, and average queue length, as functions of the transmission probabilities, the self interference coefficient, and the links' outage probabilities. Furthermore, we study the impact of the relay node and the self-interference coefficient on the per-user and aggregate throughput, and the average delay per packet. We show that perfect self-interference cancelation plays a crucial role when the SINR threshold is small, since it may result to worse performance in throughput and delay comparing with the half-duplex case. This is because perfect self-interference cancelation can cause an unstable queue at the relay under some conditions.

preprint2015arXiv

Renewable Powered Cellular Networks: Energy Field Modeling and Network Coverage

Powering radio access networks using renewables, such as wind and solar power, promises dramatic reduction in the network operation cost and the network carbon footprints. However, the spatial variation of the energy field can lead to fluctuations in power supplied to the network and thereby affects its coverage. This warrants research on quantifying the aforementioned negative effect and countermeasure techniques, motivating the current work. First, a novel energy field model is presented, in which fixed maximum energy intensity $γ$ occurs at Poisson distributed locations, called energy centers. The intensities fall off from the centers following an exponential decay function of squared distance and the energy intensity at an arbitrary location is given by the decayed intensity from the nearest energy center. The product between the energy center density and the exponential rate of the decay function, denoted as $ψ$, is shown to determine the energy field distribution. Next, the paper considers a cellular downlink network powered by harvesting energy from the energy field and analyzes its network coverage. For the case of harvesters deployed at the same sites as base stations (BSs), as $γ$ increases, the mobile outage probability is shown to scale as $(c γ^{-πψ}+p)$, where $p$ is the outage probability corresponding to a flat energy field and $c$ a constant. Subsequently, a simple scheme is proposed for counteracting the energy randomness by spatial averaging. Specifically, distributed harvesters are deployed in clusters and the generated energy from the same cluster is aggregated and then redistributed to BSs. As the cluster size increases, the power supplied to each BS is shown to converge to a constant proportional to the number of harvesters per BS.

preprint2015arXiv

Throughput of a Cognitive Radio Network under Congestion Constraints: A Network-Level Study

In this paper we analyze a cognitive radio network with one primary and one secondary transmitter, in which the primary transmitter has bursty arrivals while the secondary node is assumed to be saturated (i.e. always has a packet waiting to be transmitted). The secondary node transmits in a cognitive way such that it does not impede the performance of the primary node. We assume that the receivers have multipacket reception (MPR) capabilities and that the secondary node can take advantage of the MPR capability by transmitting simultaneously with the primary under certain conditions. We obtain analytical expressions for the stationary distribution of the primary node queue and we also provide conditions for its stability. Finally, we provide expressions for the aggregate throughput of the network as well as for the throughput at the secondary node.

preprint2014arXiv

Distributed SIR-Aware Opportunistic Access Control for D2D Underlaid Cellular Networks

In this paper, we propose a distributed interference and channel-aware opportunistic access control technique for D2D underlaid cellular networks, in which each potential D2D link is active whenever its estimated signal-to-interference ratio (SIR) is above a predetermined threshold so as to maximize the D2D area spectral efficiency. The objective of our SIR-aware opportunistic access scheme is to provide sufficient coverage probability and to increase the aggregate rate of D2D links by harnessing interference caused by dense underlaid D2D users using an adaptive decision activation threshold. We determine the optimum D2D activation probability and threshold, building on analytical expressions for the coverage probabilities and area spectral efficiency of D2D links derived using stochastic geometry. Specifically, we provide two expressions for the optimal SIR threshold, which can be applied in a decentralized way on each D2D link, so as to maximize the D2D area spectral efficiency derived using the unconditional and conditional D2D success probability respectively. Simulation results in different network settings show the performance gains of both SIR-aware threshold scheduling methods in terms of D2D link coverage probability, area spectral efficiency, and average sum rate compared to existing channel-aware access schemes.

preprint2014arXiv

Massive MIMO Systems with Non-Ideal Hardware: Energy Efficiency, Estimation, and Capacity Limits

The use of large-scale antenna arrays can bring substantial improvements in energy and/or spectral efficiency to wireless systems due to the greatly improved spatial resolution and array gain. Recent works in the field of massive multiple-input multiple-output (MIMO) show that the user channels decorrelate when the number of antennas at the base stations (BSs) increases, thus strong signal gains are achievable with little inter-user interference. Since these results rely on asymptotics, it is important to investigate whether the conventional system models are reasonable in this asymptotic regime. This paper considers a new system model that incorporates general transceiver hardware impairments at both the BSs (equipped with large antenna arrays) and the single-antenna user equipments (UEs). As opposed to the conventional case of ideal hardware, we show that hardware impairments create finite ceilings on the channel estimation accuracy and on the downlink/uplink capacity of each UE. Surprisingly, the capacity is mainly limited by the hardware at the UE, while the impact of impairments in the large-scale arrays vanishes asymptotically and inter-user interference (in particular, pilot contamination) becomes negligible. Furthermore, we prove that the huge degrees of freedom offered by massive MIMO can be used to reduce the transmit power and/or to tolerate larger hardware impairments, which allows for the use of inexpensive and energy-efficient antenna elements.

preprint2014arXiv

Receive Combining vs. Multi-Stream Multiplexing in Downlink Systems with Multi-Antenna Users

In downlink multi-antenna systems with many users, the multiplexing gain is strictly limited by the number of transmit antennas $N$ and the use of these antennas. Assuming that the total number of receive antennas at the multi-antenna users is much larger than $N$, the maximal multiplexing gain can be achieved with many different transmission/reception strategies. For example, the excess number of receive antennas can be utilized to schedule users with effective channels that are near-orthogonal, for multi-stream multiplexing to users with well-conditioned channels, and/or to enable interference-aware receive combining. In this paper, we try to answer the question if the $N$ data streams should be divided among few users (many streams per user) or many users (few streams per user, enabling receive combining). Analytic results are derived to show how user selection, spatial correlation, heterogeneous user conditions, and imperfect channel acquisition (quantization or estimation errors) affect the performance when sending the maximal number of streams or one stream per scheduled user---the two extremes in data stream allocation. While contradicting observations on this topic have been reported in prior works, we show that selecting many users and allocating one stream per user (i.e., exploiting receive combining) is the best candidate under realistic conditions. This is explained by the provably stronger resilience towards spatial correlation and the larger benefit from multi-user diversity. This fundamental result has positive implications for the design of downlink systems as it reduces the hardware requirements at the user devices and simplifies the throughput optimization.

preprint2013arXiv

Downlink MIMO HetNets: Modeling, Ordering Results and Performance Analysis

We develop a general downlink model for multi-antenna heterogeneous cellular networks (HetNets), where base stations (BSs) across tiers may differ in terms of transmit power, target signal-to-interference-ratio (SIR), deployment density, number of transmit antennas and the type of multi-antenna transmission. In particular, we consider and compare space division multiple access (SDMA), single user beamforming (SU-BF), and baseline single-input single-output (SISO) transmission. For this general model, the main contributions are: (i) ordering results for both coverage probability and per user rate in closed form for any BS distribution for the three considered techniques, using novel tools from stochastic orders, (ii) upper bounds on the coverage probability assuming a Poisson BS distribution, and (iii) a comparison of the area spectral efficiency (ASE). The analysis concretely demonstrates, for example, that for a given total number of transmit antennas in the network, it is preferable to spread them across many single-antenna BSs vs. fewer multi-antenna BSs. Another observation is that SU-BF provides higher coverage and per user data rate than SDMA, but SDMA is in some cases better in terms of ASE.

preprint2013arXiv

Hardware Impairments in Large-scale MISO Systems: Energy Efficiency, Estimation, and Capacity Limits

The use of large-scale antenna arrays has the potential to bring substantial improvements in energy efficiency and/or spectral efficiency to future wireless systems, due to the greatly improved spatial beamforming resolution. Recent asymptotic results show that by increasing the number of antennas one can achieve a large array gain and at the same time naturally decorrelate the user channels; thus, the available energy can be focused very accurately at the intended destinations without causing much inter-user interference. Since these results rely on asymptotics, it is important to investigate whether the conventional system models are still reasonable in the asymptotic regimes. This paper analyzes the fundamental limits of large-scale multiple-input single-output (MISO) communication systems using a generalized system model that accounts for transceiver hardware impairments. As opposed to the case of ideal hardware, we show that these practical impairments create finite ceilings on the estimation accuracy and capacity of large-scale MISO systems. Surprisingly, the performance is only limited by the hardware at the single-antenna user terminal, while the impact of impairments at the large-scale array vanishes asymptotically. Furthermore, we show that an arbitrarily high energy efficiency can be achieved by reducing the power while increasing the number of antennas.

preprint2013arXiv

HetNets and Massive MIMO: Modeling, Potential Gains, and Performance Analysis

We consider a heterogeneous cellular network (HetNet) where a macrocell tier with a large antenna array base station (BS) is overlaid with a dense tier of small cells (SCs). We investigate the potential benefits of incorporating a massive MIMO BS in a TDD-based HetNet and we provide analytical expressions for the coverage probability and the area spectral efficiency using stochastic geometry. The duplexing mode in which SCs should operate during uplink macrocell transmissions is optimized. Furthermore, we consider a reverse TDD scheme, in which the massive MIMO BS can estimate the SC interference covariance matrix. Our results suggest that significant throughput improvement can be achieved by exploiting interference nulling and implicit coordination across the tiers due to flexible and asymmetric TDD operation.

preprint2013arXiv

Massive MIMO and Small Cells: Improving Energy Efficiency by Optimal Soft-Cell Coordination

To improve the cellular energy efficiency, without sacrificing quality-of-service (QoS) at the users, the network topology must be densified to enable higher spatial reuse. We analyze a combination of two densification approaches, namely "massive" multiple-input multiple-output (MIMO) base stations and small-cell access points. If the latter are operator-deployed, a spatial soft-cell approach can be taken where the multiple transmitters serve the users by joint non-coherent multiflow beamforming. We minimize the total power consumption (both dynamic emitted power and static hardware power) while satisfying QoS constraints. This problem is proved to have a hidden convexity that enables efficient solution algorithms. Interestingly, the optimal solution promotes exclusive assignment of users to transmitters. Furthermore, we provide promising simulation results showing how the total power consumption can be greatly improved by combining massive MIMO and small cells; this is possible with both optimal and low-complexity beamforming.

preprint2013arXiv

Modeling Heterogeneous Network Interference Using Poisson Point Processes

Cellular systems are becoming more heterogeneous with the introduction of low power nodes including femtocells, relays, and distributed antennas. Unfortunately, the resulting interference environment is also becoming more complicated, making evaluation of different communication strategies challenging in both analysis and simulation. Leveraging recent applications of stochastic geometry to analyze cellular systems, this paper proposes to analyze downlink performance in a fixed-size cell, which is inscribed within a weighted Voronoi cell in a Poisson field of interferers. A nearest out-of-cell interferer, out-of-cell interferers outside a guard region, and cross-tier interference are included in the interference calculations. Bounding the interference power as a function of distance from the cell center, the total interference is characterized through its Laplace transform. An equivalent marked process is proposed for the out-of-cell interference under additional assumptions. To facilitate simplified calculations, the interference distribution is approximated using the Gamma distribution with second order moment matching. The Gamma approximation simplifies calculation of the success probability and average rate, incorporates small-scale and large-scale fading, and works with co-tier and cross-tier interference. Simulations show that the proposed model provides a flexible way to characterize outage probability and rate as a function of the distance to the cell edge.

preprint2013arXiv

Network-Level Cooperation in Energy Harvesting Wireless Networks

We consider a two-hop communication network consisted of a source node, a relay and a destination node in which the source and the relay node have external traffic arrivals. The relay forwards a fraction of the source node's traffic to the destination and the cooperation is performed at the network level. In addition, both source and relay nodes have energy harvesting capabilities and an unlimited battery to store the harvested energy. We study the impact of the energy constraints on the stability region. Specifically, we provide inner and outer bounds on the stability region of the two-hop network with energy harvesting source and relay.

preprint2013arXiv

Successive Interference Cancellation in Heterogeneous Cellular Networks

At present, operators address the explosive growth of mobile data demand by densification of the cellular network so as to reduce the transmitter-receiver distance and to achieve higher spectral efficiency. Due to such network densification and the intense proliferation of wireless devices, modern wireless networks are interference-limited, which motivates the use of interference mitigation and coordination techniques. In this work, we develop a statistical framework to evaluate the performance of multi-tier heterogeneous networks with successive interference cancellation (SIC) capabilities, accounting for the computational complexity of the cancellation scheme and relevant network related parameters such as random location of the access points (APs) and mobile users, and the characteristics of the wireless propagation channel. We explicitly model the consecutive events of canceling interferers and we derive the success probability to cancel the n-th strongest signal and to decode the signal of interest after n cancellations. When users are connected to the AP which provides the maximum average received signal power, the analysis indicates that the performance gains of SIC diminish quickly with n and the benefits are modest for realistic values of the signal-to-interference ratio (SIR). We extend the statistical model to include several association policies where distinct gains of SIC are expected: (i) minimum load association, (ii) maxi- mum instantaneous SIR association, and (iii) range expansion. Numerical results show the effectiveness of SIC for the considered association policies. This work deepens the understanding of SIC by defining the achievable gains for different association policies in multi-tier heterogeneous networks.

preprint2013arXiv

The Stability Region of the Two-User Interference Channel

The stable throughput region of the two-user interference channel is investigated here. First, the stability region for the general case is characterized. Second, we study the cases where the receivers treat interference as noise or perform successive interference cancelation. Finally, we provide conditions for the convexity/concavity of the stability region and for which a certain interference management strategy leads to broader stability region.

preprint2011arXiv

Downlink SDMA with Limited Feedback in Interference-Limited Wireless Networks

The tremendous capacity gains promised by space division multiple access (SDMA) depend critically on the accuracy of the transmit channel state information. In the broadcast channel, even without any network interference, it is known that such gains collapse due to interstream interference if the feedback is delayed or low rate. In this paper, we investigate SDMA in the presence of interference from many other simultaneously active transmitters distributed randomly over the network. In particular we consider zero-forcing beamforming in a decentralized (ad hoc) network where each receiver provides feedback to its respective transmitter. We derive closed-form expressions for the outage probability, network throughput, transmission capacity, and average achievable rate and go on to quantify the degradation in network performance due to residual self-interference as a function of key system parameters. One particular finding is that as in the classical broadcast channel, the per-user feedback rate must increase linearly with the number of transmit antennas and SINR (in dB) for the full multiplexing gains to be preserved with limited feedback. We derive the throughput-maximizing number of streams, establishing that single-stream transmission is optimal in most practically relevant settings. In short, SDMA does not appear to be a prudent design choice for interference-limited wireless networks.

preprint2011arXiv

Enhanced Inter-Cell Interference Coordination Challenges in Heterogeneous Networks

3GPP LTE-Advanced has started a new study item to investigate Heterogeneous Network (HetNet) deployments as a cost effective way to deal with the unrelenting traffic demand. HetNets consist of a mix of macrocells, remote radio heads, and low-power nodes such as picocells, femtocells, and relays. Leveraging network topology, increasing the proximity between the access network and the end-users, has the potential to provide the next significant performance leap in wireless networks, improving spatial spectrum reuse and enhancing indoor coverage. Nevertheless, deployment of a large number of small cells overlaying the macrocells is not without new technical challenges. In this article, we present the concept of heterogeneous networks and also describe the major technical challenges associated with such network architecture. We focus in particular on the standardization activities within the 3GPP related to enhanced inter-cell interference coordination.

preprint2011arXiv

Limited Feedback Over Temporally Correlated Channels for the Downlink of a Femtocell Network

Heterogeneous networks are a flexible deployment model that rely on low power nodes to improve the user broadband experience in a cost effective manner. Femtocells are an integral part of heterogeneous networks, whose main purpose is to improve the indoor capacity. When restricting access to home users, femtocells cause a substantial interference problem that cannot be mitigated through coordination with the macrocell base station. In this paper, we analyze multiple antenna communication on the downlink of a macrocell network, with femtocell overlay. We evaluate the feasibility of limited feedback beamforming given delay on the feedback channel, quantization error and uncoordinated interference from the femtocells. We model the femtocell spatial distribution as a Poisson point process and the temporal correlation of the channel according to a Gauss-Markov model. We derive the probability of outage at the macrocell users as a function of the temporal correlation, the femtocell density, and the feedback rate. We propose rate backoff to maximize the average achievable rate in the network. Simulation results show that limited feedback beamforming is a viable solution for femtocell networks despite the CSI inaccuracy and the interference. They illustrate how properly designed rate backoff improves the achievable rate of the macrocell system.

preprint2010arXiv

Multi-mode Transmission for the MIMO Broadcast Channel with Imperfect Channel State Information

This paper proposes an adaptive multi-mode transmission strategy to improve the spectral efficiency achieved in the multiple-input multiple-output (MIMO) broadcast channel with delayed and quantized channel state information. The adaptive strategy adjusts the number of active users, denoted as the transmission mode, to balance transmit array gain, spatial division multiplexing gain, and residual inter-user interference. Accurate closed-form approximations are derived for the achievable rates for different modes, which help identify the active mode that maximizes the average sum throughput for given feedback delay and channel quantization error. The proposed transmission strategy is combined with round-robin scheduling, and is shown to provide throughput gain over single-user MIMO at moderate signal-to-noise ratio. It only requires feedback of instantaneous channel state information from a small number of users. With a feedback load constraint, the proposed algorithm provides performance close to that achieved by opportunistic scheduling with instantaneous feedback from a large number of users.

preprint2009arXiv

Coverage in Multi-Antenna Two-Tier Networks

In two-tier networks -- comprising a conventional cellular network overlaid with shorter range hotspots (e.g. femtocells, distributed antennas, or wired relays) -- with universal frequency reuse, the near-far effect from cross-tier interference creates dead spots where reliable coverage cannot be guaranteed to users in either tier. Equipping the macrocell and femtocells with multiple antennas enhances robustness against the near-far problem. This work derives the maximum number of simultaneously transmitting multiple antenna femtocells meeting a per-tier outage probability constraint. Coverage dead zones are presented wherein cross-tier interference bottlenecks cellular and hotspot coverage. Two operating regimes are shown namely 1) a cellular-limited regime in which femtocell users experience unacceptable cross-tier interference and 2) a hotspot-limited regime wherein both femtocell users and cellular users are limited by hotspot interference. Our analysis accounts for the per-tier transmit powers, the number of transmit antennas (single antenna transmission being a special case) and terrestrial propagation such as the Rayleigh fading and the path loss exponents. Single-user (SU) multiple antenna transmission at each tier is shown to provide significantly superior coverage and spatial reuse relative to multiuser (MU) transmission. We propose a decentralized carrier-sensing approach to regulate femtocell transmission powers based on their location. Considering a worst-case cell-edge location, simulations using typical path loss scenarios show that our interference management strategy provides reliable cellular coverage with about 60 femtocells per cellsite.

preprint2009arXiv

Random Access Transport Capacity

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the average maximum rate of successful end-to-end transmissions, multiplied by the communication distance, and normalized by the network area. We show that a simple upper bound on this quantity is computable in closed-form in terms of key network parameters when the number of retransmissions is not restricted and the hops are assumed to be equally spaced on a line between the source and destination. We also derive the optimum number of hops and optimal per hop success probability and show that our result follows the well-known square root scaling law while providing exact expressions for the preconstants as well. Numerical results demonstrate that the upper bound is accurate for the purpose of determining the optimal hop count and success (or outage) probability.

preprint2008arXiv

Achievable Throughput of Multi-mode Multiuser MIMO with Imperfect CSI Constraints

For the multiple-input multiple-output (MIMO) broadcast channel with imperfect channel state information (CSI), neither the capacity nor the optimal transmission technique have been fully discovered. In this paper, we derive achievable ergodic rates for a MIMO fading broadcast channel when CSI is delayed and quantized. It is shown that we should not support too many users with spatial division multiplexing due to the residual inter-user interference caused by imperfect CSI. Based on the derived achievable rates, we propose a multi-mode transmission strategy to maximize the throughput, which adaptively adjusts the number of active users based on the channel statistics information.

preprint2008arXiv

Mode Switching for MIMO Broadcast Channel Based on Delay and Channel Quantization

Imperfect channel state information degrades the performance of multiple-input multiple-output (MIMO) communications; its effect on single-user (SU) and multi-user (MU) MIMO transmissions are quite different. In particular, MU-MIMO suffers from residual inter-user interference due to imperfect channel state information while SU-MIMO only suffers from a power loss. This paper compares the throughput loss of both SU and MU MIMO on the downlink due to delay and channel quantization. Accurate closed-form approximations are derived for the achievable rates for both SU and MU MIMO. It is shown that SU-MIMO is relatively robust to delayed and quantized channel information, while MU MIMO with zero-forcing precoding loses spatial multiplexing gain with a fixed delay or fixed codebook size. Based on derived achievable rates, a mode switching algorithm is proposed that switches between SU and MU MIMO modes to improve the spectral efficiency, based on the average signal-to-noise ratio (SNR), the normalized Doppler frequency, and the channel quantization codebook size. The operating regions for SU and MU modes with different delays and codebook sizes are determined, which can be used to select the preferred mode. It is shown that the MU mode is active only when the normalized Doppler frequency is very small and the codebook size is large.