LDCA: Lightweight Dynamic Clustering Algorithm for IoT-Connected Wide-Area WSN and Mobile Data Sink Using LoRa
Bibliographic record
Abstract
Wide-area monitoring applications of the Internet-of-Things (IoT) connected wireless sensor network (WSN) consists of sensor nodes (SNs) with limited hardware and energy sources. The distributed nature of such a network and the difficulty of remote access make it more demanding to design an energy-efficient WSN. Moreover, long-range and low-power wireless connectivity is a challenge in IoT-connected applications. Present WSN topologies deal mainly with fixed SNs, SN distribution, and fixed data sink (DS). The majority of the control layer is implemented in the lower hierarchical layer or in a virtual middle layer, which reduces the network lifetime due to excessive processing and data transmission activities. This article proposes a real-time lightweight dynamic clustering algorithm (LDCA) for a WSN that supports the following two scenarios with limited processing resources: 1) with mobile DSs and static SNs (such as DS and SNs mounted on unmanned aerial vehicles, autonomous vehicles) and 2) with mobile SNs and static DSs (such as livestock monitoring or autonomous robots in smart farming, and urban monitoring). The proposed algorithm is based on the received signal strength indicator and signal-to-noise ratio of a long-range (LoRa) interface and its residual energy. Mathematical models were derived for real-time clustering using LoRa. Memory requirement and clustering efficiency of the constrained SN and DS for various mobility scenario were evaluated. The proposed LDCA reduces the energy requirement to 33% compared to static clustering, by reducing the number of concurrent clusters and hops. In addition, a hardware-based approach was used to validate the LDCA algorithm, and evaluate its performance in terms of energy efficiency, packet delivery rate, and network lifetime.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".