PANDA: Preference-Based Bandwidth Allocation in Fog-Enabled Internet of Underground-Mine Things

Traditionally, sensor networks are surmised to enhance safety in underground mines by providing consistent monitoring of the conditions. However, to cope with the frequent condition changes of such a hostile environment, we need a specific network architecture for the deployed nodes to enable dynami...

Full description

Saved in:
Bibliographic Details
Published in:IEEE systems journal 2021-12, Vol.15 (4), p.5144-5151
Main Authors: Misra, Sudip, Tiwari, Minu, Ojha, Tamoghna, Raj, Yash
Format: Article
Language:English
Subjects:
Bandwidth
Bandwidths
Channel allocation
Cloud computing
Computer architecture
Criticality aspects
Data criticality
Decision making
Delays
Edge computing
fog computing
Games
Internet
mines safety
Monitoring
Nodes
Safety
Stackelberg game
Underground mines
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Traditionally, sensor networks are surmised to enhance safety in underground mines by providing consistent monitoring of the conditions. However, to cope with the frequent condition changes of such a hostile environment, we need a specific network architecture for the deployed nodes to enable dynamic decision making. In this article, we argue that the fog computing paradigm can be leveraged to ensure safety in the Internet of Underground-Mine Things. We emphasize on prioritizing and speeding up the processing of sensitive data by introducing a factor named "criticality index" and ensuring the fairness of bandwidth allocation using this index to comply with the resource requirement of critical data. We formulate the interaction between the fog nodes using the notions of the Stackelberg game. Simulation-based results show that using the proposed scheme, the fog nodes are able to allocate bandwidth with less average error and offset bandwidth, compared to the benchmark schemes.
ISSN:1932-8184
1937-9234
DOI:10.1109/JSYST.2021.3086150