An Optimal Cluster Head Selection with Trusted Path Routing and Classification of Intrusion in WSN Employing CHLNNet
Bibliographic record
Abstract
A wireless sensor network consists of a large number of sensors dispersed across a large area.These are used in broad areas including queue management, military applications, ecological applications, and others.This method, which combines deep learning and optimisation strategies with a focus on attack identification, is still under testing.The nodes will first be distributed randomly, centred on the network's dimension, under a system paradigm.Comparison sets are produced by use of an energy-related timer.Later, the geographical comparison, the quality of the link between the cluster head (CH) and cluster member (CM) nodes, and the node's remaining network energy will all be taken into account when analysing the transmission probability.The CH will determine how to manage the trust.The node will be chosen as CH after it meets the criteria for trust coverage.This will be chosen as CM if the situation is still unsatisfactory.The Dempster-Shaft theory and multi-dimensional trust criteria will be used to determine the cluster pathways' (CP) optimal range for effective data transfer, with residual energy and distance being the key constraints.Cascaded Hermite Laguerre Neural Network will classify and identify the attack if the best and most reliable path is still chosen (CHLNNet).This proposed approach will be compared against three sophisticated methodologies with regard to several parameters.As a result, the suggested CHLNNet technique achieves 91.4% of malicious detection rate, 28.2% average latency, 94.8% throughput, 23% end-to-end delay, and 31.4% routing overhead.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 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".