TY - JOUR
T1 - A graph-based fault-tolerant approach to modeling QoS for IoT-based surveillance applications
AU - Thomas, Diya
AU - Orgun, Mehmet
AU - Hitchens, Michael
AU - Shankaran, Rajan
AU - Mukhopadhyay, Subhas Chandra
AU - Ni, Wei
PY - 2021/3/1
Y1 - 2021/3/1
N2 - Node scheduling provides an effective way to prolong the network lifetime of Internet-of-Things (IoT) networks comprising of energy-constrained sensor nodes. Barrier scheduling is a special type of node scheduling scheme that targets IoT-based surveillance applications. An efficient barrier scheduling scheme must address the key Quality-of-Service (QoS) requirements of smart surveillance applications, such as coverage, connectivity, and energy efficiency. Moreover, such a scheme must be capable of dynamically adapting its execution strategy in the event of node failures caused due to faults arising out of unexpected battery depletion. This article proposes a fault-tolerant barrier scheduling scheme that satisfies the key QoS requirements of surveillance applications in the event of such faults. The approach is based on a novel fully weighted dynamic graph model. This article suggests two novel heuristics to guarantee fault tolerance and recovery. Extensive simulation studies are conducted to evaluate and compare the performance and effectiveness of this scheme with other such approaches.
AB - Node scheduling provides an effective way to prolong the network lifetime of Internet-of-Things (IoT) networks comprising of energy-constrained sensor nodes. Barrier scheduling is a special type of node scheduling scheme that targets IoT-based surveillance applications. An efficient barrier scheduling scheme must address the key Quality-of-Service (QoS) requirements of smart surveillance applications, such as coverage, connectivity, and energy efficiency. Moreover, such a scheme must be capable of dynamically adapting its execution strategy in the event of node failures caused due to faults arising out of unexpected battery depletion. This article proposes a fault-tolerant barrier scheduling scheme that satisfies the key QoS requirements of surveillance applications in the event of such faults. The approach is based on a novel fully weighted dynamic graph model. This article suggests two novel heuristics to guarantee fault tolerance and recovery. Extensive simulation studies are conducted to evaluate and compare the performance and effectiveness of this scheme with other such approaches.
KW - Barrier scheduling
KW - fault tolerance
KW - Internet of Things (IoT)
KW - wireless sensor network
UR - http://www.scopus.com/inward/record.url?scp=85099076116&partnerID=8YFLogxK
U2 - 10.1109/JIOT.2020.3022941
DO - 10.1109/JIOT.2020.3022941
M3 - Article
AN - SCOPUS:85099076116
SN - 2327-4662
VL - 8
SP - 3587
EP - 3604
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
IS - 5
ER -