DuyQuang Nguyen, University of Oklahoma, 100 E. Boyd St., T-335, Norman, OK 73019 and Miguel J. Bagajewicz, Chemical, Biological and Materials Engineering, University of Oklahoma, 100 E. Boyd St., T-335, Norman, OK 73019.
A tree enumeration algorithm for the design and upgrade of linear sensor networks utilizing cutsets of process graphs has been recently proposed (Mayur and Bagajewicz, , AIChE 2005, and 2005a). Later, the speed of the algorithm was improved using a graph decomposition technique (Mayur and Bagajewicz, AIChE 2005 and 2005b). The algorithms have been shown to consistently give optimum sensor networks for large and linear systems with short computation time. In this work, the mentioned algorithms are extended to solve nonlinear sensor network design problem. The concept of cutsets for the nonlinear case is revisited and a new decomposition procedure, suitable for this case is also discussed. The calculation procedure will be shown to be capable of solving both linear and nonlinear sensor network design problems. Examples will be provided. Gala, M. and Bagajewicz, M., 2005a. A New Methodology for the Design and Upgrade of Sensor Networks. Industrial and Engineering Chemistry Research, submitted. Gala, M. and Bagajewicz, M., 2005b. A New New Methodology for the Design and Upgrade of Sensor Networks. Part II-Efficient Procedure using Rigorous Decomposition. Industrial and Engineering Chemistry Research, submitted.