Toward Safer Mines: A Robust Wireless Sensor Network Placement for Real-World Underground Conditions
Bibliographic record
Abstract
Wireless sensor networks (WSN) are essential for monitoring operations, environmental conditions, and ensuring worker safety in underground mining environments. A key challenge in deploying these networks lies in achieving sufficient sensor coverage and reliable connectivity to enable early incident detection and timely response. While existing approaches primarily focus on deployment efficiency, this paper introduces a safety-driven optimization model that accounts for the complete underground mine structure and its specific operational conditions. The proposed algorithm minimizes the number of deployed nodes—reducing capital expenditure (CAPEX)—while meeting occupational safety standards by ensuring sensor coverage at critical points of interest and maintaining network connectivity. Compared to existing models, our method reduces the number of required nodes by up to 82%, while satisfying both k-coverage and k-connectivity requirements. Unlike conventional strategies based on idealized assumptions, our approach is tailored to the real-world conditions of Colombian underground mines. Simulation results demonstrate that achieving connectivity demands more nodes than coverage when both are evaluated under equivalent conditions. The algorithm was validated in two prototype mines, achievingk= 2 for both coverage and connectivity—ensuring that each point of interest is monitored by at least two sensors and connected via two link-disjoint communication paths. This redundancy enhances fault tolerance by providing backup for both sensing and communication. Finally, we introduce two new metrics for evaluating k-coverage and k-connectivity, designed to assess the robustness of WSN in underground mining and tunnel environments.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| 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".