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.

Portugal e a economia do conhecimento: A despesa empresarial em Investigação e Desenvolvimento

The objective of the paper is to contribute to the understanding of the knowledge economy in Portugal, presenting data and revealing specific characteristics of the Portuguese business R&D, using a framework of available tools such as international comparisons, technology intensity and sectors of the economy. This study concludes that Portuguese business R&D reveals strong elements of economic terciarization, and an important presence of foreign direct investment in knowledge intensive industries. Furthermore, the study revealed less significant determinants such as the existence of skill labour in pharmaceutical industries and the role of the state in some sectors (wealth and rail transportation).

Exploiting a prioritized MAC protocol to efficiently compute min and max in multihop networks

Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take sensor readings but individual sensor readings are not very important. It is important however to compute aggregated quantities of these sensor readings. The minimum and maximum of all sensor readings at an instant are often interesting because they indicate abnormal behavior, for example if the maximum temperature is very high then it may be that a fire has broken out. We propose an algorithm for computing the min or max of sensor reading in a multihop network. This algorithm has the particularly interesting property of having a time complexity that does not depend on the number of sensor nodes; only the network diameter and the range of the value domain of sensor readings matter.

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.

Exploiting a prioritized MAC protocol to efficiently compute interpolations

Consider a network where all nodes share a single broadcast domain such as a wired broadcast network. Nodes take sensor readings but individual sensor readings are not the most important pieces of data in the system. Instead, we are interested in aggregated quantities of the sensor readings such as minimum and maximum values, the number of nodes and the median among a set of sensor readings on different nodes. In this paper we show that a prioritized medium access control (MAC) protocol may advantageously be exploited to efficiently compute aggregated quantities of sensor readings. In this context, we propose a distributed algorithm that has a very low time and message-complexity for computing certain aggregated quantities. Importantly, we show that if every sensor node knows its geographical location, then sensor data can be interpolated with our novel distributed algorithm, and the message-complexity of the algorithm is independent of the number of nodes. Such an interpolation of sensor data can be used to compute any desired function; for example the temperature gradient in a room (e.g., industrial plant) densely populated with sensor nodes, or the gas concentration gradient within a pipeline or traffic tunnel.

A two-competitive approximate schedulability analysis of CAN

Consider the problem of deciding whether a set of n sporadic message streams meet deadlines on a Controller Area Network (CAN) bus for a specified priority assignment. It is assumed that message streams have implicit deadlines and no release jitter. An algorithm to solve this problem is well known but unfortunately it time complexity is non-polynomial. We present an algorithm with polynomial time-complexity for computing an upper bound on the response times. Clearly, if the upper bound on the response time does not exceed the deadline then all deadlines are met. The pessimism of our approach is proven: if the upper bound of the response time exceeds the deadline then the response time exceeds the deadline as well for a CAN network with half the speed.

Exact analysis of TDMA with slot skipping

Consider a communication medium shared among a set of computer nodes; these computer nodes issue messages that are requested to be transmitted and they must finish their transmission before their respective deadlines. TDMA/SS is a protocol that solves this problem; it is a specific type of Time Division Multiple Access (TDMA) where a computer node is allowed to skip its time slot and then this time slot can be used by another computer node. We present an algorithm that computes exact queuing times for TDMA/SS in conjunction with Rate-Monotonic (RM) or Earliest- Deadline-First (EDF).

Delay-bounded medium access for unidirectional wireless links

Consider a wireless network where links may be unidirectional, that is, a computer node A can broadcast a message and computer node B will receive this message but if B broadcasts then A will not receive it. Assume that messages have deadlines. We propose a medium access control (MAC) protocol which replicates a message in time with carefully selected pauses between replicas, and in this way it guarantees that for every message at least one replica of that message is transmitted without collision. The protocol ensures this with no knowledge of the network topology and it requires neither synchronized clocks nor carrier sensing capabilities. We believe this result is significant because it is the only MAC protocol that offers an upper bound on the message queuing delay for unidirectional links without relying on synchronized clocks.

Preliminary discussion on globally prioritized medium access for multi-channel wireless systems

We discuss the development of a simple globally prioritized multi-channel medium access control (MAC) protocol for wireless networks. This protocol provides “hard” pre-run-time real-time guarantees to sporadic message streams, exploits a very large fraction of the capacity of all channels for “hard” real-time traffic and also makes it possible to fully utilize the channels with non real-time traffic when hard real-time messages do not request to be transmitted. The potential of such protocols for real-time applications is discussed and a schedulability analysis is also presented.

Flexible manufacturing field trial

Within the European project R-Fieldbus (http://www.hurray.isep.ipp.pt/activities/rfieldbus/), an industrial manufacturing field trial was developed. This field trial was conceived as a demonstration test bed for the technologies developed during the project. Because the R-Fieldbus field trial included prototype hardware devices, the purpose of this equipment changed and since the conclusion of the project, several new technologies also emerged, therefore an update of the field trial was required. This document describes an update of the manufacturing field trial. The purpose of this update, the changes and improvements introduced are described in the document. Additionally, this document also provides a reliable source of documentation for the equipment, configuration and software components of the manufacturing field trial.

Highly scalable aggregate computations in cyber-physical systems: physical environment meets communication protocols

In this paper, we focus on large-scale and dense Cyber- Physical Systems, and discuss methods that tightly integrate communication and computing with the underlying physical environment. We present Physical Dynamic Priority Dominance ((PD)2) protocol that exemplifies a key mechanism to devise low time-complexity communication protocols for large-scale networked sensor systems. We show that using this mechanism, one can compute aggregate quantities such as the maximum or minimum of sensor readings in a time-complexity that is equivalent to essentially one message exchange. We also illustrate the use of this mechanism in a more complex task of computing the interpolation of smooth as well as non-smooth sensor data in very low timecomplexity.

How a cyber-physical system can efficiently obtain a snapshot of physical information even in the presence of sensor faults

We present a distributed algorithm for cyber-physical systems to obtain a snapshot of sensor data. The snapshot is an approximate representation of sensor data; it is an interpolation as a function of space coordinates. The new algorithm exploits a prioritized medium access control (MAC) protocol to efficiently transmit information of the sensor data. It scales to a very large number of sensors and it is able to operate in the presence of sensor faults.

Gestão de um projecto de uma torre de arrefecimento industrial: estudo de caso

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Mecânica

Action, reaction and protest by publishers in 1960s Portugal: books and other publications in the Catholic opposition

The authoritarian regime of the Portuguese Estado Novo (New State), the longest dictatorship in twentieth-century Western Europe, suffered one of its most serious threats during the late 1950s and the whole of the following decade. An array of events and dynamics of opposition to the regime and condemnation of the political and social situation in Portugal appeared at that time. One of the core groups that displayed their dissidence in the 1960s, with the awakening of their critical conscience, originated in Catholic sectors that rallied the laity and the clergy to express their disagreement or even break with the government of Salazar (and, later, Marcelo Caetano). This article aims to establish the role of print culture and, in particular, publishing in the opposition’s mobilisation of Catholics who criticised the Estado Novo. It will also closely examine the contribution of certain publishers to the formulation of the terms of this mobilisation, in publishing new authors and topics and creating new printed forums (e.g. periodicals) for discussion and reflection. The most detailed case will be that of the publishing house Livraria Moraes Editora, under the command of the publisher António Alçada Baptista.

A edição de livros como formulação do mundo: ideias e casos

Este artigo incide sobre o editor de livros e o papel de mediação cultural e social que este exerce na sua actividade prescritiva e mediadora. Procura-se analisar o editor numa dupla vertente: a personagem social nas suas práticas e propósitos de constituição de públicos, mercados, hierarquias e modos de ler e extrair sentido, por um lado, e um conjunto de casos que permitam historicizar as possibilidades e contradições que esta personagem social encontra em contextos particulares, por outro. Na tentativa deste conhecimento convocam-se exemplos de formas contemporâneas de consagração e configuração de públicos leitores em Portugal, através da exploração de colecções editadas em épocas específicas do século XX, de prémios promovidos pelo sector editorial e pelo Estado (durante o regime ditatorial do Estado Novo), e de dois casos de acção editorial a partir do intercâmbio luso-brasileiro (ilustrados pelos projectos editoriais luso-brasileiros de António de Sousa Pinto e de Álvaro Pinto).