LoRa-LBO: An Experimental Analysis of LoRa Link Budget Optimization in Custom Build IoT Test Bed for Agriculture 4.0
Bibliographic record
Abstract
The Internet of Things (IoT) is transforming all applications into real-time monitoring systems. Due to the advancement in sensor technology and communication protocols, the implementation of the IoT is occurring rapidly. In agriculture, the IoT is encouraging implementation of real-time monitoring of crop fields from any remote location. However, there are several agricultural challenges regarding low power use and long-range transmission for effective implementation of the IoT. These challenges are overcome by integrating a long-range (LoRa) communication modem with customized, low-power hardware for transmitting agricultural field data to a cloud server. In this study, we implemented a custom-based sensor node, gateway, and handheld device for real-time transmission of agricultural data to a cloud server. Moreover, we calibrated certain LoRa field parameters, such as link budget, spreading factor, and receiver sensitivity, to extract the correlation of these parameters on a custom-built LoRa testbed in MATLAB. An energy harvesting mechanism is also presented in this article for analyzing the lifetime of the sensor node. Furthermore, this article addresses the significance and distinct kinds of localization algorithms. Based on the MATLAB simulation, we conclude that hybrid range-based localization algorithms are more reliable and scalable for deployment in the agricultural field. Finally, a real-time experiment was conducted to analyze the performance of custom sensor nodes, gateway, and handheld devices.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 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.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| 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".