Node Embedding for Security-Aware Clustering of Mobile Information-Centric Sensor Networks
Bibliographic record
Abstract
In cluster-based information-centric wireless sensor networks (ICWSNs), mobile sensor nodes are grouped into clusters in rounds. In each cluster, a cluster head (CH) is selected, which collects, aggregates, and forwards locally sensed data to a sink node. CHs further store a copy of data for the round period to act as cache nodes and deliver data to mobile users upon requests. Nevertheless, clustering and securing mobile ICWSNs are challenging. This is because, in addition to sensor nodes’ and users’ mobility, sensor nodes are often resource constrained. Therefore, clustering and security resource allocation in mobile ICWSNs should be carefully redesigned to ensure efficient ICWSN operation, data security, and timely data access to mobile users. This article proposes a node embedding with security resource allocation (NESRA) clustering algorithm for mobile ICWSNs in rounds. NESRA allocates security resources to sensor nodes based on the location, mobility, and energy resources available in the first step. An optimization problem is formulated to select CHs that maximize network coverage and minimize data delivery delay to mobile users in the second step. In the third step, NESRA utilizes network representation learning that embeds sensor nodes’ location, mobility, and expected energy expenditure features into a 2-D space to form well-separated clusters of sensing nodes. Compared to existing works, NESRA achieves lower energy consumption, nodes’ death rate, and latency and allows higher throughput and cache nodes’ utilization with stable data security. Still, NESRA has some challenges to overcome in high-mobility networks.
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.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 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".