IIoT Wireless Network Design Algorithms for Smart Mines and Tunnels
Bibliographic record
Abstract
<p>Safety and high productivity of mines and tunnels can be ensured by collecting critical data. Fast emerging Industrial Internet of Things (IIoT) approach is an effective tool to perform this tedious task. The work of this thesis focuses on investigating underground IIoT communication systems and suggesting a number of algorithms for performance improvement. First we characterized wireless propagation in mines and tunnels via simulation as well as experiments. Then analytically optimized various system parameters for better performance improvement and lifetime enhancement with power saving features at the node level as well as at the network level. Then we developed a new medium access control (MAC) protocol to provide better connectivity to the IIoT system in harsh underground environments using Long Range (LoRa) wireless technology. The MAC protocols play a crucial role to collect data in a timely manner and meet the application specific QoS requirements. LoRaWAN, the incumbent MAC protocol of LoRa is a pure ALOHA protocol which is prone to collisions at high density. In contrast, the proposed MAC algorithm provides a paradigm shift in methodology to not only address the low throughput and high probability of collisions, but also maintain the low cost, and long life benefit to IIoT devices. The new MAC protocol is presented in this thesis along with empirical evidence to showcase the improvement over the existing LoRaWAN standard. The added benefit is that existing hardware can still be utilized which results in a low cost solution. Also, appropriate modifications of relevant parameters as well as the inclusion of timing corrections steps in the ACK packets provide a very unique approach in addressing the deficiencies of the LoRaWAN.</p>
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.001 | 0.001 |
| 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".