Source author record

Pingyi Fan

Pingyi Fan 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

42works
12topics
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

42 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.

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.

preprint2022arXiv

EXK-SC: A Semantic Communication Model Based on Information Framework Expansion and Knowledge Collision

Semantic communication is not focused on improving the accuracy of transmitted symbols, but is concerned with expressing the expected meaning that the symbol sequence exactly carries. However, the measurement of semantic messages and their corresponding codebook generation are still open issues. Expansion, which integrates simple things into a complex system and even generates intelligence, is truly consistent with the evolution of the human language system. We apply this idea to the semantic communication system, quantifying semantic transmission by symbol sequences and investigating the semantic information system in a similar way as Shannon's method for digital communication systems. This work is the first to discuss semantic expansion and knowledge collision in the semantic information framework. Some important theoretical results are presented, including the relationship between semantic expansion and the transmission information rate. We believe such a semantic information framework may provide a new paradigm for semantic communications, and semantic expansion and knowledge collision will be the cornerstone of semantic information theory.

preprint2021arXiv

MIM-Based GAN: Information Metric to Amplify Small Probability Events Importance in Generative Adversarial Networks

In terms of Generative Adversarial Networks (GANs), the information metric to discriminate the generative data from the real data, lies in the key point of generation efficiency, which plays an important role in GAN-based applications, especially in anomaly detection. As for the original GAN, there exist drawbacks for its hidden information measure based on KL divergence on rare events generation and training performance for adversarial networks. Therefore, it is significant to investigate the metrics used in GANs to improve the generation ability as well as bring gains in the training process. In this paper, we adopt the exponential form, referred from the information measure, i.e. MIM, to replace the logarithm form of the original GAN. This approach is called MIM-based GAN, has better performance on networks training and rare events generation. Specifically, we first discuss the characteristics of training process in this approach. Moreover, we also analyze its advantages on generating rare events in theory. In addition, we do simulations on the datasets of MNIST and ODDS to see that the MIM-based GAN achieves state-of-the-art performance on anomaly detection compared with some classical GANs.

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

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

Storage Space Allocation Strategy for Digital Data with Message Importance

This paper mainly focuses on the problem of lossy compression storage from the perspective of message importance when the reconstructed data pursues the least distortion within limited total storage size. For this purpose, we transform this problem to an optimization by means of the importance-weighted reconstruction error in data reconstruction. Based on it, this paper puts forward an optimal allocation strategy in the storage of digital data by a kind of restrictive water-filling. That is, it is a high efficient adaptive compression strategy since it can make rational use of all the storage space. It also characterizes the trade-off between the relative weighted reconstruction error and the available storage size. Furthermore, this paper also presents that both the users' preferences and the special characteristic of data distribution can trigger the small-probability event scenarios where only a fraction of data can cover the vast majority of users' interests. Whether it is for one of the reasons above, the data with highly clustered message importance is beneficial to compression storage. In contrast, the data with uniform information distribution is incompressible, which is consistent with that in information theory.

preprint2019arXiv

Energy Harvesting Powered Sensing in IoT: Timeliness Versus Distortion

We consider an Internet-of-Things (IoT) system in which an energy harvesting powered sensor node monitors the phenomenon of interest and transmits its observations to a remote monitor over a Gaussian channel. We measure the timeliness of the signals recovered by the monitor using age of information (AoI), which could be reduced by transmitting more observations to the monitor. We evaluate the corresponding distortion with the mean-squared error (MSE) metric, which would be reduced if a larger transmit power and a larger source coding rate were used. Since the energy harvested by the sensor node is random and limited, however, the timeliness and the distortion of the received signals cannot be optimized at the same time. Thus, we shall investigate the timeliness-distortion trade-off of the system by minimizing the average weighted-sum AoI and distortion over all possible transmit powers and transmission intervals. First, we explicitly present the optimal transmit powers for the performance limit achieving save-and-transmit policy and the easy-implementing fixed power transmission policy. Second, we propose a backward water-filling based offline power allocation algorithm and a genetic based offline algorithm to jointly optimize the transmission interval and transmit power. Third, we formulate the online power control as an Markov Decision Process (MDP) and solve the problem with an iterative algorithm, which closely approach the trade-off limit of the system. Also, we show that the optimal transmit power is a monotonic and bi-valued function of current AoI and distortion. Finally, we present our results via numerical simulations and extend results on the save-and-transmit policy to fading sensing systems.

preprint2016arXiv

Location-aware ICI Reduction in MIMO-OFDM Downlinks for High-speed Railway Communication Systems

High mobility may destroy the orthogonality of subcarriers in OFDM systems, resulting in inter- carrier interference (ICI), which may greatly reduce the service quantity of high-speed railway (HSR) wireless communications. This paper focuses on ICI mitigation in the HSR downlinks with distributed transmit antennas.For such a system, its key feature is that the ICIs are caused by multiple carrier frequency offsets corresponding to multiple transmit antennas. Meanwhile, the channel of HSR is fast time varying, which is another big challenge in the system design. In order to get a good performance, low complexity real-time ICI reduction is necessary. To this end, we first analyzed the property of the ICI matrix in AWGN and Rician scenarios, respectively. Then, we propose corresponding low complexity ICI reduction methods based on location information. For evaluating the effectiveness of the proposed method, the expectation and variance of remaining interference after ICI reduction is analyzed with respect to Rician K-factor. In addition, the service quantity and the bandwidth and computation cost are also discussed. Numerical results are presented to verify our theoretical analysis and the effectiveness of proposed ICI reduction methods. One important observation is that our proposed ICI mitigation method can achieve almost the same service quantity with that obtained on the case without ICI at 300km/h,that is, ICI has been completely eliminated. Numerical results also show that the scenarios with Rician K-factors over 30dB can be considered as AWGN scenarios, which may provide valuable insights on future system designs.

preprint2016arXiv

Message Importance Measure and Its Application to Minority Subset Detection in Big Data

Message importance measure (MIM) is an important index to describe the message importance in the scenario of big data. Similar to the Shannon Entropy and Renyi Entropy, MIM is required to characterize the uncertainty of a random process and some related statistical characteristics. Moreover, MIM also need to highlight the importance of those events with relatively small occurring probabilities, thereby is especially applicable to big data. In this paper, we first define a parametric MIM measure from the viewpoint of information theory and then investigate its properties. We also present a parameter selection principle that provides answers to the minority subsets detection problem in the statistical processing of big data.

preprint2016arXiv

Mobile Millimeter Wave Channel Acquisition, Tracking, and Abrupt Change Detection

Millimeter wave provides a promising approach for meeting the ever-growing traffic demand in next generation wireless networks. It is crucial to obtain relatively accurate channel state information so that beamforming/combining can be performed to compensate for severe path loss in this band. In contrast to lower frequencies, a typical mobile millimeter wave channel consists of a few dominant paths. It is generally sufficient to estimate the path gains, angles of departure (AoD), and angles of arrival (AoA) of those paths. In this paper, multiple transmit and receive antennas and beamforming with a single baseband processing chain are assumed. We propose a framework for estimating millimeter wave channels with intermittent abrupt changes (e.g., blockage or emergence of dominant paths) and slow variations of AoDs and AoAs. The solution consists of three components: tracking of the slow channel variations, detection of abrupt changes, followed by (re-)acquisition of channel (and back to the tracking stage). For acquisition, we formulate a least squares problem and find its solution based on the Levenberg-Marquardt algorithm. To track slow variations of AoDs and AoAs, we propose a new approach using Kalman filtering. Finally, an algorithm based on a likelihood test is devised for detecting abrupt changes. Simulation results show that, with moderate signal-to-noise ratios, the proposed scheme can achieve more than 8 dB higher estimation accuracy than several other methods using the same number of pilots.

preprint2016arXiv

Optimum Transmission Policies for Energy Harvesting Sensor Networks Powered By a Mobile Control Center

Wireless energy transfer, namely RF-based energy harvesting, is a potential way to prolong the lifetime of energy-constrained devices, especially in wireless sensor networks. However, due to huge propagation attenuation, its energy efficiency is regarded as the biggest bottleneck to widely applications. It is critical to find appropriate transmission policies to improve the global energy efficiency in this kind of systems. To this end, this paper focuses on the sensor networks scenario, where a mobile control center powers the sensors by RF signal and also collects information from them. Two related schemes, called as harvest-and-use scheme and harvest-store-use scheme, are investigated, respectively. In harvest-and-use scheme, as a benchmark, both constant and adaptive transmission modes from sensors are discussed. To harvest-store-use scheme, we propose a new concept, the best opportunity for wireless energy transfer, and use it to derive an explicit closed-form expression of optimal transmission policy. It is shown by simulation that a considerable improvement in terms of energy efficiency can be obtained with the help of the transmission policies developed in this paper. Furthermore, the transmission policies is also discussed under the constraint of fixed information rate. The minimal required power, the performance loss from the new constraint as well as the effect of fading are then presented.

preprint2016arXiv

Position-aided Large-scale MIMO Channel Estimation for High-Speed Railway Communication Systems

We consider channel estimation for high-speed railway communication systems, where both the transmitter and the receiver are equipped with large-scale antenna arrays. It is known that the throughput of conventional training schemes monotonically decreases with the mobility. Assuming that the moving terminal employs a large linear antenna array, this paper proposes a position-aided channel estimation scheme whereby only a portion of the transmit antennas send pilot symbols and the full channel matrix can be well estimated by using these pilots together with the antenna position information based on the joint spatial-temporal correlation. The relationship between mobility and throughput/DoF is established. Furthermore, the optimal selections of transmit power and time interval partition between the training and data phases as well as the antenna size are presented accordingly. Both analytical and simulation results show that the system throughput with the position-aided channel estimator does not deteriorate appreciably as the mobility increases, which is sharply in contrast with the conventional one.

preprint2016arXiv

Remote Antenna Unit Selection Assisted Seamless Handover for High-Speed Railway Communications with Distributed Antennas

To attain seamless handover and reduce the han- dover failure probability for high-speed railway (HSR) com- munication systems, this paper proposes a remote antenna unit (RAU) selection assisted handover scheme where two antennas are installed on high speed train (HST) and distributed antenna system (DAS) cell architecture on ground is adopted. The RAU selection is used to provide high quality received signals for trains moving in DAS cells and the two HST antennas are employed on trains to realize seamless handover. Moreover, to efficiently evaluate the system performance, a new met- ric termed as handover occurrence probability is defined for describing the relation between handover occurrence position and handover failure probability. We then analyze the received signal strength, the handover trigger probability, the handover occurrence probability, the handover failure probability and the communication interruption probability. Numerical results are provided to compare our proposed scheme with the current existing ones. It is shown that our proposed scheme achieves better performances in terms of handover failure probability and communication interruption probability.

preprint2015arXiv

Deploying Multiple Antennas on High-speed Trains: Equidistant Strategy v.s. Fixed-Interval Strategy

Deploying multiple antennas on high speed trains is an effective way to enhance the information transmission performance for high speed railway (HSR) wireless communication systems. However, how to efficiently deploy multiple antennas on a train? This problem has not been studied yet. In this paper, we shall investigate efficient antenna deployment strategies for HSR communication systems where two multi-antenna deployment strategies, i.e., the equidistant strategy and the fixed-interval strategy, are considered. To evaluate the system performance, mobile service amount and outage time ratio are introduced. Theoretical analysis and numerical results show that, when the length of the train is not very large, for two-antenna case, by increasing the distance of neighboring antennas in a reasonable region, the system performance can be enhanced. It is also shown that the two strategies have much difference performance behavior in terms of instantaneous channel capacity, and the fixed-interval strategy may achieve much better performance than the equidistant one in terms of service amount and outage time ratio when the antenna number is much large.

preprint2015arXiv

Energy Efficiency with Proportional Rate Fairness in Multi-Relay OFDM Networks

This paper investigates the energy efficiency (EE) in multiple relay aided OFDM system, where decode-and-forward (DF) relay beamforming is employed to help the information transmission. In order to explore the EE performance with user fairness for such a system, we formulate an optimization problem to maximize the EE by jointly considering several factors, the transmission mode selection (DF relay beamforming or direct-link transmission), the helping relay set selection, the subcarrier assignment and the power allocation at the source and relays on subcarriers, under nonlinear proportional rate fairness constraints, where both transmit power consumption and linearly rate-dependent circuit power consumption are taken into account. To solve the non-convex optimization problem, we propose a low-complexity scheme to approximate it. Simulation results demonstrate its effectiveness. We also investigate the effects of the circuit power consumption on system performances and observe that with both the constant and the linearly rate-dependent circuit power consumption, system EE grows with the increment of system average channel-to noise ratio (CNR), but the growth rates show different behaviors. For the constant circuit power consumption, system EE increasing rate is an increasing function of the system average CNR, while for the linearly rate-dependent one, system EE increasing rate is a decreasing function of the system average CNR. This observation is very important which indicates that by deducing the circuit dynamic power consumption per unit data rate, system EE can be greatly enhanced. Besides, we also discuss the effects of the number of users and subcarriers on the system EE performance.

preprint2015arXiv

Fundamental Limits of Caching: Improved Bounds For Small Buffer Users

In this work, the peak rate of the caching problem is investigated, under the scenario that the users are with small buffer sizes and the number of users is no less than the amount of files in the server. A novel coded caching strategy is proposed for such a scenario, leading to a lower peak rate compared to recent results in the literature. Furthermore, it is verified that our peak rates coincides with the cut-set bound analytically in an information-theoretic view.

preprint2015arXiv

Mobile Service-Based Cooperative Scheduling for High-Mobility Vehicular Networks

This paper investigates the downlink scheduling for relay-aided high-mobility vehicular networks, where the vehicles with good vehicle-to-infrastructure (V2I) links are employed as cooperative relay nodes to help the ones with poor V2I links forward information via vehicle-to-vehicle (V2V) links. In existing works, instantaneous achievable information rate was widely adopted to perform the link scheduling, but it is not efficient for vehicular networks, especially for high-mobility scenarios. Different from them, in this paper, we introduce the mobile service to describe the mobile link capacity of vehicular networks and then we propose a mobile service based relaying scheduling (MSRS) for high mobility vehicular networks. In order to explore the system information transmission performance limit, we formulate an optimization problem to maximize the mobile service amount of MSRS by jointly scheduling the V2I and V2V links. Since it is a combinational optimization problem which is too complex to solve, we design an efficient algorithm with low-complexity for it, where Sort-then-Select, Hungarian algorithm and Bisection search are employed. Simulation results demonstrate that our proposed MSRS is able to achieve the optimal results with an optimal approximation ratio larger than 96.5%. It is also shown that our proposed MSRS is much more efficient for high-mobility vehicular systems, which can improve the system average throughput with increment of 3.63% compared with existing instantaneous achievable information rate based scheduling method, and with 15% increment compared with traditional non-cooperation scheduling method, respectively.

preprint2015arXiv

Mobility-Aware Uplink Interference Model for 5G Heterogeneous Networks

To meet the surging demand for throughput, 5G cellular networks need to be more heterogeneous and much denser, by deploying more and more small cells. In particular, the number of users in each small cell can change dramatically due to users' mobility, resulting in random and time varying uplink interference. This paper considers the uplink interference in a 5G heterogeneous network which is jointly covered by one macro cell and several small cells. Based on the Lévy flight moving model, a mobility-aware interference model is proposed to characterize the uplink interference from macro cell users to small cell users. In this model, the total uplink interference is characterized by its moment generating function, for both closed subscriber group (CSG) and open subscriber group (CSG) femto cells. In addition, the proposed interference model is a function of basic step length, which is a key velocity parameter of Lévy flights. It is shown by both theoretical analysis and simulation results that the proposed interference model provides a flexible way of evaluating the system performance in terms of success probability and average rate.

preprint2015arXiv

Network Coding Tree Algorithm for Multiple Access System

Network coding is famous for significantly improving the throughput of networks. The successful decoding of the network coded data relies on some side information of the original data. In that framework, independent data flows are usually first decoded and then network coded by relay nodes. If appropriate signal design is adopted, physical layer network coding is a natural way in wireless networks. In this work, a network coding tree algorithm which enhances the efficiency of the multiple access system (MAS) is presented. For MAS, existing works tried to avoid the collisions while collisions happen frequently under heavy load. By introducing network coding to MAS, our proposed algorithm achieves a better performance of throughput and delay. When multiple users transmit signal in a time slot, the mexed signals are saved and used to jointly decode the collided frames after some component frames of the network coded frame are received. Splitting tree structure is extended to the new algorithm for collision solving. The throughput of the system and average delay of frames are presented in a recursive way. Besides, extensive simulations show that network coding tree algorithm enhances the system throughput and decreases the average frame delay compared with other algorithms. Hence, it improves the system performance.

preprint2015arXiv

Power Allocation for Mixed Traffic Broadcast with Service Outage Constraint

To transmit a mixture of real-time and non-real-time traffic in a broadcast system, we impose a basic service rate $r_0$ for real-time traffic and use the excess rate beyond $r_0$ to transmit non-real-time traffic. Considering the time-varying nature of wireless channels, the basic service rate is guaranteed with a service outage constraint, where service outage occurs when the channel capacity is below the basic service rate. This approach is well suited for providing growing services like video, real-time TV, etc., in group transportation systems such as coach, high-speed train, and airplane. We show that the optimal power allocation policy depends only on the statistics of the minimum gain of all user channels, and it is a combination of water-filling and channel inversion. We provide the optimal power allocation policy, which guarantees that real-time traffic be delivered with quality of service (QoS) for every user. Moreover, we show that the required minimum average power to satisfy the service outage constraint increases linearly with the number of users.

preprint2015arXiv

Simultaneous Wireless Information and Power Transfer in Cooperative Relay Networks with Rateless Codes

This paper investigates the simultaneous wireless information and power transfer (SWIPT) in cooperative relay networks, where a relay harvests energy from the radio frequency (RF) signals transmitted by a source and then uses the harvested energy to assist the information transmission from the source to its destination. Both source and relay transmissions use rateless code, which allows the destination to employ any of the two information receiving strategies, i.e., the mutual information accumulation (IA) and the energy accumulation (EA). The SWIPT-enabled relay employs three different SWIPT receiver architectures, the ideal receiver and two practical receivers (i.e., the power splitting (PS) and the time switch (TS) receivers). Accordingly, three relaying protocols, namely, ideal protocol, PS protocol and TS protocol, are presented. In order to explore the system performance limits with these three protocols, optimization problems are formulated to maximize their achievable information rates. For the ideal protocol, explicit expressions of the optimal solutions are derived. For the PS protocol, a linear-search algorithm is designed to solve the non-convex problems. For the TS protocol, two solving methods are presented. Numerical experiments are carried out to validate our analysis and algorithms, which also show that, with the same SWIPT receiver, the IA-based system outperforms the EA-based system, while with the same information receiving strategy, PS protocol outperforms TS protocol. Moreover, compared with conventional non-SWIPT and non-rateless-coded systems, the proposed protocols exhibit considerable performance gains, especially in relatively low signal-to-noise ratio (SNR) regime. Besides, the effects of the source-destination direct link and the relay position on system performance are also discussed, which provides insights on SWIPT-enabled relay systems.

preprint2015arXiv

Tracking Angles of Departure and Arrival in a Mobile Millimeter Wave Channel

Millimeter wave provides a very promising approach for meeting the ever-growing traffic demand in next generation wireless networks. To utilize this band, it is crucial to obtain the channel state information in order to perform beamforming and combining to compensate for severe path loss. In contrast to lower frequencies, a typical millimeter wave channel consists of a few dominant paths. Thus it is generally sufficient to estimate the path gains, angles of departure (AoDs), and angles of arrival (AoAs) of those paths. Proposed in this paper is a dual timescale model to characterize abrupt channel changes (e.g., blockage) and slow variations of AoDs and AoAs. This work focuses on tracking the slow variations and detecting abrupt changes. A Kalman filter based tracking algorithm and an abrupt change detection method are proposed. The tracking algorithm is compared with the adaptive algorithm due to Alkhateeb, Ayach, Leus and Heath (2014) in the case with single radio frequency chain. Simulation results show that to achieve the same tracking performance, the proposed algorithm requires much lower signal-to-noise-ratio (SNR) and much fewer pilots than the other algorithm. Moreover, the change detection method can always detect abrupt changes with moderate number of pilots and SNR.

preprint2015arXiv

Weighted Sum-Throughput Maximization for MIMO Broadcast Channel: Energy Harvesting Under System Imperfection

In this work, a MIMO broadcast channel under the energy harvesting (EH) constraint and the peak power constraint is investigated. The transmitter is equipped with a hybrid energy storage system consisting of a perfect super capacitor (SC) and an inefficient battery, where both elements have limited energy storage capacities. In addition, the effect of data processing circuit power consumption is also addressed. To be specific, two extreme cases are studied here, where the first assumes ideal/zero circuit power consumption and the second considers a positive constant circuit power consumption where the circuit is always operating at its highest power level. The performance of these two extreme cases hence serve as the upper bound and the lower bound of the system performance in practice, respectively. In this setting, the offline scheduling with ideal and maximum circuit power consumptions are investigated. The associated optimization problems are formulated and solved in terms of weighted throughput optimization. Further, we extend to a general circuit power consumption model. To complement this work, some intuitive online policies are presented for all cases. Interestingly, for the case with maximum circuit power consumption, a close-to-optimal online policy is presented and its performance is shown to be comparable to its offline counterpart in the numerical results.

preprint2014arXiv

A Queueing Characterization of Information Transmission over Block Fading Rayleigh Channels in the Low SNR

Unlike the AWGN (additive white gaussian noise) channel, fading channels suffer from random channel gains besides the additive Gaussian noise. As a result, the instantaneous channel capacity varies randomly along time, which makes it insufficient to characterize the transmission capability of a fading channel using data rate only. In this paper, the transmission capability of a buffer-aided block Rayleigh fading channel is examined by a constant rate input data stream, and reflected by several parameters such as the average queue length, stationary queue length distribution, packet delay and overflow probability. Both infinite-buffer model and finite-buffer model are considered. Taking advantage of the memoryless property of the service provided by the channel in each block in the the low SNR (signal-to-noise ratio) regime, the information transmission over the channel is formulated as a \textit{discrete time discrete state} $D/G/1$ queueing problem. The obtained results show that block fading channels are unable to support a data rate close to their ergodic capacity, no matter how long the buffer is, even seen from the application layer. For the finite-buffer model, the overflow probability is derived with explicit expression, and is shown to decrease exponentially when buffer size is increased, even when the buffer size is very small.

preprint2014arXiv

Downlink Resource Allocation for the High-speed Train and Local Users in OFDMA Systems

We consider providing services for passengers in a high-speed train and local users (quasi-static users) in a single OFDMA system. For the train, we apply a two-hop architecture, under which, passengers communicate with base stations (BSs) via a mobile relay (MR) installed in the train cabin. With this architecture, all passengers in the train can be represented by the MR. Since the channels of the MR and local users vary differently, we consider allocating system resources (power and subcarriers) over two time-scales for them. We formulate the problem as a capacity optimization problem for the MR subject to the sum capacity constraint of local users. We treat the inter-carrier interference (ICI) at the MR as additive Gaussian noise and derive an explicit expression for the ICI using the two-path Doppler spread model. Then we discuss the optimization problem and propose an optimal power and subcarrier allocation (OPSA) policy. The capacity obtained using OPSA is compared with that of constant power and subcarrier allocation (CPSA) policies. Simulation results justify the optimality of the OPSA. Besides, by comparing the capacity bounds achieved by OPSA with and without ICI, we find that only in specific regions, where the gap between the capacity bounds is large, do practical ICI cancellation methods provide meaningful rate gain.

preprint2014arXiv

High Speed Railway Wireless Communications: Efficiency v.s. Fairness

High speed railways (HSRs) have been deployed widely all over the world in recent years. Different from traditional cellular communication, its high mobility makes it essential to implement power allocation along the time. In the HSR case, the transmission rate depends greatly on the distance between the base station (BS) and the train. As a result, the train receives a time varying data rate service when passing by a BS. It is clear that the most efficient power allocation will spend all the power when the train is nearest from the BS, which will cause great unfairness along the time. On the other hand, the channel inversion allocation achieves the best fairness in terms of constant rate transmission. However, its power efficiency is much lower. Therefore, the power efficiency and the fairness along time are two incompatible objects. For the HSR cellular system considered in this paper, a trade-off between the two is achieved by proposing a temporal proportional fair power allocation scheme. Besides, near optimal closed form solution and one algorithm finding the $ε$-optimal allocation are presented.

preprint2014arXiv

On the Power Allocation for Hybrid DF and CF Protocol with Auxiliary Parameter in Fading Relay Channels

In fading channels, power allocation over channel state may bring a rate increment compared to the fixed constant power mode. Such a rate increment is referred to power allocation gain. It is expected that the power allocation gain varies for different relay protocols. In this paper, Decode-and-Forward (DF) and Compress-and-Forward (CF) protocols are considered. We first establish a general framework for relay power allocation of DF and CF over channel state in half-duplex relay channels and present the optimal solution for relay power allocation with auxiliary parameters, respectively. Then, we reconsider the power allocation problem for one hybrid scheme which always selects the better one between DF and CF and obtain a near optimal solution for the hybrid scheme by introducing an auxiliary rate function as well as avoiding the non-concave rate optimization problem.

preprint2014arXiv

Outage Probability of Energy Harvesting Relay-aided Cooperative Networks Over Rayleigh Fading Channel

Energy harvesting technique is a potential way for relay node energy supply in cooperative networks in terms of deployment flexibility and maintain charge reduction. Unlike traditional power source, relay node in this case may run out of energy with certain probability, which can degrade the benefit from relay-aided cooperative transmission. In this paper, we concentrate on the outage behavior of cooperative networks aided by energy harvesting relay node in slow fading channel, and attempt to derive the closed-form expression of outage probability of proposed cooperative protocol. Compared with traditional direct transmission protocol, two conclusions are derived: 1) the diversity gain cannot be increased excepting the extreme case that energy-exhausted probability is zero; 2) a multiplicative gain for improving system performance can be obtained in terms of minimizing outage probability.

preprint2014arXiv

QoS-distinguished Achievable Rate Region for High Speed Railway Wireless Communications

In high speed railways (HSRs) communication system, when a train travels along the railway with high velocity, the wireless channel between the train and base station varies strenuously, which makes it essential to implement appropriate power allocations to guarantee system performance. What's more, how to evaluate the performance limits in this new scenario is also needed to consider. To this end, this paper investigates the performance limits of wireless communication in HSRs scenario. Since the hybrid information transmitted between train and base station usually has diverse quality of service (QoS) requirements, QoS-based achievable rate region is utilized to characterize the transmission performance in this paper. It is proved that traditional ergodic capacity and outage capacity with unique QoS requirement can be regarded as two extreme cases of the achievable rate region proposed in this paper. The corresponding optimal power allocation strategy is also given to achieve the maximal boundary of achievable rate region. Compared with conventional strategies, the advantages of the proposed strategy are validated in terms of green communication, namely minimizing average transmit power. Besides, the hybrid information transmission in a non-uniform generalized motion scenario is analyzed to confirm the robust performance of proposed strategy. The performance loss caused by non-uniform motion compared with that in uniform motion is also indicated, where a deterministic worst case for instantaneous speed realization is proposed to serve as the lower bound for system performance.

preprint2014arXiv

The Deterministic Time-Linearity of Service Provided by Fading Channels

In the paper, we study the service process $S(t)$ of an independent and identically distributed (\textit{i.i.d.}) Nakagami-$m$ fading channel, which is defined as the amount of service provided, i.e., the integral of the instantaneous channel capacity over time $t$. By using the Characteristic Function (CF) approach and the infinitely divisible law, it is proved that, other than certain generally recognized curve form {or a stochastic process}, the channel service process $S(t)$ is a deterministic linear function of time $t$, namely, $S(t)=c_m^\ast\cdot t$ where $c_m^\ast$ is a constant determined by the fading parameter $m$. Furthermore, we extend it to general \textit{i.i.d.} fading channels and present an explicit form of the constant service rate $c_p^\ast$. The obtained work provides such a new insight on the system design of joint source/channel coding that there exists a coding scheme such that a receiver can decode with zero error probability and zero high layer queuing delay, if the transmitter maintains a constant data rate no more than $c_p^\ast$. Finally, we verify our analysis through Monte Carlo simulations.

preprint2014arXiv

Time-Switching Based SWIPT for Network-Coded Two-Way Relay Transmission with Data Rate Fairness

This paper investigates the simultaneous wireless power and information transfer (SWPIT) for network-coded two-way re- lay transmission from an information theoretical viewpoint, where two sources exchange information via an energy har- vesting relay. By considering the time switching (TS) relay receiver architecture, we present the TS-based two-way re- laying (TS-TWR) protocol. In order to explore the system throughput limit with data rate fairness, we formulate an op- timization problem under total power constraint. To solve the problem, we first derive some explicit results and then de- sign an efficient algorithm. Numerical results show that with the same total available power, TS-TWR has a certain per- formance loss compared with conventional non-EH two-way relaying due to the path loss effect on energy transfer, where in relatively low and relatively high SNR regimes, the perfor- mance losses are relatively small.

preprint2014arXiv

Wireless Communication System with RF-based Energy Harvesting: From Information Theory to Green System

Harvesting energy from ambient environment is a new promising solution to free electronic devices from electric wire or limited-lifetime battery, which may find very significant applications in sensor networks and body-area networks. This paper mainly investigate the fundamental limits of information transmission in wireless communication system with RF-based energy harvesting, in which a master node acts not only as an information source but also an energy source for child node while only information is transmitted back from child to master node. Three typical structures: optimum receiver, orthogonal receiver and power splitting receiver are considered where two way information transmission between two nodes under an unique external power supply constraint at master node are jointly investigated in the viewpoint of systemic level. We explicitly characterize the achievable capacity-rate region and also discuss the effect of signal processing power consumption at child node. The optimal transmission strategy corresponding to the most energy-efficient status, namely the point on the boundary of achievable capacity-rate region, is derived with help of conditional capacity function. Simulation confirms the substantial gains of employing optimal transmission strategy and optimum receiver structure. Besides, a typical application on minimizing required transmit power to green system is presented.

preprint2014arXiv

Wireless Information and Energy Transfer for Two-Hop Non-Regenerative MIMO-OFDM Relay Networks

This paper investigates the simultaneous wireless information and energy transfer for the non-regenerative multipleinput multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) relaying system. By considering two practical receiver architectures, we present two protocols, time switchingbased relaying (TSR) and power splitting-based relaying (PSR). To explore the system performance limit, we formulate two optimization problems to maximize the end-to-end achievable information rate with the full channel state information (CSI) assumption. Since both problems are non-convex and have no known solution method, we firstly derive some explicit results by theoretical analysis and then design effective algorithms for them. Numerical results show that the performances of both protocols are greatly affected by the relay position. Specifically, PSR and TSR show very different behaviors to the variation of relay position. The achievable information rate of PSR monotonically decreases when the relay moves from the source towards the destination, but for TSR, the performance is relatively worse when the relay is placed in the middle of the source and the destination. This is the first time to observe such a phenomenon. In addition, it is also shown that PSR always outperforms TSR in such a MIMO-OFDM relaying system. Moreover, the effect of the number of antennas and the number of subcarriers are also discussed.

preprint2013arXiv

An Extended Fano's Inequality for the Finite Blocklength Coding

Fano's inequality reveals the relation between the conditional entropy and the probability of error . It has been the key tool in proving the converse of coding theorems in the past sixty years. In this paper, an extended Fano's inequality is proposed, which is tighter and more applicable for codings in the finite blocklength regime. Lower bounds on the mutual information and an upper bound on the codebook size are also given, which are shown to be tighter than the original Fano's inequality. Especially, the extended Fano's inequality is tight for some symmetric channels such as the $q$-ary symmetric channels (QSC).

preprint2013arXiv

Channel Service Based High Speed Railway Base Station Arrangement

With the rapid development of high-speed railways, demands on high mobility wireless communication increase greatly. To provide stable and high data rate wireless access for users in the train, it is necessary to properly deploy base stations along the railway. In this paper, we consider this issue from the perspective of channel service which is defined as the integral of the time-varying instantaneous channel capacity. It will show that the total service quantity of each base station is a constant. In order to keep high service efficiency of the railway communication system with multiple base stations along the railway, we need to use the time division to schedule the multiple stations and allow one base station to work when the train is running close to it. In this way, we find a fact that if the ratio of the service quantity provided by each station to its total service quantity is given, the base station interval(i.e. the distance between two adjacent base stations) is a constant, regardless of the speed of the train. On the other hand, interval between two neighboring base stations will increase with the speed of the train. Furthermore, using the concept of channel service, we also analyze the transmission strategy of base stations.

preprint2013arXiv

Every-user delay guarantee for wireless multiple access systems

The quality of service (QoS) requirements are usually different from user to user in a multiaccess system, and it is necessary to take the different requirements into account when allocating the shared resources of the system. In this paper, we consider one QoS criterion--delay in a multiaccess system, and we combine information theory and queueing theory in an attempt to analyze whether a multiaccess system can meet the different delay requirements of users. For users with the same transmission power, we prove that only $N$ inequalities are necessary for the checking, and for users with different transmission powers, we provide a polynomial-time algorithm for such a decision. In cases where the system cannot satisfy the delay requirements of all users, we prove that as long as the sum power is larger than a threshold, there is always an approach to adjust the transmission power of each user to make the system delay feasible if power reallocation is available.

preprint2013arXiv

Service based hight-speed railway base station arrangement

To provide stable and high data rate wireless access for passengers in the train, it is necessary to properly deploy base stations along the railway. We consider this issue from the perspective of service, which is defined as the integral of the time-varying instantaneous channel capacity. With large-scale fading assumption, it will be shown that the total service of each base station is inversely proportional to the velocity of the train. Besides, we find that if the ratio of the service provided by a base station in its service region to its total service is given, the base station interval (i.e. the distance between two adjacent base stations) is a constant regardless of the velocity of the train. On the other hand, if a certain amount of service is required, the interval will increase with the velocity of the train. The above results apply not only to simple curve rails, like line rail and arc rail, but also to any irregular curve rail, provided that the train is travelling at a constant velocity. Furthermore, the new developed results are applied to analyze the on-off transmission strategy of base stations.

preprint2010arXiv

Joint Channel Probing and Proportional Fair Scheduling in Wireless Networks

The design of a scheduling scheme is crucial for the efficiency and user-fairness of wireless networks. Assuming that the quality of all user channels is available to a central controller, a simple scheme which maximizes the utility function defined as the sum logarithm throughput of all users has been shown to guarantee proportional fairness. However, to acquire the channel quality information may consume substantial amount of resources. In this work, it is assumed that probing the quality of each user's channel takes a fraction of the coherence time, so that the amount of time for data transmission is reduced. The multiuser diversity gain does not always increase as the number of users increases. In case the statistics of the channel quality is available to the controller, the problem of sequential channel probing for user scheduling is formulated as an optimal stopping time problem. A joint channel probing and proportional fair scheduling scheme is developed. This scheme is extended to the case where the channel statistics are not available to the controller, in which case a joint learning, probing and scheduling scheme is designed by studying a generalized bandit problem. Numerical results demonstrate that the proposed scheduling schemes can provide significant gain over existing schemes.