You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Searching for the Minimum Failures that Can Cause a Hazard in a Wireless Sensor Network

Fulltext:


Authors:

Iain Bate, Mark Fairbairn

Publication Type:

Conference/Workshop Paper

Venue:

Genetic and Evolutionary Computation Conference

DOI:

10.1145/2463372.2463520


Abstract

Wireless Sensor Networks (WSN) are now being used in a range of applications, many of which are critical systems, e.g. monitoring assisted living facilities or for fire detection systems which is the example used in this paper. For critical systems it is important to be able to determine the minimum number of failures that can cause a hazard to occur. This is normally a manual, human intensive, task. This paper presents a novel application of search to both the WSN and safety domains; searching for combinations of failures that can cause a hazard and then reducing these to the minimum possible using a combination of automated search and manual refinement. Due to the size and complexity of the search problem, a parallel search algorithm is designed that runs on available compute resources with the results being processed using R.

Bibtex

@inproceedings{Bate2974,
author = {Iain Bate and Mark Fairbairn},
title = {Searching for the Minimum Failures that Can Cause a Hazard in a Wireless Sensor Network},
isbn = {978-1-4503-1963-8},
month = {July},
year = {2013},
booktitle = {Genetic and Evolutionary Computation Conference},
url = {http://www.es.mdu.se/publications/2974-}
}