A Formal Energy Consumption Analysis to Secure Cluster-Based WSN: A Case Study of Multi-Hop Clustering Algorithm Based on Spectral Classification Using Lightweight Blockchain
Bibliographic record
Abstract
Wireless Sensors Networks are integrating human daily life at a fast rate. Applications cover a wide range of fields, including home security, agriculture, climate change, fire prevention, and so on and so forth. If WSN were initially flat networks, hierarchical, or cluster-based networks have been introduced in order to achieve a better performance in terms of energy efficiency, topology management, delay minimization, load balancing, routing techniques, etc. As cluster-based algorithms proved to be efficient in terms of energy balancing, security has been of less importance in the field. Data shared by nodes in a WSN can be very sensitive depending on the field of application. Therefore, it is important to ensure security at various levels of WSN. This paper proposes a formal modeling of the energy consumed to secure communications in a cluster-based WSN in general. The concept is implemented using the Proof of Authentication (POAh) paradigm of blockchain and applied to a Multi-hop Clustering Algorithm based on spectral classification. The studied metrics are residual energy in the network, the number of alive nodes, first and last dead node.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.001 | 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.000 | 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 teacher head, 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".