Zigbee over tinyos: Implementation and experimental challenges

The IEEE 802.15.4/Zigbee protocols are a promising technology for Wireless Sensor Networks (WSNs). This paper shares our experience on the implementation and use of these protocols and related technologies in WSNs. We present problems and challenges we have been facing in implementing an IEEE 802.15.4/ZigBee stack for TinyOS in a two-folded perspective: IEEE 802.15.4/ZigBee protocol standards limitations (ambiguities and open issues) and technological limitations (hardware and software). Concerning the former, we address challenges for building scalable and synchronized multi-cluster ZigBee networks, providing a trade-off between timeliness and energy-efficiency. On the latter issue, we highlight implementation problems in terms of hardware, timer handling and operating system limitations. We also report on our experience from experimental test-beds, namely on physical layer aspects such as coexistence problems between IEEE 802.15.4 and 802.11 radio channels.

Static-priority scheduling over wireless networks with multiple broadcast domains

We propose a wireless medium access control (MAC) protocol that provides static-priority scheduling of messages in a guaranteed collision-free manner. Our protocol supports multiple broadcast domains, resolves the wireless hidden terminal problem and allows for parallel transmissions across a mesh network. Arbitration of messages is achieved without the notion of a master coordinating node, global clock synchronization or out-of-band signaling. The protocol relies on bit-dominance similar to what is used in the CAN bus except that in order to operate on a wireless physical layer, nodes are not required to receive incoming bits while transmitting. The use of bit-dominance efficiently allows for a much larger number of priorities than would be possible using existing wireless solutions. A MAC protocol with these properties enables schedulability analysis of sporadic message streams in wireless multihop networks.

Real-time communications over cluster-tree sensor networks with mobile sink behaviour

Modelling the fundamental performance limits of wireless sensor networks (WSNs) is of paramount importance to understand the behaviour of WSN under worst case conditions and to make the appropriate design choices. In that direction, this paper contributes with a methodology for modelling cluster tree WSNs with a mobile sink. We propose closed form recurrent expressions for computing the worst case end to end delays, buffering and bandwidth requirements across any source-destination path in the cluster tree assuming error free channel. We show how to apply our theoretical results to the specific case of IEEE 802.15.4/ZigBee WSNs. Finally, we demonstrate the validity and analyze the accuracy of our methodology through a comprehensive experimental study, therefore validating the theoretical results through experimentation.

Run-time monitoring approach for the shark kernel

Typically common embedded systems are designed with high resource constraints. Static designs are often chosen to address very specific use cases. On contrast, a dynamic design must be used if the system must supply a real-time service where the input may contain factors of indeterminism. Thus, adding new functionality on these systems is often accomplished by higher development time, tests and costs, since new functionality push the system complexity and dynamics to a higher level. Usually, these systems have to adapt themselves to evolving requirements and changing service requests. In this perspective, run-time monitoring of the system behaviour becomes an important requirement, allowing to dynamically capturing the actual scheduling progress and resource utilization. For this to succeed, operating systems need to expose their internal behaviour and state, making it available to the external applications, usually using a run-time monitoring mechanism. However, such mechanism can impose a burden in the system itself if not wisely used. In this paper we explore this problem and propose a framework, which is intended to provide this run-time mechanism whilst achieving code separation, run-time efficiency and flexibility for the final developer.

A self-healing real-time system based on run-time self-reconfiguration

The new generations of SRAM-based FPGA (field programmable gate array) devices are the preferred choice for the implementation of reconfigurable computing platforms intended to accelerate processing in real-time systems. However, FPGA's vulnerability to hard and soft errors is a major weakness to robust configurable system design. In this paper, a novel built-in self-healing (BISH) methodology, based on run-time self-reconfiguration, is proposed. A soft microprocessor core implemented in the FPGA is responsible for the management and execution of all the BISH procedures. Fault detection and diagnosis is followed by repairing actions, taking advantage of the dynamic reconfiguration features offered by new FPGA families. Meanwhile, modular redundancy assures that the system still works correctly

On-line defragmentation for run-time partially reconfigurable FPGAs

Dynamically reconfigurable systems have benefited from a new class of FPGAs recently introduced into the market, which allow partial and dynamic reconfiguration at run-time, enabling multiple independent functions from different applications to share the same device, swapping resources as needed. When the sequence of tasks to be performed is not predictable, resource allocation decisions have to be made on-line, fragmenting the FPGA logic space. A rearrangement may be necessary to get enough contiguous space to efficiently implement incoming functions, to avoid spreading their components and, as a result, degrading their performance. This paper presents a novel active replication mechanism for configurable logic blocks (CLBs), able to implement on-line rearrangements, defragmenting the available FPGA resources without disturbing those functions that are currently running.

Otimização de uma cadeia de logística interna

Atualmente qualquer organização que se queira manter no ativo, tem que obrigatoriamente inovar, reduzir o desperdício associado ao processo produtivo e simultaneamente simplificar as tarefas diárias dos seus colaboradores. E é sobre estes princípios que este trabalho é baseado, ou seja, pretende-se através da aplicação de ferramentas Lean, a melhoria contínua do processo de produção da Schmitt Elevadores. Numa fase inicial foi necessário um estudo dos diferentes fluxos de materiais, que permitiu a conceção do VSM (Value Stream Mapping). O VSM juntamente com o diagrama de Spaghetti permitiram a identificação de algumas das fontes de desperdício, relacionadas essencialmente com o excesso de movimentações. Considerando o âmbito do estágio, logística interna, e reunidas as causas de desperdício verificadas nesta área, procedeu-se à criação de um ciclo de entrega de materiais, por parte do operador logístico, baseado no conceito de milk run. Verificaram-se também problemas ao nível da gestão de stocks, pelo que também foi necessária intervenção nesta área. A aplicação das medidas mencionadas anteriormente irá traduzir-se em ganhos para o processo produtivo, nomeadamente, na criação de rotinas para os operadores logísticos; evitar deslocações por parte dos operadores de cada processo e manter em supermercado a quantidade suficiente de cada artigo, para fazer face à variabilidade da procura.

Habitação modular evolutiva

Da necessidade de criação de habitações que se adaptem ao constante dinamismo do ser humano, surgiu a ideia da concepção de um edifício evolutivo com base na construção modular. A construção modular poderá ser entendida como sendo a principal resposta ao combate da construção de estruturas físicas e imóveis, com características inalteráveis ao longo do tempo. Com este trabalho idealizou-se uma habitação evolutiva, baseado nos conceitos da Coordenação Modular, identificando-se as suas especificações, exigências de desempenho e características funcionais. Foi considerada como medida modular base 0,10m. Os módulos foram pensados com o intuito de que o seu desempenho prático seja satisfatório. A sua base estrutural foi executada a partir do rearranjo de contentores marítimos. Previu-se ainda, o uso de coberturas verdes por serem uma solução comprovada de minorar notoriamente o efeito pernicioso que a construção tem sobre o meio ambiente, ao mesmo tempo que apresentam vantagens térmicas e acústicas. A questão do incentivo do uso da pré-fabricação em Portugal a uma maior escala, não poderia ser descurada. A apresentação de eventuais desenvolvimentos futuros é também relevante, dada a importância que é inerente ao âmbito da industrialização da construção. Do estudo realizado ficaram ainda, bem patentes, os benefícios da racionalização e da industrialização, tanto em termos económicos como em termos ambientais. É possível executar um projecto com níveis de perdas mais baixos e com índices de qualidade superiores a um menor preço.

Development of procedures for the simulation of atmospheric flows over complex terrain, using OpenFOAM

The main purpose of this work was the development of procedures for the simulation of atmospheric ows over complex terrain, using OpenFOAM. For this aim, tools and procedures were developed apart from this code for the preprocessing and data extraction, which were thereafter applied in the simulation of a real case. For the generation of the computational domain, a systematic method able to translate the terrain elevation model to a native OpenFOAM format (blockMeshDict) was developed. The outcome was a structured mesh, in which the user has the ability to de ne the number of control volumes and its dimensions. With this procedure, the di culties of case set up and the high computation computational e ort reported in literature associated to the use of snappyHexMesh, the OpenFOAM resource explored until then for the accomplishment of this task, were considered to be overwhelmed. Developed procedures for the generation of boundary conditions allowed for the automatic creation of idealized inlet vertical pro les, de nition of wall functions boundary conditions and the calculation of internal eld rst guesses for the iterative solution process, having as input experimental data supplied by the user. The applicability of the generated boundary conditions was limited to the simulation of turbulent, steady-state, incompressible and neutrally strati ed atmospheric ows, always recurring to RaNS (Reynolds-averaged Navier-Stokes) models. For the modelling of terrain roughness, the developed procedure allowed to the user the de nition of idealized conditions, like an uniform aerodynamic roughness length or making its value variable as a function of topography characteristic values, or the using of real site data, and it was complemented by the development of techniques for the visual inspection of generated roughness maps. The absence and the non inclusion of a forest canopy model limited the applicability of this procedure to low aerodynamic roughness lengths. The developed tools and procedures were then applied in the simulation of a neutrally strati ed atmospheric ow over the Askervein hill. In the performed simulations was evaluated the solution sensibility to di erent convection schemes, mesh dimensions, ground roughness and formulations of the k - ε and k - ω models. When compared to experimental data, calculated values showed a good agreement of speed-up in hill top and lee side, with a relative error of less than 10% at a height of 10 m above ground level. Turbulent kinetic energy was considered to be well simulated in the hill windward and hill top, and grossly predicted in the lee side, where a zone of ow separation was also identi ed. Despite the need of more work to evaluate the importance of the downstream recirculation zone in the quality of gathered results, the agreement between the calculated and experimental values and the OpenFOAM sensibility to the tested parameters were considered to be generally in line with the simulations presented in the reviewed bibliographic sources.

Run-time defragmentation for dynamically reconfigurable hardware

Reconfigurable computing experienced a considerable expansion in the last few years, due in part to the fast run-time partial reconfiguration features offered by recent SRAM-based Field Programmable Gate Arrays (FPGAs), which allowed the implementation in real-time of dynamic resource allocation strategies, with multiple independent functions from different applications sharing the same logic resources in the space and temporal domains. However, when the sequence of reconfigurations to be performed is not predictable, the efficient management of the logic space available becomes the greatest challenge posed to these systems. Resource allocation decisions have to be made concurrently with system operation, taking into account function priorities and optimizing the space currently available. As a consequence of the unpredictability of this allocation procedure, the logic space becomes fragmented, with many small areas of free resources failing to satisfy most requests and so remaining unused. A rearrangement of the currently running functions is therefore necessary, so as to obtain enough contiguous space to implement incoming functions, avoiding the spreading of their components and the resulting degradation of system performance. A novel active relocation procedure for Configurable Logic Blocks (CLBs) is herein presented, able to carry out online rearrangements, defragmenting the available FPGA resources without disturbing functions currently running.

Fast mobility support in low-power wireless networks: smart-HOP over RPL/6LoWPAN

With the emergence of low-power wireless hardware new ways of communication were needed. In order to standardize the communication between these low powered devices the Internet Engineering Task Force (IETF) released the 6LoWPAN stand- ard that acts as an additional layer for making the IPv6 link layer suitable for the lower-power and lossy networks. In the same way, IPv6 Routing Protocol for Low- Power and Lossy Networks (RPL) has been proposed by the IETF Routing Over Low power and Lossy networks (ROLL) Working Group as a standard routing protocol for IPv6 routing in low-power wireless sensor networks. The research performed in this thesis uses these technologies to implement a mobility process. Mobility management is a fundamental yet challenging area in low-power wireless networks. There are applications that require mobile nodes to exchange data with a xed infrastructure with quality-of-service guarantees. A prime example of these applications is the monitoring of patients in real-time. In these scenarios, broadcast- ing data to all access points (APs) within range may not be a valid option due to the energy consumption, data storage and complexity requirements. An alternative and e cient option is to allow mobile nodes to perform hand-o s. Hand-o mechanisms have been well studied in cellular and ad-hoc networks. However, low-power wireless networks pose a new set of challenges. On one hand, simpler radios and constrained resources ask for simpler hand-o schemes. On the other hand, the shorter coverage and higher variability of low-power links require a careful tuning of the hand-o parameters. In this work, we tackle the problem of integrating smart-HOP within a standard protocol, speci cally RPL. The simulation results in Cooja indicate that the pro- posed scheme minimizes the hand-o delay and the total network overhead. The standard RPL protocol is simply unable to provide a reliable mobility support sim- ilar to other COTS technologies. Instead, they support joining and leaving of nodes, with very low responsiveness in the existence of physical mobility.

A quest for the right word enhancing reflexivity and technology in terminology training

INTED2010, the 4th International Technology, Education and Development Conference was held in Valencia (Spain), on March 8, 9 and 10, 2010.

Race-to-halt energy saving strategies

Energy consumption is one of the major issues for modern embedded systems. Early, power saving approaches mainly focused on dynamic power dissipation, while neglecting the static (leakage) energy consumption. However, technology improvements resulted in a case where static power dissipation increasingly dominates. Addressing this issue, hardware vendors have equipped modern processors with several sleep states. We propose a set of leakage-aware energy management approaches that reduce the energy consumption of embedded real-time systems while respecting the real-time constraints. Our algorithms are based on the race-to-halt strategy that tends to run the system at top speed with an aim to create long idle intervals, which are used to deploy a sleep state. The effectiveness of our algorithms is illustrated with an extensive set of simulations that show an improvement of up to 8% reduction in energy consumption over existing work at high utilization. The complexity of our algorithms is smaller when compared to state-of-the-art algorithms. We also eliminate assumptions made in the related work that restrict the practical application of the respective algorithms. Moreover, a novel study about the relation between the use of sleep intervals and the number of pre-emptions is also presented utilizing a large set of simulation results, where our algorithms reduce the experienced number of pre-emptions in all cases. Our results show that sleep states in general can save up to 30% of the overall number of pre-emptions when compared to the sleep-agnostic earliest-deadline-first algorithm.

Avaliação e Otimização Energética das Fornalhas da Fábrica de Aromáticos

O consumo energético verificado nas refinarias petrolíferas é muito elevado, sendo as fornalhas os equipamentos que mais contribuem para esse consumo. Neste estudo foi efetuada uma avaliação e otimização energética às fornalhas da Fábrica de Aromáticos da Refinaria de Matosinhos. Numa primeira fase foi efetuado um levantamento exaustivo de dados de todas as correntes de entrada e saída dos equipamentos para posteriormente efetuar os balanços de massa e energia a cada uma das fornalhas. Os dados relativos ao levantamento compreenderam dois períodos de funcionamento distintos da unidade fabril, o período de funcionamento normal e o período relativo ao arranque. O período de funcionamento normal foi relativo ao ano de 2012 entre os meses de janeiro a setembro, por sua vez o período de arranque foi de dezembro de 2012 a março de 2013. Na segunda fase foram realizados os balanços de massa e energia quantificando todas as correntes de entrada e saída das fornalhas em termos mássicos e energéticos permitindo o cálculo do rendimento térmico das fornalhas para avaliar a sua performance. A avaliação energética permitiu concluir que existe um consumo maior de energia proveniente da combustão do Fuel Gás do que do Fuel Óleo, tanto no período de funcionamento normal como no arranque. As fornalhas H0101, H0301 e a H0471 possuem os consumos mais elevados, sendo responsáveis por mais de 70% do consumo da Fábrica de Aromáticos. Na terceira fase foram enunciadas duas medidas para a otimização energética das três fornalhas mais consumidoras de energia, a limpeza mensal e o uso exclusivo de Fuel Gás como combustível. As poupanças energéticas obtidas para uma limpeza mensal foram de 0,3% na fornalha H0101, 0,7% na fornalha H0301 e uma poupança de 0,9 % na fornalha H0471. Para o uso exclusivo de Fuel Gás obteve-se uma poupança de 0,9% na fornalha H0101 e uma poupança de 1,3% nas fornalhas H0301 e H0471. A análise económica efetuada à sugestão de alteração do combustível mostra que os custos de operação sofrerão um aumento anual de 621 679 €. Apesar do aumento dos custos, a redução na emissão de 24% de dióxido de carbono, poderá justificar este aumento na despesa.