In this paper security systems deployed over an area are regarded abstractly as a diagram of security network. We propose the Neyman-Pearson protection model for security systems, which can be used to determine the protection probability of a security system and find the weakest breach path of a security network. We present the weakest breach path problem formulation, which is defined by the breach protection probability of an unauthorized target passing through a guard field, and provide a solution for this problem by using the Dijkstra’s shortest path algorithm. Finally we study the variation of the breach protection probability with the change of the parameters of the model.
展开▼