Intelligent Evacuation Sign Control Mechanism in IoT-Enabled Multi-Floor Multi-Exit Buildings.

In contemporary evacuation systems, the evacuation sign typically points fixedly towards the nearest emergency exit, providing guidance to evacuees. However, this static approach may not effectively respond to the dynamic nature of a rapidly evolving fire situation, in particular if the closest emergency exit is compromised by fire. This paper introduces an intelligent evacuation sign control mechanism that leverages smoke and temperature sensors to dynamically adjust the direction of evacuation signs, ensuring evacuees are guided to the quickest and safest emergency exit. The proposed mechanism is outlined through a rigorous mathematical formulation, and an ESP heuristic is devised to determine temperature-safe, smoke-safe, and congestion-aware evacuation paths for each sign. This algorithm then adjusts the direction light on the evacuation sign to align with the identified evacuation path. To validate the effectiveness of this approach, fire simulations using FDS software 6.7.1 were conducted in the Taipei 101 shopping mall. Temperature and smoke data from sensor nodes were utilized by the ESP algorithm, demonstrating superior performance compared to that of the existing FEL algorithm. Specifically, the ESP algorithm exhibited a notable increase in the probability of evacuation success, surpassing the FEL algorithm by up to 34% in methane fire scenarios and 14% in PVC fire scenarios. The significance of this improvement is more pronounced in densely congested evacuation scenarios.

Time-Aware and Temperature-Aware Fire Evacuation Path Algorithm in IoT-Enabled Multi-Story Multi-Exit Buildings.

Temperature sensors with a communication capability can help monitor and report temperature values to a control station, which enables dynamic and real-time evacuation paths in fire emergencies. As compared to traditional approaches that identify a one-shot fire evacuation path, in this paper, we develop an intelligent algorithm that can identify time-aware and temperature-aware fire evacuation paths by considering temperature changes at different time slots in multi-story and multi-exit buildings. We first propose a method that can map three-dimensional multi-story multi-exit buildings into a two-dimensional graph. Then, a mathematical optimization model is proposed to capture this time-aware and temperature-aware evacuation path problem in multi-story multi-exit buildings. Six fire evacuation algorithms (BFS, SP, DBFS, TABFS, TASP and TADBFS) are proposed to identify the efficient evacuation path. The first three algorithms that do not address human temperature limit constraints can be used by rescue robots or firemen with fire-proof suits. The last three algorithms that address human temperature limit constraints can be used by evacuees in terms of total time slots and total temperature on the evacuation path. In the computational experiments, the open space building and the Taipei 101 Shopping Mall are all tested to verify the solution quality of these six algorithms. From the computational results, TABFS, TASP and TADBF identify almost the same evacuation path in open space building and the Taipei 101 Shopping Mall. BFS, SP DBFS can locate marginally better results in terms of evacuation time and total temperature on the evacuation path. When considering evacuating a group of evacuees, the computational time of the evacuation algorithm is very important in a time-limited evacuation process. Considering the extreme case of seven fires in eight emergency exits in the Taipei 101 Shopping Mall, the golden window for evacuation is 15 time slots. Only TABFS and TADBFS are applicable to evacuate 1200 people in the Taipei 101 Shopping Mall when one time slot is setting as one minute. The computational results show that the capacity limit for the Taipei 101 Shopping Mall is 800 people in the extreme case of seven fires. In this case, when the number of people in the building is less than 700, TADBFS should be adopted. When the number of people in the building is greater than 700, TABFS can evacuate more people than TADBFS. Besides identifying an efficient evacuation path, another significant contribution of this paper is to identify the best sensor density deployment at large buildings like the Taipei 101 Shopping Mall in considering the fire evacuation.

Novel Visual Sensor Coverage and Deployment in Time Aware PTZ Wireless Visual Sensor Networks.

In this paper, we consider the visual sensor deployment algorithm in Pan-Tilt-Zoom (PTZ) Wireless Visual Sensor Networks (WVSNs). With PTZ capability, a sensor's visual coverage can be extended to reduce the number of visual sensors that need to be deployed. The coverage zone of a visual sensor in PTZ WVSN is composed of two regions, a Direct Coverage Region (DCR) and a PTZ Coverage Region (PTZCR). In the PTZCR, a visual sensor needs a mechanical pan-tilt-zoom operation to cover an object. This mechanical operation can take seconds, so the sensor might not be able to adjust the camera in time to capture the visual data. In this paper, for the first time, we study this PTZ time-aware PTZ WVSN deployment problem. We formulate this PTZ time-aware PTZ WVSN deployment problem as an optimization problem where the objective is to minimize the total visual sensor deployment cost so that each area is either covered in the DCR or in the PTZCR while considering the PTZ time constraint. The proposed Time Aware Coverage Zone (TACZ) model successfully captures the PTZ visual sensor coverage in terms of camera focal range, angle span zone coverage and camera PTZ time. Then a novel heuristic, called Time Aware Deployment with PTZ camera (TADPTZ) algorithm, is proposed to solve the problem. From our computational experiments, we found out that TACZ model outperforms the existing M coverage model under all network scenarios. In addition, as compared to the optimal solutions, the TACZ model is scalable and adaptable to the different PTZ time requirements when deploying large PTZ WVSNs.

A survey on sensor coverage and visual data capturing/processing/transmission in wireless visual sensor networks.

Wireless Visual Sensor Networks (WVSNs) where camera-equipped sensor nodes can capture, process and transmit image/video information have become an important new research area. As compared to the traditional wireless sensor networks (WSNs) that can only transmit scalar information (e.g., temperature), the visual data in WVSNs enable much wider applications, such as visual security surveillance and visual wildlife monitoring. However, as compared to the scalar data in WSNs, visual data is much bigger and more complicated so intelligent schemes are required to capture/process/ transmit visual data in limited resources (hardware capability and bandwidth) WVSNs. WVSNs introduce new multi-disciplinary research opportunities of topics that include visual sensor hardware, image and multimedia capture and processing, wireless communication and networking. In this paper, we survey existing research efforts on the visual sensor hardware, visual sensor coverage/deployment, and visual data capture/ processing/transmission issues in WVSNs. We conclude that WVSN research is still in an early age and there are still many open issues that have not been fully addressed. More new novel multi-disciplinary, cross-layered, distributed and collaborative solutions should be devised to tackle these challenging issues in WVSNs.

Delay QoS and MAC Aware Energy-Efficient Data-Aggregation Routing in Wireless Sensor Networks.

By eliminating redundant data flows, data aggregation capabilities in wireless sensor networks could transmit less data to reduce the total energy consumption. However, additional data collisions incur extra data retransmissions. These data retransmissions not only increase the system energy consumption, but also increase link transmission delays. The decision of when and where to aggregate data depends on the trade-off between data aggregation and data retransmission. The challenges of this problem need to address the routing (layer 3) and the MAC layer retransmissions (layer 2) at the same time to identify energy-efficient data-aggregation routing assignments, and in the meantime to meet the delay QoS. In this paper, for the first time, we study this cross-layer design problem by using optimization-based heuristics. We first model this problem as a non-convex mathematical programming problem where the objective is to minimize the total energy consumption subject to the data aggregation tree and the delay QoS constraints. The objective function includes the energy in the transmission mode (data transmissions and data retransmissions) and the energy in the idle mode (to wait for data from downstream nodes in the data aggregation tree). The proposed solution approach is based on Lagrangean relaxation in conjunction with a number of optimization-based heuristics. From the computational experiments, it is shown that the proposed algorithm outperforms existing heuristics that do not take MAC layer retransmissions and the energy consumption in the idle mode into account.

Optimization-based channel constrained data aggregation routing algorithms in multi-radio wireless sensor networks.

In wireless sensor networks, data aggregation routing could reduce the number of data transmissions so as to achieve energy efficient transmission. However, data aggregation introduces data retransmission that is caused by co-channel interference from neighboring sensor nodes. This kind of co-channel interference could result in extra energy consumption and significant latency from retransmission. This will jeopardize the benefits of data aggregation. One possible solution to circumvent data retransmission caused by co-channel interference is to assign different channels to every sensor node that is within each other's interference range on the data aggregation tree. By associating each radio with a different channel, a sensor node could receive data from all the children nodes on the data aggregation tree simultaneously. This could reduce the latency from the data source nodes back to the sink so as to meet the user's delay QoS. Since the number of radios on each sensor node and the number of non-overlapping channels are all limited resources in wireless sensor networks, a challenging question here is to minimize the total transmission cost under limited number of non-overlapping channels in multi-radio wireless sensor networks. This channel constrained data aggregation routing problem in multi-radio wireless sensor networks is an NP-hard problem. I first model this problem as a mixed integer and linear programming problem where the objective is to minimize the total transmission subject to the data aggregation routing, channel and radio resources constraints. The solution approach is based on the Lagrangean relaxation technique to relax some constraints into the objective function and then to derive a set of independent subproblems. By optimally solving these subproblems, it can not only calculate the lower bound of the original primal problem but also provide useful information to get the primal feasible solutions. By incorporating these Lagrangean multipliers as the link arc weight, the optimization-based heuristics are proposed to get energy-efficient data aggregation tree with better resource (channel and radio) utilization. From the computational experiments, the proposed optimization-based approach is superior to existing heuristics under all tested cases.

A Novel Energy-Efficient MAC Aware Data Aggregation Routing in Wireless Sensor Networks.

Embedding data-aggregation capabilities into sensor nodes of wireless networks could save energy by reducing redundant data flow transmissions. Existing research describes the construction of data aggregation trees to maximize data aggregation times in order to reduce data transmission of redundant data. However, aggregation of more nodes on the same node will incur significant collisions. These MAC (Media Access Control) layer collisions introduce additional data retransmissions that could jeopardize the advantages of data aggregation. This paper is the first to consider the energy consumption tradeoffs between data aggregation and retransmissions in a wireless sensor network. By using the existing CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) MAC protocol, the retransmission energy consumption function is well formulated. This paper proposes a novel non-linear mathematical formulation, whose function is to minimize the total energy consumption of data transmission subject to data aggregation trees and data retransmissions. This solution approach is based on Lagrangean relaxation, in conjunction with optimization-based heuristics. From the computational experiments, it is shown that the proposed algorithms could construct MAC aware data aggregation trees that are up to 59% more energy efficient than existing data aggregation algorithms.