Tao Deng

Tao Deng

Auto-generated profile, based on publicly available information

Tao Deng

School of Computer Science and Technology, Soochow University, Suzhou, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 February 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
TDTao Deng
Tao Deng
GAGhafour Ahani
Ghafour Ahani
PFPingzhi Fan
Pingzhi Fan
DYDi Yuan
Di Yuan
Caching popular files at the user equipments (UEs) provides an effective way to alleviate the burden of the backhaul networks. Generally, popularity-based caching is not a system-wide optimal strategy, especially for user mobility scenarios. Motivated by this observation, we consider optimal caching with the presence of mobility. A cost-optimal caching problem (COCP) for device-to-device (D2D) networks is modeled, in which the impact of user mobility, cache size, and total number of encoded segments are all taken into account. The hardness of the problem is proved via a reduction from the satisfiability problem. Next, a lower-bounding function of the objective function is derived. By the function, an approximation of COCP (ACOCP) achieving linearization is obtained, which features two advantages. First, the ACOCP approach can use an off-the-shelf integer linear programming algorithm to obtain the global optimal solution, and it can effectively deliver solutions for small-scale and medium-scale system scenarios. Second, and more importantly, based on the ACOCP approach, one can derive a lower bound of global optimum of COCP, thus enabling performance benchmarking of any sub-optimal algorithm. To tackle large scenarios with low complexity, we first prove that the optimal caching placement of one user, giving other users' caching placements, can be derived in polynomial time. Then, based on this proof, a mobility aware multi-user algorithm is developed. Simulation results verify the effectivenesses of the two approaches by comparing them to the lower bound of global optimum and conventional caching algorithms.

16 June 2023 in IEEE Networking Letters
Verified
Journal Article
Open access
ZYZhanwei Yu
Zhanwei Yu
YZYi Zhao
Yi Zhao
TDTao Deng
Tao Deng
LYLei You
Lei You
DYDi Yuan
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.

29 July 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YCYuanlu Chen
Yuanlu Chen
ATAlysa Ziying Tan
Alysa Ziying Tan
SFSiwei Feng
Siwei Feng
HYHan Yu
Han Yu
TDTao Deng
Tao Deng
FWFeng Wu
Feng Wu
Federated class-incremental learning (FCIL) aims to allow federated learning (FL) systems to consistently learn new tasks with classes that change dynamically, without forgetting knowledge from previous classes. In FCIL scenarios, both heterogeneity in both label and data distribution across clients and catastrophic forgetting caused by continual emergence of new classes can significantly affect the performance of a FL system. Existing FCIL methods assume only changes in class distribution over time for each single client while ignoring class-specific domain distribution. Furthermore, these methods often rely on storing old class exemplars to mitigate catastrophic forgetting, potentially raising privacy concerns and computational burdens. In this article, we propose a FCIL framework called generative federated class-incremental learning (GenFCIL) that effectively addresses the aforementioned challenges. First, we introduce a lightweight generator that promotes knowledge sharing among clients and preserves the accumulated knowledge from all clients. By collecting classes and their associated data from each client, the generator effectively tackles data heterogeneity, facilitating information transfer across clients, and mitigating catastrophic forgetting in a replay-free manner. Importantly, the lightweight nature of the generator ensures that it does not impose excessive memory and computation requirements. Second, to tackle challenges from shifts in both class distribution and class-specific domain distribution in general FCIL scenarios, which may exacerbate catastrophic forgetting, we incorporate and update multiple logit scores from clients focusing on their old and new overlapping classes to incorporate more intraclass information. Experimental results show that GenFCIL effectively alleviates the impact of catastrophic forgetting and heterogeneity.

11 July 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
TDTao Deng
Tao Deng
DCDongyu Chen
Dongyu Chen
JJJuncheng Jia
Juncheng Jia
MDMianxiong Dong
Mianxiong Dong
KOKaoru Ota
Kaoru Ota
DYDi Yuan
Di Yuan
In this paper, we investigate the deployment and service of pre-trained foundation models (PFMs) in mobile edge networks with cell coupling. We formulate a joint resource allocation and request routing optimization problem (RARP) to achieve a trade-off between the accuracy loss and cost of artificial intelligence-generated content (AIGC). For problem solving, we propose an alternating optimization algorithm (AOA) that decomposes RARP into two sub-problems and iteratively optimizes them. Specifically, for the first sub-problem, we reformulate it as a linear programming problem and use the off-the-shelf optimization solver to solve it. For the other sub-problem, we propose a deep reinforcement learning based algorithm to optimize the deployment to PFMs. Performance evaluations validate the efficiency of AOA.

24 March 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
FWFeng Wu
Feng Wu
ATAlysa Ziying Tan
Alysa Ziying Tan
SFSiwei Feng
Siwei Feng
HYHan Yu
Han Yu
TDTao Deng
Tao Deng
YCYuanlu Chen
Yuanlu Chen
Federated Class-Incremental Learning (FCIL) aims to design privacy-preserving collaborative training methods to continuously learn new classes from distributed datasets. In these scenarios, federated clients face the challenge of encountering new classes while being constrained by limited memory capacity, which can lead to catastrophic forgetting in the resulting global model. Existing FCIL approaches tend to overlook the challenges posed by the heterogeneity of dataset label distribution among clients, thereby constraining the generalization capacity of the global model they learn. Some of these methods also suffer from excessive computational burdens when addressing catastrophic forgetting problems. Furthermore, certain approaches are constrained to handling only straightforward data, posing significant difficulties in managing complex datasets and tackling more intricate scenarios. In this paper, we propose the Weighted Aggregation and Distillation-based FCIL (WAD-FCIL) method to address these limitations. To address data heterogeneity arising from class imbalance, we first introduce a task-aware client clustering method to identify clients with extreme class deviations before global model aggregation to eliminate potential impact on the global model. Then, we propose a multi-sampling weighted aggregation approach during the global FL model update that integrates knowledge from different clients and dynamically adjusts the weight of each client model to facilitate model update. To mitigate catastrophic forgetting, we propose a multi-model distillation strategy that involves selecting multiple teacher models for knowledge distillation. Extensive experiments comparing WAD-FCIL with ten state-of-the-art methods demonstrate that it significantly outperforms the baselines by 0.8%~3.2% in terms of average test accuracy on three representative benchmark datasets.

6 June 2019 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
TDTao Deng
Tao Deng
PFPingzhi Fan
Pingzhi Fan
DYDi Yuan
Di Yuan
Caching is an effective way to address the challenges due to explosive data traffic growth and massive device connectivity in fifth-generation (5G) networks. Currently, few works on caching pay attention to the impact of the time duration for which a content is stored, called retention time, on caching optimization. The research on retention time is motivated by two practical issues, i.e., flash memory damage and storage rental cost in cloud networks, together giving rise to the storage cost. How to optimize caching contents taking the storage cost into consideration is a challenging problem, especially for the scenarios with cache-enabled mobile nodes. In this paper, a retention-aware caching problem (RACP) in vehicular networks is formulated, considering the impact of the storage cost. The problem’s complexity analysis is provided. For symmetric cases, an optimal dynamic programming (DP) algorithm with polynomial time complexity is derived. For general cases, a low complexity and effective retention aware multi-helper caching algorithm (RAMA) is proposed. Numerical results are used to verify the effectiveness of the algorithms.