Topology-Related Metrics and Applications for the Design and Operation of Wireless Sensor Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The use of topological features, more specifically, the importance of an element related to its structural position, is a subject widely studied in the literature. For instance, the theory of complex networks provides centrality measures that have been applied to a large variety of fields (e.g., social sciences and biology). In this work, we propose a new topological measure, the Sink Betweenness (SBet), which stems from the theory of complex networks but is adapted to Wireless Sensor Networks (WSNs) to capture relevant information for this kind of network. We also provide a distributed algorithm to calculate it, and show its applicability to two different scenarios. The first one is focused on data fusion applications for event-driven WSNs, where we devise a tree-based data collection algorithm that takes advantage of node centrality to improve the data fusion efficiency. The second scenario is focused on energy balancing problems, more specifically in a problem called energy hole , where nodes closer to the sink are more likely to relay a larger number of packets than those that are further. This phenomenon is strongly related to the topology induced by the deployment of nodes along the sensor field, and it can be effectively captured by the SBet metric. Thus, we devise a data collection algorithm that is able to distribute the relay task more evenly. Simulation results show that the SBet metric can be satisfactorily used in both scenarios. We compare the proposed approach with some of the most efficient available data fusion algorithms, and show that the proposed algorithm generates consistently good-quality data collection infrastructures which require significantly smaller overhead. The use of SBet allows to alleviate the energy-hole effects by evenly balancing the relay load, and thus increasing the network lifetime. These two applications illustrate how the topology awareness can be used to improve different network functions in a WSN.
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.
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.000 | 0.001 |
| 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 it