DynEvac: Dynamic Evacuation Routing using Wireless Sensors

From Master Projects
Revision as of 09:59, 6 January 2009 by Schut (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

has title::WILLEM: Wireless InteLLigent Evacuation Method
status: finished
Master: project within::Computational Intelligence and Selforganisation
Student name: student name::Willem van Willigen
number: student number::1420674
Start start date:=2008/04/15
End end date:=2008/11/30
Supervisor: Martijn Schut
Second reader: has second reader::Guszti Eiben
Company: has company::TNO Defence, Security and Safety
Poster: has poster::Media:Media:Posternaam.pdf

Signature supervisor



This thesis describes a complete method for dynamic evacuation routing in buildings, using a wireless sensor network. Dynamic evacuation routing is the process of dynamically determining the shortest routes to the exits. The routes are changed in case a fire occurs somewhere. We also present an algorithm for detecting congestions in corridors during evacuation, and a means of providing the people in those congestions an alternative route towards the exit. Each part of the method is descibed extensively: the deployment of the wireless sensor network, the automatic topology learning of the network and the actual evacuation routing methods. We have built a simulation framework in which all types of evacuation routing can be simulated. The results of our experiments were surprising in the sense that dynamic evacuation routing turned out not to be faster than static evacuation routing in every setup; however, we did find out why this is the case. We also performed some experiments on a real wireless sensor network, in order to find out if our automatic configuration method could work. The results look very promising. As a sidestep, we also present an algorithm for mapping the learned topology of the wireless sensor network upon a virtual map, so the network can be visualized. We have shown that this method is guaranteed to find all possible mappings.