A Lyapunov Optimization Approach for Long-Term Task Assignment in Vehicular Crowdsensing

Vehicular crowdsensing has recently received considerable attention, due to its promising capability of collecting useful information for the Internet of Vehicles. However, existing researches in crowdsensing mainly focus on optimizing the short-term objectives, e.g., quality of crowdsensing, social welfare, or crowdsensing cost. Few of them consider the assignment of crowdsensing tasks from a long-term perspective, particularly for tasks located within a sensing hole. Due to the lack of sufficient participants nearby, these tasks may not be timely completed and have to be delayed. Particularly, in a dynamic crowdsensing system, the requirements of tasks may also change over time, which presents a new challenge in achieving the system stability. To tackle these issues, this paper formulates a novel task assignment problem from a long term perspective. A Lyapunov optimization model is constructed to optimize both the stability of the system and the utility of crowdsensing. Additionally, we establish the upper bound of the utility function, based on which we construct an auxiliary graph to convert the defined task assignment problem into finding a minimum weight maximum flow from the graph. Finally, we perform simulations to validate the efficiency of the proposed scheme.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Consumer Electronics
Published
2024-10-09
DOI
https://doi.org/10.1109/tce.2024.3477472
Citations
3
Primary Topic
Mobile Crowdsensing and Crowdsourcing
Type
article
Field-Weighted Citation Impact
1.24
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Lyapunov Optimization Approach for Long-Term Task Assignment in Vehicular Crowdsensing

Weiwei Wu, Weijian Pan, Kai Liu, Xiumin Wang et al.
3 citations
IEEE Transactions on Consumer Electronics
Mobile Crowdsensing and Crowdsourcing
1.24
article

A Lyapunov Optimization Approach for Long-Term Task Assignment in Vehicular Crowdsensing

Weiwei Wu, Weijian Pan, Kai Liu, Xiumin Wang, Xuhui Guo
article en
3 citations

Abstract

Vehicular crowdsensing has recently received considerable attention, due to its promising capability of collecting useful information for the Internet of Vehicles. However, existing researches in crowdsensing mainly focus on optimizing the short-term objectives, e.g., quality of crowdsensing, social welfare, or crowdsensing cost. Few of them consider the assignment of crowdsensing tasks from a long-term perspective, particularly for tasks located within a sensing hole. Due to the lack of sufficient participants nearby, these tasks may not be timely completed and have to be delayed. Particularly, in a dynamic crowdsensing system, the requirements of tasks may also change over time, which presents a new challenge in achieving the system stability. To tackle these issues, this paper formulates a novel task assignment problem from a long term perspective. A Lyapunov optimization model is constructed to optimize both the stability of the system and the utility of crowdsensing. Additionally, we establish the upper bound of the utility function, based on which we construct an auxiliary graph to convert the defined task assignment problem into finding a minimum weight maximum flow from the graph. Finally, we perform simulations to validate the efficiency of the proposed scheme.

IEEE Transactions on Consumer ElectronicsVol. 71(1)
Chongqing University (CN), Southeast University (CN), South China University of Technology (CN)
Openalex Percentile: Top 14%
Mobile Crowdsensing and Crowdsourcing
1.24
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.