SearcharxivSearch

arXiv subjects

Chen-Feng Liu

Publications and source records attributed to Chen-Feng Liu.

At least 19 recordsLinked to original sources

The Rendezvous Between Extreme Value Theory and Next-generation Networks

Promising technologies such as massive multiple-input and multiple-output, reconfigurable intelligent reflecting surfaces, non-terrestrial networks, millimetre wave communication, ultra-reliable lowlatency communication are envisioned as the enablers for next-generation (NG) networks. In contrast to conventional communication systems meeting specific average performance requirements, NG systems are expected to meet quality-of-service requirements in extreme scenarios as well. In this regard, extreme value theory (EVT) provides a powerful framework for the design of communication systems. In this paper, we provide a comprehensive survey of advances in communication that utilize EVT to characterize the extreme order statistics of interest. We first give an overview of the history of EVT and then elaborate on the fundamental theorems. Subsequently, we discuss different problems of interest in NG communication systems and how EVT can be utilized for their analysis. We finally point out the open challenges and future directions of EVT in NG communication systems.

cs.IT

URLLC-Aware Proactive UAV Placement in Internet of Vehicles

Unmanned aerial vehicles (UAVs) are envisioned to provide diverse services from the air. The service quality may rely on the wireless performance which is affected by the UAV's position. In this paper, we focus on the UAV placement problem in the Internet of Vehicles, where the UAV is deployed to monitor the road traffic and sends the monitored videos to vehicles. The studied problem is formulated as video resolution maximization by optimizing over the UAV's position. Moreover, we take into account the maximal transmission delay and impose a probabilistic constraint. To solve the formulated problem, we first leverage the techniques in extreme value theory (EVT) and Gaussian process regression (GPR) to characterize the influence of the UAV's position on the delay performance. Based on this characterization, we subsequently propose a proactive resolution selection and UAV placement approach, which adaptively places the UAV according to the geographic distribution of vehicles. Numerical results justify the joint usage of EVT and GPR for maximal delay characterization. Through investigating the maximal transmission delay, the proposed approach nearly achieves the optimal performance when vehicles are evenly distributed, and reduces 10% and 19% of the 999-th 1000-quantile over two baselines when vehicles are biased distributed.

cs.NI

UAV Immersive Video Streaming: A Comprehensive Survey, Benchmarking, and Open Challenges

Over the past decade, the utilization of UAVs has witnessed significant growth, owing to their agility, rapid deployment, and maneuverability. In particular, the use of UAV-mounted 360-degree cameras to capture omnidirectional videos has enabled truly immersive viewing experiences with up to 6DoF. However, achieving this immersive experience necessitates encoding omnidirectional videos in high resolution, leading to increased bitrates. Consequently, new challenges arise in terms of latency, throughput, perceived quality, and energy consumption for real-time streaming of such content. This paper presents a comprehensive survey of research efforts in UAV-based immersive video streaming, benchmarks popular video encoding schemes, and identifies open research challenges. Initially, we review the literature on 360-degree video coding, packaging, and streaming, with a particular focus on standardization efforts to ensure interoperability of immersive video streaming devices and services. Subsequently, we provide a comprehensive review of research efforts focused on optimizing video streaming for timevarying UAV wireless channels. Additionally, we introduce a high resolution 360-degree video dataset captured from UAVs under different flying conditions. This dataset facilitates the evaluation of complexity and coding efficiency of software and hardware video encoders based on popular video coding standards and formats, including AVC/H.264, HEVC/H.265, VVC/H.266, VP9, and AV1. Our results demonstrate that HEVC achieves the best trade-off between coding efficiency and complexity through its hardware implementation, while AV1 format excels in coding efficiency through its software implementation, specifically using the libsvt-av1 encoder. Furthermore, we present a real testbed showcasing 360-degree video streaming over a UAV, enabling remote control of the drone via a 5G cellular network.

eess.IV

Federated Learning with Correlated Data: Taming the Tail for Age-Optimal Industrial IoT

While information delivery in industrial Internet of things demands reliability and latency guarantees, the freshness of the controller's available information, measured by the age of information (AoI), is paramount for high-performing industrial automation. The problem in this work is cast as a sensor's transmit power minimization subject to the peak-AoI requirement and a probabilistic constraint on queuing latency. We further characterize the tail behavior of the latency by a generalized Pareto distribution (GPD) for solving the power allocation problem through Lyapunov optimization. As each sensor utilizes its own data to locally train the GPD model, we incorporate federated learning and propose a local-model selection approach which accounts for correlation among the sensor's training data. Numerical results show the tradeoff between the transmit power, peak AoI, and delay's tail distribution. Furthermore, we verify the superiority of the proposed correlation-aware approach for selecting the local models in federated learning over an existing baseline.

cs.LG

Age-Optimal Power Allocation in Industrial IoT: A Risk-Sensitive Federated Learning Approach

This work studies a real-time environment monitoring scenario in the industrial Internet of things, where wireless sensors proactively collect environmental data and transmit it to the controller. We adopt the notion of risk-sensitivity in financial mathematics as the objective to jointly minimize the mean, variance, and other higher-order statistics of the network energy consumption subject to the constraints on the age of information (AoI) threshold violation probability and the AoI exceedances over a pre-defined threshold. We characterize the extreme AoI staleness using results in extreme value theory and propose a distributed power allocation approach by weaving in together principles of Lyapunov optimization and federated learning (FL). Simulation results demonstrate that the proposed FL-based distributed solution is on par with the centralized baseline while consuming 28.50% less system energy and outperforms the other baselines.

cs.NI

Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing

To overcome devices' limitations in performing computation-intense applications, mobile edge computing (MEC) enables users to offload tasks to proximal MEC servers for faster task computation. However, current MEC system design is based on average-based metrics, which fails to account for the ultra-reliable low-latency requirements in mission-critical applications. To tackle this, this paper proposes a new system design, where probabilistic and statistical constraints are imposed on task queue lengths, by applying extreme value theory. The aim is to minimize users' power consumption while trading off the allocated resources for local computation and task offloading. Due to wireless channel dynamics, users are re-associated to MEC servers in order to offload tasks using higher rates or accessing proximal servers. In this regard, a user-server association policy is proposed, taking into account the channel quality as well as the servers' computation capabilities and workloads. By marrying tools from Lyapunov optimization and matching theory, a two-timescale mechanism is proposed, where a user-server association is solved in the long timescale while a dynamic task offloading and resource allocation policy is executed in the short timescale. Simulation results corroborate the effectiveness of the proposed approach by guaranteeing highly-reliable task computation and lower delay performance, compared to several baselines.

cs.NI

Taming the Tail of Maximal Information Age in Wireless Industrial Networks

In wireless industrial networks, the information of time-sensitive control systems needs to be transmitted in an ultra-reliable and low-latency manner. This letter studies the resource allocation problem in finite blocklength transmission, in which the information freshness is measured as the age of information (AoI) whose maximal AoI is characterized using extreme value theory (EVT). The considered system design is to minimize the sensors' transmit power and transmission blocklength subject to constraints on the maximal AoI's tail behavior. The studied problem is solved using Lyapunov stochastic optimization, and a dynamic reliability and age-aware policy for resource allocation and status updates is proposed. Simulation results validate the effectiveness of using EVT to characterize the maximal AoI. It is shown that sensors need to send larger-size data with longer transmission blocklength at lower transmit power. Moreover, the maximal AoI's tail decays faster at the expense of higher average information age.

cs.NI

Risk-Sensitive Task Fetching and Offloading for Vehicular Edge Computing

This letter studies an ultra-reliable low latency communication problem focusing on a vehicular edge computing network in which vehicles either fetch and synthesize images recorded by surveillance cameras or acquire the synthesized image from an edge computing server. The notion of risk-sensitive in financial mathematics is leveraged to define a reliability measure, and the studied problem is formulated as a risk minimization problem for each vehicle's end-to-end (E2E) task fetching and offloading delays. Specifically, by resorting to a joint utility and policy estimation-based learning algorithm, a distributed risk-sensitive solution for task fetching and offloading is proposed. Simulation results show that our proposed solution achieves performance improvements up to 40% variance reduction and steeper distribution tail of the E2E delay over an averaged-based baseline.

cs.NI

Data-Driven Predictive Scheduling in Ultra-Reliable Low-Latency Industrial IoT: A Generative Adversarial Network Approach

To date, model-based reliable communication with low latency is of paramount importance for time-critical wireless control systems. In this work, we study the downlink (DL) controller-to-actuator scheduling problem in a wireless industrial network such that the outage probability is minimized. In contrast to the existing literature based on well-known stationary fading channel models, we assume an arbitrary and unknown channel fading model, which is available only via samples. To overcome the issue of limited data samples, we invoke the generative adversarial network framework and propose an online data-driven approach to jointly schedule the DL transmissions and learn the channel distributions in an online manner. Numerical results show that the proposed approach can effectively learn any arbitrary channel distribution and further achieve the optimal performance by using the predicted outage probability.

cs.NI

White Paper on Critical and Massive Machine Type Communication Towards 6G

The society as a whole, and many vertical sectors in particular, is becoming increasingly digitalized. Machine Type Communication (MTC), encompassing its massive and critical aspects, and ubiquitous wireless connectivity are among the main enablers of such digitization at large. The recently introduced 5G New Radio is natively designed to support both aspects of MTC to promote the digital transformation of the society. However, it is evident that some of the more demanding requirements cannot be fully supported by 5G networks. Alongside, further development of the society towards 2030 will give rise to new and more stringent requirements on wireless connectivity in general, and MTC in particular. Driven by the societal trends towards 2030, the next generation (6G) will be an agile and efficient convergent network serving a set of diverse service classes and a wide range of key performance indicators (KPI). This white paper explores the main drivers and requirements of an MTC-optimized 6G network, and discusses the following six key research questions: - Will the main KPIs of 5G continue to be the dominant KPIs in 6G; or will there emerge new key metrics? - How to deliver different E2E service mandates with different KPI requirements considering joint-optimization at the physical up to the application layer? - What are the key enablers towards designing ultra-low power receivers and highly efficient sleep modes? - How to tackle a disruptive rather than incremental joint design of a massively scalable waveform and medium access policy for global MTC connectivity? - How to support new service classes characterizing mission-critical and dependable MTC in 6G? - What are the potential enablers of long term, lightweight and flexible privacy and security schemes considering MTC device requirements?

cs.NI

Predictive Control and Communication Co-Design: A Gaussian Process Regression Approach

While Remote control over wireless connections is a key enabler for scalable control systems consisting of multiple actuator-sensor pairs, i.e., control systems, it entails two technical challenges. Due to the lack of wireless resources, only a limited number of control systems can be served, making the state observations outdated. Further, even after scheduling, the state observations received through wireless channels are distorted, hampering control stability. To address these issues, in this article we propose a scheduling algorithm that guarantees the age-of-information (AoI) of the last received states. Meanwhile, for non-scheduled sensor-actuator pairs, we propose a machine learning (ML) aided predictive control algorithm, in which states are predicted using a Gaussian process regression (GPR). Since the GPR prediction credibility decreases with the AoI of the input data, both predictive control and AoI-based scheduler should be co-designed. Hence, we formulate a joint scheduling and transmission power optimization via the Lyapunov optimization framework. Numerical simulations corroborate that the proposed co-designed predictive control and AoI based scheduling achieves lower control errors, compared to a benchmark scheme using a round-robin scheduler without state prediction.

cs.IT

Optimized Age of Information Tail for Ultra-Reliable Low-Latency Communications in Vehicular Networks

While the notion of age of information (AoI) has recently been proposed for analyzing ultra-reliable low-latency communications (URLLC), most of the existing works have focused on the average AoI measure. Designing a wireless network based on average AoI will fail to characterize the performance of URLLC systems, as it cannot account for extreme AoI events, occurring with very low probabilities. In contrast, this paper goes beyond the average AoI to improve URLLC in a vehicular communication network by characterizing and controlling the AoI tail distribution. In particular, the transmission power minimization problem is studied under stringent URLLC constraints in terms of probabilistic AoI for both deterministic and Markovian traffic arrivals. Accordingly, an efficient novel mapping between AoI and queue-related distributions is proposed. Subsequently, extreme value theory (EVT) and Lyapunov optimization techniques are adopted to formulate and solve the problem considering both long and short packets transmissions. Simulation results show over a two-fold improvement, in shortening the AoI distribution tail, versus a baseline that models the maximum queue length distribution, in addition to a tradeoff between arrival rate and AoI.

cs.NI

Wireless Edge Computing with Latency and Reliability Guarantees

Edge computing is an emerging concept based on distributing computing, storage, and control services closer to end network nodes. Edge computing lies at the heart of the fifth generation (5G) wireless systems and beyond. While current state-of-the-art networks communicate, compute, and process data in a centralized manner (at the cloud), for latency and compute-centric applications, both radio access and computational resources must be brought closer to the edge, harnessing the availability of computing and storage-enabled small cell base stations in proximity to the end devices. Furthermore, the network infrastructure must enable a distributed edge decision-making service that learns to adapt to the network dynamics with minimal latency and optimize network deployment and operation accordingly. This article will provide a fresh look to the concept of edge computing by first discussing the applications that the network edge must provide, with a special emphasis on the ensuing challenges in enabling ultra-reliable and low-latency edge computing services for mission-critical applications such as virtual reality (VR), vehicle-to-everything (V2X), edge artificial intelligence (AI), and so forth. Furthermore, several case studies where the edge is key are explored followed by insights and prospect for future work.

cs.NI

Ultra-Reliable Low-Latency Vehicular Networks: Taming the Age of Information Tail

While the notion of age of information (AoI) has recently emerged as an important concept for analyzing ultra-reliable low-latency communications (URLLC), the majority of the existing works have focused on the average AoI measure. However, an average AoI based design falls short in properly characterizing the performance of URLLC systems as it cannot account for extreme events that occur with very low probabilities. In contrast, in this paper, the main objective is to go beyond the traditional notion of average AoI by characterizing and optimizing a URLLC system while capturing the AoI tail distribution. In particular, the problem of vehicles' power minimization while ensuring stringent latency and reliability constraints in terms of probabilistic AoI is studied. To this end, a novel and efficient mapping between both AoI and queue length distributions is proposed. Subsequently, extreme value theory (EVT) and Lyapunov optimization techniques are adopted to formulate and solve the problem. Simulation results shows a nearly two-fold improvement in terms of shortening the tail of the AoI distribution compared to a baseline whose design is based on the maximum queue length among vehicles, when the number of vehicular user equipment (VUE) pairs is 80. The results also show that this performance gain increases significantly as the number of VUE pairs increases.

cs.NI

Ultra-Reliable and Low-Latency Vehicular Transmission: An Extreme Value Theory Approach

Considering a Manhattan mobility model in vehicle-to-vehicle networks, this work studies a power minimization problem subject to second-order statistical constraints on latency and reliability, captured by a network-wide maximal data queue length. We invoke results in extreme value theory to characterize statistics of extreme events in terms of the maximal queue length. Subsequently, leveraging Lyapunov stochastic optimization to deal with network dynamics, we propose two queue-aware power allocation solutions. In contrast with the baseline, our approaches achieve lower mean and variance of the maximal queue length.

cs.NI

Path Selection and Rate Allocation in Self-Backhauled mmWave Networks

We investigate the problem of multi-hop scheduling in self-backhauled millimeter wave (mmWave) networks. Owing to the high path loss and blockage of mmWave links, multi-hop paths between the macro base station and the intended users via full-duplex small cells need to be carefully selected. This paper addresses the fundamental question: how to select the best paths and how to allocate rates over these paths subject to latency constraints. To answer this question, we propose a new system design, which factors in mmWave-specific channel variations and network dynamics. The problem is cast as a network utility maximization subject to a bounded delay constraint and network stability. The studied problem is decoupled into: (i) a path selection and (ii) rate allocation, whereby learning the best paths is done by means of a reinforcement learning algorithm, and the rate allocation is solved by applying the successive convex approximation method. Via numerical results, our approach ensures reliable communication with a guaranteed probability of 99.9999%, and reduces latency by 50.64% and 92.9% as compared to baselines.

cs.NI

Fronthaul-Aware Software-Defined Wireless Networks: Resource Allocation and User Scheduling

Software-defined networking (SDN) provides an agile and programmable way to optimize radio access networks via a control-data plane separation. Nevertheless, reaping the benefits of wireless SDN hinges on making optimal use of the limited wireless fronthaul capacity. In this work, the problem of fronthaul-aware resource allocation and user scheduling is studied. To this end, a two-timescale fronthaul-aware SDN control mechanism is proposed in which the controller maximizes the time-averaged network throughput by enforcing a coarse correlated equilibrium in the long timescale. Subsequently, leveraging the controller's recommendations, each base station schedules its users using Lyapunov stochastic optimization in the short timescale, i.e., at each time slot. Simulation results show that significant network throughput enhancements and up to 40% latency reduction are achieved with the aid of the SDN controller. Moreover, the gains are more pronounced for denser network deployments.

cs.NI

Latency and Reliability-Aware Task Offloading and Resource Allocation for Mobile Edge Computing

While mobile edge computing (MEC) alleviates the computation and power limitations of mobile devices, additional latency is incurred when offloading tasks to remote MEC servers. In this work, the power-delay tradeoff in the context of task offloading is studied in a multi-user MEC scenario. In contrast with current system designs relying on average metrics (e.g., the average queue length and average latency), a novel network design is proposed in which latency and reliability constraints are taken into account. This is done by imposing a probabilistic constraint on users' task queue lengths and invoking results from extreme value theory to characterize the occurrence of low-probability events in terms of queue length (or queuing delay) violation. The problem is formulated as a computation and transmit power minimization subject to latency and reliability constraints, and solved using tools from Lyapunov stochastic optimization. Simulation results demonstrate the effectiveness of the proposed approach, while examining the power-delay tradeoff and required computational resources for various computation intensities.

cs.NI