Ziqiong Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ziqiong Lin has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Wenjie Zhang
School of Computer Sciences, Minnan Normal University, Zhangzhou, China
8 shared publications - Yifeng Zheng
School of Computer Sciences, Minnan Normal University, Zhangzhou, China
8 shared publications - Jingmin Yang
Minnan Normal University
4 shared publications - Liming Chen
Zhangzhou Affiliated Hospital of Fujian Medical University, Zhangzhou, Fujian, China
2 shared publications - Yijun Li
School of Computer Sciences, Minnan Normal University, Zhangzhou, China
2 shared publications - Baoya Wei
School of Computer Science, Minnan Normal University, Zhangzhou 363000, China
1 shared publication
Latest Publications
- 22 April 2025
- Published by Springer Nature in Computing
- Vol. 107 (5) , 1-29
Optimal sequential computation offloading and migration in mobile edge computing with multi-task priority
- 22 April 2025
- Published by Springer Nature in Computing
- Vol. 107 (5) , 1-29
Optimal sequential computation offloading and migration in mobile edge computing with multi-task priority
- 24 March 2025
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 30 (3-4) , 776-794
Computation Offloading in Mobile Edge Computing-enabled Blockchain Based on Contract and Matching Theory
- 24 March 2025
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 30 (3-4) , 776-794
Computation Offloading in Mobile Edge Computing-enabled Blockchain Based on Contract and Matching Theory
- Open Access
Novel Ensemble Approach with Incremental Information Level and Improved Evidence Theory for Attribute Reduction
With the development of intelligent technology, data in practical applications show exponential growth in quantity and scale. Extracting the most distinguished attributes from complex datasets becomes a crucial problem. The existing attribute reduction approaches focus on the correlation between attributes and labels without considering the redundancy. To address the above problem, we propose an ensemble approach based on an incremental information level and improved evidence theory for attribute reduction (IILE). Firstly, the incremental information level reduction measure comprehensively assesses attributes based on reduction capability and redundancy level. Then, an improved evidence theory and approximate reduction methods are employed to fuse multiple reduction results, thereby obtaining an approximately globally optimal and a most representative subset of attributes. Eventually, using different metrics, experimental comparisons are performed on eight datasets to confirm that our proposal achieved better than other methods. The results show that our proposal can obtain more relevant attribute sets by using the incremental information level and improved evidence theory.
Open AccessNovel Ensemble Approach with Incremental Information Level and Improved Evidence Theory for Attribute Reduction
With the development of intelligent technology, data in practical applications show exponential growth in quantity and scale. Extracting the most distinguished attributes from complex datasets becomes a crucial problem. The existing attribute reduction approaches focus on the correlation between attributes and labels without considering the redundancy. To address the above problem, we propose an ensemble approach based on an incremental information level and improved evidence theory for attribute reduction (IILE). Firstly, the incremental information level reduction measure comprehensively assesses attributes based on reduction capability and redundancy level. Then, an improved evidence theory and approximate reduction methods are employed to fuse multiple reduction results, thereby obtaining an approximately globally optimal and a most representative subset of attributes. Eventually, using different metrics, experimental comparisons are performed on eight datasets to confirm that our proposal achieved better than other methods. The results show that our proposal can obtain more relevant attribute sets by using the incremental information level and improved evidence theory.
- 12 August 2024
- Published by Springer Nature in The Journal of Supercomputing
- p. 1-30
Matching with contract-based resource trading in UAV-assisted MEC system
- 12 August 2024
- Published by Springer Nature in The Journal of Supercomputing
- p. 1-30
Matching with contract-based resource trading in UAV-assisted MEC system
- Open Access
- 15 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 233-238
Computation Offloading in Mobile Edge Computing-Enabled Blockchain using Matching and Contract Theory
The application of blockchain technology on mobile devices requires significant computing resources. However, the limited capacity of mobile devices cannot meet the high computing power requirements of blockchain technology, which limits the development of blockchain technology. Mobile Edge Computing (MEC) is capable of alleviate the limited computing capacity of IoT terminals. This paper introduces an edge computing-enabled blockchain system consisting of an edge computing allocation center (ECAC), multiple edge service providers (ESPs), and multiple miners. To efficiently allocate resources between these miners and ESPs, we propose a hierarchical computation offloading strategy based on contract theory and matching game. During contract design phase, ECAC designs a contribution-reward contract to attract ESPs to join the trading market, and provide services to miners. By analyzing the attributes and conditions of feasible contracts of feasible contract, the optimal contract is devised using Lagrange multiplication. During matching phase, an iterative matching algorithm (IMA) is proposed to achieve the matching between ESPs and miners by constructing preference sets for miners and ESPs. Both the stability and convergence have been proved by theoretical analysis. Finally, we conduct experiments to validate the feasibility and effectiveness of the design contract. Experimental results also demonstrate the stability of IMA matching algorithm.
- 15 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 233-238
Open AccessComputation Offloading in Mobile Edge Computing-Enabled Blockchain using Matching and Contract Theory
The application of blockchain technology on mobile devices requires significant computing resources. However, the limited capacity of mobile devices cannot meet the high computing power requirements of blockchain technology, which limits the development of blockchain technology. Mobile Edge Computing (MEC) is capable of alleviate the limited computing capacity of IoT terminals. This paper introduces an edge computing-enabled blockchain system consisting of an edge computing allocation center (ECAC), multiple edge service providers (ESPs), and multiple miners. To efficiently allocate resources between these miners and ESPs, we propose a hierarchical computation offloading strategy based on contract theory and matching game. During contract design phase, ECAC designs a contribution-reward contract to attract ESPs to join the trading market, and provide services to miners. By analyzing the attributes and conditions of feasible contracts of feasible contract, the optimal contract is devised using Lagrange multiplication. During matching phase, an iterative matching algorithm (IMA) is proposed to achieve the matching between ESPs and miners by constructing preference sets for miners and ESPs. Both the stability and convergence have been proved by theoretical analysis. Finally, we conduct experiments to validate the feasibility and effectiveness of the design contract. Experimental results also demonstrate the stability of IMA matching algorithm.
- Open Access
- 17 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 988-994
Resource Reservation Contract Design for Mobile Edge Computing with Energy Harvesting
To address the bottleneck of energy performance, this paper considers an energy harvesting (EH)-enabled Mobile Edge Computing (MEC) system with contract users (CUs) and random users (RUs). The resource demands of CUs are known in advance, while RUs are mobile and randomly arriving. We propose a resource reservation framework based on contract theory with the goal of maximizing the utility of agent node (AN) under information asymmetry and demand uncertainty. First, for symmetric information scenario, the relationship between the optimal resource reservation and the demands of CUs is obtained. Then, for asymmetric information scenario, a contract-based resource reservation scheme is proposed to motivate wireless access point (WAP) to share the demand information of CUs and take part of over-reservation risk cost. Based on this, the theoretical expression for the optimal reserved resource is obtained by exploring the features of the feasible contracts under individual rationality and incentive compatibility constraints. The effectiveness of proposed contract-based resource reservation scheme is validated through simulation results.
- 17 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 988-994
Open AccessResource Reservation Contract Design for Mobile Edge Computing with Energy Harvesting
To address the bottleneck of energy performance, this paper considers an energy harvesting (EH)-enabled Mobile Edge Computing (MEC) system with contract users (CUs) and random users (RUs). The resource demands of CUs are known in advance, while RUs are mobile and randomly arriving. We propose a resource reservation framework based on contract theory with the goal of maximizing the utility of agent node (AN) under information asymmetry and demand uncertainty. First, for symmetric information scenario, the relationship between the optimal resource reservation and the demands of CUs is obtained. Then, for asymmetric information scenario, a contract-based resource reservation scheme is proposed to motivate wireless access point (WAP) to share the demand information of CUs and take part of over-reservation risk cost. Based on this, the theoretical expression for the optimal reserved resource is obtained by exploring the features of the feasible contracts under individual rationality and incentive compatibility constraints. The effectiveness of proposed contract-based resource reservation scheme is validated through simulation results.
- 27 February 2023
- Published by Springer Nature in Journal of Grid Computing
- Vol. 21 (1) , 1-19
Contract-based Cooperative Computation and Communication Resources Sharing in Mobile Edge Computing
- 27 February 2023
- Published by Springer Nature in Journal of Grid Computing
- Vol. 21 (1) , 1-19
Contract-based Cooperative Computation and Communication Resources Sharing in Mobile Edge Computing
- 10 December 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (7) , 7970-7996
Mobile edge computing-enabled blockchain: contract-guided computation offloading
- 10 December 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (7) , 7970-7996
Mobile edge computing-enabled blockchain: contract-guided computation offloading