Xingting Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xingting Liu has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Siwang Zhou
Hunan University
5 shared publications - Wei Zhang
School of Computer Science and Engineering, Changsha University, Changsha, China
4 shared publications - Jiaxin Peng
College of Computer Science and Electrical Engineering, Hunan University, Changsha, China
3 shared publications Deyan Tang
2 shared publications- Jianping Yu
College of Information Science and Engineering, Hunan Normal University, Changsha, China
2 shared publications - Keqin Li
Hunan University
2 shared publications
Latest Publications
- 9 September 2025
- Published by Elsevier in Computer Networks
- Vol. 272
Attention map-driven compressive sensing for stable and high-accuracy distributed data storage in mobile crowdsensing systems
- 9 September 2025
- Published by Elsevier in Computer Networks
- Vol. 272
Attention map-driven compressive sensing for stable and high-accuracy distributed data storage in mobile crowdsensing systems
- 16 April 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 158, 200-209
Region-based compressive distributed storage in Mobile CrowdSensing
- 16 April 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 158, 200-209
Region-based compressive distributed storage in Mobile CrowdSensing
- 10 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (7) , 12022-12032
Adaptive Sampling Allocation for Distributed Data Storage in Compressive CrowdSensing
Distributed data storage can assist compressive crowdsensing to solve the challenge of temporary data storage in the network. Block compressive sensing effectively addresses distributed data storage of large spatiotemporal data from crowdsensing, allowing efficient reconstruction at low storage and computational costs. However, when the data is unevenly distributed over the sensing area, existing algorithms ignore the variability of information between blocks and still require the central server to uniformly collect samples from each block stored on the mobile device, leading to a reduction in overall reconstruction accuracy. To address this, we propose an adaptive sampling allocation strategy that deeply analyzes the statistical information of each block which can help the central server to collect the number of measurements for each block adaptively to improve the sampling quality. Additionally, we consider the correlation between blocks and use a global denoising strategy to further improve the reconstruction accuracy. Experimental results demonstrate that, compared to the state-of-the-art DDS-CCS algorithm, our proposed adaptive sampling allocation with a joint-denoising mechanism significantly improves the accuracy of the information-rich blocks that most affect the global accuracy, and hence the global reconstruction accuracy. which also remains robust to different block sizes and exhibits improved stability.
- 10 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (7) , 12022-12032
Adaptive Sampling Allocation for Distributed Data Storage in Compressive CrowdSensing
Distributed data storage can assist compressive crowdsensing to solve the challenge of temporary data storage in the network. Block compressive sensing effectively addresses distributed data storage of large spatiotemporal data from crowdsensing, allowing efficient reconstruction at low storage and computational costs. However, when the data is unevenly distributed over the sensing area, existing algorithms ignore the variability of information between blocks and still require the central server to uniformly collect samples from each block stored on the mobile device, leading to a reduction in overall reconstruction accuracy. To address this, we propose an adaptive sampling allocation strategy that deeply analyzes the statistical information of each block which can help the central server to collect the number of measurements for each block adaptively to improve the sampling quality. Additionally, we consider the correlation between blocks and use a global denoising strategy to further improve the reconstruction accuracy. Experimental results demonstrate that, compared to the state-of-the-art DDS-CCS algorithm, our proposed adaptive sampling allocation with a joint-denoising mechanism significantly improves the accuracy of the information-rich blocks that most affect the global accuracy, and hence the global reconstruction accuracy. which also remains robust to different block sizes and exhibits improved stability.
- 8 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (7) , 11767-11778
Stopping Criteria for Distributed Data Storage in Compressive CrowdSensing Systems
Distributed data storage (DDS) in mobile crowdsensing (MCS) systems has recently gained popularity. Data should be briefly saved on participants’ mobile devices before being gathered once the centralized cloud servers resume normal operations. For MCS systems, the existing DDS strategies briefly considered reconstructing the scene as precisely as possible without thinking about the costs of each step. However, our goal is to obtain a sufficiently accurate approximation of the sensing data from mobile participants with as few costs as possible. We note a crucial observation: when a specified number of participants have been transmitted to a central server, the sensing data has already been well reconstructed, and the accuracy advancement with additional transmitted participants is minimal. In our scheme, two stopping criteria are proposed for DDS in compressive MCS, which aims to enhance recovery performance while reducing the costs of the whole process. In the first stopping criterion, we established a rule to stop the continued recruitment of participants. The algorithm adaptively increases the number of participants until the reconstruction accuracy meets the requirement. Another stopping criterion of the reconstruction algorithm is designed to find a more accurate number of iterations than the original. The experiment results demonstrate that the first stopping criterion can reduce participants’ collection while obtaining an approximate value. The second stopping criterion assists the reconstruction algorithm in terminating at a more appropriate number of iterations, saving computing costs while ensuring accuracy.
- 8 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (7) , 11767-11778
Stopping Criteria for Distributed Data Storage in Compressive CrowdSensing Systems
Distributed data storage (DDS) in mobile crowdsensing (MCS) systems has recently gained popularity. Data should be briefly saved on participants’ mobile devices before being gathered once the centralized cloud servers resume normal operations. For MCS systems, the existing DDS strategies briefly considered reconstructing the scene as precisely as possible without thinking about the costs of each step. However, our goal is to obtain a sufficiently accurate approximation of the sensing data from mobile participants with as few costs as possible. We note a crucial observation: when a specified number of participants have been transmitted to a central server, the sensing data has already been well reconstructed, and the accuracy advancement with additional transmitted participants is minimal. In our scheme, two stopping criteria are proposed for DDS in compressive MCS, which aims to enhance recovery performance while reducing the costs of the whole process. In the first stopping criterion, we established a rule to stop the continued recruitment of participants. The algorithm adaptively increases the number of participants until the reconstruction accuracy meets the requirement. Another stopping criterion of the reconstruction algorithm is designed to find a more accurate number of iterations than the original. The experiment results demonstrate that the first stopping criterion can reduce participants’ collection while obtaining an approximate value. The second stopping criterion assists the reconstruction algorithm in terminating at a more appropriate number of iterations, saving computing costs while ensuring accuracy.
- 3 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. PP (19328184) , 1-11
Volatility-Based Measurements Allocation for Distributed Data Storage in Mobile Crowd Sensing
For the implementation of distributed storage frameworks in the context of mobile crowd sensing (MCS), compressed sensing (CS) theory provides significant support, mainly because of the essential characteristic that CS theory will contain global information when encoding any measurements. Therefore, with limited measurement resources, the rational allocation of measurement resources becomes the most critical factor affecting recovery accuracy when using CS to recover the data. Unfortunately, the latest distributed storage frameworks do not take into account the importance of measurement resource allocation, which directly leads to a significant loss of data recovery accuracy. Therefore, to address this issue, this article proposes a volatility-based allocation strategy for the measurement resource. First, we process the target monitoring region in blocks. Next, we calculate the magnitude of fluctuations between adjacent reconstructed data by volatility, which is used to assess the importance of the different areas. Finally, a volatility-based measurement allocation scheme is proposed by fully considering the importance of different areas. It is important to note that the introduction of the concept of “volatility” in the context of MCS makes it feasible to correctly differentiate the importance of individual parts of the target monitoring region without any prior knowledge by employing extremely fuzzy recovery data. In addition, extensive experiments show that our measurement allocation scheme improves data recovery accuracy by 44% for uneven data distribution scenarios and 25% for even data distribution scenarios, compared with the random measurement allocation used in the state-of-the-art MCS distributed storage framework.
- 3 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. PP (19328184) , 1-11
Volatility-Based Measurements Allocation for Distributed Data Storage in Mobile Crowd Sensing
For the implementation of distributed storage frameworks in the context of mobile crowd sensing (MCS), compressed sensing (CS) theory provides significant support, mainly because of the essential characteristic that CS theory will contain global information when encoding any measurements. Therefore, with limited measurement resources, the rational allocation of measurement resources becomes the most critical factor affecting recovery accuracy when using CS to recover the data. Unfortunately, the latest distributed storage frameworks do not take into account the importance of measurement resource allocation, which directly leads to a significant loss of data recovery accuracy. Therefore, to address this issue, this article proposes a volatility-based allocation strategy for the measurement resource. First, we process the target monitoring region in blocks. Next, we calculate the magnitude of fluctuations between adjacent reconstructed data by volatility, which is used to assess the importance of the different areas. Finally, a volatility-based measurement allocation scheme is proposed by fully considering the importance of different areas. It is important to note that the introduction of the concept of “volatility” in the context of MCS makes it feasible to correctly differentiate the importance of individual parts of the target monitoring region without any prior knowledge by employing extremely fuzzy recovery data. In addition, extensive experiments show that our measurement allocation scheme improves data recovery accuracy by 44% for uneven data distribution scenarios and 25% for even data distribution scenarios, compared with the random measurement allocation used in the state-of-the-art MCS distributed storage framework.
- 18 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (3) , 4990-5001
Privacy-Preserving Truth Discovery for Collaborative-Cloud Encryption in Mobile Crowdsensing
In mobile crowdsensing (MCS) system, a variety of sensors are required to operate together to glean and upload sensory data to clouds for processing. In real practice, truth discovery has been widely explored to find reliable information from various mobile devices. Under the requirement of MCS security, privacy-preserving truth discovery (PPTD) causes wide concern, which refers to discovering truthful information from these unreliable uploaded data while protecting users' private information. Although many PPTD mechanisms have been proposed, they can either not guarantee low communication from users to the cloud, or fail to realize fully strong privacy protect including sensing data privacy, weight privacy, intermediate privacy, and estimated truth privacy. This study designs a collaborative cloud encryption architecture. In this framework, we propose a new system architecture that adapts a two-cloud peer model while leveraging garbled circuit (GC). Users only need to transfer data to two clouds once, which realizes low users workloads while supporting dynamic users. The two cloud terminals cooperate to complete the weight update through the GC but execute the truth discovery algorithm, respectively. In this way, the noninteractive comes true and the users' workloads are transferred to the cloud server side. The weight update finish and weight privacy are fulfilled through GC, meanwhile the other intermediate values maintain strong privacy. At the same time, because the collaborative cloud architecture of the two clouds ensures the confidentiality of the truth value in the cloud and the homomorphism at the inquiry side, it ensures the strong privacy of the whole process from users to inquiries. The performance of this proposed method is verified through extensive evaluations.
- 18 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (3) , 4990-5001
Privacy-Preserving Truth Discovery for Collaborative-Cloud Encryption in Mobile Crowdsensing
In mobile crowdsensing (MCS) system, a variety of sensors are required to operate together to glean and upload sensory data to clouds for processing. In real practice, truth discovery has been widely explored to find reliable information from various mobile devices. Under the requirement of MCS security, privacy-preserving truth discovery (PPTD) causes wide concern, which refers to discovering truthful information from these unreliable uploaded data while protecting users' private information. Although many PPTD mechanisms have been proposed, they can either not guarantee low communication from users to the cloud, or fail to realize fully strong privacy protect including sensing data privacy, weight privacy, intermediate privacy, and estimated truth privacy. This study designs a collaborative cloud encryption architecture. In this framework, we propose a new system architecture that adapts a two-cloud peer model while leveraging garbled circuit (GC). Users only need to transfer data to two clouds once, which realizes low users workloads while supporting dynamic users. The two cloud terminals cooperate to complete the weight update through the GC but execute the truth discovery algorithm, respectively. In this way, the noninteractive comes true and the users' workloads are transferred to the cloud server side. The weight update finish and weight privacy are fulfilled through GC, meanwhile the other intermediate values maintain strong privacy. At the same time, because the collaborative cloud architecture of the two clouds ensures the confidentiality of the truth value in the cloud and the homomorphism at the inquiry side, it ensures the strong privacy of the whole process from users to inquiries. The performance of this proposed method is verified through extensive evaluations.