Opportunistic Sharing of Continuous Mobile Sensing Data for Energy and Power Conservation
Bibliographic record
Abstract
Smartphones and a growing number of wearable devices are equipped with powerful sensors. This has led to increased interest in developing applications using sensor feeds from such devices to offer services across a wide variety of domains including healthcare, entertainment, environmental monitoring and transportation. However, most of these applications require continuous sensing, which places a heavy demand on the typically limited battery power of devices. This paper presents ShareSens, our approach to opportunistically merge sensing requirements of independent applications. We achieve this using sensing schedulers for sensors, which determine the lowest sensing rate which would satisfy all requests, and then use custom filters to send out only the required data to each application. Applications can request fixed sampling rates or ranges of rates, creating the opportunity for sending them higher rates than minimally required-“for free.” Sensing requests made through our ShareSens API are forwarded to the relevant schedulers, which determine the optimum sensing rates to satisfy all requests, and set up filters to deliver required feeds to the applications. The design and implementation of ShareSens is presented, along with results from our experimental work on the power savings that can be achieved by using it.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".