Wireless Communication in Process Control Loop: Requirements Analysis, Industry Practices and Experimental Evaluation

Wireless communication is already used in process automation for process monitoring. The next stage of implementation of wireless technology in industrial applications is for process control. The need for wireless networked control systems has evolved because of the necessity for extensibility, mobility, modularity, fast deployment, and reduced installation and maintenance cost. These benefits are only applicable given that the wireless network of choice can meet the strict requirements of process control applications, such as latency. In this regard, this paper is an effort towards identifying current industry practices related to implementing process control over a wireless link and evaluates the suitability of ISA100.11a network for use in process control through experiments

Dynamic load balancing algorithm complexity

This paper presents a theoretical analysis of the asymptotic complexity inherent in a load balancing algorithm in a loosely-coupled network, where processor communication is achieved by message passing. The load balancing complexity depends on the network topology and the overhead of processor communication for each polling strategy. The best, worst, and average case analysis of the load balancing algorithms for the various polling topologies are presented. The polling strategies considered are local, global, and random polling. The complexity is presented as a function of the number of processors in the network

Automatic vehicle monitoring systems study. Report of phase O. Volume 2: Problem definition and derivation of AVM system selection techniques

A set of planning guidelines is presented to help law enforcement agencies and vehicle fleet operators decide which automatic vehicle monitoring (AVM) system could best meet their performance requirements. Improvements in emergency response times and resultant cost benefits obtainable with various operational and planned AVM systems may be synthesized and simulated by means of special computer programs for model city parameters applicable to small, medium and large urban areas. Design characteristics of various AVM systems and the implementation requirements are illustrated and cost estimated for the vehicles, the fixed sites and the base equipments. Vehicle location accuracies for different RF links and polling intervals are analyzed. Actual applications and coverage data are tabulated for seven cities whose police departments actively cooperated in the study

Low power wireless sensor network for building monitoring

A wireless sensor network is proposed for monitoring buildings to assess earthquake damage. The sensor nodes use custom-developed capacitive MEMS strain and 3D acceleration sensors and a low power readout ASIC for a battery life of up to 12 years. The strain sensors are mounted at the base of the building to measure the settlement and plastic hinge activation of the building after an earthquake. They measure periodically or on-demand from the base station. The accelerometers are mounted at every floor of the building to measure the seismic response of the building during an earthquake. They record during an earthquake event using a combination of the local acceleration data and remote triggering from the base station based on the acceleration data from multiple sensors across the building. A low power network architecture was implemented over an 802.15.4 MAC in the 900MHz band. A custom patch antenna was designed in this frequency band to obtain robust links in real-world conditions

A survey on performance analysis of warehouse carousel systems

This paper gives an overview of recent research on the performance evaluation and design of carousel systems. We discuss picking strategies for problems involving one carousel, consider the throughput of the system for problems involving two carousels, give an overview of related problems in this area, and present an extensive literature review. Emphasis has been given on future research directions in this area

The Aerospace Energy Systems Laboratory: A BITBUS networking application

The NASA Ames-Dryden Flight Research Facility developed a computerized aircraft battery servicing facility called the Aerospace Energy Systems Laboratory (AESL). This system employs distributed processing with communications provided by a 2.4-megabit BITBUS local area network. Customized handlers provide real time status, remote command, and file transfer protocols between a central system running the iRMX-II operating system and ten slave stations running the iRMX-I operating system. The hardware configuration and software components required to implement this BITBUS application are required

Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking

The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade.\ud \ud An important result of that research is the logic CSL (continuous stochastic logic) and its corresponding model checking algorithms. The evaluation of properties expressed in CSL makes it necessary to solve large systems of linear (differential) equations, usually by means of numerical analysis. Both the inherent time and space complexity of the numerical algorithms make it practically infeasible to model check systems with more than 100 million states, whereas realistic system models may have billions of states.\ud \ud To overcome this severe restriction, it is important to be able to replace the original state space with a probabilistically equivalent, but smaller one. The most prominent equivalence relation is bisimulation, for which also a stochastic variant exists (Markovian bisimulation). In many cases, this bisimulation allows for a substantial reduction of the state space size. But, these savings in space come at the cost of an increased time complexity. Therefore in this paper a new distributed signature-based algorithm for the computation of the bisimulation quotient of a given state space is introduced.\ud \ud To demonstrate the feasibility of our approach in both a sequential, and more important, in a distributed setting, we have performed a number of case studies