Examining the effect of exit separation on aircraft evacuation performance using evacuation modelling techniques: "Is the 60 foot rule relevant?"

This paper examines the influence of exit separation, exit availability and seating configuration on aircraft evacuation efficiency and evacuation time. The purpose of this analysis is to explore how these parameters influence the 60 foot exit separation requirement found in aircraft certification rules. The analysis makes use of the airEXODUS evacuation model and is based on a typical wide-body aircraft cabin section involving two pairs of Type-A exits located at either end of the section with a maximum permissible loading of 220 passengers located between the exits. The analysis reveals that there is a complex relationship between exit separation and evacuation efficiency. Indeed, other factors such as exit flow rate and exit availability are shown to exert a strong influence on critical exit separations. A main finding of this work is that for the cabin section examined under certification conditions, exit separations up to 170 feet will result in approximately constant total evacuation times and average personal evacuation times. This practical exit separation threshold is decreased to 114 feet if another combination of exits is selected. While other factors must also be considered when determining maximum allowable exit separations, these results suggest it is not possible to mandate a maximum exit separation without taking into consideration exit type, exit availability and aircraft configuration. This has implications when determining maximum allowable exit separations for wide and narrow body aircraft. It is also relevant when considering the maximum allowable separation between different exit types on a given aircraft configuration.

Approximation Algorithms for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications

We consider a knapsack problem to minimize a symmetric quadratic function. We demonstrate that this symmetric quadratic knapsack problem is relevant to two problems of single machine scheduling: the problem of minimizing the weighted sum of the completion times with a single machine non-availability interval under the non-resumable scenario; and the problem of minimizing the total weighted earliness and tardiness with respect to a common small due date. We develop a polynomial-time approximation algorithm that delivers a constant worst-case performance ratio for a special form of the symmetric quadratic knapsack problem. We adapt that algorithm to our scheduling problems and achieve a better performance. For the problems under consideration no fixed-ratio approximation algorithms have been previously known.

Quality-of-context driven autonomicity

Optimisation in wireless sensor networks is necessary due to the resource constraints of individual devices, bandwidth limits of the communication channel, relatively high probably of sensor failure, and the requirement constraints of the deployed applications in potently highly volatile environments. This paper presents BioANS, a protocol designed to optimise a wireless sensor network for resource efficiency as well as to meet a requirement common to a whole class of WSN applications - namely that the sensor nodes are dynamically selected on some qualitative basis, for example the quality by which they can provide the required context information. The design of BioANS has been inspired by the communication mechanisms that have evolved in natural systems. The protocol tolerates randomness in its environment, including random message loss, and incorporates a non-deterministic ’delayed-bids’ mechanism. A simulation model is used to explore the protocol’s performance in a wide range of WSN configurations. Characteristics evaluated include tolerance to sensor node density and message loss, communication efficiency, and negotiation latency .

Emergent self-organisation of wireless sensor networks

This paper describes a protocol for dynamically configuring wireless sensor nodes into logical clusters. The concept is to be able to inject an overlay configuration into an ad-hoc network of sensor nodes or similar devices, and have the network configure itself organically. The devices are arbitrarily deployed and have initially have no information whatsoever concerning physical location, topology, density or neighbourhood. The Emergent Cluster Overlay (ECO) protocol is totally self-configuring and has several novel features, including nodes self-determining their mobility based on patterns of neighbour discovery, and that the target cluster size is specified externally (by the sensor network application) and is not directly coupled to radio communication range or node packing density. Cluster head nodes are automatically assigned as part of the cluster configuration process, at no additional cost. ECO is ideally suited to applications of wireless sensor networks in which localized groups of sensors act cooperatively to provide a service. This includes situations where service dilution is used (dynamically identifying redundant nodes to conserve their resources).