Lunjie Chang
Research Subjects
Lunjie Chang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Peiying Zhang
China University of Petroleum (East China)
2 shared publications - Godfrey Kibalya
Nearby Computing, Barcelona, Spain
1 shared publication M. Selvi
School of Computer Science and Engineering, Vellore Institute of Technology, Vellore, India
1 shared publication- Ning Chen
Beijing University of Posts and Telecommunications
1 shared publication - Peng Gan
College of Computer Science and Technology, China University of Petroleum (East China), Qingdao, China
1 shared publication - Sripathi Venkata Naga Santhosh Kumar
School of Computer Science Engineering and Information Systems, Vellore Institute of Technology, Vellore, India
1 shared publication
Latest Publications
- Open Access
- 16 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 54002-54011
DPRL: Task Offloading Strategy Based on Differential Privacy and Reinforcement Learning in Edge Computing
Mobile edge computing has been widely used in various IoT devices due to its excellent computing power and good interaction speed. Task offloading is the core of mobile edge computing. However, most of the existing task offloading strategies only focus on improving the unilateral performance of MEC, such as security, delay, and overhead. Therefore, focus on the security, delay and overhead of MEC, we propose a task offloading strategy based on differential privacy and reinforcement learning. This strategy optimizes the overhead required for the task offloading process while protecting user privacy. Specifically, before task offloading, differential privacy is used to interfere with the user’s location information to avoid malicious edge servers from stealing user privacy. Then, on the basis of ensuring user privacy and security, combined with the resource environment of the MEC network, reinforcement learning is used to select appropriate edge servers for task offloading. Simulation results show that our scheme improves the performance of MEC in many aspects, especially in security and resource consumption. Compared with the typical privacy protection scheme, the security is improved by 7%, and the resource consumption is reduced by 9% compared with the typical task offloading strategy.
- 16 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 54002-54011
Open AccessDPRL: Task Offloading Strategy Based on Differential Privacy and Reinforcement Learning in Edge Computing
Mobile edge computing has been widely used in various IoT devices due to its excellent computing power and good interaction speed. Task offloading is the core of mobile edge computing. However, most of the existing task offloading strategies only focus on improving the unilateral performance of MEC, such as security, delay, and overhead. Therefore, focus on the security, delay and overhead of MEC, we propose a task offloading strategy based on differential privacy and reinforcement learning. This strategy optimizes the overhead required for the task offloading process while protecting user privacy. Specifically, before task offloading, differential privacy is used to interfere with the user’s location information to avoid malicious edge servers from stealing user privacy. Then, on the basis of ensuring user privacy and security, combined with the resource environment of the MEC network, reinforcement learning is used to select appropriate edge servers for task offloading. Simulation results show that our scheme improves the performance of MEC in many aspects, especially in security and resource consumption. Compared with the typical privacy protection scheme, the security is improved by 7%, and the resource consumption is reduced by 9% compared with the typical task offloading strategy.
- Open Access
- 10 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 29393-29405
CAPSO: Chaos Adaptive Particle Swarm Optimization Algorithm
As an influential technology of swarm evolutionary computing (SEC), the particle swarm optimization (PSO) algorithm has attracted extensive attention from all walks of life. However, how to rationally and effectively utilize the population resources to equilibrate the exploration and utilization is still a key dispute to be resolved. In this paper, we propose a novel PSO algorithm called Chaos Adaptive Particle Swarm Optimization (CAPSO), which adaptively adjust the inertia weight parameter $w$ and acceleration coefficients $c_{1},c_{2}$ , and introduces a controlling factor $\gamma $ based on chaos theory to adaptively adjust the range of chaotic search. This makes the algorithm have favorable adaptability, and then the particles cannot only effectively prevent missing the global optimal solution, but also have a high probability of jumping out of the local optimal solution. To verify the stability, convergence speed, and accuracy of CAPSO, we conduct ample experiments on 6 test functions. In addition, to further verify the effectiveness and scalability of CAPSO, comparative experiments are carried out on the CEC2013 test suite. Finally, the results prove that CAPSO outperforms other peer algorithms to achieve satisfactory performance.
- 10 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 29393-29405
Open AccessCAPSO: Chaos Adaptive Particle Swarm Optimization Algorithm
As an influential technology of swarm evolutionary computing (SEC), the particle swarm optimization (PSO) algorithm has attracted extensive attention from all walks of life. However, how to rationally and effectively utilize the population resources to equilibrate the exploration and utilization is still a key dispute to be resolved. In this paper, we propose a novel PSO algorithm called Chaos Adaptive Particle Swarm Optimization (CAPSO), which adaptively adjust the inertia weight parameter $w$ and acceleration coefficients $c_{1},c_{2}$ , and introduces a controlling factor $\gamma $ based on chaos theory to adaptively adjust the range of chaotic search. This makes the algorithm have favorable adaptability, and then the particles cannot only effectively prevent missing the global optimal solution, but also have a high probability of jumping out of the local optimal solution. To verify the stability, convergence speed, and accuracy of CAPSO, we conduct ample experiments on 6 test functions. In addition, to further verify the effectiveness and scalability of CAPSO, comparative experiments are carried out on the CEC2013 test suite. Finally, the results prove that CAPSO outperforms other peer algorithms to achieve satisfactory performance.