TY - GEN
T1 - Enhancing Mobile Crowdsensing Efficiency
T2 - 101st IEEE Vehicular Technology Conference, VTC 2025-Spring 2025
AU - Fu, Yaru
AU - Zhang, Yue
AU - Shi, Zheng
AU - Guo, Yongna
AU - Liu, Yalin
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - In this study, we investigate the resource management challenges in next-generation mobile crowdsensing networks with the goal of minimizing task completion latency while ensuring coverage performance, i.e., an essential metric to ensure comprehensive data collection across the monitored area, yet it has been commonly overlooked in existing studies. To this end, we formulate a weighted latency and coverage gap minimization problem via jointly optimizing user selection, subchannel allocation, and sensing task allocation. The formulated minimization problem is a non-convex mixed-integer programming issue. To facilitate the analysis, we decompose the original optimization problem into two subproblems. One focuses on optimizing sensing task and subband allocation under fixed sensing user selection, which is optimally solved by the Hungarian algorithm via problem reformulation. Building upon these findings, we introduce a time-efficient two-sided swapping method to refine the scheduled user set and enhance system performance. Extensive numerical results demonstrate the effectiveness of our proposed approach compared to various benchmark strategies.
AB - In this study, we investigate the resource management challenges in next-generation mobile crowdsensing networks with the goal of minimizing task completion latency while ensuring coverage performance, i.e., an essential metric to ensure comprehensive data collection across the monitored area, yet it has been commonly overlooked in existing studies. To this end, we formulate a weighted latency and coverage gap minimization problem via jointly optimizing user selection, subchannel allocation, and sensing task allocation. The formulated minimization problem is a non-convex mixed-integer programming issue. To facilitate the analysis, we decompose the original optimization problem into two subproblems. One focuses on optimizing sensing task and subband allocation under fixed sensing user selection, which is optimally solved by the Hungarian algorithm via problem reformulation. Building upon these findings, we introduce a time-efficient two-sided swapping method to refine the scheduled user set and enhance system performance. Extensive numerical results demonstrate the effectiveness of our proposed approach compared to various benchmark strategies.
KW - coverage consideration
KW - Mobile crowdsensing networks
KW - sensing task allocation
KW - subband allocation
KW - user scheduling
UR - https://www.scopus.com/pages/publications/105019048839
U2 - 10.1109/VTC2025-Spring65109.2025.11174583
DO - 10.1109/VTC2025-Spring65109.2025.11174583
M3 - Conference contribution
AN - SCOPUS:105019048839
T3 - IEEE Vehicular Technology Conference
BT - 2025 IEEE 101st Vehicular Technology Conference, VTC 2025-Spring 2025 - Proceedings
Y2 - 17 June 2025 through 20 June 2025
ER -