LDAP: Lightweight Dynamic Auto-Reconfigurable Protocol in an IoT-Enabled WSN for Wide-Area Remote Monitoring
Bibliographic record
Abstract
IoT (Internet of Things)-based remote monitoring and controlling applications are increasing in dimensions and domains day by day. Sensor-based remote monitoring using a Wireless Sensor Network (WSN) becomes challenging for applications when both temporal and spatial data from widely spread sources are acquired in real time. In applications such as environmental, agricultural, and water quality monitoring, the data sources are geographically distributed, and have little or no cellular connectivity. These applications require long-distance wireless or satellite connections for IoT connectivity. Present WSNs are better suited for densely populated applications and require a large number of sensor nodes and base stations for wider coverage but at the cost of added complexity in routing and network organization. As a result, real time data acquisition using an IoT connected WSN is a challenge in terms of coverage, network lifetime, and wireless connectivity. This paper proposes a lightweight, dynamic, and auto-reconfigurable communication protocol (LDAP) for Wide-Area Remote Monitoring (WARM) applications. It has a mobile data sink for wider WSN coverage, and auto-reconfiguration capability to cope with the dynamic network topology required for device mobility. The WSN coverage and lifetime are further improved by using a Long-Range (LoRa) wireless interface. We evaluated the performance of the proposed LDAP in the field in terms of the data delivery rate, Received Signal Strength (RSS), and Signal to Noise Ratio (SNR). All experiments were conducted in a field trial for a water quality monitoring application as a case study. We have used both static and mobile data sinks with static sensor nodes in an IoT-connected environment. The experimental results show a significant reduction (up to 80%) of the number of data sinks while using the proposed LDAP. We also evaluated the energy consumption to determine the lifetime of the WSN using the LDAP algorithm.
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.001 | 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.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".