Name
Title | ||
|---|---|---|
A Graph-Based Fault-Tolerant Approach to Modeling QoS for IoT-Based Surveillance Applications |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/JIOT.2020.3022941 | IEEE Internet of Things Journal |
Keywords | DocType | Volume |
Barrier scheduling,fault tolerance,Internet of Things (IoT),wireless sensor network | Journal | 8 |
Issue | ISSN | Citations |
5 | 2327-4662 | 1 |
PageRank | References | Authors |
0.35 | 21 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Quan Z. Sheng | 1 | 3520 | 301.77 |
| Mehmet A. Orgun | 2 | 1366 | 155.15 |
| Michael Hitchens | 3 | 428 | 50.41 |
| Rajan Shankaran | 4 | 113 | 15.86 |
| S. C. Mukhopadhyay | 5 | 270 | 45.51 |
| Wei Ni | 6 | 474 | 70.16 |