TY - GEN
T1 - Towards Optimal Event Detection and Localization in Acyclic Flow Networks
AU - Agumbe Suresh, Mahima
AU - Stoleru, Radu
AU - Denton, Ron
AU - Zechman, Emily
AU - Shihada, Basem
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2012/1/1
Y1 - 2012/1/1
N2 - Acyclic flow networks, present in many infrastructures of national importance (e.g., oil & 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, especially when dealing with large scale distribution systems. In this paper, 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. Sensor nodes move along the edges of the network and detect events (i.e., attacks) and proximity to beacon nodes with known placement in the network. We formulate the problem of minimizing the cost of monitoring infrastructure (i.e., minimizing the number of sensor and beacon nodes deployed), while ensuring a degree of sensing coverage in a zone of interest and a required accuracy in locating events. We propose algorithms for solving these problems and demonstrate their effectiveness with results obtained from a high fidelity simulator.
AB - Acyclic flow networks, present in many infrastructures of national importance (e.g., oil & 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, especially when dealing with large scale distribution systems. In this paper, 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. Sensor nodes move along the edges of the network and detect events (i.e., attacks) and proximity to beacon nodes with known placement in the network. We formulate the problem of minimizing the cost of monitoring infrastructure (i.e., minimizing the number of sensor and beacon nodes deployed), while ensuring a degree of sensing coverage in a zone of interest and a required accuracy in locating events. We propose algorithms for solving these problems and demonstrate their effectiveness with results obtained from a high fidelity simulator.
UR - http://hdl.handle.net/10754/350280
UR - http://link.springer.com/10.1007/978-3-642-25959-3_13
UR - http://www.scopus.com/inward/record.url?scp=84855735631&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-25959-3_13
DO - 10.1007/978-3-642-25959-3_13
M3 - Conference contribution
SN - 9783642259586
SP - 179
EP - 196
BT - Distributed Computing and Networking
PB - Springer Nature
ER -