Source author record

Khaled B. Letaief

Khaled B. Letaief 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

50works
10topics
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

50 published item(s)

preprint2026arXiv

Federated Client Selection under Partial Visibility: A POMDP Approach with Spatio-Temporal Attention

Federated learning relies on effective client selection to alleviate the performance degradation caused by data heterogeneity. Most existing methods assume full visibility of all clients at each communication round. However, in large-scale or edge-based deployments, the server can only access a subset of clients due to communication, mobility, or availability constraints, resulting in partial visibility where only a subset of clients is observable for aggregation in each communication round. In this paper, we formulate federated client selection under partial visibility as a Partially Observable Markov Decision Process (POMDP) and propose a Spatial-Temporal attention-based reinforcement learning framework. By integrating historical global models and client identity embeddings, the proposed method captures both the temporal contexts of training and the persistent characteristics of clients. Experimental results across multiple datasets demonstrate that our approach achieves superior performance compared to existing baselines in heterogeneous and partially visible settings, validating its effectiveness in addressing the challenges of incomplete observations in practical federated learning systems.

preprint2026arXiv

FedGMI: Generative Model-Driven Federated Learning for Probabilistic Mixture Inference

Federated Learning (FL) facilitates collaborative model training across decentralized clients while preserving data privacy by avoiding raw data exchange. Despite its potential, FL performance is often compromised by data heterogeneity across clients. To address this, Clustered Federated Learning (CFL) groups clients with similar data distributions to improve model performance, but constrained by intra-cluster heterogeneity. Conversely, Personalized Federated Learning (PFL) tailors models to individual clients, but usually neglects the underlying structural similarities among clients. In this work, we investigate a probabilistic mixture (PM) scenario, where each client's local data distribution is modeled as a convex combination of several shared inherent distributions. To effectively model this structure, we propose FedGMI, a framework that utilizes Variational Autoencoders (VAEs) as generative density estimators to represent these inherent distributions and infer the mixture components of clients' local data distributions. This approach enables structured personalization without sacrificing the benefits of collaborative learning. Extensive experiments demonstrate that FedGMI effectively characterizes and discriminate the inherent distributions, as well as accurately estimates mixture proportions. Furthermore, FedGMI maintains robust performance even under communication cost constraints.

preprint2026arXiv

Joint Optimization of Trajectory Control, Resource Allocation, and Task Offloading for Multi-UAV-Assisted IoV

This paper investigates a multi-Unmanned Aerial Vehicle (UAV) joint base station-assisted Internet of Vehicles (IoV) task offloading system in dense urban environments. To minimize system delay and energy consumption under strict coupling constraints, the complex non-convex optimization problem is decoupled into a hierarchical execution framework. First, a sequential distributed optimization algorithm based on Second-Order Cone Programming (SOCP) is proposed to optimize the 3D flight trajectory of each UAV, ensuring adaptive network coverage. Second, a novel hybrid resource scheduling paradigm synergizing Deep Reinforcement Learning (DRL) and Large Language Models (LLMs) is developed. Within this framework, the DRL agent dictates the initial resource allocation, while the LLM acts as a semantic macro-scheduler to rectify long-tail allocation imbalances for failed and surplus tasks. Crucially, a reward decoupling mechanism is introduced to isolate DRL training from external LLM interventions, thereby ensuring policy convergence. Finally, the task offloading ratios are precisely determined via Linear Programming (LP) within an alternating optimization loop. Simulation results demonstrate that the proposed method significantly outperforms traditional multi-agent reinforcement learning baselines in terms of task success rate and system efficiency.

preprint2026arXiv

Sensing for Free: Learn to Localize More Sources than Antennas without Pilots

Integrated sensing and communication (ISAC) represents a key paradigm for future wireless networks. However, existing approaches require waveform modifications, dedicated pilots, or overhead that complicates standards integration. We propose sensing for free - performing multi-source localization without pilots by reusing uplink data symbols, making sensing occur during transmission and directly compatible with 3GPP 5G NR and 6G specifications. With ever-increasing devices in dense 6G networks, this approach is particularly compelling when combined with sparse arrays, which can localize more sources than uniform arrays via an enlarged virtual array. Existing pilot-free multi-source localization algorithms first reconstruct an extended covariance matrix and apply subspace methods, incurring cubic complexity and limited to second-order statistics. Performance degrades under non-Gaussian data symbols and few snapshots, and higher-order statistics remain unexploited. We address these challenges with an attention-only transformer that directly processes raw signal snapshots for grid-less end-to-end direction-of-arrival (DOA) estimation. The model efficiently captures higher-order statistics while being permutation-invariant and adaptive to varying snapshot counts. Our algorithm greatly outperforms state-of-the-art AI-based benchmarks with over 30x reduction in parameters and runtime, and enjoys excellent generalization under practical mismatches. Applied to multi-user MIMO beam training, our algorithm can localize uplink DOAs of multiple users during data transmission. Through angular reciprocity, estimated uplink DOAs prune downlink beam sweeping candidates and improve throughput via sensing-assisted beam management. This work shows how reusing existing data transmission for sensing can enhance both multi-source localization and beam management in 3GPP efforts towards 6G.

preprint2026arXiv

Space Network of Experts: Architecture and Expert Placement

Leveraging continuous solar energy harvesting at high efficiency, space data centers are envisioned as a promising platform for executing energy-intensive large language models (LLMs). Recognizing this advantage, space and AI conglomerates (e.g., SpaceX, Google) are actively investing in this vision. One key challenge, however, is the efficient distributed deployment of a large-scale LLM in a satellite network due to the limited onboard computing and communication resources. This gives rise to a placement problem that involves partitioning and mapping model components to satellites such that the fundamentally different model architecture and network topology can be reconciled to ensure low-latency token generation. To address this problem, we present the Space Network of Experts (Space-XNet) framework targeting the distributed execution of a popular mixture-of-experts (MoE) model in space. The proposed placement strategies are two-level: (1) layer placement, which assigns MoE layers to satellite subnets; and (2) intra-layer expert placement, which assigns individual experts to satellites associated with the same layer/subnet. For layer placement, we exploit the ring-like communication pattern of autoregressive inference to partition the satellite constellation along the orbiting direction into subnets arranged on a ring, each hosting one MoE layer. Based on this architecture, we formulate and solve an optimization problem for intra-layer expert placement to map experts with heterogeneous activation probabilities onto satellites. The derived strategy reveals an intuitive principle: a frequently activated expert should be mapped to a satellite on a routing path with low expected latency. Experiments over a thousand-satellite constellation show that Space-XNet achieves at least a threefold latency reduction compared with conventional random and ablation-based placement strategies.

preprint2024arXiv

A Tutorial on Extremely Large-Scale MIMO for 6G: Fundamentals, Signal Processing, and Applications

Extremely large-scale multiple-input-multiple-output (XL-MIMO), which offers vast spatial degrees of freedom, has emerged as a potentially pivotal enabling technology for the sixth generation (6G) of wireless mobile networks. With its growing significance, both opportunities and challenges are concurrently manifesting. This paper presents a comprehensive survey of research on XL-MIMO wireless systems. In particular, we introduce four XL-MIMO hardware architectures: uniform linear array (ULA)-based XL-MIMO, uniform planar array (UPA)-based XL-MIMO utilizing either patch antennas or point antennas, and continuous aperture (CAP)-based XL-MIMO. We comprehensively analyze and discuss their characteristics and interrelationships. Following this, we introduce several electromagnetic characteristics and general distance boundaries in XL-MIMO. Given the distinct electromagnetic properties of near-field communications, we present a range of channel models to demonstrate the benefits of XL-MIMO. We further discuss and summarize signal processing schemes for XL-MIMO. It is worth noting that the low-complexity signal processing schemes and deep learning empowered signal processing schemes are reviewed and highlighted to promote the practical implementation of XL-MIMO. Furthermore, we explore the interplay between XL-MIMO and other emergent 6G technologies. Finally, we outline several compelling research directions for future XL-MIMO wireless communication systems.

preprint2024arXiv

FedNC: A Secure and Efficient Federated Learning Method with Network Coding

Federated Learning (FL) is a promising distributed learning mechanism which still faces two major challenges, namely privacy breaches and system efficiency. In this work, we reconceptualize the FL system from the perspective of network information theory, and formulate an original FL communication framework, FedNC, which is inspired by Network Coding (NC). The main idea of FedNC is mixing the information of the local models by making random linear combinations of the original parameters, before uploading for further aggregation. Due to the benefits of the coding scheme, both theoretical and experimental analysis indicate that FedNC improves the performance of traditional FL in several important ways, including security, efficiency, and robustness. To the best of our knowledge, this is the first framework where NC is introduced in FL. As FL continues to evolve within practical network frameworks, more variants can be further designed based on FedNC.

preprint2023arXiv

GNN-Enhanced Approximate Message Passing for Massive/Ultra-Massive MIMO Detection

Efficient massive/ultra-massive multiple-input multiple-output (MIMO) detection algorithms with satisfactory performance and low complexity are critical to meet the high throughput and ultra-low latency requirements in 5G and beyond communications, given the extremely large number of antennas. In this paper, we propose a low-complexity graph neural network (GNN) enhanced approximate message passing (AMP) algorithm, AMP-GNN, for massive/ultra-massive MIMO detection. The structure of the neural network is customized by unfolding the AMP algorithm and introducing the GNN module for multiuser interference cancellation. Numerical results will show that the proposed AMP-GNN significantly improves the performance of the AMP detector and achieves comparable performance as the state-of-the-art deep learning-based MIMO detectors but with reduced computational complexity. Furthermore, it presents strong robustness to the change of the number of users.

preprint2023arXiv

Hierarchical Federated Learning with Quantization: Convergence Analysis and System Design

Federated learning (FL) is a powerful distributed machine learning framework where a server aggregates models trained by different clients without accessing their private data. Hierarchical FL, with a client-edge-cloud aggregation hierarchy, can effectively leverage both the cloud server's access to many clients' data and the edge servers' closeness to the clients to achieve a high communication efficiency. Neural network quantization can further reduce the communication overhead during model uploading. To fully exploit the advantages of hierarchical FL, an accurate convergence analysis with respect to the key system parameters is needed. Unfortunately, existing analysis is loose and does not consider model quantization. In this paper, we derive a tighter convergence bound for hierarchical FL with quantization. The convergence result leads to practical guidelines for important design problems such as the client-edge aggregation and edge-client association strategies. Based on the obtained analytical results, we optimize the two aggregation intervals and show that the client-edge aggregation interval should slowly decay while the edge-cloud aggregation interval needs to adapt to the ratio of the client-edge and edge-cloud propagation delay. Simulation results shall verify the design guidelines and demonstrate the effectiveness of the proposed aggregation strategy.

preprint2022arXiv

Collaborative Sensing in Perceptive Mobile Networks: Opportunities and Challenges

With the development of innovative applications that demand accurate environment information, e.g., autonomous driving, sensing becomes an important requirement for future wireless networks. To this end, integrated sensing and communication (ISAC) provides a promising platform to exploit the synergy between sensing and communication, where perceptive mobile networks (PMNs) were proposed to add accurate sensing capability to existing wireless networks. The well-developed cellular networks offer exciting opportunities for sensing, including large coverage, strong computation and communication power, and most importantly networked sensing, where the perspectives from multiple sensing nodes can be collaboratively utilized for sensing the same target. However, PMNs also face big challenges such as the inherent interference between sensing and communication, the complex sensing environment, and the tracking of high-speed targets by cellular networks. This paper provides a comprehensive review on the design of PMNs, covering the popular network architectures, sensing protocols, standing research problems, and available solutions. Several future research directions that are critical for the development of PMNs are also discussed.

preprint2022arXiv

Communication-Efficient Federated Distillation with Active Data Sampling

Federated learning (FL) is a promising paradigm to enable privacy-preserving deep learning from distributed data. Most previous works are based on federated average (FedAvg), which, however, faces several critical issues, including a high communication overhead and the difficulty in dealing with heterogeneous model architectures. Federated Distillation (FD) is a recently proposed alternative to enable communication-efficient and robust FL, which achieves orders of magnitude reduction of the communication overhead compared with FedAvg and is flexible to handle heterogeneous models at the clients. However, so far there is no unified algorithmic framework or theoretical analysis for FD-based methods. In this paper, we first present a generic meta-algorithm for FD and investigate the influence of key parameters through empirical experiments. Then, we verify the empirical observations theoretically. Based on the empirical results and theory, we propose a communication-efficient FD algorithm with active data sampling to improve the model performance and reduce the communication overhead. Empirical simulations on benchmark datasets will demonstrate that our proposed algorithm effectively and significantly reduces the communication overhead while achieving a satisfactory performance.

preprint2022arXiv

How Neural Architectures Affect Deep Learning for Communication Networks?

In recent years, there has been a surge in applying deep learning to various challenging design problems in communication networks. The early attempts adopt neural architectures inherited from applications such as computer vision, which suffer from poor generalization, scalability, and lack of interpretability. To tackle these issues, domain knowledge has been integrated into the neural architecture design, which achieves near-optimal performance in large-scale networks and generalizes well under different system settings. This paper endeavors to theoretically validate the importance and effects of neural architectures when applying deep learning to design communication networks. We prove that by exploiting permutation invariance, a common property in communication networks, graph neural networks (GNNs) converge faster and generalize better than fully connected multi-layer perceptrons (MLPs), especially when the number of nodes (e.g., users, base stations, or antennas) is large. Specifically, we prove that under common assumptions, for a communication network with $n$ nodes, GNNs converge $O(n \log n)$ times faster and their generalization error is $O(n)$ times lower, compared with MLPs.

preprint2022arXiv

Perceptive Mobile Network with Distributed Target Monitoring Terminals: Leaking Communication Energy for Sensing

Integrated sensing and communication (ISAC) creates a platform to exploit the synergy between two powerful functionalities that have been developing separately. However, the interference management and resource allocation between sensing and communication have not been fully studied. In this paper, we consider the design of perceptive mobile networks (PMNs) by adding sensing capability to current cellular networks. To avoid the full-duplex operation, we propose the PMN with distributed target monitoring terminals (TMTs) where passive TMTs are deployed over wireless networks to locate the sensing target (ST). We jointly optimize the transmit and receive beamformers towards the communication user terminals (UEs) and the ST by alternating-optimization (AO) and prove its convergence. To reduce computation complexity and obtain physical insights, we further investigate the use of linear transceivers, including zero forcing and beam synthesis (B-syn). Our analysis revealed interesting physical insights regarding interference management and resource allocation between sensing and communication: 1) instead of forming dedicated sensing signals, it is more efficient to redesign the communication signals for both communication and sensing purposes and "leak" communication energy for sensing; 2) the amount of energy leakage from one UE to the ST depends on their relative locations.

preprint2022arXiv

Semantic Communication Meets Edge Intelligence

The development of emerging applications, such as autonomous transportation systems, are expected to result in an explosive growth in mobile data traffic. As the available spectrum resource becomes more and more scarce, there is a growing need for a paradigm shift from Shannon's Classical Information Theory (CIT) to semantic communication (SemCom). Specifically, the former adopts a "transmit-before-understanding" approach while the latter leverages artificial intelligence (AI) techniques to "understand-before-transmit", thereby alleviating bandwidth pressure by reducing the amount of data to be exchanged without negating the semantic effectiveness of the transmitted symbols. However, the semantic extraction (SE) procedure incurs costly computation and storage overheads. In this article, we introduce an edge-driven training, maintenance, and execution of SE. We further investigate how edge intelligence can be enhanced with SemCom through improving the generalization capabilities of intelligent agents at lower computation overheads and reducing the communication overhead of information exchange. Finally, we present a case study involving semantic-aware resource optimization for the wireless powered Internet of Things (IoT).

preprint2021arXiv

IRS-aided MIMO Systems over Double-scattering Channels: Impact of Channel Rank Deficiency

Intelligent reflecting surfaces (IRSs) are promising enablers for next-generation wireless communications due to their reconfigurability and high energy efficiency in improving poor propagation condition of channels, e.g., limited scattering environment. However, most existing works assumed full-rank channels requiring rich scatters, which may not be available in practice. To analyze the impact of rank-deficient channels and mitigate the ensued performance loss, we consider a large-scale IRS-aided MIMO system with statistical channel state information (CSI), where the double-scattering channel is adopted to model rank deficiency. By leveraging random matrix theory (RMT), we first derive a deterministic approximation (DA) of the ergodic rate with low computational complexity and prove the existence and uniqueness of the DA parameters. Then, we propose an alternating optimization algorithm for maximizing the DA with respect to phase shifts and signal covariance matrices. Numerical results will show that the DA is tight and our proposed method can effectively mitigate the performance loss induced by channel rank deficiency.

preprint2020arXiv

Age-optimal Service and Decision Scheduling in Internet of Things

We consider an Internet of Things (IoT) system in which a sensor observes a phenomena of interest with exponentially distributed intervals and delivers the updates to a monitor with the First-come-First-served (FCFS) policy. At the monitor, the received updates are used to make decisions with deterministic or random intervals. For this system, we investigate the freshness of the updates at these decision epochs using the age upon decisions (AuD) metric. Theoretical results show that 1) when the decisions are made with exponentially distributed intervals, the average AuD of the system is smaller if the service time (e.g., transmission time) is uniformly distributed than when it is exponentially distributed, and would be the smallest if it is deterministic; 2)when the decisions are made periodically, the average AuD of the system is larger than, and decreases with decision rate to, the average AuD of the corresponding system with Poisson decision intervals; 3)the probability of missing to use a received update for any decisions is decreasing with the decision rate, and is the smallest if the service time is deterministic. For IoT monitoring systems, therefore, it is suggested to use deterministic monitoring schemes, deterministic transmitting schemes, and Poisson decision schemes, so that the received updates are as fresh as possible at the time they are used to make decisions.

preprint2020arXiv

An Importance Aware Weighted Coding Theorem Using Message Importance Measure

There are numerous scenarios in source coding where not only the code length but the importance of each value should also be taken into account. Different from the traditional coding theorems, by adding the importance weights for the length of the codes, we define the average cost of the weighted codeword length as an importance-aware measure of the codes. This novel information theoretical measure generalizes the average codeword length by assigning importance weights for each symbol according to users' concerns through focusing on user's selections. With such definitions, coding theorems of the bounds are derived and the outcomes are shown to be extensions of traditional coding theorems.

preprint2020arXiv

Complete Dictionary Learning via $\ell_p$-norm Maximization

Dictionary learning is a classic representation learning method that has been widely applied in signal processing and data analytics. In this paper, we investigate a family of $\ell_p$-norm ($p>2,p \in \mathbb{N}$) maximization approaches for the complete dictionary learning problem from theoretical and algorithmic aspects. Specifically, we prove that the global maximizers of these formulations are very close to the true dictionary with high probability, even when Gaussian noise is present. Based on the generalized power method (GPM), an efficient algorithm is then developed for the $\ell_p$-based formulations. We further show the efficacy of the developed algorithm: for the population GPM algorithm over the sphere constraint, it first quickly enters the neighborhood of a global maximizer, and then converges linearly in this region. Extensive experiments will demonstrate that the $\ell_p$-based approaches enjoy a higher computational efficiency and better robustness than conventional approaches and $p=3$ performs the best.

preprint2020arXiv

Intelligent networking with Mobile Edge Computing: Vision and Challenges for Dynamic Network Scheduling

Mobile edge computing (MEC) has been considered as a promising technique for internet of things (IoT). By deploying edge servers at the proximity of devices, it is expected to provide services and process data at a relatively low delay by intelligent networking. However, the vast edge servers may face great challenges in terms of cooperation and resource allocation. Furthermore, intelligent networking requires online implementation in distributed mode. In such kinds of systems, the network scheduling can not follow any previously known rule due to complicated application environment. Then statistical learning rises up as a promising technique for network scheduling, where edges dynamically learn environmental elements with cooperations. It is expected such learning based methods may relieve deficiency of model limitations, which enhance their practical use in dynamic network scheduling. In this paper, we investigate the vision and challenges of the intelligent IoT networking with mobile edge computing. From the systematic viewpoint, some major research opportunities are enumerated with respect to statistical learning.

preprint2020arXiv

Large-Scale Beamforming for Massive MIMO via Randomized Sketching

Massive MIMO system yields significant improvements in spectral and energy efficiency for future wireless communication systems. The regularized zero-forcing (RZF) beamforming is able to provide good performance with the capability of achieving numerical stability and robustness to the channel uncertainty. However, in massive MIMO systems, the matrix inversion operation in RZF beamforming becomes computationally expensive. To address this computational issue, we shall propose a novel randomized sketching based RZF beamforming approach with low computational complexity. This is achieved by solving a linear system via randomized sketching based on the preconditioned Richard iteration, which guarantees high quality approximations to the optimal solution. We theoretically prove that the sequence of approximations obtained iteratively converges to the exact RZF beamforming matrix linearly fast as the number of iterations increases. Also, it turns out that the system sum-rate for such sequence of approximations converges to the exact one at a linear convergence rate. Our simulation results verify our theoretical findings.

preprint2020arXiv

Reconfigurable Intelligent Surface Assisted Massive MIMO with Antenna Selection

Antenna selection is capable of reducing the hardware complexity of massive multiple-input multiple-output (MIMO) networks at the cost of certain performance degradation. Reconfigurable intelligent surface (RIS) has emerged as a cost-effective technique that can enhance the spectrum-efficiency of wireless networks by reconfiguring the propagation environment. By employing RIS to compensate the performance loss due to antenna selection, in this paper we propose a new network architecture, i.e., RIS-assisted massive MIMO system with antenna selection, to enhance the system performance while enjoying a low hardware cost. This is achieved by maximizing the channel capacity via joint antenna selection and passive beamforming while taking into account the cardinality constraint of active antennas and the unit-modulus constraints of all RIS elements. However, the formulated problem turns out to be highly intractable due to the non-convex constraints and coupled optimization variables, for which an alternating optimization framework is provided, yielding antenna selection and passive beamforming subproblems. The computationally efficient submodular optimization algorithms are developed to solve the antenna selection subproblem under different channel state information assumptions. The iterative algorithms based on block coordinate descent are further proposed for the passive beamforming design by exploiting the unique problem structures. Experimental results will demonstrate the algorithmic advantages and desirable performance of the proposed algorithms for RIS- assisted massive MIMO systems with antenna selection.

preprint2020arXiv

Reconfigurable Intelligent Surface Empowered Downlink Non-Orthogonal Multiple Access

Power-domain non-orthogonal multiple access (NOMA) has become a promising technology to exploit the new dimension of the power domain to enhance the spectral efficiency of wireless networks. However, most existing NOMA schemes rely on the strong assumption that users' channel gains are quite different, which may be invalid in practice. To unleash the potential of power-domain NOMA, we will propose a reconfigurable intelligent surface (RIS)-empowered NOMA network to introduce desirable channel gain differences among the users by adjusting the phase shifts at RIS. Our goal is to minimize the total transmit power by jointly optimizing the beamforming vectors at the base station and the phase-shift matrix at the RIS. To address the highly coupled optimization variables, we present an alternating optimization framework to decompose the non-convex bi-quadratically constrained quadratic problem into two rank-one constrained matrices optimization problems via matrix lifting. At the same time, to accurately detect the feasibility of the non-convex rank-one constraints and improve performance by avoiding early stopping in the alternating optimization procedure, we equivalently represent the rank-one constraint as the difference between nuclear norm and spectral norm. A difference-of-convex (DC) algorithm is further developed to solve the resulting DC programs via successive convex relaxation, followed by establishing the convergence of the proposed DC-based alternating optimization method. We further propose an efficient user ordering scheme with closed-form expressions, considering both the channel conditions and users' target data rates. Simulation results will validate the effectiveness of deploying an RIS and the superiority of the proposed DC-based alternating optimization method in reducing the total transmit power.

preprint2016arXiv

Alternating Minimization Algorithms for Hybrid Precoding in Millimeter Wave MIMO Systems

Millimeter wave (mmWave) communications has been regarded as a key enabling technology for 5G networks. In contrast to conventional multiple-input-multiple-output (MIMO) systems, precoding in mmWave MIMO cannot be performed entirely at baseband using digital precoders, as only a limited number of signal mixers and analog-to-digital converters (ADCs) can be supported considering their cost and power consumption. As a cost-effective alternative, a hybrid precoding transceiver architecture, combining a digital precoder and an analog precoder, has recently received considerable attention. However, the optimal design of such hybrid precoders has not been fully understood. In this paper, treating the hybrid precoder design as a matrix factorization problem, effective alternating minimization (AltMin) algorithms will be proposed for two different hybrid precoding structures, i.e., the fully-connected and partially-connected structures. In particular, for the fully-connected structure, an AltMin algorithm based on manifold optimization is proposed to approach the performance of the fully digital precoder, which, however, has a high complexity. Thus, a low-complexity AltMin algorithm is then proposed, by enforcing an orthogonal constraint on the digital precoder. Furthermore, for the partially-connected structure, an AltMin algorithm is also developed with the help of semidefinite relaxation. For practical implementation, the proposed AltMin algorithms are further extended to the broadband setting with orthogonal frequency division multiplexing (OFDM) modulation. Simulation results will demonstrate significant performance gains of the proposed AltMin algorithms over existing hybrid precoding algorithms. Moreover, based on the proposed algorithms, simulation comparisons between the two hybrid precoding structures will provide valuable design insights.

preprint2016arXiv

ARQ with Adaptive Feedback for Energy Harvesting Receivers

Automatic repeat request (ARQ) is widely used in modern communication systems to improve transmission reliability. In conventional ARQ protocols developed for systems with energy-unconstrained receivers, an acknowledgement/negative-acknowledgement (ACK/NACK) message is fed back when decoding succeeds/fails. Such kind of non-adaptive feedback consumes significant amount of energy, and thus will limit the performance of systems with energy harvesting (EH) receivers. In order to overcome this limitation and to utilize the harvested energy more efficiently, we propose a novel ARQ protocol for EH receivers, where the ACK feedback can be adapted based upon the receiver's EH state. Two conventional ARQ protocols are also considered. By adopting the packet drop probability (PDP) as the performance metric, we formulate the throughput constrained PDP minimization problem for a communication link with a non-EH transmitter and an EH receiver. Optimal reception policies including the sampling, decoding and feedback strategies, are developed for different ARQ protocols. Simulation results will show that the proposed ARQ protocol not only outperforms the conventional ARQs in terms of PDP, but can also achieve a higher throughput.

preprint2016arXiv

Cache Size Allocation in Backhaul Limited Wireless Networks

Caching popular content at base stations is a powerful supplement to existing limited backhaul links for accommodating the exponentially increasing mobile data traffic. Given the limited cache budget, we investigate the cache size allocation problem in cellular networks to maximize the user success probability (USP), taking wireless channel statistics, backhaul capacities and file popularity distributions into consideration. The USP is defined as the probability that one user can successfully download its requested file either from the local cache or via the backhaul link. We first consider a single-cell scenario and derive a closed-form expression for the USP, which helps reveal the impacts of various parameters, such as the file popularity distribution. More specifically, for a highly concentrated file popularity distribution, the required cache size is independent of the total number of files, while for a less concentrated file popularity distribution, the required cache size is in linear relation to the total number of files. Furthermore, we study the multi-cell scenario, and provide a bisection search algorithm to find the optimal cache size allocation. The optimal cache size allocation is verified by simulations, and it is shown to play a more significant role when the file popularity distribution is less concentrated.

preprint2016arXiv

Delay-Optimal Computation Task Scheduling for Mobile-Edge Computing Systems

Mobile-edge computing (MEC) emerges as a promising paradigm to improve the quality of computation experience for mobile devices. Nevertheless, the design of computation task scheduling policies for MEC systems inevitably encounters a challenging two-timescale stochastic optimization problem. Specifically, in the larger timescale, whether to execute a task locally at the mobile device or to offload a task to the MEC server for cloud computing should be decided, while in the smaller timescale, the transmission policy for the task input data should adapt to the channel side information. In this paper, we adopt a Markov decision process approach to handle this problem, where the computation tasks are scheduled based on the queueing state of the task buffer, the execution state of the local processing unit, as well as the state of the transmission unit. By analyzing the average delay of each task and the average power consumption at the mobile device, we formulate a power-constrained delay minimization problem, and propose an efficient one-dimensional search algorithm to find the optimal task scheduling policy. Simulation results are provided to demonstrate the capability of the proposed optimal stochastic task scheduling policy in achieving a shorter average execution delay compared to the baseline policies.

preprint2016arXiv

Dynamic Computation Offloading for Mobile-Edge Computing with Energy Harvesting Devices

Mobile-edge computing (MEC) is an emerging paradigm to meet the ever-increasing computation demands from mobile applications. By offloading the computationally intensive workloads to the MEC server, the quality of computation experience, e.g., the execution latency, could be greatly improved. Nevertheless, as the on-device battery capacities are limited, computation would be interrupted when the battery energy runs out. To provide satisfactory computation performance as well as achieving green computing, it is of significant importance to seek renewable energy sources to power mobile devices via energy harvesting (EH) technologies. In this paper, we will investigate a green MEC system with EH devices and develop an effective computation offloading strategy. The execution cost, which addresses both the execution latency and task failure, is adopted as the performance metric. A low-complexity online algorithm, namely, the Lyapunov optimization-based dynamic computation offloading (LODCO) algorithm is proposed, which jointly decides the offloading decision, the CPU-cycle frequencies for mobile execution, and the transmit power for computation offloading. A unique advantage of this algorithm is that the decisions depend only on the instantaneous side information without requiring distribution information of the computation task request, the wireless channel, and EH processes. The implementation of the algorithm only requires to solve a deterministic problem in each time slot, for which the optimal solution can be obtained either in closed form or by bisection search. Moreover, the proposed algorithm is shown to be asymptotically optimal via rigorous analysis. Sample simulation results shall be presented to verify the theoretical analysis as well as validate the effectiveness of the proposed algorithm.

preprint2016arXiv

Grid Energy Consumption and QoS Tradeoff in Hybrid Energy Supply Wireless Networks

Hybrid energy supply (HES) wireless networks have recently emerged as a new paradigm to enable green networks, which are powered by both the electric grid and harvested renewable energy. In this paper, we will investigate two critical but conflicting design objectives of HES networks, i.e., the grid energy consumption and quality of service (QoS). Minimizing grid energy consumption by utilizing the harvested energy will make the network environmentally friendly, but the achievable QoS may be degraded due to the intermittent nature of energy harvesting. To investigate the tradeoff between these two aspects, we introduce the total service cost as the performance metric, which is the weighted sum of the grid energy cost and the QoS degradation cost. Base station assignment and power control is adopted as the main strategy to minimize the total service cost, while both cases with non-causal and causal side information are considered. With non-causal side information, a Greedy Assignment algorithm with low complexity and near-optimal performance is proposed. With causal side information, the design problem is formulated as a discrete Markov decision problem. Interesting solution structures are derived, which shall help to develop an efficient monotone backward induction algorithm. To further reduce complexity, a Look-Ahead policy and a Threshold-based Heuristic policy are also proposed. Simulation results shall validate the effectiveness of the proposed algorithms and demonstrate the unique grid energy consumption and QoS tradeoff in HES networks.

preprint2016arXiv

Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit

In this paper, we present a flexible low-rank matrix completion (LRMC) approach for topological interference management (TIM) in the partially connected K-user interference channel. No channel state information (CSI) is required at the transmitters except the network topology information. The previous attempt on the TIM problem is mainly based on its equivalence to the index coding problem, but so far only a few index coding problems have been solved. In contrast, in this paper, we present an algorithmic approach to investigate the achievable degrees-of-freedom (DoFs) by recasting the TIM problem as an LRMC problem. Unfortunately, the resulting LRMC problem is known to be NP-hard, and the main contribution of this paper is to propose a Riemannian pursuit (RP) framework to detect the rank of the matrix to be recovered by iteratively increasing the rank. This algorithm solves a sequence of fixed-rank matrix completion problems. To address the convergence issues in the existing fixed-rank optimization methods, the quotient manifold geometry of the search space of fixed-rank matrices is exploited via Riemannian optimization. By further exploiting the structure of the low-rank matrix varieties, i.e., the closure of the set of fixed- rank matrices, we develop an efficient rank increasing strategy to find good initial points in the procedure of rank pursuit. Simulation results demonstrate that the proposed RP algorithm achieves a faster convergence rate and higher achievable DoFs for the TIM problem compared with the state-of-the-art methods.

preprint2016arXiv

Optimal QoS-Aware Channel Assignment in D2D Communications with Partial CSI

In this paper, we propose effective channel assignment algorithms for network utility maximization in a cellular network with underlaying device-to-device (D2D) communications. A major innovation is the consideration of partial channel state information (CSI), i.e., the base station (BS) is assumed to be able to acquire `partial' instantaneous CSI of the cellular and D2D links, as well as, the interference links. In contrast to existing works, multiple D2D links are allowed to share the same channel, and the quality of service (QoS) requirements for both the cellular and D2D links are enforced. We first develop an optimal channel assignment algorithm based on dynamic programming (DP), which enjoys a much lower complexity compared to exhaustive search and will serve as a performance benchmark. To further reduce complexity, we propose a cluster-based sub-optimal channel assignment algorithm. New closed-form expressions for the expected weighted sum-rate and the successful transmission probabilities are also derived. Simulation results verify the effectiveness of the proposed algorithms. Moreover, by comparing different partial CSI scenarios, we observe that the CSI of the D2D communication links and the interference links from the D2D transmitters to the BS significantly affects the network performance, while the CSI of the interference links from the BS to the D2D receivers only has a negligible impact.

preprint2016arXiv

Power-Delay Tradeoff in Multi-User Mobile-Edge Computing Systems

Mobile-edge computing (MEC) has recently emerged as a promising paradigm to liberate mobile devices from increasingly intensive computation workloads, as well as to improve the quality of computation experience. In this paper, we investigate the tradeoff between two critical but conflicting objectives in multi-user MEC systems, namely, the power consumption of mobile devices and the execution delay of computation tasks. A power consumption minimization problem with task buffer stability constraints is formulated to investigate the tradeoff, and an online algorithm that decides the local execution and computation offloading policy is developed based on Lyapunov optimization. Specifically, at each time slot, the optimal frequencies of the local CPUs are obtained in closed forms, while the optimal transmit power and bandwidth allocation for computation offloading are determined with the Gauss-Seidel method. Performance analysis is conducted for the proposed algorithm, which indicates that the power consumption and execution delay obeys an [O (1/V); O (V)] tradeoff with V as a control parameter. Simulation results are provided to validate the theoretical analysis and demonstrate the impacts of various parameters to the system performance.

preprint2016arXiv

Success Probability and Area Spectral Efficiency in Multiuser MIMO HetNets

We derive a general and closed-form result for the success probability in downlink multiple-antenna (MIMO) heterogeneous cellular networks (HetNets), utilizing a novel Toeplitz matrix representation. This main result, which is equivalently the signal-to-interference ratio (SIR) distribution, includes multiuser MIMO, single-user MIMO and per-tier biasing for $K$ different tiers of randomly placed base stations (BSs), assuming zero-forcing precoding and perfect channel state information. The large SIR limit of this result admits a simple closed form that is accurate at moderate SIRs, e.g., above 5 dB. These results reveal that the SIR-invariance property of SISO HetNets does not hold for MIMO HetNets; instead the success probability may decrease as the network density increases. We prove that the maximum success probability is achieved by activating only one tier of BSs, while the maximum area spectral efficiency (ASE) is achieved by activating all the BSs. This reveals a unique tradeoff between the ASE and link reliability in multiuser MIMO HetNets. To achieve the maximum ASE while guaranteeing a certain link reliability, we develop efficient algorithms to find the optimal BS densities. It is shown that as the link reliability requirement increases, more BSs and more tiers should be deactivated.

preprint2016arXiv

Transmit Power Minimization for Wireless Networks with Energy Harvesting Relays

Energy harvesting (EH) has recently emerged as a key technology for green communications as it can power wireless networks with renewable energy sources. However, directly replacing the conventional non-EH transmitters by EH nodes will be a challenge. In this paper, we propose to deploy extra EH nodes as relays over an existing non-EH network. Specifically, the considered non-EH network consists of multiple source-destination (S-D) pairs. The deployed EH relays will take turns to assist each S-D pair, and energy diversity can be achieved to combat the low EH rate of each EH relay. To make the best of these EH relays, with the source transmit power minimization as the design objective, we formulate a joint power assignment and relay selection problem, which, however, is NP-hard. We thus propose a general framework to develop efficient sub-optimal algorithms, which is mainly based on a sufficient condition for the feasibility of the optimization problem. This condition yields useful design insights and also reveals an energy hardening effect, which provides the possibility to exempt the requirement of non-causal EH information. Simulation results will show that the proposed cooperation strategy can achieve near-optimal performance and provide significant power savings. Compared to the greedy cooperation method that only optimizes the performance of the current transmission block, the proposed strategy can achieve the same performance with much fewer relays, and the performance gap increases with the number of S-D pairs.

preprint2015arXiv

A Lyapunov Optimization Approach for Green Cellular Networks with Hybrid Energy Supplies

Powering cellular networks with renewable energy sources via energy harvesting (EH) has recently been proposed as a promising solution for green networking. However, with intermittent and random energy arrivals, it is challenging to provide satisfactory quality of service (QoS) in EH networks. To enjoy the greenness brought by EH while overcoming the instability of the renewable energy sources, hybrid energy supply (HES) networks that are powered by both EH and the electric grid have emerged as a new paradigm for green communications. In this paper, we will propose new design methodologies for HES green cellular networks with the help of Lyapunov optimization techniques. The network service cost, which addresses both the grid energy consumption and achievable QoS, is adopted as the performance metric, and it is optimized via base station assignment and power control (BAPC). Our main contribution is a low-complexity online algorithm to minimize the long-term average network service cost, namely, the Lyapunov optimization-based BAPC (LBAPC) algorithm. One main advantage of this algorithm is that the decisions depend only on the instantaneous side information without requiring distribution information of channels and EH processes. To determine the network operation, we only need to solve a deterministic per-time slot problem, for which an efficient inner-outer optimization algorithm is proposed. Moreover, the proposed algorithm is shown to be asymptotically optimal via rigorous analysis. Finally, sample simulation results are presented to verify the theoretical analysis as well as validate the effectiveness of the proposed algorithm.

preprint2015arXiv

Backhaul-Aware Caching Placement for Wireless Networks

As the capacity demand of mobile applications keeps increasing, the backhaul network is becoming a bottleneck to support high quality of experience (QoE) in next-generation wireless networks. Content caching at base stations (BSs) is a promising approach to alleviate the backhaul burden and reduce user-perceived latency. In this paper, we consider a wireless caching network where all the BSs are connected to a central controller via backhaul links. In such a network, users can obtain the required data from candidate BSs if the data are pre-cached. Otherwise, the user data need to be first retrieved from the central controller to local BSs, which introduces extra delay over the backhaul. In order to reduce the download delay, the caching placement strategy needs to be optimized. We formulate such a design problem as the minimization of the average download delay over user requests, subject to the caching capacity constraint of each BS. Different from existing works, our model takes BS cooperation in the radio access into consideration and is fully aware of the propagation delay on the backhaul links. The design problem is a mixed integer programming problem and is highly complicated, and thus we relax the problem and propose a low-complexity algorithm. Simulation results will show that the proposed algorithm can effectively determine the near-optimal caching placement and provide significant performance gains over conventional caching placement strategies.

preprint2015arXiv

Energy Harvesting Small Cell Networks: Feasibility, Deployment and Operation

Small cell networks (SCNs) have attracted great attention in recent years due to their potential to meet the exponential growth of mobile data traffic and the increasing demand for better quality of service and user experience in mobile applications. Nevertheless, a wide deployment of SCNs has not happened yet because of the complexity in the network planning and optimization, as well as the high expenditure involved in deployment and operation. In particular, it is difficult to provide grid power supply to all the small cell base stations (SCBSs) in a cost effective way. Moreover, a dense deployment of SCBSs, which is needed to meet the capacity and coverage of the next generation wireless networks, will increase operators' electricity bills and lead to significant carbon emission. Thus, it is crucial to exploit off-grid and green energy sources to power SCNs, for which energy harvesting (EH) technology is a viable solution. In this article, we will conduct a comprehensive study of EH-SCNs, and investigate important aspects, including the feasibility analysis, network deployment, and network operation issues. The advantages, as well as unique challenges, of EH-SCNs will be highlighted, together with potential solutions and effective design methodologies.

preprint2015arXiv

High-Dimensional CSI Acquisition in Massive MIMO: Sparsity-Inspired Approaches

Massive MIMO has been regarded as one of the key technologies for 5G wireless networks, as it can significantly improve both the spectral efficiency and energy efficiency. The availability of high-dimensional channel side information (CSI) is critical for its promised performance gains, but the overhead of acquiring CSI may potentially deplete the available radio resources. Fortunately, it has recently been discovered that harnessing various sparsity structures in massive MIMO channels can lead to significant overhead reduction, and thus improve the system performance. This paper presents and discusses the use of sparsity-inspired CSI acquisition techniques for massive MIMO, as well as the underlying mathematical theory. Sparsity-inspired approaches for both frequency-division duplexing and time-division duplexing massive MIMO systems will be examined and compared from an overall system perspective, including the design trade-offs between the two duplexing modes, computational complexity of acquisition algorithms, and applicability of sparsity structures. Meanwhile, some future prospects for research on high-dimensional CSI acquisition to meet practical demands will be identified.

preprint2015arXiv

Joint Channel and Queue Aware Scheduling for Wireless Links with Multiple Fading States

In this work, we address the delay optimal scheduling problem for wireless transmission with fixed modulation over multi-state fading channels. We propose a stochastic scheduling policy which schedules the source to transmit with probability jointly based on the buffer and channel states, with an average power constraint at the transmitter. Our objective is to minimize the average queueing delay by choosing the optimal transmission probabilities. Using Markov chain modeling, we formulate a power-constrained delay minimization problem, and then transform it into a Linear Programming (LP) one. By analyzing its property, we can derive the optimal threshold-based scheduling policy together with the corresponding transmission probabilities. Our theoretical analysis is corroborated by simulation results.

preprint2015arXiv

Large-Scale Convex Optimization for Dense Wireless Cooperative Networks

Convex optimization is a powerful tool for resource allocation and signal processing in wireless networks. As the network density is expected to drastically increase in order to accommodate the exponentially growing mobile data traffic, performance optimization problems are entering a new era characterized by a high dimension and/or a large number of constraints, which poses significant design and computational challenges. In this paper, we present a novel two-stage approach to solve large-scale convex optimization problems for dense wireless cooperative networks, which can effectively detect infeasibility and enjoy modeling flexibility. In the proposed approach, the original large-scale convex problem is transformed into a standard cone programming form in the first stage via matrix stuffing, which only needs to copy the problem parameters such as channel state information (CSI) and quality-of-service (QoS) requirements to the pre-stored structure of the standard form. The capability of yielding infeasibility certificates and enabling parallel computing is achieved by solving the homogeneous self-dual embedding of the primal-dual pair of the standard form. In the solving stage, the operator splitting method, namely, the alternating direction method of multipliers (ADMM), is adopted to solve the large-scale homogeneous self-dual embedding. Compared with second-order methods, ADMM can solve large-scale problems in parallel with modest accuracy within a reasonable amount of time. Simulation results will demonstrate the speedup, scalability, and reliability of the proposed framework compared with the state-of-the-art modeling frameworks and solvers.

preprint2015arXiv

Large-Scale Convex Optimization for Ultra-Dense Cloud-RAN

The heterogeneous cloud radio access network (Cloud-RAN) provides a revolutionary way to densify radio access networks. It enables centralized coordination and signal processing for efficient interference management and flexible network adaptation. Thus, it can resolve the main challenges for next-generation wireless networks, including higher energy efficiency and spectral efficiency, higher cost efficiency, scalable connectivity, and low latency. In this article, we shall provide an algorithmic thinking on the new design challenges for the dense heterogeneous Cloud-RAN based on convex optimization. As problem sizes scale up with the network size, we will demonstrate that it is critical to take unique structures of design problems and inherent characteristics of wireless channels into consideration, while convex optimization will serve as a powerful tool for such purposes. Network power minimization and channel state information acquisition will be used as two typical examples to demonstrate the effectiveness of convex optimization methods. We will then present a two-stage framework to solve general large-scale convex optimization problems, which is amenable to parallel implementation in the cloud data center.

preprint2015arXiv

Smoothed Lp-Minimization for Green Cloud-RAN with User Admission Control

The cloud radio access network (Cloud-RAN) has recently been proposed as one cost-effective and energy-efficient technique for 5G wireless networks. By moving the signal processing functionality to a single baseband unit (BBU) pool, centralized signal processing and resource allocation are enabled in Cloud-RAN, thereby providing the promise of improving the energy efficiency via effective network adaptation and interference management. In this paper, we propose a holistic sparse optimization framework to design green Cloud-RAN by taking into consideration the power consumption of the fronthaul links, multicast services, as well as user admission control. Specifically, we first identify the sparsity structures in the solutions of both the network power minimization and user admission control problems. However, finding the optimal sparsity structures turns out to be NP-hard, with the coupled challenges of the l0-norm based objective functions and the nonconvex quadratic QoS constraints due to multicast beamforming. In contrast to the previous works on convex but non-smooth sparsity inducing approaches, e.g., the group sparse beamforming algorithm based on the mixed l1/l2-norm relaxation [1], we adopt the nonconvex but smoothed lp-minimization (0 < p <= 1) approach to promote sparsity in the multicast setting, thereby enabling efficient algorithm design based on the principle of the majorization-minimization (MM) algorithm and the semidefinite relaxation (SDR) technique. In particular, an iterative reweighted-l2 algorithm is developed, which will converge to a Karush-Kuhn-Tucker (KKT) point of the relaxed smoothed lp-minimization problem from the SDR technique. We illustrate the effectiveness of the proposed algorithms with extensive simulations for network power minimization and user admission control in multicast Cloud-RAN.

preprint2014arXiv

Optimal Stochastic Coordinated Beamforming for Wireless Cooperative Networks with CSI Uncertainty

Transmit optimization and resource allocation for wireless cooperative networks with channel state information (CSI) uncertainty are important but challenging problems in terms of both the uncertainty modeling and performance op- timization. In this paper, we establish a generic stochastic coordinated beamforming (SCB) framework that provides flex- ibility in the channel uncertainty modeling, while guaranteeing optimality in the transmission strategies. We adopt a general stochastic model for the CSI uncertainty, which is applicable for various practical scenarios. The SCB problem turns out to be a joint chance constrained program (JCCP) and is known to be highly intractable. In contrast to all the previous algo- rithms for JCCP that can only find feasible but sub-optimal solutions, we propose a novel stochastic DC (difference-of-convex) programming algorithm with optimality guarantee, which can serve as the benchmark for evaluating heuristic and sub-optimal algorithms. The key observation is that the highly intractable probability constraint can be equivalently reformulated as a DC constraint. This further enables efficient algorithms to achieve optimality. Simulation results will illustrate the convergence, conservativeness, stability and performance gains of the proposed algorithm.

preprint2014arXiv

Scalable Coordinated Beamforming for Dense Wireless Cooperative Networks

To meet the ever growing demand for both high throughput and uniform coverage in future wireless networks, dense network deployment will be ubiquitous, for which co- operation among the access points is critical. Considering the computational complexity of designing coordinated beamformers for dense networks, low-complexity and suboptimal precoding strategies are often adopted. However, it is not clear how much performance loss will be caused. To enable optimal coordinated beamforming, in this paper, we propose a framework to design a scalable beamforming algorithm based on the alternative direction method of multipliers (ADMM) method. Specifically, we first propose to apply the matrix stuffing technique to transform the original optimization problem to an equivalent ADMM-compliant problem, which is much more efficient than the widely-used modeling framework CVX. We will then propose to use the ADMM algorithm, a.k.a. the operator splitting method, to solve the transformed ADMM-compliant problem efficiently. In particular, the subproblems of the ADMM algorithm at each iteration can be solved with closed-forms and in parallel. Simulation results show that the proposed techniques can result in significant computational efficiency compared to the state- of-the-art interior-point solvers. Furthermore, the simulation results demonstrate that the optimal coordinated beamforming can significantly improve the system performance compared to sub-optimal zero forcing beamforming.

preprint2014arXiv

User-Centric Intercell Interference Nulling for Downlink Small Cell Networks

Small cell networks are regarded as a promising candidate to meet the exponential growth of mobile data traffic in cellular networks. With a dense deployment of access points, spatial reuse will be improved, and uniform coverage can be provided. However, such performance gains cannot be achieved without effective intercell interference management. In this paper, a novel interference coordination strategy, called user-centric intercell interference nulling, is proposed for small cell networks. A main merit of the proposed strategy is its ability to effectively identify and mitigate the dominant interference for each user. Different from existing works, each user selects the coordinating base stations (BSs) based on the relative distance between the home BS and the interfering BSs, called the interference nulling (IN) range, and thus interference nulling adapts to each user's own interference situation. By adopting a random spatial network model, we derive an approximate expression of the successful transmission probability to the typical user, which is then used to determine the optimal IN range. Simulation results shall confirm the tightness of the approximation, and demonstrate significant performance gains (about 35%-40%) of the proposed coordination strategy, compared with the non-coordination case. Moreover, it is shown that the proposed strategy outperforms other interference nulling methods. Finally, the effect of imperfect channel state information (CSI) is investigated, where CSI is assumed to be obtained via limited feedback. It is shown that the proposed coordination strategy still provides significant performance gains even with a moderate number of feedback bits.

preprint2013arXiv

An Outage Exponent Region based Coded f-Matching Framework for Channel Allocation in Multi-carrier Multi-access Channels

The multi-carrier multi-access technique is widely adopt in future wireless communication systems, such as IEEE 802.16m and 3GPP LTE-A. The channel resources allocation in multi-carrier multi-access channel, which can greatly improve the system throughput with QoS assurance, thus attracted much attention from both academia and industry. There lacks, however, an analytic framework with a comprehensive performance metric, such that it is difficult to fully exploit the potentials of channel allocation. This paper will propose an analytic coded fmatching framework, where the outage exponent region (OER) will be defined as the performance metric. The OER determines the relationship of the outage performance among all of the users in the full SNR range, and converges to the diversity-multiplexing region (DMR) when SNR tends to infinity. To achieve the optimal OER and DMR, the random bipartite graph (RBG) approach, only depending on 1 bit CSI, will be proposed to formulate this problem. Based on the RBG formulation, the optimal frequency-domain coding based maximum f-matching method is then proposed. By analyzing the combinatorial structure of the RBG based coded f-matching with the help of saddlepoint approximation, the outage probability of each user, OER, and DMR will be derived in closed-form formulas. It will be shown that all of the users share the total multiplexing gain according to their rate requirements, while achieving the full frequency diversity, i.e., the optimal OER and DMR. Based on the principle of parallel computations, the parallel vertices expansion & random rotation based Hopcroft-Karp (PVER2HK) algorithm, which enjoys a logarithmic polynomial complexity, will be proposed. The simulation results will not only verify the theoretical derivations, but also show the significant performance gains.

preprint2013arXiv

Group Sparse Beamforming for Green Cloud-RAN

A cloud radio access network (Cloud-RAN) is a network architecture that holds the promise of meeting the explosive growth of mobile data traffic. In this architecture, all the baseband signal processing is shifted to a single baseband unit (BBU) pool, which enables efficient resource allocation and interference management. Meanwhile, conventional powerful base stations can be replaced by low-cost low-power remote radio heads (RRHs), producing a green and low-cost infrastructure. However, as all the RRHs need to be connected to the BBU pool through optical transport links, the transport network power consumption becomes significant. In this paper, we propose a new framework to design a green Cloud-RAN, which is formulated as a joint RRH selection and power minimization beamforming problem. To efficiently solve this problem, we first propose a greedy selection algorithm, which is shown to provide near- optimal performance. To further reduce the complexity, a novel group sparse beamforming method is proposed by inducing the group-sparsity of beamformers using the weighted $\ell_1/\ell_2$-norm minimization, where the group sparsity pattern indicates those RRHs that can be switched off. Simulation results will show that the proposed algorithms significantly reduce the network power consumption and demonstrate the importance of considering the transport link power consumption.

preprint2013arXiv

Outage Exponent: A Unified Performance Metric for Parallel Fading Channels

The parallel fading channel, which consists of finite number of subchannels, is very important, because it can be used to formulate many practical communication systems. The outage probability, on the other hand, is widely used to analyze the relationship among the communication efficiency, reliability, SNR, and channel fading. To the best of our knowledge, the previous works only studied the asymptotic outage performance of the parallel fading channel which are only valid for a large number of subchannels or high SNRs. In this paper, a unified performance metric, which we shall refer to as the outage exponent, will be proposed. Our approach is mainly based on the large deviations theory and the Meijer's G-function. It is shown that the proposed outage exponent is not only an accurate estimation of the outage probability for any number of subchannels, any SNR, and any target transmission rate, but also provides an easy way to compute the outage capacity, finite-SNR diversity-multiplexing tradeoff, and SNR gain. The asymptotic performance metrics, such as the delay-limited capacity, ergodic capacity, and diversity-multiplexing tradeoff can be directly obtained by letting the number of subchannels or SNR tends to infinity. Similar to Gallager's error exponent, a reliable function for parallel fading channels, which illustrates a fundamental relationship between the transmission reliability and efficiency, can also be defined from the outage exponent. Therefore, the proposed outage exponent provides a complete and comprehensive performance measure for parallel fading channels.

preprint2012arXiv

Optimal Scheduling and Power Allocation for Two-Hop Energy Harvesting Communication Systems

Energy harvesting (EH) has recently emerged as a promising technique for green communications. To realize its potential, communication protocols need to be redesigned to combat the randomness of the harvested energy. In this paper, we investigate how to apply relaying to improve the short-term performance of EH communication systems. With an EH source and a non-EH half-duplex relay, we consider two different design objectives: 1) short-term throughput maximization; and 2) transmission completion time minimization. Both problems are joint scheduling and power allocation problems, rendered quite challenging by the half-duplex constraint at the relay. A key finding is that directional water-filling (DWF), which is the optimal power allocation algorithm for the single-hop EH system, can serve as guideline for the design of two-hop communication systems, as it not only determines the value of the optimal performance, but also forms the basis to derive optimal solutions for both design problems. Based on a relaxed energy profile along with the DWF algorithm, we derive key properties of the optimal solutions for both problems and thereafter propose efficient algorithms. Simulation results will show that both scheduling and power allocation optimizations are necessary in two-hop EH communication systems.

preprint2012arXiv

Training Optimization for Energy Harvesting Communication Systems

Energy harvesting (EH) has recently emerged as an effective way to solve the lifetime challenge of wireless sensor networks, as it can continuously harvest energy from the environment. Unfortunately, it is challenging to guarantee a satisfactory short-term performance in EH communication systems because the harvested energy is sporadic. In this paper, we consider the channel training optimization problem in EH communication systems, i.e., how to obtain accurate channel state information to improve the communication performance. In contrast to conventional communication systems, the optimization of the training power and training period in EH communication systems is a coupled problem, which makes such optimization very challenging. We shall formulate the optimal training design problem for EH communication systems, and propose two solutions that adaptively adjust the training period and power based on either the instantaneous energy profile or the average energy harvesting rate. Numerical and simulation results will show that training optimization is important in EH communication systems. In particular, it will be shown that for short block lengths, training optimization is critical. In contrast, for long block lengths, the optimal training period is not too sensitive to the value of the block length nor to the energy profile. Therefore, a properly selected fixed training period value can be used.

preprint2011arXiv

Spatial Intercell Interference Cancellation with CSI Training and Feedback

We investigate intercell interference cancellation (ICIC) with a practical downlink training and uplink channel state information (CSI) feedback model. The average downlink throughput for such a 2-cell network is derived. The user location has a strong effect on the signal-to-interference ratio (SIR) and the channel estimation error. This motivates adaptively switching between traditional (single-cell) beamforming and ICIC at low signal-to-noise ratio (SNR) where ICIC is preferred only with low SIR and accurate channel estimation, and the use of ICIC with optimized training and feedback at high SNR. For a given channel coherence time and fixed training and feedback overheads, we develop optimal data vs. pilot power allocation for CSI training as well as optimal feedback resource allocation to feed back CSI of different channels. Both analog and finite-rate digital feedback are considered. With analog feedback, the training power optimization provides a more significant performance gain than feedback optimization; while conversely for digital feedback, performance is more sensitive to the feedback bit allocation than the training power optimization. We show that even with low-rate feedback and standard training, ICIC can transform an interference-limited cellular network into a noise-limited one.