Jiayuan Du

Mr. Jiayuan Du

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
4 September 2024 in Electronics
Verified
Journal Article
Open access
PDF file
GZGuowei Zhang
Guowei Zhang
JDJiayuan Du
Jiayuan Du
XYXiaowei Yuan
Xiaowei Yuan
KZKewei Zhang
Kewei Zhang
Mobile Edge Computing (MEC) has been widely applied in various Internet of Things (IoT) scenarios due to its advantages of low latency and low energy consumption. However, the offloading of tasks generated by terminal devices to edge servers inevitably raises privacy leakage concerns. Given the limited resources in MEC networks, this paper proposes a task scheduling strategy, named DQN-DP, to minimize location privacy leakage under the constraint of offloading costs. The strategy is based on a differential privacy location obfuscation probability density function. Theoretical analysis demonstrates that the probability density function employed in this study is valid and satisfies ϵ-differential privacy in terms of security. Numerical results indicate that, compared to existing baseline approaches, the proposed DQN-DP algorithm effectively balances privacy leakage and offloading cost. Specifically, DQN-DP reduces privacy leakage by approximately 20% relative to baseline approaches.

18 March 2024 in IEEE Access
Verified
Journal Article
Open access
JDJiayuan Du
Jiayuan Du
GZGuowei Zhang
Guowei Zhang
XYXiaowei Yuan
Xiaowei Yuan
XZXiaodong Zang
Xiaodong Zang
In recent years, edge computing networks have been widely adopted to achieve low latency, save bandwidth, and improve flexibility. However, most of the current Edge Nodes (ENs) are in semi-trusted or untrusted environments, where interactions among users are unsafe. Therefore, providing cost-effective protection strategies for ENs under resource limitations remains a great challenge. To cope with this, we propose an edge computing model with "End-Edge-Cloud" collaborative services, and a Privacy Preservation Strategy with Pseudo-Addresses (P 2 SPA) is constructed to maximize the cost-effectiveness while protecting the location privacy of the ENs. We quantify the privacy protection preference of user information using the Analytic Hierarchy Process (AHP) to select the optimal EN. Considering the dynamic change in the attack frequency, a pseudo-address selection and updating strategy is constructed based on the Stackelberg game theory; thus, the optimal pseudo-address update frequency is achieved. Numerical estimations are performed to verify the effectiveness of the proposed P 2 SPA strategy. Compared with the existing methods, P 2 SPA achieves a compromise service strategy with satisfactory performance on both the defense effect and defense cost.

6 August 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
GZGuowei Zhang
Guowei Zhang
JDJiayuan Du
Jiayuan Du
XLXiuhua Lu
Xiuhua Lu
XZXiaodong Zang
Xiaodong Zang
YYYang Yang
Yang Yang
The rapidly evolving Internet of Things (IoT) continues to serve as a critical bridge between the physical world and digital space, driving increasing demands for optimized communication capabilities and time-sensitive data acquisition. However, traditional cloud computing architectures are becoming increasingly insufficient to meet these stringent demands. Mobile Edge Computing (MEC) has thus emerged as a promising paradigm. By delegating data processing tasks from centralized cloud servers to edge nodes (ENs) located near end-users, MEC significantly enhances service efficiency while simultaneously introducing heightened privacy and security risks. To mitigate both external threats during task interactions and internal adversaries within the network, this paper proposes a Lightweight Verification and Protection (LVP) strategy for ENs. LVP primarily leverages secure computation techniques to ensure the anonymity and confidentiality of private information during transmission and verification. It further incorporates a reputation-based evaluation framework to mitigate the impact of insider threats. Specifically, the integrity of user-uploaded task data is first verified, followed by anonymous matching between users and ENs through paired index. A reputation-based anonymous authentication algorithm is then designed to prevent exposure or linkage of reputation information during usage. Finally, reputation values are dynamically updated by jointly considering temporal relevance and historical behavior. Theoretical analysis confirms the robustness and correctness of all LVP sub-algorithms, while experimental evaluations demonstrate the scheme’s effectiveness and feasibility under low computational and communication overhead.

19 June 2026 in Computer Networks
Verified
Journal Article
Closed access
FWFei Wang
Fei Wang
LJLei Jiao
Lei Jiao
KZKonglin Zhu
Konglin Zhu
JDJiayuan Du
Jiayuan Du
XLXiaojun Lin
Xiaojun Lin
JDJin Dong
Jin Dong