This paper explores the idea of smart building evacuation when evacuees can belong to different categories with respect to their ability to move and their health conditions. This leads to new algorithms that use the Cognitive Packet Network concept to tailor different quality of service needs to different evacuees. These ideas are implemented in a simulated environment and evaluated with regard to their effectiveness.
Navigation algorithms proposed previously search for the shortest or the safest path and in @cite_32 a self-organizing sensor network is proposed to guide a user (robots, people, unmanned aerial vehicle, etc.) through the safest path by using artificial potential fields'' @cite_30 . An attractive force pulls users to the destination while repulsive forces from dangerous zones push them away. In @cite_25 a temporally ordered routing algorithm @cite_22 routes evacuees to exits through safer paths. A navigation map is manually defined to avoid impractical paths and each sensor is assigned with an altitude with respect to its hops to the nearest exit. Combining the definition of effective length with Dijkstra's algorithm, @cite_26 presents a decentralized evacuation system with decision nodes (DNs) and sensor nodes (SNs) to compute the shortest routes in real time, while opportunistic communications @cite_28 based emergency evacuation systems @cite_29 have the advantage of being more robust to network attacks @cite_9 that often accompany emergencies caused by malicious acts.
@cite_30 @cite_26 @cite_22 @cite_28 @cite_29 @cite_9 @cite_32 @cite_25
2059040514 2150843819 2135035173 2032094375 2159494053 1995405963 2039252979 2124941493
This paper is a survey of research on autonomous search strategies which originate in engineering and biology. Our motivation is to identify methods of search in an essentially two-dimensional Euclidean space, which can be applied to the area of demining. Such search strategies are based on spatio-temporal distributions. These distributions may be known in advance, because of prior intelligence or through the use of remote sensing, or they may be the result of on-line gathering of information as the search progresses, or of both. We first review the literature on search and coordination which emanates from the field of robotics, we then summarize significant research in the field of animal search, and also discuss relevant results in robotics which are inspired by animal behavior. The evacuation of a building is a challenging problem, since the evacuees most of the times do not know or do not follow the optimal evacuation route. Especially during an ongoing hazard present in the building, finding the best evacuation route becomes harder as the conditions along the paths change in the course of the evacuation procedure. In this paper we propose a distributed system that will compute the best evacuation routes in real-time, while a hazard is spreading inside the building. The system is composed of a network of decision nodes and sensor nodes, positioned in specific locations inside the building. The recommendations of the decision nodes are computed in a distributed manner, at each of the decision nodes, which then communicate them to evacuees or rescue personnel located in their vicinity. We evaluate our proposed system in various emergency scenarios, using a multi-agent simulation platform for Building Evacuation. Our results indicate that the presence of the system improves the outcome of the evacuation with respect to the evacuation time and the injury level of the evacuees. We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals. The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks. In these networks, the protocol's reaction to link failures typically involves only a localized "single pass" of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocol's high degree of adaptivity. This desirable behavior is achieved through the novel use of a "physical or logical clock" to establish the "temporal order" of topological change events which is used to structure (or order) the algorithm's reaction to topological changes. We refer to the protocol as the temporally-ordered routing algorithm (TORA). Opportunistic networks are one of the most interesting evolutions of MANETs. In opportunistic networks, mobile nodes are enabled to communicate with each other even if a route connecting them never exists. Furthermore, nodes are not supposed to possess or acquire any knowledge about the network topology, which (instead) is necessary in traditional MANET routing protocols. Routes are built dynamically, while messages are en route between the sender and the destination(s), and any possible node can opportunistically be used as next hop, provided it is likely to bring the message closer to the final destination. These requirements make opportunistic networks a challenging and promising research field. In this article we survey the most interesting case studies related to opportunistic networking and discuss and organize a taxonomy for the main routing and forwarding approaches in this challenging environment. We finally envision further possible scenarios to make opportunistic networks part of the next-generation Internet Opportunistic communications (oppcomms) use low-cost human wearable mobile nodes allowing the exchange of packets at a close range of a few to some tens of meters with limited or no infrastructure. Typically cheap pocket devices which are IEEE 802.15.4-2006 compliant can be used and they can communicate at 2m to 10m range, with local computational capabilities and some local memory. In this paper we consider the application of such devices to emergency situations when other means of communication have broken down. This paper evaluates whether oppcomms can improve the outcome of emergency evacuation in directing civilians safely. We describe an autonomous emergency support system (ESS) based on oppcomms to support evacuation of civilians in a built environment such as a building or supermarket. The proposed system uses a fixed infrastructure of sensor nodes (SNs) to monitor the environment. Hazard information obtained via SNs is disseminated to the individuals, and they spread among the people who are located in this built environment using oppcomm devices carried by these people. The information received by these people can then guide them safely to the exits as the emergency situation evolves over time. We evaluate our scheme using a distributed multi-agent building evacuation simulator (DBES) in the context of evacuation scenarios of a multi-storey office building in the presence of a fire that is spreading. The results show the degree of improvement that the oppcomms can offer. c � 2011 Published by Elsevier Ltd. Denial of service (DoS) attacks are a serious security threat for Internet based organisations, and effective methods are needed to detect an attack and defend the nodes being attacked in real time. We propose an autonomic approach to DoS defence based on detecting DoS flows, and adaptively dropping attacking packets upstream from the node being attacked using trace-back of the attacking flows. Our approach is based on the Cognitive Packet Network infrastructure which uses smart packets to select paths based on Quality of Service. This approach allows paths being used by a flow (including an attacking flow) to be identified, and also helps legitimate flows to find robust paths during an attack. We evaluate the proposed approach using a mathematical model, as well as using experiments in a laboratory test-bed. We then suggest a more sophisticated defence framework based on authenticity tests as part of the detection mechanism, and on assigning priorities to incoming traffic and rate-limiting it on the basis of the outcome of these tests. We develop distributed algorithms for self-organizing sensor networks that respond to directing a target through a region. The sensor network models the danger levels sensed across its area and has the ability to adapt to changes. It represents the dangerous areas as obstacles. A protocol that combines the artificial potential field of the sensors with the goal location for the moving object guides the object incrementally across the network to the goal, while maintaining the safest distance to the danger areas. We give the analysis to the protocol and report on hardware experiments using a physical sensor network consisting of Mote sensors. In an emergency, wireless network sensors combined with a navigation algorithm could help safely guide people to a building exit while helping them avoid hazardous areas. We propose a distributed navigation algorithm for emergency situations. At normal time, sensors monitor the environment. When the sensors detect emergency events, our protocol quickly separates hazardous areas from safe areas, and the sensors establish escape paths. Simulation and implementation results show that our scheme achieves navigation safety and quick convergence of the navigation directions. We based our protocol on the temporally ordered routing algorithm for mobile ad hoc networks. TORA assigns mobile nodes temporally ordered sequence numbers to support multipath routing from a source to a specific destination node