Enhanced Network Lifetime and Secure Data Transmission in IoT: A Reinforcement Based Approach
Bibliographic record
Abstract
Internet of Things is a developing technology in the modern period with uses in wide area monitoring, healthcare, smart cities, and other areas.Wireless sensor networks (WSN) form the core of these IoT.The sensors within the WSN encounter numerous obstacles, including limited battery life, Security and Privacy and Synchronization etc.This shortens the lifetime of the network, thus energy must be used wisely.In this study, the Reinforcement Learning algorithm and K-Means are used to build clusters and to elect cluster heads.Additionally, a mobile sink is proposed to collect data from each cluster head (CH), saving energy on data transmission from nodes to base station.The proposed novel clustering and cluster head election algorithms increases energy efficiency by 75% and the time complexity is reduced to O(n/2) using reinforcement algorithm.By considering the shortest edges of obstacles, energy consumption during the mobile sink's routing is reduced, ensuring secure data transmission.The results illustrate a comparison of the time complexity between the initial cluster head election, conducted using K-Means, and the subsequent cluster head election is performed using Q-Learning.These algorithms are compared with K-Means and Fuzzy C-Means.Our proposed approach demonstrates superior performance compared to the other methods.The outcomes of the proposed work also reveal that in comparison to Clustered Routing algorithm based on forwarding mechanism optimization (CRFMO), Low Energy Adaptive Clustering Hierarchy with Improved Adaptive Cluster Adjustment (LEACH-IASA) and Improved LEACH, enhances network lifetime by increasing the number of surviving nodes and network coverage.The proposed scheme also outperforms in terms of latency compared to Software Defined Networking with Reinforcement Learning (SDN-RL) and Energy Efficient Rendezvous Ponts Selection using Deep Policy Dynamic Programming (EERPS-DPDP).
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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".