Abstract
The timing behavior of the EDCA mechanism defined in the IEEE 802.11e standard is analyzed. More specifically, the target of this paper is to evaluate the limitations of the highest priority level of the EDCA mechanism (voice category) when supporting real-time (RT) communication. By RT communication, we mean small-sized packets generated in periodic intervals that must be delivered before the end of the message stream period. Otherwise, the message is considered to be delayed and a deadline loss occurs. We have assessed the EDCA mechanism considering an open communication environment, where both RT and non-RT stations share the same frequency band. Furthermore, a realistic error-prone model channel was used to measure the impact of interferences against an error-free channel. We show that, for most part of the evaluated scenarios, when using the default parameters of the EDCA mechanism both the number of packet losses and the average packet delays forecast an unacceptable number of deadline losses. However, if adequate Contention Windows (CW) parameters are configured in the set of RT stations, it becomes possible to adequately handle RT traffic. As a conclusion of this paper, we present some potential future directions toward improved QoS in wireless networks.

Abstract
Terology is a concept introduced to synthesize all the actions related to the managing of the life cycle of facilities and equipment as an enlarged maintenance perspective. Nowadays, the concept tries to give some contribution to integrate the environment in this approach. The concept has been implemented in several fields, namely for wind mills in existing works. Now, it is expanded to the problem of marine wind farms taking into account the singularities of the marine environment. In fact, if the maintenance problems in wind farms are so diverse like the reading of on-condition data, their synchronization and, after, their transmission, in marine wind farms the problems are bigger, including the distance from GSM antenna to transmit and read data remotely. Additionally, and not less important, there is the distance between the marine wind farms and the staff responsible by its maintenance. In this case, the resources and time involved to develop maintenance interventions are much more expensive when compared to similar actions in land. Finally, nevertheless this kind of energy being green it also implies some environmental problems, related to the birds and fisheries.

Abstract
It is reported a LPG dynamic interrogation technique based on the modulation of fibre Bragg gratings located in the readout unit that permits to attenuate the effect of the 1/f noise of the electronics in the resolution of the LPG-based sensing head. The concept is tested to detect variations of the external refractive index and a resolution of 2.0x10 (4) NIR was achieved without system optimization. Additionally, the effect in the sensor resolution when introducing Erbium and Raman optical amplification is experimentally investigated.

Abstract

Abstract

Abstract
Finding and counting the occurrences of a collection of subgraphs within another larger network is a computationally hard problem, closely related to graph isomorphism. The subgraph count is by itself a very powerful characterization of a network and it is crucial for other important network measurements. G-tries are a specialized data-structure designed to store and search for subgraphs. By taking advantage of subgraph common substructure, g-tries can provide considerable speedups over previously used methods. In this paper we present a parallel algorithm based precisely on gtries that is able to efficiently find and count subgraphs. The algorithm relies on randomized receiver-initiated dynamic load balancing and is able to stop its computation at any given time, efficiently store its search position, divide what is left to compute in two halfs, and resume from where it left. We apply our algorithm to several representative real complex networks from various domains and examine its scalability. We obtain an almost linear speedup up to 128 processors, thus allowing us to reach previously unfeasible limits. We showcase the multidisciplinary potential of the algorithm by also applying it to network motif discovery. © 2010 IEEE.