TY - JOUR
T1 - On Event Detection and Localization in Acyclic Flow Networks
AU - Suresh, Mahima Agumbe
AU - Stoleru, Radu
AU - Zechman, Emily M.
AU - Shihada, Basem
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2013/5
Y1 - 2013/5
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/348541
UR - http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6425511
UR - http://www.scopus.com/inward/record.url?scp=84887127965&partnerID=8YFLogxK
U2 - 10.1109/TSMCA.2012.2210411
DO - 10.1109/TSMCA.2012.2210411
M3 - Article
SN - 2168-2216
VL - 43
SP - 708
EP - 723
JO - IEEE Transactions on Systems, Man, and Cybernetics: Systems
JF - IEEE Transactions on Systems, Man, and Cybernetics: Systems
IS - 3
ER -