Xiaolong Liu

Mr. Xiaolong Liu


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
22 February 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XLXiaolong Liu
Xiaolong Liu
Honglong ChenHonglong Chen
Honglong Chen
YLYuping Liu
Yuping Liu
WWWentao Wei
Wentao Wei
HXHuansheng Xue
Huansheng Xue
FXFeng Xia
Feng Xia
Due to the swift advancement of edge computing and mobile crowdsensing (MCS), edge-assisted MCS (EAMCS) has emerged as a promising paradigm, leveraging sensor-embedded mobile devices for the collection and sharing of environmental data. As the sensing scale increases in the modern urban, the application scenario becomes more and more complex, and the budget of users and platform is limited. Therefore, it is indispensable to study the effective task allocation mechanism with considering the multiple budget constraints in the EAMCS system. However, a majority of the existing studies unilaterally focus on either the users’ time budget or the platform’s budget, disregarding the crucial aspect of the users’ energy budget. In this article, we design a joint user movement, sensing, offloading, and computation framework adopting the computation offloading strategy called binary processing strategy. In addition, the multitask data collection with a limited budget (MDCB) problem considering time, energy, and platform budget in EAMCS is formulated, which is proved to be nondeterministic polynomial-hard. In order to maximize the amount of data collected by the users in the MDCB problem, we first verify the submodularity of the objective function, then propose the global maximum data first search algorithm and task sequence-based genetic algorithm to solve the problem. The extensive experiments are conducted on both synthetic and real-world data sets to demonstrate the effectiveness of our proposed schemes.

23 February 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HXHuansheng Xue
Huansheng Xue
Honglong ChenHonglong Chen
Honglong Chen
ZNZhichen Ni
Zhichen Ni
XLXiaolong Liu
Xiaolong Liu
FXFeng Xia
Feng Xia
In recent years, wireless rechargeable sensor networks (WRSNs) have gained significant attention in the research community due to the current advancements in wireless power transfer technology. In mobile charger scheduling, previous works primarily emphasized the survival rate of sensor nodes. However, the primary task of a WRSN is to monitor targets in a given area. Therefore, the coverage of targets (CoT) maximization should be the primary objective of mobile charger scheduling. In this paper, we shift the focus to the CoT maximization on-demand charging scheduling problem, and formulate it as a multi-objective optimization problem, aiming to simultaneously enhance the average coverage and energy efficiency. We prove that the problem is NP-hard by reformulating it as a Multiple Travelling Salesman Problem with Deadline. We first propose the multiple chargers scheduling scheme for maximizing coverage of targets called MaxCov, which is designed to optimize the charging scheduling process and improve network performance in terms of coverage. Then, we further propose the multiple chargers scheduling scheme based on requests grouping called MaxCov-RG, which can well balance the trade-off between the performance and computational complexity. Finally, we validate the effectiveness of the proposed schemes via extensive simulations.

22 January 2025 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
YLYuping Liu
Yuping Liu
HCHonglong Chen
Honglong Chen
XLXiang Liu
Xiang Liu
WWWentao Wei
Wentao Wei
GMGuoqi Ma
Guoqi Ma
DYDuannan Ye
Duannan Ye

11 September 2023 in Sensors
Verified
Journal Article
Open access
PDF file
ZLZhe Li
Zhe Li
XLXiaolong Liu
Xiaolong Liu
YHYang Huang
Yang Huang
Honglong ChenHonglong Chen
Honglong Chen
The increasing popularity of portable smart devices has led to the emergence of vehicular crowdsensing as a novel approach for real-time sensing and environmental data collection, garnering significant attention across various domains. Within vehicular crowdsensing, task assignment stands as a fundamental research challenge. As the number of vehicle users and perceived tasks grows, the design of efficient task assignment schemes becomes crucial. However, existing research solely focuses on task deadlines, neglecting the importance of task duration. Additionally, the majority of privacy protection mechanisms in the current task assignment process emphasize safeguarding user location information but overlook the protection of user-perceived duration. This lack of protection exposes users to potential time-aware inference attacks, enabling attackers to deduce user schedules and device information. To address these issues in opportunistic task assignment for vehicular crowdsensing, this paper presents the minimum number of participants required under the constraint of probability coverage and proposes the User-Based Task Assignment (UBTA) mechanism, which selects the smallest set of participants to minimize the payment cost while measuring the probability of accomplishing perceived tasks by user combinations. To ensure privacy protection during opportunistic task assignment, a privacy protection method based on differential privacy is introduced. This method fuzzifies the sensing duration of vehicle users and calculates the probability of vehicle users completing sensing tasks, thus avoiding the exposure of users’ sensitive data while effectively assigning tasks. The efficacy of the proposed algorithm is demonstrated through theoretical analysis and a comprehensive set of simulation experiments.


10 February 2026 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XLXiaolong Liu
Xiaolong Liu
Honglong ChenHonglong Chen
Honglong Chen
KLKai Lin
Kai Lin
Zhishuai LiZhishuai Li
Zhishuai Li
NCNing Chen
Ning Chen
LWLiantao Wu
Liantao Wu
In recent years, the mobile crowdsensing (MCS) paradigm has enabled a diverse array of emerging sensing applications by harnessing the collective efforts of ubiquitous mobile users, who collaborate to carry out specific sensing tasks using smart devices. However, the majority of existing works concentrate on a single MCS platform, which struggles to accommodate diverse service requirements. Moreover, these existing studies either consider opportunistic users (OUs) or participatory users (PUs) for task execution, which leads to low task coverage or high recruitment costs while reducing the sensing quality of tasks. Therefore, in this article, we introduce a multiplatform scenario where OUs and PUs are combined to complement each other. Then, we formulate a multiplatform hybrid user recruitment (MPHUR) problem within the limited platform budget and user time budget (TB) and decompose it into two NP-hard subproblems. To maximize the total sensing quality of tasks, we propose a two-phase cross-platform hybrid user recruitment strategy called THUS. In the first phase, we present a greedy-based OU recruitment algorithm (GORA) to match the user–task pair iteratively with maximum sensing quality according to the shortage degree of PUs. In the second phase, the MCS platforms assign PUs to complete the tasks that OUs fail to cover based on their residual budget. We propose a multitask minimum-cost flow algorithm (MMCF) to recruit PUs for the remaining tasks. The extensive experiments are conducted on two real-world datasets to demonstrate the effectiveness of our proposed THUS.