Leak localization in water distribution networks using pressure and data-driven classifier approach

Leaks in water distribution networks (WDNs) are one of the main reasons for water loss during fluid transportation. Considering the worldwide problem of water scarcity, added to the challenges that a growing population brings, minimizing water losses through leak detection and localization, timely and efficiently using advanced techniques is an urgent humanitarian need. There are numerous methods being used to localize water leaks in WDNs through constructing hydraulic models or analyzing flow/pressure deviations between the observed data and the estimated values. However, from the application perspective, it is very practical to implement an approach which does not rely too much on measurements and complex models with reasonable computation demand. Under this context, this paper presents a novel method for leak localization which uses a data-driven approach based on limit pressure measurements in WDNs with two stages included: (1) Two different machine learning classifiers based on linear discriminant analysis (LDA) and neural networks (NNET) are developed to determine the probabilities of each node having a leak inside a WDN; (2) Bayesian temporal reasoning is applied afterwards to rescale the probabilities of each possible leak location at each time step after a leak is detected, with the aim of improving the localization accuracy. As an initial illustration, the hypothetical benchmark Hanoi district metered area (DMA) is used as the case study to test the performance of the proposed approach. Using the fitting accuracy and average topological distance (ATD) as performance indicators, the preliminary results reaches more than 80% accuracy in the best cases.Peer ReviewedPostprint (published version

Reconstructing diffusion fields sampled with a network of arbitrarily distributed sensors

Sensor networks are becoming increasingly prevalent for monitoring physical phenomena of interest. For such wireless sensor network applications, knowledge of node location is important. Although a uniform sensor distribution is common in the literature, it is normally difficult to achieve in reality. Thus we propose a robust algorithm for reconstructing two-dimensional diffusion fields, sampled with a network of arbitrarily placed sensors. The two-step method proposed here is based on source parameter estimation: in the first step, by properly combining the field sensed through well-chosen test functions, we show how Prony's method can reveal locations and intensities of the sources inducing the field. The second step then uses a modification of the Cauchy-Schwarz inequality to estimate the activation time in the single source field. We combine these steps to give a multi-source field estimation algorithm and carry out extensive numerical simulations to evaluate its performance

Damage identification in structural health monitoring: a brief review from its implementation to the Use of data-driven applications

The damage identification process provides relevant information about the current state of a structure under inspection, and it can be approached from two different points of view. The first approach uses data-driven algorithms, which are usually associated with the collection of data using sensors. Data are subsequently processed and analyzed. The second approach uses models to analyze information about the structure. In the latter case, the overall performance of the approach is associated with the accuracy of the model and the information that is used to define it. Although both approaches are widely used, data-driven algorithms are preferred in most cases because they afford the ability to analyze data acquired from sensors and to provide a real-time solution for decision making; however, these approaches involve high-performance processors due to the high computational cost. As a contribution to the researchers working with data-driven algorithms and applications, this work presents a brief review of data-driven algorithms for damage identification in structural health-monitoring applications. This review covers damage detection, localization, classification, extension, and prognosis, as well as the development of smart structures. The literature is systematically reviewed according to the natural steps of a structural health-monitoring system. This review also includes information on the types of sensors used as well as on the development of data-driven algorithms for damage identification.Peer ReviewedPostprint (published version

PHALANX: Expendable Projectile Sensor Networks for Planetary Exploration

Technologies enabling long-term, wide-ranging measurement in hard-to-reach areas are a critical need for planetary science inquiry. Phenomena of interest include flows or variations in volatiles, gas composition or concentration, particulate density, or even simply temperature. Improved measurement of these processes enables understanding of exotic geologies and distributions or correlating indicators of trapped water or biological activity. However, such data is often needed in unsafe areas such as caves, lava tubes, or steep ravines not easily reached by current spacecraft and planetary robots. To address this capability gap, we have developed miniaturized, expendable sensors which can be ballistically lobbed from a robotic rover or static lander - or even dropped during a flyover. These projectiles can perform sensing during flight and after anchoring to terrain features. By augmenting exploration systems with these sensors, we can extend situational awareness, perform long-duration monitoring, and reduce utilization of primary mobility resources, all of which are crucial in surface missions. We call the integrated payload that includes a cold gas launcher, smart projectiles, planning software, network discovery, and science sensing: PHALANX. In this paper, we introduce the mission architecture for PHALANX and describe an exploration concept that pairs projectile sensors with a rover mothership. Science use cases explored include reconnaissance using ballistic cameras, volatiles detection, and building timelapse maps of temperature and illumination conditions. Strategies to autonomously coordinate constellations of deployed sensors to self-discover and localize with peer ranging (i.e. a local GPS) are summarized, thus providing communications infrastructure beyond-line-of-sight (BLOS) of the rover. Capabilities were demonstrated through both simulation and physical testing with a terrestrial prototype. The approach to developing a terrestrial prototype is discussed, including design of the launching mechanism, projectile optimization, micro-electronics fabrication, and sensor selection. Results from early testing and characterization of commercial-off-the-shelf (COTS) components are reported. Nodes were subjected to successful burn-in tests over 48 hours at full logging duty cycle. Integrated field tests were conducted in the Roverscape, a half-acre planetary analog environment at NASA Ames, where we tested up to 10 sensor nodes simultaneously coordinating with an exploration rover. Ranging accuracy has been demonstrated to be within +/-10cm over 20m using commodity radios when compared to high-resolution laser scanner ground truthing. Evolution of the design, including progressive miniaturization of the electronics and iterated modifications of the enclosure housing for streamlining and optimized radio performance are described. Finally, lessons learned to date, gaps toward eventual flight mission implementation, and continuing future development plans are discussed

Perturbation Analysis for Robust Damage Detection with Application to Multifunctional Aircraft Structures

The most widely known form of multifunctional aircraft structure is smart structures for structural health monitoring (SHM). The aim is to provide automated systems whose purposes are to identify and to characterize possible damage within structures by using a network of actuators and sensors. Unfortunately, environmental and operational variability render many of the proposed damage detection methods difficult to successfully be applied. In this paper, an original robust damage detection approach using output-only vibration data is proposed. It is based on independent component analysis and matrix perturbation analysis, where an analytical threshold is proposed to get rid of statistical assumptions usually performed in damage detection approach. The effectiveness of the proposed SHM method is demonstrated numerically using finite element simulations and experimentally through a conformal load-bearing antenna structure and composite plates instrumented with piezoelectric ceramic materials.FUI MSIE (Pole Astech

Distributed Service Discovery for Heterogeneous Wireless Sensor Networks

Service discovery in heterogeneous Wireless Sensor Networks is a challenging research objective, due to the inherent limitations of sensor nodes and their extensive and dense deployment. The protocols proposed for ad hoc networks are too heavy for sensor environments. This paper presents a resourceaware solution for the service discovery problem, which exploits the heterogeneous nature of the sensor network and alleviates the high-density problem from the flood-based approaches. The idea is to organize nodes into clusters, based on the available resources and the dynamics of nodes. The clusterhead nodes act as a distributed directory of service registrations. Service discovery messages are exchanged among the nodes in the distributed directory. The simulation results show the performance of the service discovery protocol in heterogeneous dense environments

Improving Bacteria Controller Efficiency

We present a novel approach that would enable the placement of dynamic sensor platforms in the most optimal areas for data collection in an environment of any size. Our approach would ensure that more sensors are placed in areas that contain interesting data and less in areas with little or no data. In this paper, we use a bacteria controller to navigate the environment in the search of interesting data and show that the addition of a flocking algorithm improves the chances of finding data