Abstract

The sensor-cloud system (SCS) integrates sensors, sensor networks, and cloud for managing sensors, collecting and processing data, and decision-making based on data processed. Though the SCS has received tremendous attention from both academia and industry because of its numerous exciting applications, it still faces the challenge in reliability. The reliability of an SCS is generally referred to as the ability to perform required functions for a given period of time. This work is focused on the $K$ -terminal reliability of an SCS, which is concerned with the successful communication between all pairs of network nodes belonging to a pre-specified subset $K$ . The increased complexity and scale of real-life SCSs require new efficient techniques to evaluate their $K$ -terminal reliability. In this work we make novel contributions by proposing a network simplification method that can effectively remove all redundant network edges and vertices, leading to a significantly reduced network model for accurate and efficient $K$ -terminal reliability analysis. The method is based on graph decomposition and reconstruction through articulation vertices. Empirical studies show that the proposed simplification method integrated with the binary-decision-diagrams based evaluation algorithm can significantly speed up $K$ -terminal reliability analysis of large real-life SCSs.

Highlights

  • The sensor-cloud system (SCS) integrates sensors, sensor networks, and cloud for managing sensors, collecting and processing data, and subsequent decision-making [1], [2]

  • In this article, we focus on this line of research and make novel contributions by proposing a comprehensive network simplification method

  • The method is based on graph decomposition and reconstruction through articulation vertices and has polynomial time complexity

Read more

Summary

INTRODUCTION

The sensor-cloud system (SCS) integrates sensors, sensor networks, and cloud for managing sensors, collecting and processing data, and subsequent decision-making [1], [2]. In the last few decades, binary decision diagrams (BDD), an extraordinarily efficient method to represent and manipulate Boolean functions [18], [19], [36], have been exploited to model different classes of systems, such as multi-state systems [20], [21], dynamic systems [22], [37], phased-mission systems [23], [24], [38], IoT systems and networks [39], [40], wireless sensor networks [41], [42], and online social networks [43] Among these efforts, BDD-based approaches for VOLUME 8, 2020 reliability analysis of large-scale networks were proposed in [25]–[29].

BACKGROUND
K-TERMINAL RELIABILITY
APPLICATION
BENCHMARK SCS TWO
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.