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.
This paper is a survey of certain known results concerning networks of queues. The choice of the topics presented has been made with special emphasis on mathematical results which can be applied to the analysis and synthesis of mathematical or simulation models of complex computer systems in which an ensemble of resources is shared among a set of user programs. The subjects covered include the Jackson, and Gordon and Newell theorems; the work-rate theorems of Chang, Lavenberg and Traiger; the Baskett, Chandy, Muntz, Palacios results. We also discuss in a unified manner problems related to Poisson processes in queueing networks. Companion papers (Parts II, III) will present results concerning approximations to queueing networks and some of their applications to computer system performance evaluation.  EVACNET+ is a user-friendly interactive computer program that allows the modeling of emergency building evacuations. An EVACNET+ model is a network consisting of a set of nodes connected by arcs. The nodes represent building components such as rooms, halls, landings, stairs and lobbies. The arcs represent the passageways between the building components. The program identifies optimal evacuation plans for user defined buildings. 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).  Recently, Wireless Sensor Networks (WSNs) have been widely discussed in many applications. In this paper, we propose a novel Three-Dimensional (3D) emergency service that aims to guide people to safe places when emergencies happen. At normal time, the network is responsible for monitoring the environment. When emergency events are detected, the network can adaptively modify its topology to ensure transportation reliability, quickly identify hazardous regions that should be avoided and find safe navigation paths that can lead people to exits. In particular, the structures of Three-Dimensional buildings are taken into account in our design. Simulation results shows that our protocols can adapt emergencies quickly at low message cost and can find safer paths to exits than existing results 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.    A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is de2ned by a dynamic network with several sources and sinks; each source has a speci2ed supply and each sink has a specified demand. The problem is to send exactly the right amount of 6ow out of each source and into each sink in the minimum overall time.Variations of the quickest transshipment problem have been studied extensively; the special case of the problem with a single sink is commonly used to model building evacuation. Similar dynamic network flow problems have numerous other applications; in some of these, the capacities are small integers and it is important to find integral flows. There are no polynomial-time algorithms known for most of these problems.In this paper we give the first polynomial-time algorithm for the quickest transshipment problem. Our algorithm provides an integral optimum flow. Previously, the quickest transshipment problem could only be solved efficiently in the special case of a single source and single sink. The objective of this study is the development of a computer simulation model for pedestrian movement in architectural and urban space. The characteristic of the model is the ability to visualize the movement of each pedestrian in a plan as an animation. So architects and designers can easily find and understand the problems in their design projects. In this model, the movement of each pedestrian is simulated by the motion of a magnetized object in a magnetic field. Positive magnetic pole is given to each pedestrian and obstacles like walls and columns. Negative magnetic pole is located at the goal of pedestrians. Each pedestrian moves to his goal by the attractive force caused by the negative magnetic pole at his goal, avoiding collisions with other pedestrians and obstacles by repulsive forces caused by the positive magnetic poles. The effectiveness of the simulation model is shown by the following two kinds of simulation examples. (1) Evacuation from an office building In this model pedestrians walk along the route from each starting point to the exit in case of evacuation. The example shows the places where stagnations and heavy congestions occur, and designers can see if the evacuation routes are appropriate. (2) Movement of pedestrians in queue spaces Three types of queuing behavior is classified in this model: movement in front of counters, movement passing through ratches, and movement of getting on and off in elevator halls. Simulation examples in a railway station and in a main floor of a resort hotel are shown where several kinds of queue spaces are included and complicated movements of hundreds of pedestrians occur.  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