The Sensor Network Workbench: Towards Functional Specification, Verification and Deployment of Constrained Distributed Systems

As the commoditization of sensing, actuation and communication hardware increases, so does the potential for dynamically tasked sense and respond networked systems (i.e., Sensor Networks or SNs) to replace existing disjoint and inflexible special-purpose deployments (closed-circuit security video, anti-theft sensors, etc.). While various solutions have emerged to many individual SN-centric challenges (e.g., power management, communication protocols, role assignment), perhaps the largest remaining obstacle to widespread SN deployment is that those who wish to deploy, utilize, and maintain a programmable Sensor Network lack the programming and systems expertise to do so. The contributions of this thesis centers on the design, development and deployment of the SN Workbench (snBench). snBench embodies an accessible, modular programming platform coupled with a flexible and extensible run-time system that, together, support the entire life-cycle of distributed sensory services. As it is impossible to find a one-size-fits-all programming interface, this work advocates the use of tiered layers of abstraction that enable a variety of high-level, domain specific languages to be compiled to a common (thin-waist) tasking language; this common tasking language is statically verified and can be subsequently re-translated, if needed, for execution on a wide variety of hardware platforms. snBench provides: (1) a common sensory tasking language (Instruction Set Architecture) powerful enough to express complex SN services, yet simple enough to be executed by highly constrained resources with soft, real-time constraints, (2) a prototype high-level language (and corresponding compiler) to illustrate the utility of the common tasking language and the tiered programming approach in this domain, (3) an execution environment and a run-time support infrastructure that abstract a collection of heterogeneous resources into a single virtual Sensor Network, tasked via this common tasking language, and (4) novel formal methods (i.e., static analysis techniques) that verify safety properties and infer implicit resource constraints to facilitate resource allocation for new services. This thesis presents these components in detail, as well as two specific case-studies: the use of snBench to integrate physical and wireless network security, and the use of snBench as the foundation for semester-long student projects in a graduate-level Software Engineering course.

Service Provisioning in Mobile Networks Through Distributed Coordinated Resource Management

The pervasiveness of personal computing platforms offers an unprecedented opportunity to deploy large-scale services that are distributed over wide physical spaces. Two major challenges face the deployment of such services: the often resource-limited nature of these platforms, and the necessity of preserving the autonomy of the owner of these devices. These challenges preclude using centralized control and preclude considering services that are subject to performance guarantees. To that end, this thesis advances a number of new distributed resource management techniques that are shown to be effective in such settings, focusing on two application domains: distributed Field Monitoring Applications (FMAs), and Message Delivery Applications (MDAs). In the context of FMA, this thesis presents two techniques that are well-suited to the fairly limited storage and power resources of autonomously mobile sensor nodes. The first technique relies on amorphous placement of sensory data through the use of novel storage management and sample diffusion techniques. The second approach relies on an information-theoretic framework to optimize local resource management decisions. Both approaches are proactive in that they aim to provide nodes with a view of the monitored field that reflects the characteristics of queries over that field, enabling them to handle more queries locally, and thus reduce communication overheads. Then, this thesis recognizes node mobility as a resource to be leveraged, and in that respect proposes novel mobility coordination techniques for FMAs and MDAs. Assuming that node mobility is governed by a spatio-temporal schedule featuring some slack, this thesis presents novel algorithms of various computational complexities to orchestrate the use of this slack to improve the performance of supported applications. The findings in this thesis, which are supported by analysis and extensive simulations, highlight the importance of two general design principles for distributed systems. First, a-priori knowledge (e.g., about the target phenomena of FMAs and/or the workload of either FMAs or DMAs) could be used effectively for local resource management. Second, judicious leverage and coordination of node mobility could lead to significant performance gains for distributed applications deployed over resource-impoverished infrastructures.

Principles of Safe Policy Routing Dynamics

We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the notion of causation chains where the route flap at one node causes a flap at the next node along the chain. Using DPR, we model the Gao-Rexford (economic) guidelines that guarantee the safety (i.e., convergence) of policy routing. We establish three principles of safe policy routing dynamics. The non-interference principle provides insight into which ASes can directly induce route changes in one another. The single cycle principle and the multi-tiered cycle principle provide insight into how cycles of routing updates can manifest in any network. We develop INTERFERENCEBEAT, a distributed algorithm that propagates a small token along causation chains to check adherence to these principles. To enhance the diagnosis power of INTERFERENCEBEAT, we model four violations of the Gao-Rexford guidelines (e.g., transiting between peers) and characterize the resulting dynamics.

The What-And-Where Filter: A Spatial Mapping Neural Network for Object Recognition and Image Understanding

The What-and-Where filter forms part of a neural network architecture for spatial mapping, object recognition, and image understanding. The Where fllter responds to an image figure that has been separated from its background. It generates a spatial map whose cell activations simultaneously represent the position, orientation, ancl size of all tbe figures in a scene (where they are). This spatial map may he used to direct spatially localized attention to these image features. A multiscale array of oriented detectors, followed by competitve and interpolative interactions between position, orientation, and size scales, is used to define the Where filter. This analysis discloses several issues that need to be dealt with by a spatial mapping system that is based upon oriented filters, such as the role of cliff filters with and without normalization, the double peak problem of maximum orientation across size scale, and the different self-similar interpolation properties across orientation than across size scale. Several computationally efficient Where filters are proposed. The Where filter rnay be used for parallel transformation of multiple image figures into invariant representations that are insensitive to the figures' original position, orientation, and size. These invariant figural representations form part of a system devoted to attentive object learning and recognition (what it is). Unlike some alternative models where serial search for a target occurs, a What and Where representation can he used to rapidly search in parallel for a desired target in a scene. Such a representation can also be used to learn multidimensional representations of objects and their spatial relationships for purposes of image understanding. The What-and-Where filter is inspired by neurobiological data showing that a Where processing stream in the cerebral cortex is used for attentive spatial localization and orientation, whereas a What processing stream is used for attentive object learning and recognition.

Simulation of 2-D metal cutting by means of a distributed algorithm

Temperature distributions involved in some metal-cutting or surface-milling processes may be obtained by solving a non-linear inverse problem. A two-level concept on parallelism is introduced to compute such temperature distribution. The primary level is based on a problem-partitioning concept driven by the nature and properties of the non-linear inverse problem. Such partitioning results to a coarse-grained parallel algorithm. A simplified 2-D metal-cutting process is used as an example to illustrate the concept. A secondary level exploitation of further parallel properties based on the concept of domain-data parallelism is explained and implemented using MPI. Some experiments were performed on a network of loosely coupled machines consist of SUN Sparc Classic workstations and a network of tightly coupled processors, namely the Origin 2000.

Matching search in fractal video compression and its parallel implementation in distributed computing environments

Fractal video compression is a relatively new video compression method. Its attraction is due to the high compression ratio and the simple decompression algorithm. But its computational complexity is high and as a result parallel algorithms on high performance machines become one way out. In this study we partition the matching search, which occupies the majority of the work in a fractal video compression process, into small tasks and implement them in two distributed computing environments, one using DCOM and the other using .NET Remoting technology, based on a local area network consists of loosely coupled PCs. Experimental results show that the parallel algorithm is able to achieve a high speedup in these distributed environments.

Scalable and efficient graph colouring in 3 dimensions using emergence engineering principles

This paper describes ways in which emergence engineering principles can be applied to the development of distributed applications. A distributed solution to the graph-colouring problem is used as a vehicle to illustrate some novel techniques. Each node acts autonomously to colour itself based only on its local view of its neighbourhood, and following a simple set of carefully tuned rules. Randomness breaks symmetry and thus enhances stability. The algorithm has been developed to enable self-configuration in wireless sensor networks, and to reflect real-world configurations the algorithm operates with 3 dimensional topologies (reflecting the propagation of radio waves and the placement of sensors in buildings, bridge structures etc.). The algorithm’s performance is evaluated and results presented. It is shown to be simultaneously highly stable and scalable whilst achieving low convergence times. The use of eavesdropping gives rise to low interaction complexity and high efficiency in terms of the communication overheads.

Legitimising Quality Principles through Critical Incidents in Organisational Development

Purpose – The aim of this paper is to analyse how critical incidents or organisational crises can be used to check and legitimise quality management change efforts in relation to the fundamental principles of quality. Design/methodology/approach – Multiple case studies analyse critical incidents that demonstrate the importance of legitimisation, normative evaluation and conflict constructs in this process. A theoretical framework composed of these constructs is used to guide the analysis. Findings – The cases show that the critical incidents leading to the legitimisation of continuous improvement (CI) were diverse. However all resulted in the need for significant ongoing cost reduction to achieve or retain competitiveness. In addition, attempts at legitimising CI were coupled with attempts at destabilising the existing normative practice. This destabilisation process, in some cases, advocated supplementing the existing approaches and in others replacing them. In all cases, significant conflict arose in these legitimising and normative evaluation processes. Research limitations/implications – It is suggested that further research could involve a critical analysis of existing quality models, tools and techniques in relation to how they incorporate, and are built upon, fundamental quality management principles. Furthermore, such studies could probe the dangers of quality curriculum becoming divorced from business and market reality and thus creating a parallel existence. Practical implications – As demonstrated by the case studies, models, tools and techniques are not valued for their intrinsic value but rather for what they will contribute to addressing the business needs. Thus, in addition to being an opportunity for quality management, critical incidents present a challenge to the field. Quality management must be shown to make a contribution in these circumstances. Originality/value – This paper is of value to both academics and practitioners.

Phase and space resolved optical emission spectroscopic investigations of an inductively coupled RF plasma using an imaging acousto-optic spectrometer

A novel acousto-optic spectrometer (IfU Diagnostic Systems GmbH) for 2-dimensional (2D) optical emission spectroscopy with high spectral resolution has been developed. The spectrometer is based on acousto-optic tuneable filter technology with fast random wavelength access. Measurements for characterisation of the imaging quality, the spatial resolution, and the spectral resolution are presented. The applicability for 2D-space and phase resolved optical emission spectroscopy (2D-PROES) is shown. 2D-PROES has been applied to an inductively coupled plasma with radio frequency excitation at 13.56 MHz.

Nested entangled states for distributed quantum channels

We find a coupling-strength configuration for a linear chain of N spins which gives rise to simultaneous multiple Bell states. We suggest a way such an interesting entanglement pattern can be used in order to distribute maximally entangled channels to remote locations and generate multipartite entanglement with a minimum-control approach. Our proposal thus provides a way to achieve the core resources in distributed information processing. The schemes we describe can be efficiently tested in chains of coupled cavities interacting with three-level atoms.

Polarisation independent bandpass FSS

The spectral transmittance of a frequency selective surface (FSS), which consists of two free-standing arrays of short-circuited nested annular slots, is presented. The FSS was designed to provide a minimum of 20 dB isolation between the frequency bands 316.5-325.5 and 349.5-358.5 GHz when the filter operates in the TE and TM planes at 45 degrees incidence. Experimental results, which are in close agreement with the computed transmission coefficients, show that the maximum insertion loss is 0.9 dB, and the minimum cross-polar discrimination is at least 21 dB in the passbands. The FSS yields virtually identical spectral responses in the two polarisation planes over the frequency range 315-359 GHz.

Compact ridged-waveguide bandpass filters and diplexers

A ridged-waveguide diplexer incorporating integrated compact ridged-waveguide filters and a ridged-waveguide T-junction is presented. The compact size of the filter is achieved by integrating of bandpass periodic filter, and a low-pass structure is used in order to suppress spurious responses. Simulation using the mode-matching method has been carried out for ridge-waveguide filters and T junctions and the results are presented. The measured results are in good agreement with the simulated results. (C) 2004 Wiley Periodicals, Inc.

Design of asymmetrical RF and microwave bandpass filters by computer optimization

This paper presents an optimization-based approach to the design of asymmetrical filter structures having the maximum number of return- or insertion-loss ripples in the passband such as those based upon Chebyshev function prototypes. The proposed approach. has the following advantages over the general purpose optimization techniques adopted previously such as: less frequency sampling is required, optimization is carried out with respect to the Chebyshev (or minimax) criterion, the problem of local minima does not arise, and optimization is usually only required for the passband. When implemented around an accurate circuit simulation, the method can be used to include all the effects of discontinuities, junctions, fringing, etc. to reduce the amount of tuning required in the final filter. The design of asymmetrical ridged-waveguide bandpass filters is considered as an example. Measurements on a fabricated filter confirm the accuracy of the design procedure.

Co-design of Distributed Systems Using Skeleton and Autonomic Management Abstractions

We discuss how common problems arising with multi/many core distributed architectures can he effectively handled through co-design of parallel/distributed programming abstractions and of autonomic management of non-functional concerns. In particular, we demonstrate how restricted patterns (or skeletons) may be efficiently managed by rule-based autonomic managers. We discuss the basic principles underlying pattern+manager co-design, current implementations inspired by this approach and some result achieved with proof-or-concept, prototype.

Nonlinear excitations in strongly-coupled plasma lattices: envelope solitons, kinks and intrinsic localized modes

Ensembles of charged particles (plasmas) are a highly complex form of matter, most often modeled as a many-body system characterized by weak inter-particle interactions (electrostatic coupling). However, strongly-coupled plasma configurations have recently been produced in laboratory, either by creating ultra-cold plasmas confined in a trap or by manipulating dusty plasmas in discharge experiments. In this paper, the nonlinear aspects involved in the motion of charged dust grains in a one-dimensional plasma monolayer (crystal) are discussed. Different types of collective excitations are reviewed, and characteristics and conditions for their occurrence in dusty plasma crystals are discussed, in a quasi-continuum approximation. Dust crystals are shown to support nonlinear kink-shaped supersonic solitary longitudinal excitations, as well as modulated envelope localized modes associated with longitudinal and transverse vibrations. Furthermore, the possibility for intrinsic localized modes (ILMs) — Discrete Breathers (DBs) — to occur is investigated, from first principles. The effect of mode-coupling is also briefly considered. The relation to previous results on atomic chains, and also to experimental results on strongly-coupled dust layers in gas discharge plasmas, is briefly discussed.