SOBER-MCS: Sociability-Oriented and Battery Efficient Recruitment for Mobile Crowd-Sensing
Bibliographic record
Abstract
The Internet of Things (IoT) concept is aiming at being an integral part of the next generation networking services by introducing pervasiveness and ubiquitous interconnectivity of uniquely-identifiable objects. The massive availability of personalized smart devices such as smartphones and wearables enable their penetration into the IoT ecosystem with their built-in sensors, particularly in Mobile Crowd-Sensing (MCS) campaigns. The MCS systems achieve the objectives of the large-scale non-dedicated sensing concept in the IoT if a sufficient number of participants are engaged to the collaborative data acquisition process. Therefore, user recruitment is a key challenge in MCS, which requires effective incentivization of cooperative, truthful and trustworthy users. A grand concern for the participants is the battery drain on the mobile devices. It is a known fact that battery drain in a smartphone is a function of the user activity, which can be modeled under various contexts. With this in mind, we propose a new social activity-aware recruitment policy, namely Sociability-Oriented and Battery-Efficient Recruitment for Mobile Crowd-Sensing (SOBER-MCS). SOBER-MCS uses sociability and the residual power of the participant smartphones as two primary criteria in the selection of participating devices. The former is an indicator of the participant willingness toward sensing campaigns, whereas the latter is used to prioritize personal use over crowd-sensing under critical battery levels. We use sociability profiles that were obtained in our previous work and use those values to simulate the sociability behavior of a large pool of participants in an MCS environment. Through simulations, we show that SOBER-MCS is able to introduce battery savings up to 18.5% while improving user and platform utilities by 12% and 20%, respectively.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".