On Event Detection and Localization in Acyclic Flow Networks
- 1 February 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 43 (3) , 708-723
Abstract
Acyclic flow networks, present in many infrastructures of national importance (e.g., oil and gas and water distribution systems), have been attracting immense research interest. Existing solutions for detecting and locating attacks against these infrastructures have been proven costly and imprecise, particularly when dealing with large-scale distribution systems. In this article, to the best of our knowledge, for the first time, we investigate how mobile sensor networks can be used for optimal event detection and localization in acyclic flow networks. We propose the idea of using sensors that move along the edges of the network and detect events (i.e., attacks). To localize the events, sensors detect proximity to beacons, which are devices with known placement in the network. We formulate the problem of minimizing the cost of monitoring infrastructure (i.e., minimizing the number of sensors and beacons deployed) in a predetermined zone of interest, while ensuring a degree of coverage by sensors and a required accuracy in locating events using beacons. We propose algorithms for solving the aforementioned problem and demonstrate their effectiveness with results obtained from a realistic flow network simulator.Keywords
This publication has 24 references indexed in Scilit:
- MISE-PIPE: Magnetic induction-based wireless sensor networks for underground pipeline monitoringAd Hoc Networks, 2011
- PipeProbe2010
- Scalable Localization with Mobility Prediction for Underwater Sensor NetworksIEEE Transactions on Mobile Computing, 2010
- Cost-effective outbreak detection in networks2007
- Virtual Cities for Water Distribution and Infrastructure System Research2007
- PIPENETa wireless sensor network for pipeline monitoring2007
- Energy-efficient target coverage in wireless sensor networks2005
- An analysis of a large scale habitat monitoring application2004
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972