Networked Wireless Sensor Data Collection: Issues, Challenges, and Approaches
Bibliographic record
Abstract
Wireless sensor networks (WSNs) have been applied to many applications since emerging. Among them, one of the most important applications is Sensor Data Collections, where sensed data are collected at all or some of the sensor nodes and forwarded to a central base station for further processing. In this paper, we present a survey on recent advances in this research area. We first highlight the special features of sensor data collection in WSNs, by comparing with both wired sensor data collection network and other WSN applications. With these features in mind, we then discuss the issues and prior solutions on the utilizations of WSNs for sensor data collection. Based on different focuses of previous research works, we describe the basic taxonomy and propose to break down the networked wireless sensor data collection into three major stages, namely, the deployment stage, the control message dissemination stage and the data delivery stage. In each stage, we then discuss the issues and challenges, followed by a review and comparison of the previously proposed approaches and solutions, striving to identify the research and development trend behind them. In addition, we further discuss the correlations among the three stages and outline possible directions for the future research of the networked wireless sensor data collection.
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.006 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.006 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.005 | 0.009 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.001 | 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".