TDBS: a time division beacon scheduling mechanism for ZigBee cluster-tree wireless sensor networks

Synchronization is a challenging and important issue for time-sensitive Wireless Sensor Networks (WSN) since it requires a mutual spatiotemporal coordination between the nodes. In that concern, the IEEE 802.15.4/ZigBee protocols embody promising technologies for WSNs, but are still ambiguous on how to efficiently build synchronized multiple-cluster networks, specifically for the case of cluster-tree topologies. In fact, the current IEEE 802.15.4/ZigBee specifications restrict the synchronization to beacon-enabled (by the generation of periodic beacon frames) star networks, while they support multi-hop networking in mesh topologies, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multi-hop and synchronization features, the description on how to effectively construct such a network topology is missing. This paper tackles this issue by unveiling the ambiguities regarding the use of the cluster-tree topology and proposing a synchronization mechanism based on Time Division Beacon Scheduling (TDBS) to build cluster-tree WSNs. In addition, we propose a methodology for efficiently managing duty-cycles in every cluster, ensuring the fairest use of bandwidth resources. The feasibility of the TDBS mechanism is clearly demonstrated through an experimental test-bed based on our open-source implementation of the IEEE 802.15.4/ZigBee protocols.

An implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks: theory and practice

Timeliness guarantee is an important feature of the recently standardized IEEE 802.15.4 protocol, turning it quite appealing for Wireless Sensor Network (WSN) applications under timing constraints. When operating in beacon-enabled mode, this protocol allows nodes with real-time requirements to allocate Guaranteed Time Slots (GTS) in the contention-free period. The protocol natively 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 GTS may be underutilized, 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 one GTS by multiple nodes, still guaranteeing that all their (delay, bandwidth) requirements are 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 approach improves the bandwidth utilization as compared to the native explicit allocation mechanism defined in the IEEE 802.15.4 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. Finally, an experimental evaluation on a real system that validates our theoretical analysis and demonstrates the implementation of i-GAME is also presented

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.

In-shoe plantar pressures and ground reaction forces during overweight adults' overground walking

Purpose: Because walking is highly recommended for prevention and treatment of obesity and some of its biomechanical aspects are not clearly understood for overweight people, we compared the absolute and normalized ground reaction forces (GRF), plantar pressures, and temporal parameters of normal-weight and overweight participants during overground walking. Method: A force plate and an in-shoe pressure system were used to record GRF, plantar pressures (foot divided in 10 regions), and temporal parameters of 17 overweight adults and 17 gender-matched normal-weight adults while walking. Results: With high effect sizes, the overweight participants showed higher absolute medial-lateral and vertical GRF and pressure peaks in the central rearfoot, lateral midfoot, and lateral and central forefoot. However, analyzing normalized (scaled to body weight) data, the overweight participants showed lower vertical and anterior-posterior GRF and lower pressure peaks in the medial rearfoot and hallux, but the lateral forefoot peaks continued to be greater compared with normal-weight participants. Time of occurrence of medial-lateral GRF and pressure peaks in the midfoot occurred later in overweight individuals. Conclusions: The overweight participants adapted their gait pattern to minimize the consequences of the higher vertical and propulsive GRF in their musculoskeletal system. However, they were not able to improve their balance as indicated by medial-lateral GRF. The overweight participants showed higher absolute pressure peaks in 4 out of 10 foot regions. Furthermore, the normalized data suggest that the lateral forefoot in overweight adults was loaded more than the proportion of their extra weight, while the hallux and medial rearfoot were seemingly protected.

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.

One-step preparation of optically transparent Ni-Fe oxide film electrocatalyst for oxygen evolution reaction

Optically transparent cocatalyst film materials is very desirable for improved photoelectrochemical (PEC)oxygen evolution reaction (OER) over light harvesting photoelectrodes which require the exciting light to irradiate through the cocatalyst side, i.e., front-side illumination. In view of the reaction overpotential at electrode/electrolyte interface, the OER electrocatalysts have been extensively used as cocatalysts for PEC water oxidation on photoanode. In this work, the feasibility of a one-step fabrication of the transparent thin film catalyst for efficient electrochemical OER is investigated. The Ni-Fe bimetal oxide films, 200 nm in thickness, are used for study. Using a reactive magnetron co-sputtering technique, transparent(> 50% in wavelength range 500-2000 nm) Ni-Fe oxide films with high electrocatalytic activities were successfully prepared at room temperature. Upon optimization, the as-prepared bimetal oxide film with atomic ratio of Fe/Ni = 3:7 demonstrates the lowest overpotential for the OER in aqueous KOH solution, as low as 329 mV at current density of 2 mA cm 2, which is 135 and 108 mV lower than that of as-sputtered FeOx and NiOx thin films, respectively. It appears that this fabrication strategy is very promising to deposit optically transparent cocatalyst films on photoabsorbers for efficient PEC water splitting.

RuSe Electrocatalysts and Single Wall Carbon Nanohorns Supports for the Oxygen Reduction Reaction

Selenium modified ruthenium electrocatalysts supported on carbon black were synthesized using NaBH4 reduction of the metal precursor. Prepared Ru/C electrocatalysts showed high dispersion and very small averaged particle size. These Ru/C electrocatalysts were subsequently modified with Se following two procedures: (a) preformed Ru/carbon catalyst was mixed with SeO2 in xylene and reduced in H2 and (b) Ru metal precursor was mixed with SeO2 followed by reduction with NaBH4. The XRD patterns indicate that a pyrite-type structure was obtained at higher annealing temperatures, regardless of the Ru:Se molar ratio used in the preparation step. A pyrite-type structure also emerged in samples that were not calcined; however, in this case, the pyrite-type structure was only prominent for samples with higher Ru:Se ratios. The characterization of the RuSe/C electrocatalysts suggested that the Se in noncalcined samples was present mainly as an amorphous skin. Preliminary study of activity toward oxygen reduction reaction (ORR) using electrocatalysts with a Ru:Se ratio of 1:0.7 indicated that annealing after modification with Se had a detrimental effect on their activity. This result could be related to the increased particle size of crystalline RuSe2 in heat-treated samples. Higher activity of not annealed RuSe/C catalysts could also be a result of the structure containing amorphous Se skin on the Ru crystal. The electrode obtained using not calcined RuSe showed a very promising performance with a slightly lower activity and higher overpotential in comparison with a commercial Pt/C electrode. Single wall carbon nanohorns (SWNH) were considered for application as ORR electrocatalysts' supports. The characterization of SWNH was carried out regarding their tolerance toward strong catalyzed corrosion conditions. Tests indicated that SWNH have a three times higher electrochemical surface area (ESA) loss than carbon black or Pt commercial electrodes.

The influence of gait cadence on the ground reaction forces and plantar pressures during load carriage of young adults

Biomechanical gait parameters—ground reaction forces (GRFs) and plantar pressures—during load carriage of young adults were compared at a low gait cadence and a high gait cadence. Differences between load carriage and normal walking during both gait cadences were also assessed. A force plate and an in-shoe plantar pressure system were used to assess 60 adults while they were walking either normally (unloaded condition) or wearing a backpack (loaded condition) at low (70 steps per minute) and high gait cadences (120 steps per minute). GRF and plantar pressure peaks were scaled to body weight (or body weight plus backpack weight). With medium to high effect sizes we found greater anterior-posterior and vertical GRFs and greater plantar pressure peaks in the rearfoot, forefoot and hallux when the participants walked carrying a backpack at high gait cadences compared to walking at low gait cadences. Differences between loaded and unloaded conditions in both gait cadences were also observed.