 Research
 Open Access
A comprehensive wireless sensor network reliability metric for critical Internet of Things applications
 Dina Deif^{1}View ORCID ID profile and
 Yasser Gadallah^{1}Email author
https://doi.org/10.1186/s1363801709303
© The Author(s). 2017
 Received: 24 January 2017
 Accepted: 31 July 2017
 Published: 29 August 2017
Abstract
Evaluating the reliability of a wireless sensor network (WSN) deployment is a highly important task especially when the WSN is used for a critical Internet of Things (IoT) application. In this paper, we introduce a novel comprehensive reliability metric to evaluate the reliability of WSN deployments over their intended mission time. Unlike the existing studies on the topic, the proposed metric takes into account that sensor nodes (SNs) are multicomponent systems that are subject to different component failures, namely, sensor, transceiver, processor, and battery failures. Consequently, SNs are modeled as threemode (on, relay, and off) systems instead of the simplistic twomode (on and off) model adopted in the existing studies. To calculate the proposed reliability metric in a computationally efficient manner, we develop a search algorithm which generates the complete path set of the given WSN deployment. Extensive experimental results demonstrate the use of the proposed metric in evaluating the reliability of several WSN deployments under different operating conditions. Results also demonstrate the computational efficiency of the developed search algorithm used for calculating the proposed metric and the significant effect of using the proposed threemode SN model on the accuracy of the evaluated reliability.
Keywords
 Wireless sensor networks
 Reliability
 Fault tolerance
 Internet of Things
 Probability of failure
 Combinatorics
1 Introduction
In recent years, wireless sensor networks (WSNs) have become a versatile technology for serving a multitude of applications that include residential, industrial, commercial, healthcare, and military applications. As such, WSNs are considered one of the enabling technologies for realizing the Internet of Things (IoT) concept where they play the pivotal role of detecting events and measuring physical and environmental phenomena of interest [1]. Many of the important IoT applications served by WSNs are characterized by being missioncritical, meaning that the failure of the WSN to detect the occurrence of an event or a phenomenon in the targeted region of interest (RoI) will have serious implications [2]. Hence, it is imperative that the WSN functions properly throughout its intended mission time. This poses stringent reliability requirements on the WSN that must be addressed in the design and deployment phase of the network.
The first step in designing a reliable WSN is to be able to evaluate the reliability of a given WSN deployment. The reliability of any multicomponent system is formally defined as the “probability that a system will perform satisfactorily during its mission time when used under the stated conditions” [3]. The method by which the reliability of a specific system is evaluated varies according to the type(s) of components the system is composed of, the configuration of the system in terms of how these components are connected to each other, and the state(s) at which the system is defined to have failed. Ultimately, the reliability of the system is a function of the reliability measures of its components and evaluating the reliability of the system as a whole is a probability modeling problem.
In that context, a WSN can be viewed as a multicomponent system in which the components are the sensor nodes (SNs) and the sink node(s). The mission time for a WSN can either be its intended lifetime or the maximum time interval between scheduled maintenance operations. Hence, the WSN mission time is applicationdependent and can vary greatly, ranging from a few days to a few years. If the WSN is composed of different types of SNs with different coverage profiles and capabilities, the WSN is said to be heterogeneous. The configuration of the WSN is determined by the way the SNs are deployed in the targeted RoI and the resulting wireless connectivity among them.
In order to identify the states at which a given WSN deployment fails, the functionality of a WSN must first be defined. The functionality of a WSN can be divided into two major elements. The first element is the sensing functionality, which is the ability of a WSN to detect all the targets or phenomena that occur inside the boundaries of the RoI during its mission time. Hence, for a WSN to be functional in terms of sensing, it must provide full coverage for the RoI area (in case of area coverage) or all the targeted locations in the RoI (in case of point coverage) during its mission time. The second element of the WSN functionality is the connectivity functionality, which is the ability of the WSN to deliver sensed data from its sources (i.e., SNs) to the designated destination (i.e., sink node(s)) during its mission time. Hence, for a WSN to be functional in terms of connectivity, any target or a phenomenon detected by one or more SNs has to be recognized at the sink node(s) through multihop wireless communication throughout the WSN mission time. Based on this definition of WSN functionality, a WSN is said to have failed if either of its sensing or connectivity functionality elements fail [4].

SN power failure: the majority of the industrial and commercial SNs currently available in the market are batterypowered. Current advances in the fabrication of batteries have recently introduced highly durable batteries for SNs that can last for years (e.g., lithium thionyl chloride batteries (http://www.tadiranbatteries.de/eng/products/lithiumthionylchloridebatteries/overview.asp)) under certain conditions. Although these batteries can sustain the operation of the SNs for long periods of time, premature battery failures can still occur in practice. This can be attributed to a myriad of reasons such as the deployment of the SNs in harsh environmental conditions (e.g., extreme temperatures or rain), incorrect handling or random failure caused by defective hardware (https://www.omnisense.com/oms_cds/media/008002002%20OmniSense%20FMS%20Sensor%20Battery%20Life.pdf).

SN hardware failures: SNs are subject to random hardware failures. This is attributed to two main reasons. The first one is that most commercial SNs are costsensitive, meaning that they are not always built of the highest quality components. The second reason is that SNs are often subjected to harsh environmental conditions which can affect the normal operation of its components [6].

SN software failures: SNs are prone to random permanent software failures which can render them inactive, i.e., unable to sense or communicate.
On the other hand, nonSNrelated issues are factors that are external to the deployed SNs such as wireless link failures (due to fading and external interference) and excessive packet collisions (i.e., internal interference in WSNs adopting contentionbased medium access control). The effect of these issues on the overall network reliability is in general difficult to predict. The authors in [7] present a thorough study on the effects of nonSNrelated factors on the quality of wireless links in a WSN and show the complex and highly transient nature of these effects. Furthermore, the effects of the nonSN related issues on the WSN reliability are usually mitigated using measures such acknowledgements and retransmissions [8].
In this paper, we derive a comprehensive WSN reliability metric, which considers the different SNrelated reliability issues, using a combinatorial approach. We adopt the general assumptions that the WSN is heterogeneous and has an arbitrary deployment configuration (e.g., clustered or flat configuration). The functionality of the WSN is defined in terms of both network coverage and connectivity of the SNs to the sink node(s). We assume that the SNs are subject to four types of failures during the WSN mission time, namely, sensor failure, transceiver failure, processor failure, and power failure. Consequently, SNs are modeled as systems which have three modes of operation, namely, on, relay, and off. To calculate the proposed reliability metric in a computationally efficient manner, we develop a search algorithm which generates the complete paths set of the given WSN deployment.
The rest of this paper is organized as follows. In Section 2, we summarize the existing work on WSN reliability and highlight the contribution of this paper. In Section 3, we briefly discuss some of the fundamental reliability concepts which we will be using throughout this paper. The assumptions and derivation of the proposed reliability metric are presented in Section 4. In Section 5, we present the developed search algorithm which is used to evaluate the reliability of WSN deployments based on the proposed metric. Section 6 presents the experimental results obtained from applying the proposed metric to case study surveillance WSN deployments. Finally, the paper is concluded in Section 7.
2 Related work on wireless sensor network reliability
Several studies have addressed the issue of evaluating or estimating the reliability of WSNs. In this section, we review the most significant of these studies and discuss their scope and limitations. Based on this discussion, we highlight the scope and contribution of the reliability metric proposed in this paper. We classify the existing studies on WSN reliability into two major tracks. The first track focuses on evaluating the reliability of a specific aspect of WSN functionality (such as packet transmission reliability) and/or to evaluate the reliability for one or more parts of the WSN (such as a single cluster in a clusterbased deployment). The studies which belong to the first track may or may not assume that SNs are subject to random failures and battery energy depletion. On the other hand, the second track focuses on evaluating the reliability of a WSN as a whole, either as a function of time or as a probability over a given network mission time, assuming that SNs are subject to random failures. Studies which belong to the second track define WSN functionality in terms of coverage and/or connectivity and assume that SNs are modeled as a twomode device (either on or off) and have a given probability of failure during the mission time of the network.
We begin by reviewing studies which belong to the first track. The studies in [9] and [10] address the problem of evaluating the reliability of SN clusters in WSNs characterized by clusterbased deployments subject to random SN failures. In both studies, the authors assume that the SN clusters are nonoverlapping and that each cluster has a designated cluster head which acts as a relay between the SNs in the cluster and the sink node. In [9], the authors define the reliability of a cluster as the probability of successful message delivery between the sink node and the cluster head. The authors in [10] define the reliability of the WSN as the probability that the geographical area of each cluster in the WSN is fully covered by its SNs and that the cluster head has at least one functional direct or multihop wireless path to the sink node. Based on this definition, they derive an expression for the reliability of each individual cluster and use a Monte Carlo (MC) simulation approach to estimate it. The main limitation of the studies in [9] and [10] is that the reliability of the WSN as a whole in terms of the reliability of its constituent clusters is not evaluated. In addition, the proposed definitions of reliability cannot be extended to WSNs with different deployment configurations such as flat deployments which are nonhierarchical.
In [11], the authors propose a model for evaluating the reliability of disjoint areas in a WSN subject to two types of failure events, namely, SN failures due to battery depletion and link failures. Their proposed approach depends on dividing the targeted RoI into disjoint areas or target regions. For each region, a reliability model is constructed using a reliability block diagram (RBD) [3], which depends on the number of SNs monitoring the target region, their relative location from the sink node, and the routing protocol used in the network. There are two drawbacks of the proposed reliability modeling proposed in [11]. The first drawback is that the model does not provide a method by which the reliability of the entire WSN deployment can be evaluated in terms of the reliability of its regions. The second drawback is that the reliability modeling is carried out under the assumption that the probabilities of link failures are known and are constant throughout the lifetime of the WSN. This assumption is unrealistic since link quality is affected by numerous factors such as multipath effects, shadowing (due to static and mobile obstacles), and interference. The effect of these factors on link quality varies significantly and rapidly in time and space [7] and hence, unlike SNrelated factors, cannot be reduced to a constant probability of failure throughout WSN mission time. In [12], the authors consider the problem of evaluating the transmission reliability of clusterbased and meshbased WSN deployments. They define transmission reliability as the ratio of the packets received by a destination node to the whole packets generated by the transmission for a given period of time. They present transmission reliability evaluation models for the uplink and downlink traffic based on the assumptions that SNs are not subject to any hardware failures and that SNs only fail when their initial battery energy is exhausted. Although the timedependent models presented in [12] can help assess the transmission reliability over time for a given routing strategy, they are limited by the assumption that SNs cannot fail due to random hardware failures unrelated to battery exhaustion. Also, it is not possible to use the study in [12] to calculate or estimate the reliability of the WSN over a given mission time since coverage functionality is not considered.
The study in [13] considers the problem of evaluating the reliability of the sink node decisions in WSNs targeted for intrusion detection applications. The authors model the detection mechanism of the sink node of an intrusion, based on the aggregated data from several SNs in the network, as a weighted voting system (WVS). They assume that both the SNs and the wireless links between the SNs and the sink node have known misdetection probabilities. Based on these assumptions, they derive the reliability of the sink’s WVS using the universal generating function (UGF) method. Similar to the study in [12], the scope of the study in [13] does not include evaluating the reliability of the WSN as a whole over a given mission time, since it is restricted to evaluating the reliability of detecting a single target/phenomena based on a fraction of the SNs in the WSN.
On the other hand, the studies in [14, 15] belong to the second track since they address the reliability of SN systems or WSNs as a whole of nonhierarchical deployment configurations subject to random SN failures. In [14], the authors address the problem of evaluating the reliability of WSNs designed for industrial inventory management. They assume that for the purposes of this specific application, the data collected by each SN are stored redundantly on several other SNs to account for random SN failures. Accordingly, the WSN is deemed functional as long as there is a sufficient number of functional SNs that are both connected to each other and to the sink node. Based on this definition of network functionality and the assumption that the WSN deployment is homogeneous, the reliability evaluation problem is reduced to the famous KoutofN reliability problem (http://www.reliabilityanalytics.com/blog/2011/09/02/reliabilitymodelingkoutofnconfigutation/). The authors also present a Monte Carlo (MC) simulation approach similar to that proposed in [10] to estimate the reliability of the WSN at hand. However, the reliability evaluation and estimation approaches proposed in [14] are based on a very restrictive definition of network functionality. Consequently, they cannot be applied to other WSN applications (e.g., surveillance and monitoring applications) where the functionality of the network is dependent not only on the number of SNs connected to the sink node but also on the network coverage. Also, the proposed approaches do not support network heterogeneity which is a major limitation since realworld deployments are often heterogeneous.
The authors in [16] propose a reliability metric for SN systems designed for surveillance purposes subject to random SN failures. They assume an arbitrary deployment configuration where SNs can monitor multiple target locations in the RoI and that each target location can be monitored by multiple SNs. They also assume that the surveillance SN system can be heterogeneous. The reliability of the system is defined as the probability that all target locations are monitored by at least one SN. The authors use a combinatorial approach to formulate the proposed reliability metric and present a search algorithm to calculate the proposed reliability metric in a timeefficient manner. The main limitation of the proposed metric is that system functionality is assumed to be in terms of the degree of target locations coverage only. Connectivity between SNs to form a wireless network is not considered.
The study in [17] propose a method for evaluating the reliability of WSNs designed for industrial IoT applications based on the automatic generation of fault trees (FTs). The proposed method requires the network failure conditions as inputs to enable the generation of the corresponding network FT and compute the network reliability. A network failure condition is defined as a combination of SNs which if fail will lead to the failure of the WSN in terms of network coverage only and not connectivity to the sink. To address the connectivity part of the network functionality, the authors propose a depthfirst search algorithm that finds all the paths between SNs belonging to the network failure conditions and the sink node. The study in [17] is extended in [15] by assuming that the WSN is also subject to permanent wireless link failures in addition to SN failures under the same assumptions adopted in [17]. In both studies, the authors in [17] and [15] did not address the computational efficiency of their approach.
In this study, we focus on the second track, i.e., on the problem of evaluating the reliability of the WSN a whole, defined as the probability that the WSN is functional during a given mission time, assuming that SNs are subject to random permanent failures. Based on the above discussion, existing studies in that track all assume that SNs have only two modes of operation, either on or off. If an SN is on, it is assumed to be functional in terms of both sensing its surrounding environment and communicating wirelessly with its neighbors. If it is off, then the SN has failed permanently due to one or more of the SNrelated reliability issues outlined in Section 1. This representation is not accurate since most commercial SNs are composed of multiple independent chips that carry out different functions, with each having its own probability of failure during the network’s mission time.
A more accurate model considers the SN as a multicomponent system [18]. Based on this model, an SN has three modes of operation. These modes of operation are on, relay, and off. The definitions of the on and off modes are the same as discussed above, while the relay mode occurs when the SN is unable to perform its sensory function but it is still able to communicate wirelessly with its neighbors. This mode of operation occurs when the SN’s sensor(s) hardware fails while its transceiver, processor, and battery are in working condition. Adopting this SN model has two main advantages. The first one is that it provides a more accurate evaluation of WSN reliability, assuming that the network functionality is adequately defined in terms of both network coverage and connectivity. The addition of the relay mode to the SN model provides a more accurate evaluation of WSN reliability because it avoids the underevaluation of the WSN reliability when the conventional twomode SN model is used. Underevaluation of the reliability of the network becomes an issue when the reliability is used as a requirement/constraint for WSN deployment. In that case, the network designer aims to deploy sufficient SNs to achieve a minimum level of network reliability while minimizing the number of deployed SNs, i.e., minimizing the deployment cost. In that case, underevaluating the reliability of a given deployment can lead to an unnecessary increase in the deployment cost. The second advantage is that it enables the network designer to isolate the effect of the quality (i.e., reliability) of the individual components of the deployed SNs (i.e., sensor, transceiver, processor and power unit) on the overall reliability of the WSN. This is discussed in more details in Section 4.1.

Network functionality is defined in terms of both network coverage of a predefined set of target locations in the RoI and connectivity to the designated sink node.

No specific network deployment configuration is assumed in the proposed model. We assume an arbitrary deployment configuration where each deployed SN may monitor multiple target locations in the RoI and each target location may be monitored by multiple SNs. All SNs can communicate wirelessly with their neighbors, i.e., no imposed communication hierarchy.

The WSN can be heterogeneous; it can consist of more than one type of SNs, each characterized by a different coverage profile and set of capabilities.

A more realistic SN model is adopted in the derivation of the proposed metric where an SN has three modes of operation instead of the twomode model used in the existing studies.

Each SN type is characterized by four different probabilities of failure during the mission time of the network (namely, sensor, transceiver, processor, and battery probabilities of failure) instead of a single SN probability of failure, as it is the case in the existing studies.

A search algorithm is developed to calculate the propose reliability metric in a computationally efficient manner.
In this study, we assume that wireless links between SNs are not subject failure. This assumption is justified as follows. Wireless link quality is affected by numerous factors such as multipath effects, shadowing (due to static and mobile obstacles), and interference. The effect of these factors on link quality varies significantly and rapidly in time and space [7] and hence, unlike SNrelated factors, cannot be reduced to a constant probability of failure throughout WSN mission time. On the other hand, permanent wireless link failures are mainly due to a complete failure (i.e., a failure in the transceiver, processor, or battery) in one or both SNs at the ends of the link [19]. In the proposed metric in this paper, this type of failure is taken into consideration since we assume that each of the main SN components are subject to failure with a given probability of failure during the WSN mission time.
3 Fundamental reliability concepts
In this section, we discuss some of the fundamental definitions and concepts related to the evaluation of multicomponent systems’ reliability which we will be using throughout this paper.
3.1 Component reliability function and component reliability
The main objective of reliability modeling is to express the reliability of a given system in terms of the reliability measures of its constituent components. There are two main reliability measures for any device or component. The first measure is the reliability function R _{ c }(t), which is used to estimate the probability that the device or component will continue to function beyond a time duration of length t [3]. The second reliability measure is based on the fact that for most practical purposes, a device or component is only required to function during the specified mission time T _{ m } of the system it belongs to. In this case, the reliability function R _{ c }(t) can be substituted by the reliability of the device. The reliability of a device, R _{ c }, is simply defined as the probability that the device will continue to function throughout the mission time of the system. Accordingly, the probability of failure of the device during T _{ m } is equal to 1 − R _{ c }(T _{ m }) = 1 − R _{ c } [3].
where α is the estimated failure rate of the component per unit of measurement (e.g., hour, year, cycle) and is equal to the reciprocal of its mean time to fail (MTTF). From the reliability curves in Fig. 1, we can estimate the reliability at t = 5000 h for α = 1/4000 (i.e., for MTTF = 4000) to be 0.287. This in turn means that there is a 1 − 0.287 = 0.713 chance that the component will fail during this time interval, i.e., the probability of failure during this time interval is 0.713.
Although the exponential reliability function is commonly used in reliability engineering due to its simplicity, it usually leads to inaccurate estimations of the probabilities of failures. This is because this type of function is based on the assumption that the component has a constant failure rate, which means that its performance does not degrade with time. To obtain a more accurate model for the reliability function of a given electronic device, reliability engineers carry out rigorous reliability testing techniques and/or gather empirical data on the device in service [3]. For example, qualitative and quantitative accelerated reliability testing is used to identify probable hardware failures of SNs and estimate the probability of their occurrence [5].
3.2 Combinatorial approach to system reliability evaluation
To calculate R(S) using (4), the conditions necessary for S to be functional must be defined and the probability of any system state must be evaluated in terms of the reliabilities (or probabilities of failure) of the system’s components, assuming that the system has a specified mission time T _{ m }. Theoretically, f(π) must be evaluated for all the possible system states π ∈ Π to calculate R(S) using this approach. However, following this extensive method in reliability calculation poses a computational problem for systems of a practical scale. For example, a system composed of 30 components which fail independently has 2^{30} states. Therefore, a tremendous amount of time is required to calculate R(S) which grows exponentially with the number of components in the system. This computational problem is mitigated by the use of more efficient methods (e.g., reliability block diagram (RBD), fault tree (FT), and search algorithms) that attempt to find all the system’s path sets or cut sets [20].
where Π _{1} is the set of all the paths of S (i.e., the complete paths set of S ) and Π _{0} is the corresponding set containing all the cuts of S (i.e., the complete cuts set of S) such that Π _{1} ∪ Π _{0} = Π . For example, a simple system of n components connected in series has only one path set which is equal to the system set S = {1, 2, …., n} and has \( \sum_{k=1}^n{C}_k^n \) cut sets. Therefore, it is simpler to express its reliability as R(S _{series}) = Prob(π = {π _{ i } = 1, ∀i = 1 , … , n}) \( ={\prod}_{i=1}^n{R}_i \) , where R _{ i } is the reliability of the i ^{th} component during the system’s mission time. On the other hand, a system of n components connected in parallel has only one cut set which is equal to S and has \( \sum_{k=1}^n{C}_k^n \) path sets. Hence, the system’s reliability can be expressed as\( \kern0.5em R\left({\boldsymbol{S}}_{\mathrm{parallel}}\right)=1\mathrm{Prob}\left(\boldsymbol{\pi} =\left\{{\pi}_i=0,\forall i=1,\dots, n\right\}\right)=1{\prod}_{i=1}^n\left(1{R}_i\right) \) .
4 Reliability of wireless sensor networks
In this section, we use the combinatorial approach outlined in Section 3 to derive the reliability of a WSN with an arbitrary deployment configuration. We start by modeling the SN as a multicomponent system and identifying its different states and modes of operation. Then, we present the WSN model and define the conditions required for the WSN to be deemed in working condition. Finally, we derive the reliability of the WSN in terms of its structure function and the probabilities of failure of its constituent SNs’ hardware components.
4.1 Sensor node model
Although SNs vary greatly in terms of their capabilities (e.g., processing power, battery capacity), there are four fundamental chips or components that are common in all SNs [22]: a sensing unit(s) or simply sensor(s), a radio unit or transceiver, a processing and memory unit or processor, and a power unit or battery. The sensor is responsible for the translation of physical phenomena detected/measured in the RoI to electrical signals. The transceiver enables the SN to communicate wirelessly with its neighboring SNs and with the sink node. The processor is responsible for performing all required computations and controlling both the sensor and transceiver. The battery supplies all three components with power. The type and capacity of the SN battery is carefully chosen according to the application and the required mission time of the WSN (http://www.sensorsmag.com/components/apracticalguidetobatterytechnologiesforwirelesssensornetworking).
Each of these components is subject to random failure [6], [23] due to several reasons such as faulty hardware, faulty software, harsh environmental conditions, and degradation with time. Accordingly, each of the SN’s four main components has a given reliability or, alternatively, a probability of failure during the WSN mission time T _{ m } as defined in Section 3.1. As mentioned earlier in Section 3, the reliabilities of the different components of an SN can be estimated through a standard reliability prediction test provided by the SN vendor or through reliability testing techniques [5].
Since each of the four components can either function or fail, i.e., be in an on or off state, an SN can theoretically have 2^{4} possible states. To describe these states, let the binary variables x _{ s } , x _{ t } , x _{ p }, and x _{ b } be the state indicators of the sensor, transceiver, processor, and battery, respectively, of an SN as defined in (2). Hence, an SN state x is described using a tuple of these four variables {x _{ s } , x _{ t } , x _{ p } , x _{ b }}. These variables are not statistically independent; the sensor and transceiver cannot possibly function if either the processor or the battery fails. Therefore, some of the SN states are practically impossible, and hence, their probability of occurrence is zero.
To calculate the probability of occurrence of the other possible states, let λ _{ s }, λ _{ t } , λ _{ p }, and λ _{ b } be the probabilities of failure of the sensor, transceiver, processor, and battery, respectively. It should be noted that the estimated probability of failure for any given device or hardware component is obtained regardless of the failure of any other device or component. Hence, λ _{ s } and λ _{ t } are actually the probability of failure of the sensor and transceiver conditioned on the event that the component is properly controlled (i.e., processor is functional) and powered (i.e., battery is functional). Similarly, λ _{ p } is the probability of failure of the processor conditioned on the event that the battery is functional, where as λ _{ b } is the unconditional probability that the SN power unit or battery fails during T _{ m }. According to the above definitions, the probability of an SN state can be given by the following equations:
4.2 Wireless sensor network model
 1.
Each target point t _{ j } for j = 1 , … , m is covered by at least one SN with an uncompromised sensing capability, i.e., an SN in the on state. Let the set Y _{ j } be the set of SNs in the on state that monitor t _{ j }. Then this condition can be expressed as,  Y _{ j }  ≠ 0 , ∀ j = 1 , … . , m where . denotes the size of a set.
 2.
Within each Y _{ j } , there is at least one SN that has at least one functional path to the sink node. This implies that SNs along that path, including the source SN, have uncompromised communication capabilities, i.e., in either the on or the relay state. Hence, the events detected at any t _{ j } can be relayed back to the sink node. Let the set Z _{ j } be the set of SNs which belong to Y _{ j } that are connected to the sink node. Hence, Z _{ j } ⊆ Y _{ j }. The condition can be expressed as  Z _{ j }  ≠ 0 , ∀ j = 1 , … . , m.
In the next subsection, we will use the above definition of WSN functionality conditions in defining the structure function of the WSN, which we defined in Section 3.2.
4.3 Wireless sensor network reliability metric derivation
Evaluation of the probability of the corresponding individual SN states for a given WSN state=X _{ s } , X _{ t } , X _{ p } , X _{ b }}, where “true” and “false” are denoted by 1 and 0, respectively, and \( {\lambda}_s^i, \) \( {\lambda}_t^i, \) \( {\lambda}_p^i \), \( {\lambda}_b^i \) are the probabilities of failure of the four main components of SN s _{ i }
s _{ i } ∈ X _{ s }  s _{ i } ∈ X _{ t }  s _{ i } ∈ X _{ p }  s _{ i } ∈ X _{ b }  Prob( x _{ i }(π)) 

0  0  0  0  (1 − \( {\lambda}_s^i \)) (1 − \( {\lambda}_t^i \)) (1 − \( {\lambda}_p^i \)) (1 − \( {\lambda}_b^i \)) 
0  0  0  1  0 
0  0  1  0  0 
0  0  1  1  0 
0  1  0  0  (1 − \( {\lambda}_s^i \)) \( {\lambda}_t^i \) (1 − \( {\lambda}_p^i \)) (1 − \( {\lambda}_b^i \)) 
0  1  0  1  0 
0  1  1  0  0 
0  1  1  1  0 
1  0  0  0  \( {\lambda}_s^i \) (1 − \( {\lambda}_t^i \)) (1 − \( {\lambda}_p^i \)) (1 − \( {\lambda}_b^i \)) 
1  0  0  1  0 
1  0  1  0  0 
1  0  1  1  0 
1  1  0  0  \( {\lambda}_s^i{\lambda}_t^i \) (1 − \( {\lambda}_p^i \)) (1 − \( {\lambda}_b^i \)) 
1  1  0  1  0 
1  1  1  0  \( {\lambda}_p^i \) (1 − \( {\lambda}_b^i \)) 
1  1  1  1  \( {\lambda}_b^i \) 
Equation (11) states that the reliability of the WSN is the summation of all the probabilities of the WSN states that have a structure function value of unity (i.e., the probabilities of all the paths of the WSN S). Depending on the set of failed components in the state π, the individual probabilities Prob(x _{ i }(π)) , i = 1 , …N can be calculated using Table 1.
5 Reliability metric calculation

The majority of the network states have null probabilities, and hence, they do not contribute to the value of R(S). This stems from the fact the majority of the individual SN states also have a null probability (i.e., are not practically possible) as shown in Table 1.

The WSN S has the property of being a monotone/coherent system [21]. This property implies the following. If the failure of a set of SNs’ components causes S to fail, then the failure of any set which contains this set will also cause S to fail. For example, if we assume that the SNs s _{1} and s _{2} in the WSN depicted in Fig. 3a are both in the off mode while the remaining SNs are in the on mode, then it can be readily observed that this would cause S to fail since any phenomenon at target point t _{1} cannot be detected or communicated to the sink node. This means that network states corresponding to this situation have a structure function value of zero as expressed in (10). Using the monotone property, we can say that the network states that include the SNs s _{1} and s _{2} being in the off mode and s _{4} being in the relay mode would also have a structure function value of zero without actually evaluating the function.
Pseudocode for the proposed algorithm for calculating the reliability of a WSN S
Step  Algorithm for computing WSN reliability R(S) 

1.a.  Set all parameters (S = {s _{ i }}, T = {t _{ j }}, types of SNs, sink location, \( {\lambda}_s^i \), \( {\lambda}_t^i \), \( {\lambda}_p^i \) and \( {\lambda}_b^i \) for i = 1 , … , n and j = 1 , … , m) 
1.b.  Initialize R =Prob(π s _{ i } ∈ S is in on mode ∀i = 1 , … , n) 
1.c.  Initialize Π _{1} = {(π s _{ i } ∈ S is in on mode ∀i = 1 , … , n)} 
2.a.  Let k be the number of SNs in relay mode. Initialize k = 1. 
2.b.  Let \( {\mathcal{F}}_r^k \) be a k−combination of SNs in relay mode. Let \( {\boldsymbol{F}}_r^k \) be the set of k−combinations of SNs in relay mode that S can tolerate. Initialize\( \kern0.5em {\mathcal{F}}_r^k={\boldsymbol{F}}_r^k=\left\{\phi \right\} \). 
2.c.  For i = 1 , … , n 
 Let s _{ i } be in relay mode, i.e. \( {\mathcal{F}}_r^k=\left\{{s}_i\right\} \)  
 Evaluate\( f\left(\boldsymbol{\pi} \ {\mathcal{F}}_r^k\right) \) using (10)  If \( f\left(\boldsymbol{\pi} \ {\mathcal{F}}_r^k\right)=1\to {\boldsymbol{F}}_r^k={\boldsymbol{F}}_r^k\cup {\mathcal{F}}_r^k \)  
End For loop  
2.d.  While \( {\boldsymbol{F}}_r^k\ne \left\{\phi \right\}\kern1em \to \kern0.75em k=k+1 \), Let \( {F}_{rl}^{k1}\in {\boldsymbol{F}}_r^{k1}, \) \( \kern0.5em {\mathcal{F}}_r^k={\boldsymbol{F}}_r^k=\left\{\phi \right\} \) 
2.e.  For \( l=1,\dots, \left\ {\boldsymbol{F}}_r^{k1}\right \) and i = 1 , … , n 
 Let \( {\mathcal{F}}_{\mathrm{r}}^{\mathrm{k}}=\left\{\ {F}_{rl}^{k1},{s}_i\kern0.5em \right\} \)  Evaluate\( \mathrm{f}\left(\uppi \ {\mathcal{F}}_{\mathrm{r}}^{\mathrm{k}}\right) \) using (10)  
 If \( f\left(\pi \ {\mathcal{F}}_r^k\right)=1\to {\boldsymbol{F}}_r^k={\boldsymbol{F}}_r^k\cup {\mathcal{F}}_r^k \)  
2.f.  End For loops, End While loop 
3.a.  Let k be the number of SNs in off mode. Initialize k = 1. 
3.b.  Let \( {\mathcal{F}}_o^k \) be a k−combination of SNs in off mode. Let \( {\boldsymbol{F}}_o^k \) be the set of k−combinations of SNs in off mode that S can tolerate. Initialize\( \kern0.50em {\mathcal{F}}_o^k={\boldsymbol{F}}_o^k=\left\{\phi \right\} \). 
3.c.  Repeat step 2.c. for off mode, i.e. \( {\mathcal{F}}_o^k=\left\{{s}_i\right\} \) 
3.d.  While \( {\boldsymbol{F}}_o^k\ne \left\{\phi \right\}\kern1em \to \kern0.75em k=k+1 \), Let \( {F}_{ol}^{k1}\in {\boldsymbol{F}}_o^{k1}, \) \( \kern0.5em {\mathcal{F}}_o^k={\boldsymbol{F}}_o^k=\left\{\phi \right\} \) 
3.e.  Repeat 2.e. using \( {F}_{ol}^{k1} \) and\( {\mathcal{F}}_o^k \) to get \( {\boldsymbol{F}}_o^k \) 
3.f.  End For loops, End While loop 
4.a.  Let ℱ _{ r } and ℱ _{ o } be a combination of SNs in relay and off modes respectively. Let F _{ r } and F _{ o } be the sets of all combinations of SNs of in relay and off mode that that S can tolerate respectively. Let \( {F}_{rl_r}\in {\boldsymbol{F}}_r \) and \( {F}_{ol_o}\in {\boldsymbol{F}}_o \) 
4.b.  For l _{ r } = 1 , … , F _{ r } and l _{ o } = 1 , … , F _{ o } 
 Let \( {\mathcal{F}}_r={F}_{rl_r} \) and \( {\mathcal{F}}_o={F}_{ol_o} \)  Evaluate f(π ℱ _{ r }, ℱ _{ o } ) using (10)  
 If f(π ℱ _{r}, ℱ _{o} ) = 1→ Π _{1} = Π _{1} ∪ π  
End For loops  
5.a.  Let π _{ l } ∈ Π _{1} 
5.b.  For l = 1 , … , Π _{1} 
 R(S) = R(S) + Prob(π _{ l })  
End For loop  
6.  Output: R(S) 
Whether any other given state π is a path of the network or not (i.e., whether f(π) = 1 or 0) depends on the WSN configuration/topology. To evaluate f(π), the two conditions of WSN functionality, namely, coverage and connectivity, are checked according to the same definitions and order presented in Section 4.2. Checking the WSN coverage is straightforward and has the computational complexity of O(n ^{∗} m). If one or more of the target points in the RoI is uncovered, then f(π) = 0 and the connectivity condition does not need to be checked. Checking the WSN connectivity condition is more complex computationally, and it depends on the connectivity matrix between the SNs and the sink. Constructing that matrix has the complexity O(n ^{2}). For every WSN state π, the connectivity matrix is updated according to SNs’ modes in the state π and the updated connectivity matrix is used to check the connectivity condition. We carry out this check using the FloydWarshall algorithm (https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm), which can compute the shortest paths (if one exists) between all SNs (in the on or relay mode) and the sink node with the computational complexity O(n ^{3}). If all the SNs covering any given target point do not have a path to the sink node, f(π) = 0, otherwise connectivity is intact and f(π) = 1.
In step 2, the algorithm searches for all the combinations of SNs that can be in the relay mode without compromising the functionality of S , assuming the remainder of the deployed SNs are in the on mode. These SN combinations are referred to as the “tolerable combinations of SNs in the relay mode.” This means that for the network states corresponding to these SN combinations, the structure function f(π) expressed in (10) is equal to unity. To perform the required search in step 2, we define \( {\boldsymbol{F}}_r^k \) as the set that holds the tolerable combinations of SNs in relay mode of length k starting with k = 1 as expressed in 2.a–2.c. in Table 2. For example, consider the WSN depicted in Fig. 3a. The set of single tolerable SNs in the relay mode will be given by\( \kern0.75em {\boldsymbol{F}}_r^1=\left\{\ \left\{{s}_1\right\},\left\{{s}_2\right\},\left\{{s}_3\right\},\left\{{s}_4\right\},\left\{{s}_5\right\}\ \right\} \). The algorithm then proceeds with the search for an increasing value of k as expressed in 2.d–2.f. in Table 2. For example, the combination {s _{1}, s _{3}} belongs to\( \kern0.75em {\boldsymbol{F}}_r^2 \)while {s _{1}, s _{2}} does not. This search continues until the algorithm reaches a value of k which results in an empty\( \kern0.5em {\boldsymbol{F}}_r^k \), i.e., \( {\boldsymbol{F}}_r^k=\left\{\varnothing \right\} \). The set of all tolerable combinations of different lengths of SNs in relay mode is denoted F _{ r }.
In step 3, the algorithm searches for all the combinations of SNs that can be in the off mode without compromising the functionality of S , assuming the remainder of the SNs is in the on mode, i.e. tolerable combinations of SNs in the off mode. The search follows the same procedure in step 2. We define \( \kern0.5em {\boldsymbol{F}}_o^k \) as the set that holds the tolerable combinations of SNs in the off mode of length k. Using the same example WSN in Fig. 3a,\( \kern0.5em {\boldsymbol{F}}_o^1=\left\{\ \left\{{s}_2\right\},\left\{{s}_3\right\},\left\{{s}_4\right\},\left\{{s}_5\right\}\ \right\} \). The combination {s _{4}, s _{5}} belongs to\( \kern0.75em {\boldsymbol{F}}_o^2\kern0.5em \)while {s _{2}, s _{5}} does not. The set of all tolerable combinations of different lengths of SNs in the off mode is denoted F _{ o }.
In step 4, the algorithm uses the sets F _{ r } and F _{ o } to discover all the pairs of combinations of SNs that can be in the relay and off modes simultaneously without compromising the functionality of S, assuming the remainder of the SNs is in the on mode. For example, the combination {s _{1}, s _{3}} can be in the relay mode while {s _{5}} can be in the off mode simultaneously without causing the WSN depicted in Fig. 3a to fail. Each of the discovered pairs of combinations corresponds to one or more distinct network path and hence the complete path set Π _{1} is updated accordingly as expressed in 4.b in Table 2. In step 5, the probabilities of the network paths in Π _{1} are calculated using (11) and Table 1. Finally, the reliability of the given WSN R(S) is calculated using (7) and given as an output in step 6.
6 Case study
6.1 Experimental setup
Parameters of the SN types used in the deployment of the casestudy surveillance WSN
FoV  r _{ s }  r _{ c }  λ _{ s }  λ _{ t }  λ _{ p }  λ _{ b }  Price($)  

Type 1  90^{°}  30 m  40 m  1.0 ×10^{−2}  5.0×10^{−3}  2.0×10^{−3}  1.0×10^{−3}  150 
Type 2  60^{°}  30 m  40 m  1.5×10^{−2}  5.5 ×10^{−3}  2.5×10^{−3}  1.5×10^{−3}  100 
Data of the obtained deployments for the casestudy surveillance WSN for the RoI shown in Fig. 5
Deployment no.  n  n _{1}  n _{2}  C ($)  R(S)  Π  Π_{1}  FE  FE/Π (%)  

Scenario 1 m = 15  S1D1  9  0  9  900  0.829  2^{36}  4  45  6.55 ×10^{−8} 
S1D2  10  1  9  1050  0.849  2^{40}  28  164  1.49×10^{−8}  
S1D3  11  2  9  1200  0.870  2^{44}  196  723  4.11×10^{−9}  
S1D4  12  3  9  1350  0.891  2^{48}  1.37×10^{3}  4.16×10^{3}  1.48 ×10^{−9}  
S1D5  13  4  9  1500  0.912  2^{52}  9.60×10^{3}  3.01×10^{3}  6.68×10^{−10}  
Scenario 2 m = 20  S2D1  16  3  13  1750  0.731  2^{64}  16  256  1.39×10^{−15} 
S2D2  17  4  13  1900  0.748  2^{68}  112  881  2.98×10^{−16}  
S2D3  18  4  14  2000  0.756  2^{72}  560  3.08×10^{3}  6.52×10^{−17}  
S2D4  19  5  14  2150  0.774  2^{76}  3.92×10^{3}  1.46×10^{4}  1.93×10^{−17}  
S2D5  20  6  14  2300  0.793  2^{80}  2.74×10^{4}  9.08×10^{4}  7.51×10^{−18}  
Scenario 3 m = 25  S3D1  21  1  20  2150  0.657  2^{84}  64  1.24×10^{3}  6.40×10^{−21} 
S3D2  22  2  20  2300  0.673  2^{88}  448  4.16×10^{3}  1.34×10^{−21}  
S3D3  23  3  20  2450  0.696  2^{92}  5.38×10^{3}  1.97×10^{4}  3.98×10^{−22}  
S3D4  24  4  20  2600  0.703  2^{96}  3.23×10^{4}  7.49×10^{4}  9.45 ×10^{−23}  
S3D5  25  5  20  2750  0.720  2^{100}  2.26×10^{5}  5.37×10^{5}  4.24×10^{−23}  
Scenario 4 m = 30  S4D1  25  8  17  2900  0.630  2^{100}  128  2.91×10^{3}  2.29 ×10^{−25} 
S4D2  26  6  20  2900  0.612  2^{104}  192  4.51×10^{3}  2.22×10^{−26}  
S4D3  27  6  21  3000  0.633  2^{108}  2.30×10^{3}  1.61×10^{4}  4.95×10^{−27}  
S4D4  28  7  21  3150  0.649  2^{112}  1.61×10^{4}  6.61×10^{4}  1.27×10^{−27}  
S4D5  29  8  21  3300  0.665  2^{116}  1.13×10^{5}  3.55×10^{5}  4.28×10^{−28}  
Scenario 5 m = 35  S5D1  28  4  24  3000  0.553  2^{112}  32  876  1.69×10^{−29} 
S5D2  29  6  23  3200  0.555  2^{116}  48  1.34×10^{3}  1.61×10^{−30}  
S5D3  30  7  23  3350  0.568  2^{120}  336  4.36×10^{3}  3.28×10^{−30}  
S5D4  31  8  23  3500  0.589  2^{124}  6.38×10^{3}  3.04×10^{4}  1.43×10^{−31}  
S5D5  32  9  23  3650  0.597  2^{128}  4.47×10^{4}  1.57×10^{5}  4.61×10^{−32} 
6.2 Results and discussion
To evaluate the computational efficiency of the proposed algorithm outlined in Table 2, we use the algorithm to evaluate the reliability of the WSN deployments in Table 4. For each deployment, Table 4 shows the value of the reliability R(S) , the total number of possible network states Π (which is equal to 2^{4 ∗ n }), the size of the deployment complete path set Π _{1} , the number of network structure function evaluations FE performed by the algorithm, and the value of the ratio FE/Π _{1} in percentage points. The latter ratio is used as a measure of the computational efficiency of the proposed algorithm. This is because the most computationally expensive subroutine in the algorithm is the evaluation of the network structure function expressed in (10). For each structure function evaluation, checking the two network functionality conditions, i.e., checking the network coverage of the set of target points and the connectivity to the sink, has a computational complexity of O(n ^{∗} m) and O(n ^{3}), respectively. Therefore, the computation time of the algorithm is mainly determined by the number of structure function evaluations denoted by FE.
It can be readily observed that the values of R(S), Π _{1}, and FE increase steadily with the increase of n in each deployment scenario. This behavior is expected and is attributed to the increase in the level of SN redundancy in the deployment as n increases. An increase in the level of SN redundancy translates to an exponential increase in the number of the paths of the deployment and hence the increase of the reliability R(S). It can also be observed that the number of performed structure function evaluations FE increases significantly with the increase in the level of SN redundancy as a direct result of the exponential increase in Π _{1}. However, the value of the ratio FE/Π decreases rapidly with the increase of n in each scenario. It can also be observed that the ratio Π _{1}/FE generally increases with the increase of the level of SN redundancy in each of the five tested scenarios. For example, the value of Π _{1}/FE is 27% for the deployment S3D3 and 43% for S3D4. These two observations mean that the computational efficiency of the proposed algorithm becomes more prominent with the increase of the SN redundancy level due to the efficiency of its search method for the deployment’s paths performed by the algorithm.
It is instructive to examine the two deployments S4D1 and S4D2 which are the only exception in Table 4 to the trend discussed above. Although S4D2 has more SNs than S4D1 and a larger number of paths Π _{1}, it is approximately 2% less reliable than S4D1. This can be attributed to the higher ratio of more reliable SNs of type 1 to the less reliable SNs of type 2 in the S4D1 compared to S4D2. It can also be observed that pends mainly on the SN redundancy level (i.e., the value of Π _{1}) relative to the total number of deployed SNs n (which controls the value of the probability of occurrence of the paths in Π _{1}). Since the increase in n in each deployment scenario is very similar, the value of Π _{1} for the deployments of the same order in the different scenarios (e.g., S4D3 and S5D3) is comparable. This means that the SN redundancy level relative to n actually decreases with the increase of deployment scenario order, i.e., with the increase of m, resulting in a steady decrease in R(S).
To demonstrate the significance of modeling the SNs as threemode (on, relay, and off) devices, we evaluate the reliability of the deployments presented in Table 4 using the reliability metric proposed in [16], which adopts the conventional twomode (on and off) SN model. For a fair comparison, we use our proposed network structure function expressed in (10) (which defines the WSN functionality in terms of both network coverage and connectivity as opposed to network coverage only in [16]). Since the twomode SN model assumes that a given SN is either in a fully functional (on state) or failed (off state) state, SNs cannot contribute to the network functionality as relays. Hence, the corresponding probability of the off state for a given SN s _{ i } is equal to the probability that any of the four SN components fail, i.e., is equal to unity minus the probability that all of the four SN components are functioning simultaneously (i.e., 1 − (1 − \( {\lambda}_s^i \)) (1 − \( {\lambda}_t^i \)) (1 − \( {\lambda}_p^i \)) (1 − \( {\lambda}_t^i \))).
7 Conclusions
In this paper, we derived a novel comprehensive reliability metric for heterogeneous WSN deployments of an arbitrary deployment configuration using a combinatorial approach. In deriving the proposed metric, SNs are modeled as threemode systems that are characterized by four different probabilities of component failure for the sensor, transceiver, processor, and battery. We addressed the computational problem associated with calculating the reliability of deployments at practical scales using the proposed reliability metric by developing a search algorithm that generates the complete set of paths for a given deployment in a time efficient manner. We applied the proposed metric and search algorithm to several deployments of a casestudy surveillance WSN under different operational parameters. Results show that the reliability of a given deployment is mainly a function of its level of SN redundancy and probabilities of failure of its constituent SNs’ components. Results also demonstrated the computational efficiency of the developed search algorithm. Moreover, the significance of adopting the proposed threemode SN model on the evaluated value of WSN reliability as opposed to the conventional simplistic twomode SN model adopted in existing studies can be observed in the results.
Declarations
Acknowledgements
The authors extend their appreciation to the anonymous reviewers for their helpful and supportive comments towards improving this paper.
Funding
This openaccess publication of this paper is supported by a research grant provided by the American University in Cairo, under grant number 10300000–04131100002–850068,665,000.
Authors’ contributions
DD and YG conceived the idea and wrote the paper. DD performed the experiments and analyzed the data. YG gave valuable suggestions on the structuring of the paper and assisted in the revising and proofreading. Both authors read and approved the final manuscript.
Competing interests
The authors declare that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
 A Flammini, E Sisinni, Wireless sensor networking in the Internet of things and cloud computing era, in Proceedings of European Conf. on SolidState Transducers (EUROSENSOR 2014), Italy, 2014Google Scholar
 L. Lei, Y. Kuang, X. Shen, K. Yang, J. Qiao, Z. Zhong, Optimal reliability in energy harvesting industrial wireless sensor networks. IEEE Trans. on Wireless Comm. 15, 5399–5413 (2016). doi:10.1109/TWC.2016.2558146 View ArticleGoogle Scholar
 W Kuo, MJ Zuo, Optimal reliability modeling: principles and applications, 1st edn. (John Wiley, Hoboken, 2003), pp. 85–102Google Scholar
 C. Zhu, C. Zheng, L. Shu, G. Han, A survey on coverage and connectivity issues in wireless sensor networks. Network and Computer Appl. 35, 619–632 (2012)View ArticleGoogle Scholar
 J Virkki, Y Zhu, Y Meng and L Chen, Reliability of WSN hardware, Int. J. of Embedded Sys. 1 (2012). doi:10.5121/ijesa.2011.1201
 F Koushanfar, M Potkonjak, A SangiovanniVecentelli, Faulttolerance in wireless sensor networks, in handbook of sensor networks, 1st edn., ed. by M Ilyas, E Mahgoub (CRC Press, Boca Raton, 2005)Google Scholar
 N Baccour, A Koubaa, L Mottola, MA Zuniga, H Youssef, CA Boano and A Alves, Radio link quality estimation in wireless sensor networks: a survey, ACM Trans. on Sensor Networks 8 (2012). doi:10.1145/2240116.2240123
 M.A. Mahmood, K.G. Winston, I. Welch, Reliability in wireless sensor networks: a survey and challenges ahead. Comput. Netw. 79, 166–187 (2015)View ArticleGoogle Scholar
 H. AboElFotoh, S. Iyengar, K. Chakrabarty, Computing reliability and message delay for cooperative wireless distributed sensor networks subject to random failures. IEEE Trans. Reliab. 54(145–155) (2005)Google Scholar
 Y Jin, H Lin, Z Zhang and X Zhang, Estimating the reliability and lifetime of wireless sensor network, in Proceedings of Int. Conf. on Wireless Communications, Networking and Mobile Computing (WiCOM), China, 2008Google Scholar
 A. Damaso, N. Rosa, P. Maciel, Reliability of wireless sensor networks. MPDI Sensors 14, 760–785 (2014)Google Scholar
 X Zhu, Y Lu, J Han and L. Shi, Transmission reliability evaluation for wireless sensor networks, Hindawi J. Of Distributed Sensor Networks 10 (2016)Google Scholar
 Q. Liu, H. Zhang, Weighted voting system with unreliable links. IEEE Trans. Reliab. 66(2), 339–350 (2017)View ArticleGoogle Scholar
 C Jaggle, J Neidig, T Grosch and F Dressler, Introduction to modelbased reliability evaluation of wireless sensor networks, in Proceedings of Int. Federation of Automatic Control (IFAC) Workshop on Dependable Control of Discrete Systems, Italy, 2009Google Scholar
 I Silva, R Leandro, D Macedo and LA Guedes, A dependability evaluation tool for the Internet of things’, Computers & Electrical Eng. 39, 806–838 (2013)Google Scholar
 EI Gokce, AK Shrivastava and Y ding, fault tolerance analysis of surveillance sensor systems, IEEE Trans. on Reliab. 62, 478489 (2013)Google Scholar
 I. Silva, L.A. Guedes, P. Portugal, F. Vasques, Reliability and availability evaluation of wireless sensor networks for industrial applications. MPDI Sensors 12, 806–838 (2012)View ArticleGoogle Scholar
 H VanTrinh, N Julien and P Berruet, Online selfdiagnosis based on power measurement for a wireless sensor node, in Proceedings of the IEEE Workshop on HighlyReliable PowerEfficient Embedded Designs, China, 2013Google Scholar
 A.E. Zonouz, L. Xing, V.M. Vokkarane, Y. Sun, in Proceedings of Annual Reliability and Maintainability Symposium (RAMS). A timedependent link failure model for wireless sensor networks (2014)Google Scholar
 Y. Shpungin, Combinatorial approach to reliability evaluation of network with unreliable nodes and unreliable edges. Int. J. Comput. Sci. 1(177–183) (2006)Google Scholar
 IB Gertsbakh and Y Shpungin, Y, Models of network reliability: analysis, combinatorics, and Monte Carlo, 1st edn. (CRC Press, Boca Raton, 2010), pp. 1723Google Scholar
 M Healy, T Newen and E Lewis, Wireless sensor node hardware: a review, IEEE Sensors, 621–624 (2008) doi:10.1109/ICSENS.2008.4716517
 H Liu, A Nayak and I Stojmenovic, Fault tolerant algorithms/protocols in wireless sensor networks, in Guide to wireless sensor networks, ed. by SC Misra, I Woungang, S Misra (SpringerVerlag, Berlin, Germany, 2009), pp. 261–292Google Scholar
 D. Deif, Y. Gadallah, Wireless sensor network deployment using a variablelength genetic algorithm (Proceedings of the Wireless Communications and Networking Conference (WCNC), Turkey, 2014)View ArticleGoogle Scholar