By Topic

Finding sensing coverage and breach paths in wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

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.

Published in:

Signal Processing and Communications Applications Conference, 2004. Proceedings of the IEEE 12th

Date of Conference:

28-30 April 2004