Energy Conservative Data Aggregation for IoT Devices: An Aerial Wake-Up Radio Approach
Bibliographic record
Abstract
The ubiquitous deployment of Internet of Things (IoT) and the ever-evolving IoT services seek fully autonomous devices with no energy limitations. To fulfill this demand, we investigate the usage of unmanned aerial vehicles (UAVs) to overcome the limited battery constraint of IoT deployments in hard-to-reach locations. Specifically, we present a UAV-enabled wake-up radio (WuR) and data collection (U-WuRIoT) solution for future IoT networks. The proposed solution leverages UAVs to wake-up IoT devices from an ultralow power sleep mode by transmitting WuR signals. Upon successful wake-up, the devices use their batteries to transmit the collected data to the UAV. In this article, we present an overview of U-WuRIoT and its applications and discuss the challenges and enabling technologies toward realizing it. Candidate enablers, such as advances on wake-up receivers and UAV transmitters’ hardware, combined energy harvesting and WuR, new spectrum opportunities, energy beamforming, channel state information (CSI)-limited schemes, and UAV trajectory optimization, are outlined. A realistic experimental testbed, using a fully operational prototype implemented via off-the-shelf components, is constructed to validate the applicability of U-WuRIoT and its benefits compared to traditional duty cycling (DCY) solutions. Furthermore, a theoretical study is conducted to extrapolate the performance of U-WuRIoT in large-scale deployments. The obtained experimental and theoretical results demonstrate that U-WuRIoT can extend the lifetime of the IoT device up to three times the lifetime when DCY is applied and can reduce the false alarm rate to less than 10%. Finally, key research directions toward implementing U-WuRIoT in the 6G era are identified.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".