1. Introduction

This chapter deals with the problem of reliability modelling with wireless sensor network (WSN) (Akyildiz et al., 2002), which is rapidly becoming a platform for applications including antiterrorism, smart spaces, numerous military sensing and command and control applications, and entertainment. Inherent in these safety-critical applications is a priority and urgency of the information or messages.

There are significant research results on reliability modelling for distributed systems with wired network. (Lin, 1976) approaches a connectivity-based reliability modelling from the perspective of the networks, which consider the node unit and link unit. (Tripath, 1997) proposes task-based reliability modelling by just considering processor unit, and defines a reliability index for a task, but don’t cover the system reliability perspective. (Zhou et al., 2001) approaches the reliability modelling from the perspective of the nodes in which a task involves and uses the reliability matrix with each element as the reliability of a task to evaluate reliability of a distributed system in avionics platform.

However, as far as we know, few attention has been paid by researchers to addressing reliability modelling on WSNs. Especially for safety-critical application, the reliability is influenced mainly and directly by not only the connectivity of the network topology but also the (such as energy-/time-) efficiency of the system. (Feng & Kumar, 2004) researches the connectivity reliability of wireless networks, but don’t consider the reliability modelling. (Xing & Shrestha, 2006) considers the problem of reliability modelling and analysis of hierarchical clustered wireless sensor networks (WSN), proposes reliability measures that integrate the conventional connectivity-based network reliability with the sensing coverage measure indicating the quality of service (QoS) of the WSN. Both work above research reliability problem of WSN just from view of connectivity and coverage, don’t introduce the efficiency of the system. (Xing, 2006; AboElFotoh et al., 2005) consider the efficiency in reliability modelling for WSN. (Xing, 2006) proposes an integrated modelling on WSN reliability and security. (AboElFotoh et al., 2005) considers the delay-efficiency factor into the reliability modelling, by computing a measure for the reliability and a measure for the message delay between data sources & data sinks in an WSN, respectively. (Silva et al., 2012) proposes a methodology based on an automatic generation of a fault tree to evaluate the reliability and availability of WSNs, when permanent faults occur on network devices. (Johannes et al., 2012) generalizes the expected hop count metric (EHC) into an expected message delay (EMD) that permits arbitrary delay values for both links and devices. Further, it proposes a method based on Augmented Ordered Multivariate Decision Diagram (OMDD-A) that can be used to compute reliability (REL), EHC and EMD for WSN with both device and link failures.

To the best of our knowledge, however, there is no systematical research done to unify energy consume and message delay into reliability modelling for WSN. The work in this chapter differs from the previous work in that it proposes a model of the system and an integrated model of the task which considers energy consume and message delay for the safety-critical application, introduces both the energy factor function and time factor function, and also establishes an integrated reliability model of WSN based on a task. The illustration of modelling suggests that the method studied has a directive influence to both task division and topology selection of WSN system.

The rest of the chapter is organized as follows. The basic node model and network structure of wireless sensor networks are introduced in Section 2. We propose an integrated model of the task which considers energy consume and message delay based on a task, introduce both the energy factor function and time factor function, and also establish an integrated reliability model of WSN based on a task in Section 3 and 4, respectively. In Section 5, we present an illustration of modelling of representative hierarchical cluster topology in WSN. Finally, the chapter is concluded in Section 6.

2. The network structure and node model

2.1. The network structure

WSNs composed of multiple sensor nodes and one sink node. The sensor nodes are usually scattered in a sensor field as in Fig.1. Each of these scattered sensor nodes has the capabilities to collect data and route data back to the sink node. Data are routed back to the sink node by a multi-hop architecture through the sink node as shown in Fig.1.

2.2. Node model

A sensor node is made up of four basic components as shown in Fig. 1: an acquisition unit, a processing unit, a communication unit and a power unit. Acquisition units are usually composed of two subunits: sensors and analog to digital converters (ADCs). The analog signals produced by the sensors based on the observed phenomenon are converted to digital signals by the ADC, and then fed into the processing unit. The processing unit, which is generally associated with a small storage unit, manages the procedures that make the sensor node collaborate with the other nodes to carry out the assigned sensing tasks. A communication unit connects the node to the network. One of the most important components of a sensor node is the power unit. Power units may be supported by a power scavenging unit such as solar cells. There are also other subunits, which are application dependent.

Figure 1.
Wireless sensor node model and network structure

Data interchanges between nodes are generally supported by processing units and communication units. Because those acquisition units can only have effect in source nodes, instead of taking effect on data relay, we suppose the acquisition unit works well. Besides, we also suppose the power unit works well.

3. The network task models

WSN can support a serial of data interchanges to satisfy the functional need for some applications. Moreover, the process of every such data interchange can be looked as a task message, which includes message source, message route, message destination and so on. So, the whole WSN can be functionally looked as a task set.

In this Section, we propose an integrated model of the task which considers energy consume and message delay for the safety-critical application,, and introduce both the energy factor function and time factor function.

3.1. Task model

[definition A]: A task in WSN can be characterized asτS,D,E,T, where

S
D
E
T

3.2. Route set of a task

[definition B]: when a task τS,D,E,T is executed, task message can bypass several node orderly, so the ordered node set composes a route of the taskτS,D,E,T, which characterized asrS,D. Where, rS,Djust consider the connectivity of the task instead of energy/time constraint. Generally speaking, there maybe more than one route for a task in WSN, so we characterize the number of the route of the task τS,D,E,T askS,D.

3.2.1 Energy available route

The wireless sensor network (WSN) system is a kind of system in which the consumer energy of a task is strictly bounded. So, an energy factor function is defined to decide whether the energy is available for a route.

Energy factor function

Suppose that task τS,D,E,T has one routerS,Di, which has the ordered nodes as followsn1i,n2i,...,nji,...,nhi. Where h represents the number of nodes bypassed by task message. We denote Enji,nj+1i as the consumer energy for message transmission from nodenji to node nj+1iof routerS,Di, and denote Enji as the available power in nodenji, that means Enjiis the remaining energy of nji (Sun et al., 2005). Then, the energy factor function can be defined as follows:

F(εi)={1 Enji,nj+1i≤Enji (j=1,2,...,h−1)0 other case E1

(1)

The expression (1) indicates that route rS,Di is an energy available route only if that the available power Enji in each node is no less thanEnji,nj+1i. Specifically, τS,D,E,Tcan be denoted asτS,D,0,T, ifE=0. This means that the energy constrains can be ignored.

3.2.2. Delay available route

The wireless sensor network (WSN) system is also a kind of system in which the message delay of a task is strictly bounded. So, a time factor function is defined to decide whether the delay is available.

Time factor function

Suppose that task τS,D,E,T has one routerS,Di, which is defined as in section 3.2.1. We denote Tnji,nj+1i as the consumer time for message transmission from nodenji to node nj+1iof routerS,Di, and denote ti as the sum of Tnji,nj+1ifor routerS,Di. Then, the time factor function can be defined as follows:

F(ti)={1 ti≤T0 ti>TE2

(2)

The expression (2) indicates that route rS,Di is a delay available route only if that the transmission delay ti is no more than message deadlineT. Specifically, τS,D,E,Tcan be denoted asτS,D,E,∞, ifT=∞. This means that the time constrains can be ignored. In another word, τS,D,E,∞will consider the energy constrains, while τS,D,0,T will consider the time constrains. Moreover, τS,D,E,Tcan be denoted as τS,D,0,∞ if both the time constrains and the energy constrains are ignored.

3.3. Available route set of a task

So, consider both the energy factor and the time factor, if the route rS,Di can meet both energy constraint and time constraint, it is called an available route, denoted asrS,D,E,Ti. And then, the available route set of τS,D,E,T is:

RS,D,E,T=∑i=1kS,DrS,D,E,Ti=∑i=1kS,DF(εi)⋅F(ti)⋅rS,DiE3

(3)

Where the route rS,D,E,Ti of the task τS,D,E,T composed of a processing unit set and a communication unit set, which are denoted as PrS,D,E,Ti andCrS,D,E,Ti, respectively.

PrS,D,E,Ti={prS,D,E,Ti|prS,D,E,Ti∈rS,D,E,Ti}E4

(4)

CrS,D,E,Ti={crS,D,E,Ti|crS,D,E,Ti∈rS,D,E,Ti}E5

(5)

Therefore, the processing unit set and the communication unit set of τS,D,E,T can be denoted as, respectively

PTS,D,E,T=∪i=1kS,DPrS,D,E,TiE6

(6)

CTS,D,E,T=∪i=1kS,DCrS,D,E,TiE7

(7)

4. Reliability model

In this Section, we establish an integrated reliability model of WSN based on task.

4.1. Assumptions

Given the WSNs nodes has a number size of M.

We take the assumption that the occurrence of component failures is independent, components either work or fail.
Assume the variable m is the number of tasks; therefore, the expression of the system task set isΓ={τS,D,E,Tk|k=1,2,...,m}.

4.2. Task reliability

In WSNs, task τS,D,E,T can have more than one route. The reliability of the route rS,D,E,Ti of task τS,D,E,T is equivalent to the probability of the processing units PrS,D,E,Tiand communication units CrS,D,E,Tiworking properly. That is:

RrS,D,E,Ti=Pr{rS,D,E,Ti}=Pr(PrS,D,E,Ti)⋅Pr(CrS,D,E,Ti)E8

(8)

Where, Pr{•}denotes the probability of the object’ s working properly in above bracket.

Task reliability is equivalent to the probability that there exists at least one path among Task paths, which is

RτS,D,E,T=Pr{∪i=1kS,DrS,D,E,Ti}E9

(9)

According to the formula of probability for incompatible event (Zhang et al., 1997), we have

RτS,D,E,T=Pr{∪i=1kS,DrS,D,E,Ti}=∑i=1kS,DPr{rS,D,E,Ti}−∑i<j=2kS,DPr{rS,D,E,Ti∩rS,D,E,Tj}+∑i<j<h=3kS,DPr{rS,D,E,Ti∩rS,D,E,Tj∩rS,D,E,Th}+⋅⋅⋅+(−1)kS,D−1⋅Pr{∩i=1kS,DrS,D,E,Ti}E10

(10)

5. Examples

In this Section, we present an illustration of modelling of representative hierarchical cluster topology in WSN, as shown in Figure 2.

WSN can offer unprecedented flexibility in the choice of network topology to match the mission requirements, and a large number of network topology architectures have been proposed for WSNs (Tilak et al., 2002; Edgar et al., 2003), and a topology solution that is efficient for one architecture is likely not to be the best for another, as different network architectures exhibit different communication patterns. Therefore, the topology selection and reliability evaluation are important issues for distributed WSN.

Presently, mesh and hierarchical clustered topology have emerged as the choice topologies for sensor networks. To decrease communication traffic and communication frequency, to ensure scalability and fault tolerance, and to manage the large number of sensors, WSN use the clustered hierarchical architecture (Heinzelman et al., 2000; Tubaishat & Madria, 2003).

5.1. hierarchical clustered topology

Figure 2 shows an example hierarchical clustered structure with nodes organized into different layers (Banerjee & Khuller, 2001; Tubaishat et al., 2003; Kim, 2010). All the sensor nodes in the network are joined at the lowest layer. The cluster heads in layer-0 are arranged into clusters in layer-1 and a cluster head is assigned for each cluster at this layer. The process is repeated for each layer until the highest layer in the architecture is reached. The hierarchical scheme forms a tree structure for routing with the sink node as the root of the tree (Callaway, 2004). Whenever a sensor node needs to send a message to the sink or another sensor node, it sends the message to its cluster head. The message is routed progressively to the immediately higher-level cluster heads, each of which forms a more detailed segment of the route, until it reaches the cluster head that has the routing information about the destination node. The message is then routed progressively to lower-level cluster heads until it reaches the destination node.

Base on the reliability modelling method above, we analyze the reliability of the hierarchical cluster structure of WSNs. The analysis includes two parts, 1) all cluster heads from L1toLn; 2) the lowest clusterLn.

Suppose a taskτi,sink, where sink represents the destination node, and i represents the source node which belongs to the lowest clusterLn. Based on the characteristic of hierarchical cluster structure, the routes of τi,sink have the ordered cluster layers as (Ln→Ln−1→...→L1→sink) which is indicated in Table 1. Moreover, the cluster heads in each layer forms a tree structure for routing with the sink node as the root of the tree. Correspondingly, the part of the ordered cluster heads in a route of the task τi,sink is always(hn−1,...,h1,sink). By contrary, the part of the lowest cluster in the route may have multiple sub-routes such as(1,2,3,6,hn),(1,2,5,8,hn) ,(1,4,5,6,hn) , and etc. (see Table 1 and Fig.2.)

So, the reliability of task τi,sink can be presented as

Rτi,sink=Rτh(n−1),sink∩Rτi,h(n)

E11

(11)

Where n represents the cluster depth; h(w)=hw(w=1,...,n);

Rτh(n−1),sinkrepresents the reliability of the part of the ordered cluster heads in the route;Rτi,h(n)represents the reliability of the part of the lowest cluster in the route.

Therefore, by (8), we can deduce the following expression

Rτh(n−1),sink=Pr(Prh(n−1),sink)⋅Pr(Crh(n−1),sink)

E12

(12)

Figure 2.
Hierarchical cluster structure of WSNs

No.	Route	Clusters to route
1	1,2,3,6, h_n, h_n-1,…, h₁,sink	L_n-"/>L_n-1-"/>…-"/> L₁-"/>sink
2	1,2,5,8, h_n, h_n-1,…, h₁,sink	L_n-"/>L_n-1-"/>…-"/> L₁-"/>sink
3	1,4,5,6, h_n, h_n-1,…, h₁,sink	L_n-"/>L_n-1-"/>…-"/> L₁-"/>sink
…	Other route	L_n-"/>L_n-1-"/>…-"/> L₁-"/>sink

Table 1.

Routes of τi,sink(i=1) and its clusters

5.2. Reliability analysis

Example: Suppose a task set Γ={τ1,sink,2,16,τ3,sink,2,16,τ7,sink,2,16} in Fig.2, we will analyze the reliability of every task in Γ by using the reliability modelling method proposed in the section above. And the analysis content includes:

To analyze the routes of every task in Γin the lowest cluster.
To analyze the constrained energy’/time’ influence on task reliability/system reliability.

Settings and assumptions:

The cluster depthn=5;
For the part of the ordered cluster heads in the route, it is supposed that:Eh(n),h(n-1)=Eh(n−1),h(n−2)=...=Eh(2),h(1)=Eh(1),sink=2;Eh(n)=Eh(n−1)=...=Eh(1)=Esink=2;Th(n),h(n-1)=...=Th(2),h(1)=Th(1),sink=2. Therefore, by (12), we can get the sub-task Γ'={τ1,h(n),2,8,τ3,h(n),2,8,τ7,h(n),2,8} corresponding to the lowest cluster.
For the part of the lowest cluster in the route, as in Fig.3, it is supposed that:E1=E3=E4=E5=E6=E8=2;E2=E7=1;E2,3=E2,5=E5,6=E7,8=1.5;E1,2=E1,4=E4,7=E5,8=E4,5=E3,6=E8,h(n)=E6,h(n)=2;T7,8=1;T5,8=T5,6=T3,6=3;T1,2=T2,3=T1,4=T2,5=T4,5=T4,7=T6,h(n)=T8,h(n)=2.
all processing units and communication units have the same failure rate, in order to reflect the influence of the failure rate to the system efficiently, the range of the failure rate is [1e-1,1e-3].

Figure 3.
Nodes in the lowest cluster and its energy/time setting

Reliability analysis:

According to both the reliability modeling method and the routing scheme (see Fig.2) in the lowest cluster, we firstly obtain all the routes of each task, then obtain both the processing unit set and the communication unit set of those routes, after that search the energy available route and the time available route of each task, and finally analyze the reliability index of each task.

Table 2 shows that multiple routes exist when considering the connectivity of the taskτ1,h(n),2,8; that only route 4 and route 5 can meet energy constraint, so they are energy available routes; and that only route 6 can meet time constraint, so it is a delay available route. Further more, there no route can meet both energy constraint and time constraint, so there no available route of the task.

In the same way, table 3 and table 4 show the route and its availability of τ3,h(n),2,8andτ7,h(n),2,8, respectively.

By (8),(9),and (10), we can deduce the reliability index of these three tasks. Taking τ3,h(n),2,8 as an example, when just considering the energy available route of route 1 and route 2, its reliability index can be calculated as

Rτ3,h(n),2,∞=Pr{∪i=12r3,h(n),2,∞i}=Pr(r3,h(n),2,∞1)+Pr(r3,h(n),2,∞2)−Pr(r3,h(n),2,∞1∩r3,h(n),2,∞2)==Pr(Pr3,h(n),2,∞1)⋅Pr(Cr3,h(n),2,∞1)+Pr(Pr3,h(n),2,∞2)⋅Pr(Cr3,h(n),2,∞2)−−Pr(Pr3,h(n),2,∞1∩Pr3,h(n),2,∞2)⋅Pr(Cr3,h(n),2,∞1∩Cr3,h(n),2,∞2)E13

(13)

And when considering the (energy and time) available route of route 1, its reliability index can be calculated as

Rτ3,h(n),2,8=Pr{r3,h(n),2,81}=Pr(Pr3,h(n),2,81∩Cr3,h(n),2,81)E14

(14)

No.	route	Processing unit set	Communication unit set	f(εi)	f(ti)	Available route?
1	1,2,3,6,hn	p1,p2,p3,p6,ph(n)	c1,c2,c3,c6,ch(n)	0	0	N
2	1,2,5,6,hn	p1,p2,p5,p6,ph(n)	c1,c2,c5,c6,ch(n)	0	0	N
3	1,2,5,8,hn	p1,p2,p5,p8,ph(n)	c1,c2,c5,c8,ch(n)	0	0	N
4	1,4,5,8,hn	p1,p4,p5,p8,ph(n)	c1,c4,c5,c8,ch(n)	1	0	N
5	1,4,5,6,hn	p1,p4,p5,p6,ph(n)	c1,c4,c5,c6,ch(n)	1	0	N
6	1,4,7,8,hn	p1,p4,p7,p8,ph(n)	c1,c4,c7,c8,ch(n)	0	1	N
…	Other route	…	…	0	0	N

Table 2.

Routes of τ1,h(n),2,8 and its processing/communication unit set

No.	route	Processing unit set	Communication unit set	f(εi)	f(ti)	Available route?
1	3,6,hn	p3,p6,ph(n)	c3,c6,ch(n)	1	1	Y
2	3,6,5,8,hn	p3,p6,p5,p8,ph(n)	c3,c6,c5,c8,ch(n)	1	0	N
3	3,6,5,4,7,8,hn	p3,p6,p5,p4,p7,p8,ph(n)	c3,c6,c5,c4,c7,c8,ch(n)	0	0	N
4	3,6,5,2,1,4,7,8,hn	p3,p6,p5,p2,p1,p4,p7,p8,ph(n)	c3,c6,c5,c2,c1,c4,c7,c8,ch(n)	0	0	N
5	3,2,5,6,hn	p3,p2,p5,p6,ph(n)	c3,c2,c5,c6,ch(n)	0	0	N
6	3,2,5,8,hn	p3,p2,p5,p8,ph(n)	c3,c2,c5,c8,ch(n)	0	0	N
7	3,2,5,4,7,8,hn	p3,p2,p5,p4,p7,p8,ph(n)	c3,c2,c5,c4,c7,c8,ch(n)	0	0	N
8	3,2,1,4,7,8,hn	p3,p2,p1,p4,p7,p8,ph(n)	c3,c2,c1,c4,c7,c8,ch(n)	0	0	N
9	3,2,1,4,5,8,hn	p3,p2,p1,p4,p5,p8,ph(n)	c3,c2,c1,c4,c5,c8,ch(n)	0	0	N
10	3,2,1,4,5,6,hn	p3,p2,p1,p4,p5,p6,ph(n)	c3,c2,c1,c4,c5,c6,ch(n)	0	0	N

Table 3.

Routes of τ3,h(n),2,8 and its processing/communication unit set

No.	route	Processing unit set	Communication unit set	f(εi)	f(ti)	Available route?
1	7,8,hn	p7,p8,ph(n)	c7,c8,ch(n)	0	1	N
2	7,8,5,6,hn	p7,p8,p5,p6,ph(n)	c7,c8,c5,c6,ch(n)	0	0	N
3	7,8,5,2,3,6,hn	p7,p8,p5,p2,p3,p6,ph(n)	c7,c8,c5,c2,c3,c6,ch(n)	0	0	N
4	7,8,5,4,1,2,3,6,hn	p7,p8,p5,p4,p1,p2,p3,p6,ph(n)	c7,c8,c5,c4,c1,c2,c3,c6,ch(n)	0	0	N
5	7,4,5,8,hn	p7,p4,p5,p8,ph(n)	c7,c4,c5,c8,ch(n)	0	0	N
6	7,4,5,6,hn	p7,p4,p5,p6,ph(n)	c7,c4,c5,c6,ch(n)	0	0	N
7	7,4,5,2,3,6,hn	p7,p4,p5,p2,p3,p6,ph(n)	c7,c4,c5,c2,c3,c6,ch(n)	0	0	N
8	7,4,1,2,3,6,hn	p7,p4,p1,p2,p3,p6,ph(n)	c7,c4,c1,c2,c3,c6,ch(n)	0	0	N
9	7,4,1,2,5,6,hn	p7,p4,p1,p2,p5,p6,ph(n)	c7,c4,c1,c2,c5,c6,ch(n)	0	0	N
10	7,4,1,2,5,8,hn	p7,p4,p1,p2,p5,p8,ph(n)	c7,c4,c1,c2,c5,c8,ch(n)	0	0	N

Table 4.

Routes of τ7,h(n),2,8and its processing/communication unit set

Correspondingly, by (11), (12), (13), and (14), the reliability index of task τ3,sink,2,16 can be deduced. In the same way, the reliability index of each task in Γ'and Γcan be obtained.

5.3. Results

Figure 4 to figure 8 show the reliability index of the tasks vs unit fail rate denoted as e. And we have that e equals to (1-r), where r denote the reliability index of the unit.

Figure 4.
The energy/time constrains’ influence on the reliability index of τ1,h(5),2,8

Figure 5.
The energy/time constrains’ influence on the reliability index of τ3,h(5),2,8

Figure 6.
The energy/time constrains’ influence on the reliability index of τ7,h(5),2,8

Several results can be obtained directly from these figures, which are as follows:

the reliability index of each task decreases with the growth of the fail rate of the processing/communication unit. That means that the reliability index can be increased by improving the reliability index of the unit.
As shown in Figs. 7 and 8, when ignoring the (energy and time) constrains, task τ3,h(5),2,8 or τ3,sink,2,16 has the same reliability index as task τ7,h(5),2,8 orτ3,sink,2,16, respectively. That is concordant with their topology symmetry.
When just considering the energy constrains (τS,D,E,∞),
The number of the energy available route of Task τ1,h(n),2,8 or τ3,h(n),2,8 is only two. As shown in Figs. 4 and 5, the reliability index of these two tasks has decreased compared with τ1,h(5),2,∞ orτ3,h(n),2,∞, respectively. It means that the energy constrains will have a certain extent negative effect on the execution of a task.
There no energy available route exists for taskT7,h(5),2,8, as shown in Fig. 6, therefore, the reliability index of the task is zero. It means that the energy constrains will have a vital effect on the execution of a task.
When just considering the time constrains (τS,D,0,T),
The number of the time available route of Taskτ1,h(n),2,8, τ3,h(n),2,8, or τ3,h(n),2,8 is only one. As shown in Figs. 4,5, and 6, the reliability index of these three tasks has decreased compared withτ1,h(5),0,8, τ3,h(5),0,8orτ7,h(5),0,8, respectively. It means that the time constrains will have a certain extent negative effect on the execution of a task.

Figure 7.
The energy/time constrains’ influence on the reliability index ofτ1,h(5),2,8,τ3,h(5),2,8 , and τ7,h(5),2,8

Figure 8.
The energy/time constrains’ influence on the reliability index ofτ1,sink,2,16,τ3,sink,2,16 , and τ7,sink,2,16

When considering both the energy constrains and the time constrains (τS,D,E,T),
The number of the available route of Task τ3,h(n),2,8 is only one. As shown in Fig. 5, the reliability index of the task has decreased compared withτ3,h(n),2,∞. It means that both the energy constrains and the time constrains will have a certain extent negative effect on the execution of a task.
There no available route exists for task T1,h(5),2,8orT7,h(5),2,8, as shown in Figs. 4 and 6, therefore, the reliability index of these two tasks is zero. It means that both the energy constrains and the time constrains will have a vital effect on the execution of a task.

6. Conclusion

The work in this chapter carries on systematically research on unifying energy consume and message delay into reliability modelling for WSN, proposes an integrated model of the task which consider energy consume and message delay for the safety-critical application, introduces both the energy factor function and time factor function, and also establishes an integrated reliability model of WSN based on a task.

The illustration of modelling suggests that the method studied has a directive influence to both task division and topology selection in the phase of system design of WSN system.

Based on this work, future directions can cover several research issues in WSNs:

To implement reliability validation and optimization for the complicated topologies in WSNs;
To analyze the reliability index for some kind of topology, search out the key unit (processing unit, or communication unit, or node), and research the redundant scheme for the unit.
To expand the reliability model to consider more factors (for example, safety or security or buffer limit) than the energy and the time in order to meet the multiple QoS requirements for the safety critical application in WSNs.

Tsutomu Shinagawa

Chapters authored

Related collaborators

Seigo Ito

Yahia Chergui

Ying-Hung Chen

Ju-Liang He

Keh-Chang Chen

Shu-Yuan Wu

Chen-Hon Chen

Chiung-Hsun Chen

Ming-Yi Hsu

N Nehaoua