H-NAMe: specifying, implementing and testing a hidden-node avoidance mechanism for wireless sensor networks

The hidden-node problem has been shown to be a major source of Quality-of-Service (QoS) degradation in Wireless Sensor Networks (WSNs) due to factors such as the limited communication range of sensor nodes, link asymmetry and the characteristics of the physical environment. In wireless contention-based Medium Access Control protocols, if two nodes that are not visible to each other transmit to a third node that is visible to the formers, there will be a collision – usually called hidden-node or blind collision. This problem greatly affects network throughput, energy-efficiency and message transfer delays, which might be particularly dramatic in large-scale WSNs. This technical report tackles the hidden-node problem in WSNs and proposes HNAMe, a simple yet efficient distributed mechanism to overcome it. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes and then scales to multiple clusters via a cluster grouping strategy that guarantees no transmission interference between overlapping clusters. We also show that the H-NAMe mechanism can be easily applied to the IEEE 802.15.4/ZigBee protocols with only minor add-ons and ensuring backward compatibility with the standard specifications. We demonstrate the feasibility of H-NAMe via an experimental test-bed, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. We believe that the results in this technical report will be quite useful in efficiently enabling IEEE 802.15.4/ZigBee as a WSN protocol.

A time division beacon scheduling mechanism for IEEE 802.15.4/Zigbee cluster-tree wireless sensor networks

While the IEEE 802.15.4/Zigbee protocol stack is being considered as a promising technology for low-cost low-power Wireless Sensor Networks (WSNs), several issues in the standard specifications are still open. One of those ambiguous issues is how to build a synchronized multi-hop cluster-tree network, which is quite suitable for ensuring QoS support in WSNs. In fact, the current IEEE 802.15.4/Zigbee specifications restrict the synchronization in the beacon-enabled mode (by the generation of periodic beacon frames) to star-based networks, while it supports multi-hop networking using the peer-to-peer mesh topology, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multihop and synchronization features, the description on how to effectively construct such a network topology is missing. This paper tackles this problem, unveils the ambiguities regarding the use of the cluster-tree topology and proposes a synchronization mechanism based on Time Division Beacon Scheduling to construct cluster-tree WSNs. We also propose a methodology for an efficient duty cycle management in each router (cluster-head) of a cluster-tree WSN that ensures the fairest use of bandwidth resources. The feasibility of the proposal is clearly demonstrated through an experimental test bed based on our own implementation of the IEEE 802.15.4/Zigbee protocol.

A simulation model for the IEEE 802.15.4 protocol: delay/throughput evaluation of the GTS mechanism

The IEEE 802.15.4 protocol has the ability to support time-sensitive Wireless Sensor Network (WSN) applications due to the Guaranteed Time Slot (GTS) Medium Access Control mechanism. Recently, several analytical and simulation models of the IEEE 802.15.4 protocol have been proposed. Nevertheless, currently available simulation models for this protocol are both inaccurate and incomplete, and in particular they do not support the GTS mechanism. In this paper, we propose an accurate OPNET simulation model, with focus on the implementation of the GTS mechanism. The motivation that has driven this work is the validation of the Network Calculus based analytical model of the GTS mechanism that has been previously proposed and to compare the performance evaluation of the protocol as given by the two alternative approaches. Therefore, in this paper we contribute an accurate OPNET model for the IEEE 802.15.4 protocol. Additionally, and probably more importantly, based on the simulation model we propose a novel methodology to tune the protocol parameters such that a better performance of the protocol can be guaranteed, both concerning maximizing the throughput of the allocated GTS as well as concerning minimizing frame delay.

Engineering a search and rescue application with a wireless sensor network - based localization mechanism

The advent of Wireless Sensor Network (WSN) technologies is paving the way for a panoply of new ubiquitous computing applications, some of them with critical requirements. In the ART-WiSe framework, we are designing a two-tiered communication architecture for supporting real-time and reliable communications in WSNs. Within this context, we have been developing a test-bed application, for testing, validating and demonstrating our theoretical findings - a search&rescue/pursuit-evasion application. Basically, a WSN deployment is used to detect, localize and track a target robot and a station controls a rescuer/pursuer robot until it gets close enough to the target robot. This paper describes how this application was engineered, particularly focusing on the implementation of the localization mechanism.

H-NAMe: a hidden-node avoidance mechanism for wireless sensor networks

The hidden-node problem has been shown to be a major source of Quality-of-Service (QoS) degradation in Wireless Sensor Networks (WSNs) due to factors such as the limited communication range of sensor nodes, link asymmetry and the characteristics of the physical environment. In wireless contention-based Medium Access Control protocols, if two nodes that are not visible to each other transmit to a third node that is visible to the formers, there will be a collision – usually called hidden-node or blind collision. This problem greatly affects network throughput, energy-efficiency and message transfer delays, which might be particularly dramatic in large-scale WSNs. This paper tackles the hiddennode problem in WSNs and proposes H-NAMe, a simple yet efficient distributed mechanism to overcome it. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes and then scales to multiple clusters via a cluster grouping strategy that guarantees no transmission interference between overlapping clusters. We also show that the H-NAMe mechanism can be easily applied to the IEEE 802.15.4/ZigBee protocols with only minor add-ons and ensuring backward compatibility with the standard specifications. We demonstrate the feasibility of H-NAMe via an experimental test-bed, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. We believe that the results in this paper will be quite useful in efficiently enabling IEEE 802.15.4/ZigBee as a WSN protocol

i-GAME: an implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks

The IEEE 802.15.4 Medium Access Control (MAC) protocol is an enabling technology for time sensitive wireless sensor networks thanks to its Guaranteed-Time Slot (GTS) mechanism in the beacon-enabled mode. However, the protocol only supports explicit GTS allocation, i.e. a node allocates a number of time slots in each superframe for exclusive use. The limitation of this explicit GTS allocation is that GTS resources may quickly disappear, since a maximum of seven GTSs can be allocated in each superframe, preventing other nodes to benefit from guaranteed service. Moreover, the GTSs may be only partially used, resulting in wasted bandwidth. To overcome these limitations, this paper proposes i-GAME, an implicit GTS Allocation Mechanism in beacon-enabled IEEE 802.15.4 networks. The allocation is based on implicit GTS allocation requests, taking into account the traffic specifications and the delay requirements of the flows. The i-GAME approach enables the use of a GTS by multiple nodes, while all their (delay, bandwidth) requirements are still satisfied. For that purpose, we propose an admission control algorithm that enables to decide whether to accept a new GTS allocation request or not, based not only on the remaining time slots, but also on the traffic specifications of the flows, their delay requirements and the available bandwidth resources. We show that our proposal improves the bandwidth utilization compared to the explicit allocation used in the IEEE 802.15.4 protocol standard. We also present some practical considerations for the implementation of i-GAME, ensuring backward compatibility with the IEEE 801.5.4 standard with only minor add-ons.

Energy and delay trade-off of the GTS allocation mechanism in IEEE 802.15.4 for wireless sensor networks

The IEEE 802.15.4 protocol proposes a flexible communication solution for Low-Rate Wireless Personal Area Networks (LR-WPAN) including wireless sensor networks (WSNs). It presents the advantage to fit different requirements of potential applications by adequately setting its parameters. When in beaconenabled mode, the protocol can provide timeliness guarantees by using its Guaranteed Time Slot (GTS) mechanism. However, power-efficiency and timeliness guarantees are often two antagonistic requirements in wireless sensor networks. The purpose of this paper is to analyze and propose a methodology for setting the relevant parameters of IEEE 802.15.4-compliant WSNs that takes into account a proper trade-off between power-efficiency and delay bound guarantees. First, we propose two accurate models of service curves for a GTS allocation as a function of the IEEE 802.15.4 parameters, using Network Calculus formalism. We then evaluate the delay bound guaranteed by a GTS allocation and express it as a function of the duty cycle. Based on the relation between the delay requirement and the duty cycle, we propose a power-efficient superframe selection method that simultaneously reduces power consumption and enables meeting the delay requirements of real-time flows allocating GTSs. The results of this work may pave the way for a powerefficient management of the GTS mechanism in an IEEE 802.15.4 cluster.

Implementation of the i-GAME mechanism in IEEE 802.15.4 WPANs

This technical report describes the implementation details of the Implicit GTS Allocation Mechanism (i-GAME), for the IEEE 802.15.4 protocol. The i-GAME was implemented in nesC/TinyOS for the CrossBow MICAz mote, over our own implementation of the IEEE 802.15.4 protocol stack. This document provides the implementation details, including a description of the i-GAME software interfaces.

Negotiation mechanism for self-organized scheduling system with collective intelligence

Current Manufacturing Systems challenges due to international economic crisis, market globalization and e-business trends, incites the development of intelligent systems to support decision making, which allows managers to concentrate on high-level tasks management while improving decision response and effectiveness towards manufacturing agility. This paper presents a novel negotiation mechanism for dynamic scheduling based on social and collective intelligence. Under the proposed negotiation mechanism, agents must interact and collaborate in order to improve the global schedule. Swarm Intelligence (SI) is considered a general aggregation term for several computational techniques, which use ideas and inspiration from the social behaviors of insects and other biological systems. This work is primarily concerned with negotiation, where multiple self-interested agents can reach agreement over the exchange of operations on competitive resources. Experimental analysis was performed in order to validate the influence of negotiation mechanism in the system performance and the SI technique. Empirical results and statistical evidence illustrate that the negotiation mechanism influence significantly the overall system performance and the effectiveness of Artificial Bee Colony for makespan minimization and on the machine occupation maximization.

Importance of immunoglobulin E (IgE) in the protective mechanism against gastrointestinal nematode infection: looking at the intestinal mucosae

This review discusses experimental evidences that indicate the IgE participation on the effector mechanisms that leads to gastrointestinal nematode elimination. Data discussed here showed that, for most experimental models, the immune response involved in nematode elimination is regulated by Th-2 type cytokines (especially IL-4). However, the mechanism(s) that result in worm elimination is not clear and might be distinct in different nematode species. Parasite specific IgE production, especially the IgE produced by the intestinal mucosae or associated lymphoid organs could participate in the intestinal elimination of Trichinella spiralis from infected rats. Intestinal IgE may also be important to the protective mechanism developed against other gastrointestinal nematodes that penetrate the murine duodenum mucosa tissue, such as Strongyloides venezuelensis and Heligmosomoides polygyrus. At least in Trichinella spiralis infected rats, the results indicated that intestinal IgE might work independently from mast cell degranulation for worm elimination.

Role of iron in the nitric oxide-mediated fungicidal mechanism of IFN-gamma-activated murine macrophages against Paracoccidioides brasiliensis conidia

Iron is an essential growth element of virtually all microorganisms and its restriction is one of the mechanisms used by macrophages to control microbial multiplication. Paracoccidioides brasiliensis, the agent of paracoccidioidomycosis, an important systemic mycosis in Latin America, is inhibited in its conidia-to-yeast conversion in the absence of iron. We studied the participation of iron in the nitric oxide (NO)-mediated fungicidal mechanism against conidia. Peritoneal murine macrophages activated with 50U/mL of IFN-gamma or treated with 35 µM Deferoxamine (DEX) and infected with P. brasiliensis conidia, were co-cultured and incubated for 96 h in the presence of different concentrations of holotransferrin (HOLO) and FeS0(4). The supernatants were withdrawn in order to assess NO2 production by the Griess method. The monolayers were fixed, stained and observed microscopically. The percentage of the conidia-to-yeast transition was estimated by counting 200 intracellular propagules. IFN-gamma-activated or DEX-treated Mthetas presented marked inhibition of the conidia-to-yeast conversion (19 and 56%, respectively) in comparison with non-activated or untreated Mthetas (80%). IFN-gamma-activated macrophages produced high NO levels in comparison with the controls. Additionally, when the activated or treated-macrophages were supplemented with iron donors (HOLO or FeSO4), the inhibitory action was reversed, although NO production remained intact. These results suggest that the NO-mediated fungicidal mechanism exerted by IFN-gamma-activated macrophages against P. brasiliensis conidia, is dependent of an iron interaction.

Mechanism of interleukin-8 induction by human cytomegalovirus UL76 protein

Dissertation presented to obtain the Ph.D degree in Biology

Evidence for Nevirapine Bioactivation in Man: Searching for the First Step in the Mechanism of Nevirapine Toxicity

Despite its efficacy, including in the prevention of vertical transmission, the antiretroviral nevirapine is associated with severe idiosyncratic hepatotoxicity and skin rash. The mechanisms underlying nevirapine toxicity are not fully understood, but drug bioactivation to reactive metabolites capable of forming stable protein adducts is thought to be involved. This hypothesis is based on the paradigm that drug reactive metabolites have the potential to bind to self-proteins, which results in drug-modified proteins being perceived as foreign by the immune system. The aim of the present work was to identify hemoglobin adducts in HIV patients as biomarkers of nevirapine haptenation upon bioactivation. The ultimate goal is to develop diagnostic methods for predicting the onset of nevirapine-induced toxic reactions. All included subjects were adults on nevirapine-containing antiretroviral therapy for at least 1month. The protocol received prior approval from the Hospital Ethics Committees and patients gave their written informed consent. Nevirapine-derived adducts with the N-terminal valine of hemoglobin were analyzed by an established liquid chromatography-electrospray ionization-tandem mass spectrometry method and characterized on the basis of retention time and mass spectrometric fragmentation pattern by comparison with adduct standards prepared synthetically. The nevirapine adducts were detected in 12/13 patient samples, and quantified in 11/12 samples (2.58±0.8 fmol/g of hemoglobin). This work represents the first evidence of nevirapine-protein adduct formation in man and confirms the ability of nevirapine to modify self-proteins, thus providing clues to the molecular mechanisms underlying nevirapine toxicity. Moreover, the possibility of assessing nevirapine-protein adduct levels has the potential to become useful for predicting the onset of nevirapine-induced adverse reactions.

The mechanism of formate oxidation by metal-dependent formate dehydrogenases

J Biol Inorg Chem (2011) 16:1255–1268 DOI 10.1007/s00775-011-0813-8

Analysis of the activation mechanism of Pseudomonas stutzeri cytochrome c peroxidase through an electron transfer chain

J Biol Inorg Chem (2011) 16:881–888 DOI 10.1007/s00775-011-0785-8