Weice Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Weice Sun has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Jun Tao
Southeast University
7 shared publications - Zuyan Wang
School of Cyber Science and Engineering, Southeast University, Nanjing, China
5 shared publications - Yifan Xu
School of Cyber Science and Engineering, Southeast University, Nanjing, China
4 shared publications - Haotian Wang
Southeast University
3 shared publications - Yang Gao
School of Cyberspace Security, Hainan University, Haikou, China
3 shared publications - Yu Gao
School of Cyber Science and Engineering, Southeast University, Nanjing, China
3 shared publications
Latest Publications
- 2 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (6) , 4276-4290
Toward Personalized Privacy-Preserving Content Caching With Edge Cooperation
Caching content at the edge network has emerged as a critical technique to alleviate backhaul congestion, minimize service latency, and improve user Quality of Experience (QoE). Driven by operational profitability, the edge service provider (ESP) necessitates access to user preference data to optimize its caching policies. However, disseminating such sensitive information raises significant privacy concerns. To address this challenge, we propose a privacy-preserving cooperative edge caching framework that jointly enhances caching efficiency and safeguards user preference privacy. Specifically, we design a privacy-oriented popularity estimation protocol, PSRSA, which guarantees the preservation of user privacy while delivering precise content popularity estimations. The PSRSA protocol integrates a randomize-then-shuffle mechanism to obfuscate user data locally prior to aggregation and accommodates heterogeneous privacy preservation requirements across users by dynamically adjusting differential privacy (DP) budgets. Subsequently, we formulate a Stackelberg Game-based Edge Caching (SGEC) algorithm that jointly optimizes the utility functions of both the content provider (CP) and the ESP, thereby ensuring efficient resource allocation at edge servers. Comprehensive evaluations conducted on real-world datasets demonstrate the superiority of the integrated PSRSA+SGEC framework, exhibiting a 35.22% increase in caching utility and a 3.4% improvement in cache hit ratio, while simultaneously achieving a 20.1% reduction in privacy leakage risks, compared to state-of-the-art baselines.
- 2 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (6) , 4276-4290
Toward Personalized Privacy-Preserving Content Caching With Edge Cooperation
Caching content at the edge network has emerged as a critical technique to alleviate backhaul congestion, minimize service latency, and improve user Quality of Experience (QoE). Driven by operational profitability, the edge service provider (ESP) necessitates access to user preference data to optimize its caching policies. However, disseminating such sensitive information raises significant privacy concerns. To address this challenge, we propose a privacy-preserving cooperative edge caching framework that jointly enhances caching efficiency and safeguards user preference privacy. Specifically, we design a privacy-oriented popularity estimation protocol, PSRSA, which guarantees the preservation of user privacy while delivering precise content popularity estimations. The PSRSA protocol integrates a randomize-then-shuffle mechanism to obfuscate user data locally prior to aggregation and accommodates heterogeneous privacy preservation requirements across users by dynamically adjusting differential privacy (DP) budgets. Subsequently, we formulate a Stackelberg Game-based Edge Caching (SGEC) algorithm that jointly optimizes the utility functions of both the content provider (CP) and the ESP, thereby ensuring efficient resource allocation at edge servers. Comprehensive evaluations conducted on real-world datasets demonstrate the superiority of the integrated PSRSA+SGEC framework, exhibiting a 35.22% increase in caching utility and a 3.4% improvement in cache hit ratio, while simultaneously achieving a 20.1% reduction in privacy leakage risks, compared to state-of-the-art baselines.
- 6 May 2024
- Published by Elsevier in Computer Networks
- Vol. 247
TLS fingerprint for encrypted malicious traffic detection with attributed graph kernel
- 6 May 2024
- Published by Elsevier in Computer Networks
- Vol. 247
TLS fingerprint for encrypted malicious traffic detection with attributed graph kernel
- Open Access
- 10 April 2024
- Published by Springer Nature in Research Square
Particle Swarm Optimization with Latin Hypercube Sampling for Mobility-Aware Task Offloading in D2D-Assisted MEC Networks
In this paper, we consider a Device-to-Device (D2D)-assisted Mobile Edge Computing (MEC) system in which the edge server collaboratively performs tasks with users who possess mobile characteristics. The computational resources of the edge server and the users are limited. Our objective is to minimize latency and energy consumption while maximizing system stability by determining the offloading decisions for all tasks. However, solving this problem is particularly challenging due to the coupling between offloading decisions and user mobility characteristics. To address this challenge, a Particle Swarm Optimization (PSO) algorithm based on Latin Hypercube Sampling (LHS) is proposed. PSO can be employed for iterative computation to obtain the optimal solution by treating the offloading decisions for all tasks as particles. Furthermore, employing LHS for the initialization and updating of the particle swarm can significantly enhance the performance and convergence of the PSO. Simulation results indicate that our proposed algorithm outperforms other algorithms significantly in terms of latency, energy consumption, and system stability while also exhibiting excellent robustness.
- 10 April 2024
- Published by Springer Nature in Research Square
Open AccessParticle Swarm Optimization with Latin Hypercube Sampling for Mobility-Aware Task Offloading in D2D-Assisted MEC Networks
In this paper, we consider a Device-to-Device (D2D)-assisted Mobile Edge Computing (MEC) system in which the edge server collaboratively performs tasks with users who possess mobile characteristics. The computational resources of the edge server and the users are limited. Our objective is to minimize latency and energy consumption while maximizing system stability by determining the offloading decisions for all tasks. However, solving this problem is particularly challenging due to the coupling between offloading decisions and user mobility characteristics. To address this challenge, a Particle Swarm Optimization (PSO) algorithm based on Latin Hypercube Sampling (LHS) is proposed. PSO can be employed for iterative computation to obtain the optimal solution by treating the offloading decisions for all tasks as particles. Furthermore, employing LHS for the initialization and updating of the particle swarm can significantly enhance the performance and convergence of the PSO. Simulation results indicate that our proposed algorithm outperforms other algorithms significantly in terms of latency, energy consumption, and system stability while also exhibiting excellent robustness.
- 8 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (24) , 22501-22513
Joint Server Deployment and Task Scheduling for the Maximal Profit in Mobile-Edge Computing
Recently, adopting mobile edge computing (MEC) to accommodate the compute-intensive and delay-sensitive tasks from mobile devices has gained increasing attention from the research community. In contrast to a cloud-centric scheme, deploying servers at the network edge offers the advantage of delivering faster and more efficient services. However, pioneering works primarily focus on a homogeneous server deployment strategy, which distributes the same quantity of servers among a specific number of selected locations. In this work, we aim to lay the theoretical foundation for budget constrained profits maximization (BCPM) problem, which is a coupled problem of server deployment and task scheduling. Subsequently, a two-step optimization method is proposed. Through seeking the maximum matches in the constructed bipartite graph, a task scheduling algorithm is first designed to maximize the profits under the server deployment. Then two approximation algorithms with provable approximation ratios are exploited to perform nearly optimal deployment of servers in a homogeneous and heterogeneous manner, respectively. Extensive simulations with real-world data set and system settings are conducted. The results show that the proposed algorithms can achieve at least a 10.54% increase in total profits and the average processing delay of tasks can be shortened by about 17%.
- 8 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (24) , 22501-22513
Joint Server Deployment and Task Scheduling for the Maximal Profit in Mobile-Edge Computing
Recently, adopting mobile edge computing (MEC) to accommodate the compute-intensive and delay-sensitive tasks from mobile devices has gained increasing attention from the research community. In contrast to a cloud-centric scheme, deploying servers at the network edge offers the advantage of delivering faster and more efficient services. However, pioneering works primarily focus on a homogeneous server deployment strategy, which distributes the same quantity of servers among a specific number of selected locations. In this work, we aim to lay the theoretical foundation for budget constrained profits maximization (BCPM) problem, which is a coupled problem of server deployment and task scheduling. Subsequently, a two-step optimization method is proposed. Through seeking the maximum matches in the constructed bipartite graph, a task scheduling algorithm is first designed to maximize the profits under the server deployment. Then two approximation algorithms with provable approximation ratios are exploited to perform nearly optimal deployment of servers in a homogeneous and heterogeneous manner, respectively. Extensive simulations with real-world data set and system settings are conducted. The results show that the proposed algorithms can achieve at least a 10.54% increase in total profits and the average processing delay of tasks can be shortened by about 17%.
- 22 February 2022
- Published by Elsevier in Computer Networks
- Vol. 207, 108849
Joint flight scheduling and task allocation for secure data collection in UAV-aided IoTs
- 22 February 2022
- Published by Elsevier in Computer Networks
- Vol. 207, 108849
Joint flight scheduling and task allocation for secure data collection in UAV-aided IoTs
- 17 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 8 (6) , 1344-1356
CEBD: Contact-Evidence-Driven Blackhole Detection Based on Machine Learning in OppNets
Blackhole detection in the opportunistic networks offers an effective means to mitigate the routing performance degradation but faces many challenges from corrupted nodes due to their collusion behaviors. Most existing effort in the literature focuses on the blackhole feature extraction from the message exchange. However, the decay effect of features and the forged features from the corrupted node, which acts as the rational node in performing message exchange, degrade the performance of the detection. In this article, we investigate the evidence construction, i.e., the direct and indirect evidence with the statistical parameters in message exchange. Specifically, we construct behavior classifiers to distinguish the blackhole behaviors from rational ones and design the collusion filtering strategy to improve the detection accuracy by separating corrupted nodes from rational ones, laying a behavior identification foundation. The contact evidence-driven blackhole detection (CEBD) based on machine learning is proposed to improve the routing performance. The soundness of the proposed scheme is verified statistically and the detection accuracy is evaluated based on random waypoint model (RWP) trace and Shanghai taxi trace. Extensive simulations show that our scheme outperforms the benchmarks, including SDBG, Li, and MDS, in terms of the delivery ratio in various scenarios.
- 17 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 8 (6) , 1344-1356
CEBD: Contact-Evidence-Driven Blackhole Detection Based on Machine Learning in OppNets
Blackhole detection in the opportunistic networks offers an effective means to mitigate the routing performance degradation but faces many challenges from corrupted nodes due to their collusion behaviors. Most existing effort in the literature focuses on the blackhole feature extraction from the message exchange. However, the decay effect of features and the forged features from the corrupted node, which acts as the rational node in performing message exchange, degrade the performance of the detection. In this article, we investigate the evidence construction, i.e., the direct and indirect evidence with the statistical parameters in message exchange. Specifically, we construct behavior classifiers to distinguish the blackhole behaviors from rational ones and design the collusion filtering strategy to improve the detection accuracy by separating corrupted nodes from rational ones, laying a behavior identification foundation. The contact evidence-driven blackhole detection (CEBD) based on machine learning is proposed to improve the routing performance. The soundness of the proposed scheme is verified statistically and the detection accuracy is evaluated based on random waypoint model (RWP) trace and Shanghai taxi trace. Extensive simulations show that our scheme outperforms the benchmarks, including SDBG, Li, and MDS, in terms of the delivery ratio in various scenarios.
- 5 November 2020
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 14 (2) , 655-671
A precision adjustable trajectory planning scheme for UAV-based data collection in IoTs
- 5 November 2020
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 14 (2) , 655-671
A precision adjustable trajectory planning scheme for UAV-based data collection in IoTs
- Open Access
- 14 February 2020
- Published by Wiley in Mobile Information Systems
- Vol. 2020, 1-6
Task Offloading with Power Control for Mobile Edge Computing Using Reinforcement Learning-Based Markov Decision Process
This paper proposes an efficient computation task offloading mechanism for mobile edge computing (MEC) systems. The studied MEC system consists of multiple user equipment (UEs) and multiple radio interfaces. In order to maximize the number of UEs benefitting from the MEC, the task offloading and power control strategy for a UE is optimized in a joint manner. However, the problem of finding the optimal solution is NP-hard. We then reformulate the problem as a Markov decision process (MDP) and develop a reinforcement learning- (RL-) based algorithm to solve the MDP. Simulation results show that the proposed RL-based algorithm achieves a near-optimal performance compared to the exhaustive search algorithm, and it also outperforms the received signal strength- (RSS-) based method no matter from the standpoint of the system (as it leads to a larger number of beneficial UEs) or an individual (as it generates a lower computation overhead for a UE).
- 14 February 2020
- Published by Wiley in Mobile Information Systems
- Vol. 2020, 1-6
Open AccessTask Offloading with Power Control for Mobile Edge Computing Using Reinforcement Learning-Based Markov Decision Process
This paper proposes an efficient computation task offloading mechanism for mobile edge computing (MEC) systems. The studied MEC system consists of multiple user equipment (UEs) and multiple radio interfaces. In order to maximize the number of UEs benefitting from the MEC, the task offloading and power control strategy for a UE is optimized in a joint manner. However, the problem of finding the optimal solution is NP-hard. We then reformulate the problem as a Markov decision process (MDP) and develop a reinforcement learning- (RL-) based algorithm to solve the MDP. Simulation results show that the proposed RL-based algorithm achieves a near-optimal performance compared to the exhaustive search algorithm, and it also outperforms the received signal strength- (RSS-) based method no matter from the standpoint of the system (as it leads to a larger number of beneficial UEs) or an individual (as it generates a lower computation overhead for a UE).