Abstract: Large number of sensors in an Emergency navigation can serve as a safety service in emergencies. Recent studies have focused on navigation protocols to safely guide people to exits while helping them avoid hazardous areas. Recently, many applications in wireless sensor networks (WSNs) have been discussed. Navigation with WSNs is the most heated debated ones. Existing navigation algorithms are used to find safe and efficient escape paths for individuals under various environmental dynamics while ignoring possible congestion, cause the individuals rushing for the exits. Previous routing mechanisms for WSN are not well suited for building fires, especially they do not consider critical and dynamic network scenarios. The propose an efficient Shortest Situation-Aware Emergency Navigation Algorithm based ant colony path selection by treating WSNs as navigation infrastructure. It takes the hazard levels of emergencies and the evacuation capabilities of exits into an account and provides the mobile users for the safest navigation paths accordingly. We formally model the situation-aware emergency navigation problem and establish a hazard potential field in the network, which is theoretically free of local minima. It was performed by extensive simulations under WSN environments to evaluate the effectiveness and response time of our work. Simulation result shows that, with our strategy, people in emergency are evacuated by less congestion and much faster to exit is observed.
Keywords: Wireless sensor network; Emergency Saving Navigation system; Ant Colony Optimization Algorithm.