Jiajie Ren
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
Research Subjects
Jiajie Ren has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Guanglin Zhang
Donghua University
3 shared publications - Chang Guo
College of Information, Mechanical, and Electrical Engineering, Shanghai Normal University, Shanghai 201418, China
2 shared publications - Demin Li
College of Information Science and Technology and the Engineering Research Center of Digitized Textile and Apparel Technology, Ministry of Education, Donghua University, Shanghai, China
2 shared publications - Lin Wang
Nanyang technological university, Singapore, Singapore
2 shared publications - Chengsi Qi
College of Information Science and Technology and Engineering Research Center of Digitized Textile and Fashion Technology, Ministry of Education, Donghua University, Shanghai 201620, China
1 shared publication - Lei Zhang
School of Information and Intelligent Science, Donghua University, Shanghai, China
1 shared publication
Latest Publications
- Open Access
- 9 November 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (22) , 11915
Coded Caching Optimization in Dual Time-Scale Wireless Networks: An Advantage Actor–Critic Learning Approach
The rapid growth of mobile data traffic poses significant challenges to ensuring high-quality service in wireless networks. Although the caching technique is capable of alleviating network congestion, most existing schemes depend on uncoded caching with prior knowledge of content popularity and ignore the time-scale mismatch between content dynamics and user mobility. To address these challenges, we first formulate a dynamic coded caching optimization framework under a dual time-scale model that simultaneously captures long-term content popularity evolution and short-term user mobility patterns. Then, we model the optimization problem as a Markov decision process and design a novel advantage actor–critic (A2C) based coded caching algorithm. By introducing the advantage function, the proposed approach can mitigate variance in policy updates and accelerate convergence under the caching capacity constraint. Finally, extensive simulations are conducted to demonstrate that our proposed algorithm significantly outperforms baseline caching schemes in terms of average delay cost.
- 9 November 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (22) , 11915
Open AccessCoded Caching Optimization in Dual Time-Scale Wireless Networks: An Advantage Actor–Critic Learning Approach
The rapid growth of mobile data traffic poses significant challenges to ensuring high-quality service in wireless networks. Although the caching technique is capable of alleviating network congestion, most existing schemes depend on uncoded caching with prior knowledge of content popularity and ignore the time-scale mismatch between content dynamics and user mobility. To address these challenges, we first formulate a dynamic coded caching optimization framework under a dual time-scale model that simultaneously captures long-term content popularity evolution and short-term user mobility patterns. Then, we model the optimization problem as a Markov decision process and design a novel advantage actor–critic (A2C) based coded caching algorithm. By introducing the advantage function, the proposed approach can mitigate variance in policy updates and accelerate convergence under the caching capacity constraint. Finally, extensive simulations are conducted to demonstrate that our proposed algorithm significantly outperforms baseline caching schemes in terms of average delay cost.
- Open Access
- 18 September 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (9) , 423
A Game Theoretic Approach for D2D Assisted Uncoded Caching in IoT Networks
Content caching and exchange through device-to-device (D2D) communications can offload data from the centralized base station and improve the quality of users’ experience. However, existing studies often overlook the selfish nature of user equipment (UE) and the heterogeneity of content preferences, which limits their practical applicability. In this paper, we propose a novel incentive-driven uncoded caching framework modeled as a Stackelberg game between a base station (BS) and cache-enabled UEs. The BS acts as the leader by determining the unit incentive reward, while UEs jointly optimize their caching strategies as followers. The particular challenge in our formulation is that the uncoded caching decisions make the UEs’ total utility maximization problem into a non-convex integer programming problem. To address this, we map the UEs’ total utility maximization problem into a potential sub-game and design a potential game-based distributed caching (PGDC) algorithm that guarantees convergence to the optimal joint caching strategy. Building on this, we further develop a dynamic iterative algorithm to derive the Stackelberg equilibrium by jointly optimizing the BS’s cost and the total utility of UEs. The simulation results confirm the existence of the Stackelberg Equilibrium and demonstrate that the proposed PGDC algorithm significantly outperforms benchmark caching schemes.
- 18 September 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (9) , 423
Open AccessA Game Theoretic Approach for D2D Assisted Uncoded Caching in IoT Networks
Content caching and exchange through device-to-device (D2D) communications can offload data from the centralized base station and improve the quality of users’ experience. However, existing studies often overlook the selfish nature of user equipment (UE) and the heterogeneity of content preferences, which limits their practical applicability. In this paper, we propose a novel incentive-driven uncoded caching framework modeled as a Stackelberg game between a base station (BS) and cache-enabled UEs. The BS acts as the leader by determining the unit incentive reward, while UEs jointly optimize their caching strategies as followers. The particular challenge in our formulation is that the uncoded caching decisions make the UEs’ total utility maximization problem into a non-convex integer programming problem. To address this, we map the UEs’ total utility maximization problem into a potential sub-game and design a potential game-based distributed caching (PGDC) algorithm that guarantees convergence to the optimal joint caching strategy. Building on this, we further develop a dynamic iterative algorithm to derive the Stackelberg equilibrium by jointly optimizing the BS’s cost and the total utility of UEs. The simulation results confirm the existence of the Stackelberg Equilibrium and demonstrate that the proposed PGDC algorithm significantly outperforms benchmark caching schemes.
- Open Access
- 9 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Scaling Performance Analysis and Optimization Based on the Node Spatial Distribution in Mobile Content‐Centric Networks
Content‐centric networks (CCNs) have become a promising technology for relieving the increasing wireless traffic demands. In this paper, we explore the scaling performance of mobile content‐centric networks based on the nonuniform spatial distribution of nodes, where each node moves around its own home point and requests the desired content according to a Zipf distribution. We assume each mobile node is equipped with a finite local cache, which is applied to cache contents following a static cache allocation scheme. According to the nonuniform spatial distribution of cache‐enabled nodes, we introduce two kinds of clustered models, i.e., the clustered grid model and the clustered random model. In each clustered model, we analyze throughput and delay performance when the number of nodes goes infinity by means of the proposed cell‐partition scheduling scheme and the distributed multihop routing scheme. We show that the node mobility degree and the clustering behavior play the fundamental roles in the aforementioned asymptotic performance. Finally, we study the optimal cache allocation problem in the two kinds of clustered models. Our findings provide a guidance for developing the optimal caching scheme. We further perform the numerical simulations to validate the theoretical scaling laws.
- 9 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Open AccessScaling Performance Analysis and Optimization Based on the Node Spatial Distribution in Mobile Content‐Centric Networks
Content‐centric networks (CCNs) have become a promising technology for relieving the increasing wireless traffic demands. In this paper, we explore the scaling performance of mobile content‐centric networks based on the nonuniform spatial distribution of nodes, where each node moves around its own home point and requests the desired content according to a Zipf distribution. We assume each mobile node is equipped with a finite local cache, which is applied to cache contents following a static cache allocation scheme. According to the nonuniform spatial distribution of cache‐enabled nodes, we introduce two kinds of clustered models, i.e., the clustered grid model and the clustered random model. In each clustered model, we analyze throughput and delay performance when the number of nodes goes infinity by means of the proposed cell‐partition scheduling scheme and the distributed multihop routing scheme. We show that the node mobility degree and the clustering behavior play the fundamental roles in the aforementioned asymptotic performance. Finally, we study the optimal cache allocation problem in the two kinds of clustered models. Our findings provide a guidance for developing the optimal caching scheme. We further perform the numerical simulations to validate the theoretical scaling laws.
- Open Access
- 26 September 2017
- Published by MDPI AG in Sustainability
- Vol. 9 (10) , 1733
Estimation and Healing of Coverage Hole in Hybrid Sensor Networks: A Simulation Approach
Nowadays, wireless sensor network which consists of numerous tiny sensors has been widely used. One of the major challenges in such networks is how to cover the sensing area effectively and maintain longer network lifetime with limited energy simultaneously. In this paper, we study hybrid sensor network which contains both static and mobile sensors. We divide monitoring area into Delaunay Triangulation (DT) by using of Delaunay theory, estimate static sensors coverage holes, calculate the number of assistant mobile sensors and then work out the positions of assisted mobile nodes in each triangle. Next, mobile sensors will move to heal the coverage holes. Compared with the similarity methods, the algorithm HCHA we proposed is simpler, the advantages of our algorithm mainly represents in the following aspects. Firstly, it is relatively simple to estimate coverage hole based on Delaunay in our proposed algorithm. Secondly, we figure out the quantitative number range of assisted sensors those need to heal the coverage holes. Thirdly, we come up with a kind of deployment rule of assisted sensors.
- 26 September 2017
- Published by MDPI AG in Sustainability
- Vol. 9 (10) , 1733
Open AccessEstimation and Healing of Coverage Hole in Hybrid Sensor Networks: A Simulation Approach
Nowadays, wireless sensor network which consists of numerous tiny sensors has been widely used. One of the major challenges in such networks is how to cover the sensing area effectively and maintain longer network lifetime with limited energy simultaneously. In this paper, we study hybrid sensor network which contains both static and mobile sensors. We divide monitoring area into Delaunay Triangulation (DT) by using of Delaunay theory, estimate static sensors coverage holes, calculate the number of assistant mobile sensors and then work out the positions of assisted mobile nodes in each triangle. Next, mobile sensors will move to heal the coverage holes. Compared with the similarity methods, the algorithm HCHA we proposed is simpler, the advantages of our algorithm mainly represents in the following aspects. Firstly, it is relatively simple to estimate coverage hole based on Delaunay in our proposed algorithm. Secondly, we figure out the quantitative number range of assisted sensors those need to heal the coverage holes. Thirdly, we come up with a kind of deployment rule of assisted sensors.
- Open Access
Local Coverage Optimization Strategy Based on Voronoi for Directional Sensor Networks
In this paper, we study the area coverage of directional sensor networks (DSNs) with random node distribution. The coverage of DSNs depends on the sensor’s locations, the sensing radiuses, and the working directions, as well as the angle of view (AoV), which is challenging to analyze. We transform the network area coverage problem into cell coverage problems by exploiting the Voronoi diagram, which only needs to optimize local coverage for each cell in a decentralized way. To address the cell coverage problem, we propose three local coverage optimization algorithms to improve the cell coverage, namely Move Inside Cell Algorithm (MIC), Rotate Working Direction Algorithm (RWD) and Rotation based on boundary (RB), respectively. Extensive simulations are performed to prove the effectiveness of our proposed algorithms in terms of the coverage ratio.
Open AccessLocal Coverage Optimization Strategy Based on Voronoi for Directional Sensor Networks
In this paper, we study the area coverage of directional sensor networks (DSNs) with random node distribution. The coverage of DSNs depends on the sensor’s locations, the sensing radiuses, and the working directions, as well as the angle of view (AoV), which is challenging to analyze. We transform the network area coverage problem into cell coverage problems by exploiting the Voronoi diagram, which only needs to optimize local coverage for each cell in a decentralized way. To address the cell coverage problem, we propose three local coverage optimization algorithms to improve the cell coverage, namely Move Inside Cell Algorithm (MIC), Rotate Working Direction Algorithm (RWD) and Rotation based on boundary (RB), respectively. Extensive simulations are performed to prove the effectiveness of our proposed algorithms in terms of the coverage ratio.