LYLei You

Lei You

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Lei You has a total of 63 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Toward Sustainable LEO Satellite Operations: A Degradation-Aware Scheduling Framework for DoD Control and Energy Optimization

    by Ahmad Y. Alhusenat, Jinjin Tian, Hana Rababah, Qizhou Wang, Lei You, Xingjun Zhang, Lei Lei, Symeon Chatzinotas

    Next-generation low earth orbit (LEO) satellite constellations demand the seamless integration of communication, sensing, and computation capabilities under stringent energy, thermal, and longevity constraints. This paper proposes an optimization framework that couples adaptive satellite selection with a sequential Lyapunov-based resource allocation to enable sustainable constellation operations. Deployed in a hybrid centralized-distributed architecture, the framework performs satellite selection at ground control stations while enabling autonomous onboard resource optimization.The adaptive selection mechanism uses diversity-weighted scoring across six real-time metrics, including interference awareness, for improved load balancing and interference-aware task assignment. A sequential optimization approach first derives a closed-form solution for CPU frequency under thermal and timing constraints, followed by a convex formulation for transmit power. This is integrated with a Lyapunov drift-plus-penalty framework that manages a sophisticated battery pack system using discrete binary cell-level assignment for both charging and discharging. This degradation-aware system autonomously maintains the depth-of-discharge (DoD) below 25% per cell, enforces thermal safety margins, and guarantees queue stability, ensuring long-term operational integrity. The overall problem is decomposed into polynomial-time stages suitable for real-time deployment. Simulation results demonstrate that the proposed framework reduces energy consumption by up to 84%, achieves an average DoD of 22.23% with all cells remaining below the 25% threshold, and extends the battery's expected cycle life by 28.6% compared to baseline methods.

  • Open Access

    Self-Supervised Learning of Time Series Representation via Diffusion Process and Imputation-Interpolation-Forecasting Mask

    by Zineb Senane, Lele Cao, Valentin Leonhard Buchner, Yusuke Tashiro, Lei You, Pawel Andrzej Herman, Mats Nordahl, Ruibo Tu, Vilhelm von Ehrenheim

    Time Series Representation Learning (TSRL) focuses on generating informative representations for various Time Series (TS) modeling tasks. Traditional Self-Supervised Learning (SSL) methods in TSRL fall into four main categories: reconstructive, adversarial, contrastive, and predictive, each with a common challenge of sensitivity to noise and intricate data nuances. Recently, diffusion-based methods have shown advanced generative capabilities. However, they primarily target specific application scenarios like imputation and forecasting, leaving a gap in leveraging diffusion models for generic TSRL. Our work, Time Series Diffusion Embedding (TSDE), bridges this gap as the first diffusion-based SSL TSRL approach. TSDE segments TS data into observed and masked parts using an Imputation-Interpolation-Forecasting (IIF) mask. It applies a trainable embedding function, featuring dual-orthogonal Transformer encoders with a crossover mechanism, to the observed part. We train a reverse diffusion process conditioned on the embeddings, designed to predict noise added to the masked part. Extensive experiments demonstrate TSDE's superiority in imputation, interpolation, forecasting, anomaly detection, classification, and clustering. We also conduct an ablation study, present embedding visualizations, and compare inference speed, further substantiating TSDE's efficiency and validity in learning representations of TS data.


  • Decomposition and Meta-DRL Based Multi-Objective Optimization for Asynchronous Federated Learning in 6G-Satellite Systems

    by Yu Zhou, Lei Lei, Xiaohui Zhao, Lei You, Yaohua Sun, Symeon Chatzinotas

    Wireless-based federated learning (FL), as an emerging distributed learning approach, has been widely studied for 6G systems. When the paradigm shifts from terrestrial to non-terrestrial networks (NTN), FL may need to address several open challenges, e.g., the limited service time of low earth orbit (LEO) satellites, the straggler issue in synchronous FL, and time-efficient uploading and aggregation for massive devices. In this work, we exploit the synergy of LEO and FL for future integrated 6G-satellite systems by taking advantage of ubiquitous wireless access provided by LEO and appealing characteristics of collaborative training and data privacy preservation in FL. The studied LEO-FL framework may need to improve multi-metric performance in practice. Different from most FL works, we simultaneously improve the communication-training efficiency and local training accuracy from a multi-objective optimization (MOO) perspective. To solve the problem, we propose a decomposition and meta-deep reinforcement learning based MOO algorithm for FL (DMMA-FL), aiming at adapting to the dynamic satellite-terrestrial environments, achieving efficient uploading and aggregation, and approaching Pareto optimal sets. Compared to single-objective optimization, heuristics-based, and learning-based MOO algorithms, the effectiveness and advantages of the proposed LEO-FL framework and DMMA-FL algorithm are assessed on MNIST and CIFAR-10 datasets.


  • Open Access

    Less Carbon Footprint in Edge Computing by Joint Task Offloading and Energy Sharing

    by Zhanwei Yu, Yi Zhao, Tao Deng, Lei You, Di Yuan

    We address reducing carbon footprint (CF) in the context of edge computing. The carbon intensity of electricity supply largely varies spatially as well as temporally. We consider optimal task scheduling and offloading, as well as battery charging to minimize the total CF.We formulate this optimization problem as a mixed integer linear programming model. However, we demonstrate that, via a graph-based reformulation, the problem can be cast as a minimum-cost flow problem, and global optimum can be admitted in polynomial time. Numerical results using real-world data show that optimization can reduce up to 83.3% of the total CF.


  • Optimal Task Allocation for Battery-Assisted and Price-Aware Mobile Edge Computing

    by Tao Deng, Lei You, Zhanwei Yu, Di Yuan

    In this paper, we propose a battery-assisted approach to improve energy efficiency for mobile edge computing (MEC) networks by utilizing the space-time-varying characteristics of electricity price. We formulate a price-aware task allocation problem (PATA) that jointly considers the cost for task computation, the cost of task offloading, and the cost of battery degradation. PATA is seemingly a mixed integer non-linear programming problem. By a graph-based reformulation, solving PATA is mapped to finding minimum cost flows or convex cost flows in the graph. This discovery reveals that the global optimum of PATA is obtained in polynomial time. Performance evaluation manifests that the proposed approach significantly outperforms other approaches.


  • Open Access

    Less Carbon Footprint in Edge Computing by Joint Task Offloading and Energy Sharing

    by Zhanwei Yu, Yi Zhao, Tao Deng, Lei You, Di Yuan

    In sprite the state-of-the-art, significantly reducing carbon footprint (CF) in communications systems remains urgent. We address this challenge in the context of edge computing. The carbon intensity of electricity supply largely varies spatially as well as temporally. This, together with energy sharing via a battery management system (BMS), justifies the potential of CF-oriented task offloading, by redistributing the computational tasks in time and space. In this paper, we consider optimal task scheduling and offloading, as well as battery charging to minimize the total CF. We formulate this CF minimization problem as an integer linear programming model. However, we demonstrate that, via a graph-based reformulation, the problem can be cast as a minimum-cost flow problem. This finding reveals that global optimum can be admitted in polynomial time. Numerical results using real-world data show that optimization can reduce up to 83.3% of the total CF.

  • Open Access

    User-centric Performance Optimization with Remote Radio Head Cooperation in C-RAN

    by Lei You, Di Yuan

    In a cloud radio access network (C-RAN), distributed remote radio heads (RRHs) are coordinated by baseband units (BBUs) in the cloud. The centralization of signal processing provides flexibility for coordinated multi-point transmission (CoMP) of RRHs to cooperatively serve user equipments (UEs). We target enhancing UEs' capacity performance, by jointly optimizing the selection of RRHs for serving UEs, i.e., resource allocation (and CoMP selection). We analyze the computational complexity of the problem. Next, we prove that under fixed CoMP selection, the optimal resource allocation amounts to solving a so-called iterated function. Towards user-centric network optimization, we propose an algorithm for the joint optimization problem, aiming at maximumly scaling up the capacity for any target UE group of interest. The proposed algorithm enables network-level performance evaluation for quality of experience.

  • Open Access

    Resource Optimization with Load Coupling in Multi-cell NOMA

    by Lei You, Di Yuan, Lei Lei, Sumei Sun, Symeon Chatzinotas, Björn Ottersten

    Optimizing non-orthogonal multiple access (NOMA) in multi-cell scenarios is much more challenging than the single-cell case because inter-cell interference must be considered. Most papers addressing NOMA consider a single cell. We take a significant step of analyzing NOMA in multi-cell scenarios. We explore the potential of NOMA networks in achieving optimal resource utilization with arbitrary topologies. Towards this goal, we investigate a broad class of problems consisting in optimizing power allocation and user pairing for any cost function that is monotonically increasing in time-frequency resource consumption. We propose an algorithm that achieves global optimality for this problem class. The basic idea is to prove that solving the joint optimization problem of power allocation, user pair selection, and time-frequency resource allocation amounts to solving a so-called iterated function without a closed form. We prove that the algorithm approaches optimality with fast convergence. Numerically, we evaluate and demonstrate the performance of NOMA for multi-cell scenarios in terms of resource efficiency and load balancing.