Finding sensing coverage and breach paths in wireless sensor networks

Most recent studies on wireless sensor networks have dealt with communication coverage. However, for surveillance wireless sensor networks, sensing coverage is an open research area; it is the subject of the paper. Sensing coverage is determined by applying the Neyman-Pearson detection model, and Dijkstra´s shortest path algorithm is applied to find the weakest breach path. Although individually not enough, breach probability is an appropriate parameter to justify the required number of sensor nodes and the reliability of the network. Analyzing the parameters of the Neyman-Pearson, the most significant parameter is determined to be the false alarm rate. Increasing the false alarm rate decreases the breach probability because the Neyman-Pearson detection model tolerates that number of alarms to be false.