Abstract
The Sensor Location Partial and Full Observability Problems consist in determining the best placement of sensors on a network to allow partial or full observability of a given set of flows of interest in the network (i.e., either Origin–Destination flows, or route flows, or link flows, or a combination of them), respectively. We present the first exact algorithm to optimally solve both the problems when the sensors to be located are counting sensors. The approach is an implicit hitting set based algorithm which uses a novel formulation of the addressed problems able to overcome several limitations of the existing approaches. The method is applied on some real-case network examples taken from the literature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
