SearcharxivSearch

arXiv subjects

Xing Xi

Publications and source records attributed to Xing Xi.

9 recordsLinked to original sources

SimAD: A Simple Dissimilarity-based Approach for Time Series Anomaly Detection

Despite the prevalence of reconstruction-based deep learning methods, time series anomaly detection remains a tremendous challenge. Existing approaches often struggle with limited temporal contexts, insufficient representation of normal patterns, and flawed evaluation metrics, all of which hinder their effectiveness in detecting anomalous behavior. To address these issues, we introduce a $\textbf{Sim}$ple dissimilarity-based approach for time series $\textbf{A}$nomaly $\textbf{D}$etection, referred to as $\textbf{SimAD}$. Specifically, SimAD first incorporates a patching-based feature extractor capable of processing extended temporal windows and employs the EmbedPatch encoder to fully integrate normal behavioral patterns. Second, we design an innovative ContrastFusion module in SimAD, which strengthens the robustness of anomaly detection by highlighting the distributional differences between normal and abnormal data. Third, we introduce two robust enhanced evaluation metrics, Unbiased Affiliation (UAff) and Normalized Affiliation (NAff), designed to overcome the limitations of existing metrics by providing better distinctiveness and semantic clarity. The reliability of these two metrics has been demonstrated by both theoretical and experimental analyses. Experiments conducted on seven diverse time series datasets clearly demonstrate SimAD's superior performance compared to state-of-the-art methods, achieving relative improvements of $\textbf{19.85%}$ on F1, $\textbf{4.44%}$ on Aff-F1, $\textbf{77.79%}$ on NAff-F1, and $\textbf{9.69%}$ on AUC on six multivariate datasets. Code and pre-trained models are available at https://github.com/EmorZz1G/SimAD.

cs.LG

CoMP-Enabled RAN Slicing for Tactile Internet

Tactile Internet (TI) enables the omnipresence and exchange of tactile experiences across the global via the ultra-reliable and ultra-responsive connectivity. This article argues for coordinated multi-point (CoMP) enabled radio access network (RAN) slicing as an efficient solution that satisfies the stringent reliable and responsive connectivity requirements for supporting tactile applications. This article presents the emerging challenges when accommodating CoMP-enabled RAN slicing in the TI ecosystem and expounds the functional split of CoMP-enabled RAN. Besides, this article elaborates on the implementation prototype of CoMP-enabled RAN slicing for TI with the coexistence of diverse vertical applications. Finally, this article studies a use case of enabling TI-included application multiplexing as an example of CoMP-enabled RAN slicing for TI.

cs.NI

Fresh, Fair and Energy-Efficient Content Provision in a Private and Cache-Enabled UAV Network

In this paper, we investigate a private and cache-enabled unmanned aerial vehicle (UAV) network for content provision. Aiming at delivering fresh, fair, and energy-efficient content files to terrestrial users, we formulate a joint UAV caching, UAV trajectory, and UAV transmit power optimization problem. This problem is confirmed to be a sequential decision problem with mixed-integer non-convex constraints, which is intractable directly. To this end, we propose a novel algorithm based on the techniques of subproblem decomposition and convex approximation. Particularly, we first propose to decompose the sequential decision problem into multiple repeated optimization subproblems via a Lyapunov technique. Next, an iterative optimization scheme incorporating a successive convex approximation (SCA) technique is explored to tackle the challenging mixed-integer non-convex subproblems. Besides, we analyze the convergence and computational complexity of the proposed algorithm and derive the theoretical value of the expected peak age of information (PAoI) to estimate the content freshness. Simulation results demonstrate that the proposed algorithm can achieve the expected PAoI close to the theoretical value and is more 22.11% and 70.51% energy-efficient and fairer than benchmark algorithms.

cs.NI

Power Control for a URLLC-enabled UAV system incorporated with DNN-Based Channel Estimation

This letter is concerned with power control for a ultra-reliable and low-latency communications (URLLC) enabled unmanned aerial vehicle (UAV) system incorporated with deep neural network (DNN) based channel estimation. Particularly, we formulate the power control problem for the UAV system as an optimization problem to accommodate the URLLC requirement of uplink control and non-payload signal delivery while ensuring the downlink high-speed payload transmission. This problem is challenging to be solved due to the requirement of analytically tractable channel models and the non-convex characteristic as well. To address the challenges, we propose a novel power control algorithm, which constructs analytically tractable channel models based on DNN estimation results and explores a semidefinite relaxation (SDR) scheme to tackle the non-convexity. Simulation results demonstrate the accuracy of the DNN estimation and verify the effectiveness of the proposed algorithm.

cs.IT

Multicast eMBB and Bursty URLLC Service Multiplexing in a CoMP-Enabled RAN

This paper is concerned with slicing a radio access network (RAN) for simultaneously serving two typical 5G and beyond use cases, i.e., enhanced mobile broadband (eMBB) and ultra-reliable and low latency communications (URLLC). Although many researches have been conducted to tackle this issue, few of them have considered the impact of bursty URLLC. The bursty characteristic of URLLC traffic may significantly increase the difficulty of RAN slicing on the aspect of ensuring a ultra-low packet blocking probability. To reduce the packet blocking probability, we re-visit the structure of physical resource blocks (PRBs) orchestrated for bursty URLLC traffic in the time-frequency plane based on our theoretical results. Meanwhile, we formulate the problem of slicing a RAN enabling coordinated multi-point (CoMP) transmissions for multicast eMBB and bursty URLLC service multiplexing as a multi-timescale optimization problem. The goal of this problem is to maximize multicast eMBB and bursty URLLC slice utilities, subject to physical resource constraints. To mitigate this thorny multi-timescale problem, we transform it into multiple single timescale problems by exploring the fundamental principle of a sample average approximation (SAA) technique. Next, an iterative algorithm with provable performance guarantees is developed to obtain solutions to these single timescale problems and aggregate the obtained solutions into those of the multi-timescale problem. We also design a prototype for the CoMP-enabled RAN slicing system incorporating with multicast eMBB and bursty URLLC traffic and compare the proposed iterative algorithm with the state-of-the-art algorithm to verify the effectiveness of the algorithm.

cs.NI

RAN Slicing for Massive IoT and Bursty URLLC Service Multiplexing: Analysis and Optimization

Future wireless networks are envisioned to serve massive Internet of things (mIoT) via some radio access technologies, where the random access channel (RACH) procedure should be exploited for IoT devices to access the networks. However, the theoretical analysis of the RACH procedure for massive IoT devices is challenging. To address this challenge, we first correlate the RACH request of an IoT device with the status of its maintained queue and analyze the evolution of the queue status. Based on the analysis result, we then derive the closed-form expression of the random access (RA) success probability, which is a significant indicator characterizing the RACH procedure of the device. Besides, considering the agreement on converging different services onto a shared infrastructure, we investigate the RAN slicing for mIoT and bursty ultra-reliable and low latency communications (URLLC) service multiplexing. Specifically, we formulate the RAN slicing problem as an optimization one to maximize the total RA success probabilities of all IoT devices and provide URLLC services for URLLC devices in an energy-efficient way. A slice resource optimization (SRO) algorithm exploiting relaxation and approximation with provable tightness and error bound is then proposed to mitigate the optimization problem. Simulation results demonstrate that the proposed SRO algorithm can effectively implement the service multiplexing of mIoT and bursty URLLC traffic.

cs.NI

Repeatedly Energy-Efficient and Fair Service Coverage: UAV Slicing (Proactive UAV Network Slicing for URLLC and Mobile Broadband Service Multiplexing)

Unmanned aerial vehicle (UAV) networks are convinced as a significant part of 5G and emerging 6G wireless networks. UAV slicing is a promising proposal of converging different services onto a common UAV network without deploying individual network solution for each type of service. This paper is concerned with UAV slicing for providing energy-efficient and fair service coverage for enhanced mobile broadband (eMBB) users (UEs). Aiming at physically configuring UAV slices, the UAV slicing problem is formulated as a time-dependent mixed-integer-non-convex programming problem with a goal of maximizing all UEs' data rates while minimizing UAVs' total transmit power. To mitigate this challenging problem, we first decompose the original problem into two time-dependent subproblems using a Lyapunov approach. We then derive the procedure of tackling the non-convexity and the mixed-integer property of the subproblems by exploring a successive convex approximate (SCA) method and an alternative optimization scheme, respectively. Based on the derived results, we develop an algorithm with provable performance guarantees to mitigate the two subproblems repeatedly.

cs.NI

Energy-Efficient Resource Allocation in a Multi-UAV-Aided NOMA Network

This paper is concerned with the resource allocation in a multi-unmanned aerial vehicle (UAV)-aided network for providing enhanced mobile broadband (eMBB) services for user equipments. Different from most of the existing network resource allocation approaches, we investigate a joint non-orthogonal user association, subchannel allocation and power control problem. The objective of the problem is to maximize the network energy efficiency under the constraints on user equipments' quality of service, UAVs' network capacity and power consumption. We formulate the energy efficiency maximization problem as a challenging mixed-integer non-convex programming problem. To alleviate this problem, we first decompose the original problem into two subproblems, namely, an integer non-linear user association and subchannel allocation subproblem and a non-convex power control subproblem. We then design a two-stage approximation strategy to handle the non-linearity of the user association and subchannel allocation subproblem and exploit a successive convex approximation approach to tackle the non-convexity of the power control subproblem. Based on the derived results, we develop an iterative algorithm with provable convergence to mitigate the original problem. Simulation results show that our proposed framework can improve energy efficiency compared with several benchmark algorithms.

cs.NI

How Should I Orchestrate Resources of My Slices for Bursty URLLC Service Provision?

Future wireless networks are convinced to provide flexible and cost-efficient services via exploiting network slicing techniques. However, it is challenging to configure network slicing systems for bursty ultra-reliable and low latency communications (URLLC) service provision due to its stringent requirements on low packet blocking probability and low codeword error decoding probability. In this paper, we propose to orchestrate network resources for a network slicing system to guarantee a more reliable bursty URLLC service provision. We re-cut physical resource blocks (PRBs) and derive the minimum upper bound of bandwidth for URLLC transmission with a low packet blocking probability. We correlate coordinated multipoint (CoMP) beamforming with channel uses and derive the minimum upper bound of channel uses for URLLC transmission with a low codeword error decoding probability. Considering the agreement on converging diverse services onto shared infrastructures, we further investigate the network slicing for URLLC and enhanced mobile broadband (eMBB) service multiplexing. Particularly, we formulate the service multiplexing as an optimization problem to maximize the long-term total slice utility. The mitigation of this problem is challenging due to the requirements of future channel information and tackling a two timescale issue. To address the challenges, we develop a joint resource optimization algorithm based on a sample average approximate (SAA) technique and a distributed optimization method with provable performance guarantees.

cs.NI