MétaCan
Menu
Back to cohort
Record W4411142912 · doi:10.1109/jiot.2025.3577671

Energy-Efficient Data Collection and Resource Allocation for UoI-Aware Mobile Crowdsensing in IoV

2025· article· en· W4411142912 on OpenAlexaff
Chenyi Liang, Fangzhe Chen, Gaoyu Luo, Zhibin Gao, Yifeng Zhao, Lianfen Huang

Bibliographic record

VenueIEEE Internet of Things Journal · 2025
Typearticle
Languageen
FieldComputer Science
TopicMobile Crowdsensing and Crowdsourcing
Canadian institutionsWestern University
FundersNational Key Laboratory of Science and Technology on CommunicationsNatural Science Foundation of Fujian ProvinceNational Natural Science Foundation of China
KeywordsComputer scienceCrowdsensingComputer networkResource allocationData collectionMobile computingEnergy consumptionResource management (computing)Efficient energy useReal-time computingDistributed computingComputer security

Abstract

fetched live from OpenAlex

Mobile Crowdsensing (MCS) is a promising paradigm where embedded sensor are exploited for collecting and sharing environmental data. In IoV, participating vehicles sense the environment, collect data and transmit the data to the edge server for processing to provide real-time services. However, real-time services not only pose energy challenges for massive data transmission and analysis, but also demand dynamic multi-timeslot optimisation for MCS systems. Additionally, sensing data often require continuous updates to prevent the provision of obsolete services. To address this, we introduce the concept of Urgency of Information (UoI) to characterize the freshness of sensing data. Diverging from the linear growth trend of Age of Information (AoI), UoI enables dynamic adjustment of the decay rate of data freshness based on traffic complexity. In this paper, we propose a dynamic multi-timeslot MCS system for IoV, under constraints of UoI, which intelligently leverages the spatial correlation of perception to update data and minimizes network energy consumption while ensuring compliance with UoI constraints. Then we propose a Joint Data Collection and Resource Allocation (JDCRA) algorithm to obtain the solution based on convex optimization. To the best of our knowledge, this is the first work to jointly optimize multi-road data collection and resource allocation, taking into account UoI metrics. We evaluate JDCRA by experiments on SUMO in real-world scenarios. Experimental results show that JDCRA outperforms state-of-the-art methods in terms of energy consumption and UoI violation probability, and obtains solutions that consumes only 7.43% more energy than the optimal solution in polynomial complexity.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.896
Threshold uncertainty score0.560

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.017
GPT teacher head0.269
Teacher spread0.252 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Internet of Things JournalSame topicMobile Crowdsensing and CrowdsourcingFrench-language works237,207