Leveraging Energy, Latency, and Robustness for Routing Path Selection in Internet of Battlefield Things
Bibliographic record
Abstract
Internet of Battlefield Things (IoBT) connects massive tactical devices to collect battlefield situations and share perceived information. The IoBT can enhance the intelligent battlefield command, collaborative attack, and other applications, such as landmine trigger and post-war clearance. Existing routing path selection methods designed for wireless sensor networks (WSNs) are effective but still face challenges in IoBT scenarios. First, tactical devices follow nonuniform distributions with high density on boundaries in IoBT to prevent the location of devices from being speculated and protect strategic positions, which results in unbalanced energy consumption. Second, increasing latency in IoBT is caused by various data generation probabilities of tactical devices. Third, the military task features, such as landmine explosion, disconnection, and failure of tactical devices, may put forward special requirements on network robustness. To this end, we propose a routing path selection method with joint optimization in IoBT based on nonuniform node distributions and location-related data generation probabilities. Specifically, we first investigate and formulate the distribution and data generation probability of tactical devices. Based on the special features, energy consumption, latency, and network robustness are analyzed during multihop communications in IoBT. Then, a joint optimization problem is formulated to minimize energy consumption and latency, while maximizing the network robustness simultaneously. Furthermore, two path assignment algorithms are developed to solve this optimization problem. Finally, our simulation results show that the proposed routing path selection method can reduce energy consumption and latency with the guaranteed robustness of IoBT.
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.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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".