Download
1 / 34
340 likes | 487 Views
Novel methods for Sensor Network Design. Dr. Miguel Bagajewicz Sanjay Kumar DuyQuang Nguyen. The Sensor Network Design Problem. Minimize cost of instrumentation while satisfying the constraints on attributes like Accuracy Precision Reliability Residual Accuracy etc….
E N D
Novel methods for Sensor Network Design Dr. Miguel Bagajewicz Sanjay Kumar DuyQuang Nguyen
The Sensor Network Design Problem Minimize cost of instrumentation while satisfying the constraints on attributes like Accuracy Precision Reliability Residual Accuracy etc…
The Sensor Network Design Problem Minimize Cost of instrumentation such that accuracy of S3= 7% S7= 8% Similarly we can have constraints on residual accuracy, reliability, precision etc..
How to find optimal solution? Tree Enumeration Procedure • At each node calculate accuracy (and other attributes mandated by the constraints) compare with thresholds. • If node is feasible, stop; explore sister nodes. • If infeasible, go down.
Modified Tree Enumeration Procedure • The Tree enumeration procedure can be made computationally effective by using cutsets instead of streams (Bagajewicz and Gala, 2006(a)). • The efficiency is further more increased by decomposing the graph into subgraphs, (Bagajewicz and Gala, 2006(b)) • Gala M and M. Bagajewicz. (2006b). “Rigorous Methodology for the Design and Upgrade of Sensor Networks using Cutsets. Industrial and Engineering Chemistry Research”. Vol 45, No 21, pp. 6679-6686. • Gala M and M. Bagajewicz. (2006b) “Efficient Procedure for the Design and Upgrade of Sensor Networks using Cutsets and Rigorous Decomposition”. Industrial and Engineering Chemistry Research, Vol 45, No 21, pp. 6687-6697.
Software Accuracy Accuracy has been conventionally defined as the sum of absolute value of the systematic error and the standard deviation of the meter (Miller, 1996). Since the above definition is of very less practical value, accuracy of a stream can defined as the sum of the precision and the maximum induced bias in the respective stream, Bagajewicz (2005).
Software Accuracy -Software Accuracy -Precision -Maximum induced bias • The maximum induced bias in a stream ‘i’ due a gross error in ‘s’ is given by, (using maximum power measurement test) Where, ‘A’ is the incidence matrix and ‘S’ is the variance covariance matrix of measurements
Software accuracy in the presence of ‘nt’ gross errors • In the presence of nTgross errors in positions given by a set T, the corresponding induced bias in variable ‘i’ is • We have to explore all the possible combinations of locations of gross errors. Thus the problem can be stated using a binary vector as
S2 S1 Gross Error Equivalency S3 When there is more than one gross error, two gross errors may be equal in magnitude but opposite in sign which tend to cancel each other.
Residual Accuracy Residual Accuracy of order ‘k’ is the software accuracy when ‘k’ gross errors have been found out and the measurements have been eliminated.
Estimation Reliability Probability with which a variable ‘i’ can be estimated using its own measurement or through material balance equations in the time interval [0, t].
Cutset Cutset is the set of edges (streams) when eliminated, separates the graph into two disjoint subgraphs. Deletion of a subset of the edges in cutset does not separate the graph into two subgraphs. Streams 8, 6, 2 is a cutset. Streams 2, 3 is another cutset. There are several others.
Calculation of Estimation Reliability- Example xm = [1, 2, 3]; xm is also a cutset P{S1}= P{S2}= P{S3}= 0.9 • Probability of estimating S1= Probability of S1 working or Probability of S2, S3 working simultaneously. S2 S5 2 S6 S1 3 1 S4 S3 RS1= P{S1} υ [P{S2}∩P{S3}] RS1= P{S1} υ [P{S2}×P{S3}] RS1= P{S1}+ [P{S2}∩P{S3}]- [P{S1}×P{S2}×P{S3}] RS1= 0.9+0.81-0.9×0.81 When xm = [2, 3]; S1 becomes non redundant and so it can be estimated only by its material balance relations. Thus, RS1= P{S1} .P{S2}= 0.81 4
Estimation Reliability for Non Redundant Variable If the variable is measured, then its estimation is directly the service reliability of the sensor measuring it. If the variable is not measured,
S2 S5 2 S6 S1 3 1 S4 S3 Estimation Reliability for Redundant Variable 4 xm = [1, 2, 3]; Since the variable of interest is S1, the reduced cutset would be [2,3]. Let this be denoted by Zj(i), where ‘i’ is the variable of interest- here it is S1. Generate all the cutsets that has the variable of interest ‘i’. Removing the variable ‘i’ from those yields the reduced cutsets.
Calculation of Estimation Reliability- Example S2 S5 S6 xm = [1, 2, 3, 4, 5]; [1, 2, 3], [1, 4, 5] are two cutsets. [2, 3] and [4,5] are reduced cutsets. P{S1}= P{S2}= P{S3}= P{S4}= P{S5}= 0.9 • Probability of estimating S1= Probability of S1 working or Probability of S2, S3 working simultaneously or P { S4 and S5} working simultaneously 2 S1 3 1 4 ENV S4 S3 RS1= P{S1} υ[P{S2}∩P{S3}] υ[P{S4}∩P{S5}] RS1= P{S1} υ [P{S2}×P{S3}] υ [P{S4}×P{S5}] RS1= [P{S1}+ [P{S2}∩P{S3}]- [P{S1}×P{S2}×P{S3}] ] υ [P{S4}×P{S5}] RS1= 0.981+0.81- 0.981×0.81 When xm = [1, 3]; S1 becomes non redundant and so it can be estimated only by its direct measurement. Thus, RS1= P{S1} = 0.9 Z1(1)- reduced cutset Z2(1)
Estimation Reliability for Redundant Variable For a measured variable, For a unmeasured variable,
It can be proved that, Computation of estimation reliability of unmeasured variable- Sum of disjoint products
Implementation in the Program Input Data: Binary vector of measured streams at each node. Service reliability of sensors. Variables of interest. Steps to be performed: Generate all the cutsets that has the variable of interest. Choose only those reduced cutsets that have measured streams for reliability calculation. Other cutsets are useless as they do not make the variable of interest observable. If no such cutset for unmeasured variable exist, then node is infeasible.
Implementation in the Program Non redundant variable Check if the variables of interest are non redundant. If so we got three cases. Case 1: The variable is measured, then estimation reliability is the sensor service reliability itself. Case 2: The variable is not measured, the estimation reliability is product of service reliabilities of sensors in the reduced cutset. Case 3: The variable of interest is not observable, then node is infeasible, go down the tree.
Implementation in the ProgramRedundant variable Case 1: variable is measured too. Case 2: unmeasured variable. We have already discussed the computational method for above equations.
Implementation in the ProgramComparison with threshold Compare the obtained reliability with the specifications/ requirements/ thresholds, If node is feasible, transfer control to appropriate statement, which explores sister nodes If infeasible, go down the tree.
Residual Reliability Let there be ‘n’ sensors when calculating reliability. Assume one of the sensors has malfuntioned and the measurement eliminated, the estimation reliability we now have is “Residual Reliability of order one” The sensor that has a gross error or the malfunctioned sensor can be identified. This helps to know which measurement is eliminated.
Calculation of Residual Reliability Input Data: Binary vector of measured streams at a node. Say ‘ns’ streams are measured. Sensor Service Reliability Reduced Cutset Information
Calculation of Residual Reliability- Order One. Steps Involved: Choose reduced cutsets from already available information. Eliminate those who have streams with the malfunctioning sensor. Calculate Reliability the same way.
6 2 7 4 9 5 3 16 18 10 1 1 4 5 2 3 15 8 19 17 20 21 13 11 7 10 11 8 6 9 22 12 23 24 14 Example Madron and Veverka (1992)
Requested Software Accuracy • The software accuracy requested were. • Three gross errors were allowed and no feasible nodes were found. • Computed Reliability values were 90% for all streams when two gross errors are allowed.
