Performance analysis of token bus protocol with maintenance functions

An analytic model for the token bus protocol with the consideration of maintenance functions has been proposed in this dissertation. Analysis of the performance is done in the aspects of average message delay and normalized throughput or channel utilization;The problem of analyzing a working token bus system, which often requires maintenance of logical ring, became a new topic in local area network field. The maintenance functions of token bus protocol have been overlooked in most performance analyses. They need to be defined clearly and quantified properly to be considered in the performance analysis;This problem of maintenance functions is investigated indirectly in this dissertation. First, an analytic model for normal operational mode is developed. This model is an unique one in the sense that it contains a variable whose value depends on the maintenance functions implemented in the network. Later, the quantified delays due to maintenance functions are reflected back in to the normal case model to complete the analysis;The first half of the dissertation includes definitions of maintenance functions and their quantifications and an analytic model development and performance analysis comprises second half of the dissertation;The result of the performance analysis with certain assumptions shows considerable increase in average message delay in the system varying from 3.8% to 5744% in the worst case. The importance of considering maintenance functions on network performance is clearly demonstrated by the result obtained in this research;The analytic model developed is a flexible model which can encompass the effects of maintenance functions in the token bus protocol

Overview of Polkadot and its Design Considerations

In this paper we describe the design components of the heterogenous multi-chain protocol Polkadot and explain how these components help Polkadot address some of the existing shortcomings of blockchain technologies. At present, a vast number of blockchain projects have been introduced and employed with various features that are not necessarily designed to work with each other. This makes it difficult for users to utilise a large number of applications on different blockchain projects. Moreover, with the increase in number of projects the security that each one is providing individually becomes weaker. Polkadot aims to provide a scalable and interoperable framework for multiple chains with pooled security that is achieved by the collection of components described in this paper

Digital system bus integrity

This report summarizes and describes the results of a study of current or emerging multiplex data buses as applicable to digital flight systems, particularly with regard to civil aircraft. Technology for pre-1995 and post-1995 timeframes has been delineated and critiqued relative to the requirements envisioned for those periods. The primary emphasis has been an assured airworthiness of the more prevalent type buses, with attention to attributes such as fault tolerance, environmental susceptibility, and problems under continuing investigation. Additionally, the capacity to certify systems relying on such buses has been addressed

Using the ethernet protocol for real-time communications in embedded systems

Doutoramento em Engenharia ElectrotécnicaOs Sistemas Computacionais de Controlo Distribuído (SCCD) estão muito disseminados em aplicações que vão desde o controlo de processos e manufactura a automóveis, aviões e robôs. Muitas aplicações são de natureza tempo-real, ou seja, impõem fortes restrições às propriedades subjacentes aos sistemas de controlo, gerando a necessidade de fornecer um comportamento temporal previsível durante períodos alargados de tempo. Em particular, dependendo da aplicação, uma falha em garantir as restrições pode causar importantes perdas económicas ou mesmo pôr vidas humanas em risco. Actualmente, a quantidade e funcionalidade dos modernos SCCD têm crescido firmemente. Esta evolução é motivada por uma nova classe de aplicações que requer maior demanda de recursos tais como aplicações de multimedia (por exemplo visão), bem como pela tendência em usar grande número de processadres simples e interconectados, em vez de poucos e poderosos processadores, encapsulando cada funcionalidade num único processador. Consequentemente, a quantidade de informação que deve ser trocada entre os nós da rede também cresceu drasticamente nos últimos anos e está agora atingindo os limites que podem ser obtidos por tradicionais barramentos de campo, como por exempo CAN, WorldFIP, PROFIBUS. Outras alternativas são pois requeridas para suportar a necessidade de largura de banda e a manutenção de exigências dos sistemas de comunicação tempo-real: previsibilidade, pontualidade, atraso e variação de período limitados. Uma das linhas de trabalho tem apostado na Ethernet, tirando vantagem dos baixos custos dos circuitos, da elevada largura de banda, da fácil integração com a Internet, e da simplicidade em promover expansões e compatibilidade com redes usadas na estrutura administrativa das empresas industriais. Porém, o mecanismo padronizado de acesso ao meio da Ethernet (CSMA/CD) é destrutivo e não determinístico, o que impede seu uso directo ao nível de campo ou pelo menos em aplicações de comunicação tempo-real. Apesar disso, muitas abordagens diferentes têm sido propostas e usadas para obter comportamento tempo-real em Ethernet. As abordagens actuais para dotar de comportamento tempo-real Ethernet partilhada apresentam desvantagens tais como: exigência de hardware especializado, fornecimento de garantias temporais estatísticas, ineficiência na utilização da largura de banda ou na reposta tempo-real. São ainda por vezes inflexíveis com respeito às propriedades de tráfego bem como com as políticas de escalonamento. Podem exigir processadores com elevado poder de cálculo. Finalmente não permitem que estações tempo-real possam coexistir com estações Ethernet standard no mesmo segmento. Uma proposta recente, o algoritmo hBEB, permite a coexistência de estações tempo-real e standard no mesmo segmento. Contudo, apenas uma estação tempo-real pode estar activa, o que é inaceitável para aplicações de automação e controlo. Esta tese discute uma nova solução para promover tempo-real em Ethernet partilhada, baseando-se na passagem implícita de testemunho de forma similar à usada pelo protocolo P-NET. Esta técnica é um mecanismo de acesso ao meio físico pouco exigente em termos de processamento, sendo portanto adequada para implementar uma rede de dispositivos baseados em processadores de baixo poder de cálculo e controladores Ethernet standard. Esta tese apresenta ainda uma proposta de implementação do VTPE em IP core para superar algumas dificuldades derivadas de funcionalidades que não são suportadas por controladores standard, nomeadamente a arbitragem do meio físico durante a transmissão de uma trama. Esta nova proposta pode aumentar muito a eficiência do VTPE no uso da largura de banda. O VTPE, assim como P-NET ou protocolos similares, permite a uma estação apenas comunicar uma vez por cada circulação do testemunho. Esta imposição pode causar bloqueios de comunicação por períodos inaceitáveis em aplicações com tráfego isócrono, por exemplo multimedia. Uma solução proposta permite que uma estação possa aceder ao meio físico mais de uma vez por cada circulação do token. Os resultados experimentais a as análises desenvolvidas mostram que o bloqueio pode ser drasticamente reduzido. Por último esta tese discute uma variante do protocolo VTPE, o VTPE/h- BEB, que permite que mais de uma estação hBEB possa coexistir com diversas estações Ethernet standard num mesmo segmento partilhado. Um demonstrador para prova de conceito bem como uma aplicação foram também implementados.Distributed Computer-Control Systems (DCCS) are widely disseminated in applications ranging from automation and control to automotive, avionics and robotics. Many of these applications are real-time, posing stringent constraints to the properties of underlying control systems, which arise from the need to provide predictable behaviour during extended time periods. Depending on the particular type of application, a failure to meet these constraints can cause important economic losses or can even put human life in risk. Currently the number and functionality of modern DCCSs have been increasing steadily. This evolution has been motivated for a new class of applications of more resource demanding applications, such as multimedia (e.g. machine vision), as well as by the trend to use large numbers of simple interconnected processors, instead of a few powerful ones, encapsulating each functionality in one single processor. Consequently, the amount of information that must be exchanged among the network nodes has also increased dramatically and is now reaching the limits achievable by traditional fieldbuses. Therefore, other alternatives are required to support higher bandwidth demands while keeping the main requirements of a real-time communication system: predictability, timeliness, bounded delays and jitter. Efforts have been made with Ethernet to take advantage of the low cost of the silicon, high bandwidth, easy integration with the Internet, easy expansion and compatibility with the networks used at higher layers in the factory structure. However its standardized media access control (CSMA/CD) is destructive and not deterministic, impairing its direct use at field level at least for real-time communication. Despite this, many solutions have been proposed to achieve real-time behavior in Ethernet. However they present several disadvantages: requiring specialized hardware, providing statistical timeliness guarantees only, being bandwidth or response-time inefficient, being inflexible concerning traffic properties and/or scheduling policy, or finally not allowing real-time stations to coexist with standard Ethernet stations in the same segment. A recent proposal, the hBEB algorithm, allows the coexistence of real-time and standard Ethernet stations in the same shared segment. However hBEB limits at most one real-time station per segment which is unacceptable for applications in industrial automation and process control. This thesis discusses a new real-time shared Ethernet solution based on the virtual token passing technique similarly to the one used by the P-NET protocol. This technique is a medium access control mechanism that requires small processing power, being suitable to implement devices based on processors with small processing power. The solution is called Virtual Token Passing Ethernet or VTPE. This proposal discusses the modifications required in the Ethernet frame format, the temporal analysis to guarantee real-time communication and the implementation of two demonstrators based on microcontrollers and standard Ethernet controllers. This thesis also presents a proposal to implement VTPE in an IP Core to overcome some difficulties derived from limitations of standard Ethernet controllers, namely to allow medium access control during a frame transmission. This proposal can increase the bandwidth efficiency of VTPE. VTPE, as well as P-NET or any other protocol based on circular token rotation technique, only allows a station to communicate once for each token round. This design imposition can cause unacceptable communication blocking in applications with isochronous traffic such as multimedia. An improvement in the VTPE proposal enables a station to access the medium more than once per token round. The experimental results as well as the temporal analysis show that the blocking can be drastically reduced. This improvement can also be used in the P-NET protocol. Finally this thesis proposes a variant of VTPE, named VTPE/hBEB, to be implemented in Ethernet controllers that are able to support the hBEB algorithm. The VTPE/hBEB allows more than one hBEB station to coexist with several standard Ethernet stations in the same shared Ethernet segment. A demonstrator for the VTPE/hBEB validation, as well as an application, are also presented and discussed

Repeater-based hybrid wired/wireless PROFIBUS network simulator

This technical report describes the Repeater-Based Hybrid Wired/Wireless PROFIBUS Network Simulator that implements a simulation model of the repeater-based approach. This approach defines the mechanism to extend the PROFIBUS protocol to supprot wireless communication, in which the interconnection of the wired and wireless segments is done by a intermediate system operating at Physical Layer, as repeater

High efficiency, character-oriented, local area networks

Imperial Users onl

Wireless Virtual Multiple Antenna Networks for Critical Process Control: Protocol Design and Experiments:

Wireless telemetry systems for remote monitoring and control of industrial processes are now becoming a relevant topic in the field of networked control. Wireless closed-loop control systems have stricter delay and link reliability requirements compared to conventional sensor networks for open-loop monitoring and call for the development of advanced network architectures. By following the guidelines introduced by recent standardization, this paper focuses on the most recent technological advances to enable wireless networked control for tight closed-loop applications with cycle times below 100 ms. The cooperative network paradigm is indicated as the key technology to enable cable replacing even in critical control applications. A cooperative communication system enables wireless devices placed at geographically separated locations to act as a virtual ensemble of antennas that creates a virtual multiple-antenna-distributed system. A proprietary link-layer protocol/based on the IEEE 802.15.4 physical layer has been developed and tested in an indoor environment characterized by non-line-of-sight (NLOS) propagation and dense obstacles. The measurements obtained from the testbed evaluate experimentally the benefits (and the limitations) of cable replacing in critical process control

Robust and cheating-resilient power auctioning on Resource Constrained Smart Micro-Grids

The principle of Continuous Double Auctioning (CDA) is known to provide an efficient way of matching supply and demand among distributed selfish participants with limited information. However, the literature indicates that the classic CDA algorithms developed for grid-like applications are centralised and insensitive to the processing resources capacity, which poses a hindrance for their application on resource constrained, smart micro-grids (RCSMG). A RCSMG loosely describes a micro-grid with distributed generators and demand controlled by selfish participants with limited information, power storage capacity and low literacy, communicate over an unreliable infrastructure burdened by limited bandwidth and low computational power of devices. In this thesis, we design and evaluate a CDA algorithm for power allocation in a RCSMG. Specifically, we offer the following contributions towards power auctioning on RCSMGs. First, we extend the original CDA scheme to enable decentralised auctioning. We do this by integrating a token-based, mutual-exclusion (MUTEX) distributive primitive, that ensures the CDA operates at a reasonably efficient time and message complexity of O(N) and O(logN) respectively, per critical section invocation (auction market execution). Our CDA algorithm scales better and avoids the single point of failure problem associated with centralised CDAs (which could be used to adversarially provoke a break-down of the grid marketing mechanism). In addition, the decentralised approach in our algorithm can help eliminate privacy and security concerns associated with centralised CDAs. Second, to handle CDA performance issues due to malfunctioning devices on an unreliable network (such as a lossy network), we extend our proposed CDA scheme to ensure robustness to failure. Using node redundancy, we modify the MUTEX protocol supporting our CDA algorithm to handle fail-stop and some Byzantine type faults of sites. This yields a time complexity of O(N), where N is number of cluster-head nodes; and message complexity of O((logN)+W) time, where W is the number of check-pointing messages. These results indicate that it is possible to add fault tolerance to a decentralised CDA, which guarantees continued participation in the auction while retaining reasonable performance overheads. In addition, we propose a decentralised consumption scheduling scheme that complements the auctioning scheme in guaranteeing successful power allocation within the RCSMG. Third, since grid participants are self-interested we must consider the issue of power theft that is provoked when participants cheat. We propose threat models centred on cheating attacks aimed at foiling the extended CDA scheme. More specifically, we focus on the Victim Strategy Downgrade; Collusion by Dynamic Strategy Change, Profiling with Market Prediction; and Strategy Manipulation cheating attacks, which are carried out by internal adversaries (auction participants). Internal adversaries are participants who want to get more benefits but have no interest in provoking a breakdown of the grid. However, their behaviour is dangerous because it could result in a breakdown of the grid. Fourth, to mitigate these cheating attacks, we propose an exception handling (EH) scheme, where sentinel agents use allocative efficiency and message overheads to detect and mitigate cheating forms. Sentinel agents are tasked to monitor trading agents to detect cheating and reprimand the misbehaving participant. Overall, message complexity expected in light demand is O(nLogN). The detection and resolution algorithm is expected to run in linear time complexity O(M). Overall, the main aim of our study is achieved by designing a resilient and cheating-free CDA algorithm that is scalable and performs well on resource constrained micro-grids. With the growing popularity of the CDA and its resource allocation applications, specifically to low resourced micro-grids, this thesis highlights further avenues for future research. First, we intend to extend the decentralised CDA algorithm to allow for participants’ mobile phones to connect (reconnect) at different shared smart meters. Such mobility should guarantee the desired CDA properties, the reliability and adequate security. Secondly, we seek to develop a simulation of the decentralised CDA based on the formal proofs presented in this thesis. Such a simulation platform can be used for future studies that involve decentralised CDAs. Third, we seek to find an optimal and efficient way in which the decentralised CDA and the scheduling algorithm can be integrated and deployed in a low resourced, smart micro-grid. Such an integration is important for system developers interested in exploiting the benefits of the two schemes while maintaining system efficiency. Forth, we aim to improve on the cheating detection and mitigation mechanism by developing an intrusion tolerance protocol. Such a scheme will allow continued auctioning in the presence of cheating attacks while incurring low performance overheads for applicability in a RCSMG

Analysis, evaluation and improvement of RT-WMP for real-time and QoS wireless communication: Applications in confined environments

En los ultimos años, la innovación tecnológica, la característica de flexibilidad y el rápido despligue de las redes inalámbricas, han favorecido la difusión de la redes móviles ad-hoc (MANETs), capaces de ofrecer servicios para tareas específicas entre nodos móviles. Los aspectos relacionados al dinamismo de la topología móvil y el acceso a un medio compartido por naturaleza hacen que sea preciso enfrentarse a clases de problemas distintos de los relacionados con la redes cableadas, atrayendo de este modo el interés de la comunidad científica. Las redes ad-hoc suelen soportar tráfico con garantía de servicio mínimo y la mayor parte de las propuestas presentes en literatura tratan de dar garantías de ancho de banda o minimizar el retardo de los mensajes. Sin embargo hay situaciones en las que estas garantías no son suficientes. Este es el caso de los sistemas que requieren garantías mas fuertes en la entrega de los mensajes, como es el caso de los sistemas de tiempo real donde la pérdida o el retraso de un sólo mensaje puede provocar problemas graves. Otras aplicaciones como la videoconferencia, cada vez más extendidas, implican un tráfico de datos con requisitos diferentes, como la calidad de servicio (QoS). Los requisitos de tiempo real y de QoS añaden nuevos retos al ya exigente servicio de comunicación inalámbrica entre estaciones móviles de una MANET. Además, hay aplicaciones en las que hay que tener en cuenta algo más que el simple encaminamiento de los mensajes. Este es el caso de aplicaciones en entornos subterráneos, donde el conocimiento de la evolución de propagación de la señal entre los diferentes nodos puede ser útil para mejorar la calidad de servicio y mantener la conectividad en cada momento. A pesar de ésto, dentro del amplio abanicos de propuestas presente en la literatura, existen un conjunto de limitaciones que van de el mero uso de protocolos simulados a propuestas que no tienen en cuenta entornos no convencionales o que resultan aisladas desde el punto de vista de la integración en sistemas complejos. En esta tesis doctoral, se propone un estudio completo sobre un plataforma inalámbrica de tiempo real, utilizando el protocolo RT-WMP capaz de gestionar trafíco multimedia al mismo tiempo y adaptado al entorno de trabajo. Se propone una extensión para el soporte a los datos con calidad de servicio sin limitar las caractaristícas temporales del protocolo básico. Y con el fin de tener en cuenta el efecto de la propagación de la señal, se caracteriza el entorno por medio de un conjunto de restricciones de conectividad. La solución ha sido desarrollada y su validez ha sido demostrada extensamente en aplicaciones reales en entornos subterráneos, en redes malladas y aplicaciones robóticas