A graph-based fault-tolerant approach to modeling QoS for IoT-based surveillance applications

Diya Thomas*, Mehmet Orgun, Michael Hitchens, Rajan Shankaran, Subhas Chandra Mukhopadhyay, Wei Ni

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)
10 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)3587-3604
Number of pages18
JournalIEEE Internet of Things Journal
Issue number5
Publication statusPublished - 1 Mar 2021


  • Barrier scheduling
  • fault tolerance
  • Internet of Things (IoT)
  • wireless sensor network


Dive into the research topics of 'A graph-based fault-tolerant approach to modeling QoS for IoT-based surveillance applications'. Together they form a unique fingerprint.

Cite this