Improving the IEEE 802.15.4 Slotted CSMA/CA MAC for time-critical events in wireless sensor networks

In beacon-enabled mode, IEEE 802.15.4 is ruled by the slotted CSMA/CA Medium Access Control (MAC) protocol. The standard slotted CSMA/CA mechanism does not provide any means of differentiated services to improve the quality of service for timecritical events (such as alarms, time slot reservation, PAN management messages etc.). In this paper, we present and discuss practical service differentiation mechanisms to improve the performance of slotted CSMA/CA for time-critical events, with only minor add-ons to the protocol. The contribution of our proposal is more practical than theoretical since our initial requirement is to leave the original algorithm of the slotted CSMA/CA unchanged, but rather tuning its parameters adequately according to the criticality of the messages. We present a simulation study based on an accurate model of the IEEE 802.15.4 MAC protocol, to evaluate the differentiated service strategies. Four scenarios with different settings of the slotted CSMA/CA parameters are defined. Each scenario is evaluated for FIFO and Priority Queuing. The impact of the hiddennode problem is also analyzed, and a solution to mitigate it is proposed.

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.

GTS allocation analysis in IEEE 802.15.4 for real-time wireless sensor networks

The IEEE 802.15.4 protocol proposes a flexible communication solution for Low-Rate Wireless Personal Area Networks including sensor networks. It presents the advantage to fit different requirements of potential applications by adequately setting its parameters. When enabling its beacon mode, the protocol makes possible real-time guarantees by using its Guaranteed Time Slot (GTS) mechanism. This paper analyzes the performance of the GTS allocation mechanism in IEEE 802.15.4. The analysis gives a full understanding of the behavior of the GTS mechanism with regards to delay and throughput metrics. First, we propose two accurate models of service curves for a GTS allocation as a function of the IEEE 802.15.4 parameters. We then evaluate the delay bounds guaranteed by an allocation of a GTS using Network Calculus formalism. Finally, based on the analytic results, we analyze the impact of the IEEE 802.15.4 parameters on the throughput and delay bound guaranteed by a GTS allocation. The results of this work pave the way for an efficient dimensioning of an IEEE 802.15.4 cluster.

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.

Compact, frequency reconfigurable, printed monopole antenna

This paper proposes a possible implementation of a compact printed monopole antenna, useful to operate in UMTS and WLAN bands. In order to accomplish that, a miniaturization technique based on the application of chip inductors is used in conjunction with frequency reconfiguration capability. The chip inductors change the impedance response of the monopole, allowing to reduce the resonant frequency. In order to be able to operate the antenna in these two different frequencies, an antenna reconfiguration technique based on PIN diodes is applied. This procedure allows the change of the active form of the antenna leading to a shift in the resonant frequency. The prototype measurements show good agreement with the simulation results.

A flexible online apparatus for projectile launch experiments

In order to provide a more flexible learning environment in physics, the developed projectile launch apparatus enables students to determine the acceleration of gravity and the dependence of a set of parameters in the projectile movement. This apparatus is remotely operated and accessed via web, by first scheduling an access time slot. This machine has a number of configuration parameters that support different learning scenarios with different complexities.

Light memory operation based on a double pin SiC device

Experimental optoelectronic characterization of a p-i'(a-SiC:H)-n/pi(a-Si:H)-n heterostructure with low conductivity doped layers shows the feasibility of tailoring channel bandwidth and wavelength by optical bias through back and front side illumination. Front background enhances light-to-dark sensitivity of the long and medium wavelength range, and strongly quenches the others. Back violet background enhances the magnitude in short wavelength range and reduces the others. Experiments have three distinct programmed time slots: control, hibernation and data. Throughout the control time slot steady light wavelengths illuminate either or both sides of the device, followed by the hibernation without any background illumination. The third time slot allows a programmable sequence of different wavelengths with an impulse frequency of 6000Hz to shine upon the sensor. Results show that the control time slot illumination has an influence on the data time slot which is used as a volatile memory with the set, reset logical functions. © IFIP International Federation for Information Processing 2015.

A Random Access Protocol incorporating Multi-Packet Reception, Retransmission Diversity and Successive Interference Cancellation

8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.

Time diversity solutions to cope with lost packets

A dissertation submitted to Departamento de Engenharia Electrotécnica of Faculdade de Ciências e Tecnologia of Universidade Nova de Lisboa in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Engenharia Electrotécnica e de Computadores

Creation of a web application for smart park system and parking prediction study for system integration

In the last few years, we have observed an exponential increasing of the information systems, and parking information is one more example of them. The needs of obtaining reliable and updated information of parking slots availability are very important in the goal of traffic reduction. Also parking slot prediction is a new topic that has already started to be applied. San Francisco in America and Santander in Spain are examples of such projects carried out to obtain this kind of information. The aim of this thesis is the study and evaluation of methodologies for parking slot prediction and the integration in a web application, where all kind of users will be able to know the current parking status and also future status according to parking model predictions. The source of the data is ancillary in this work but it needs to be understood anyway to understand the parking behaviour. Actually, there are many modelling techniques used for this purpose such as time series analysis, decision trees, neural networks and clustering. In this work, the author explains the best techniques at this work, analyzes the result and points out the advantages and disadvantages of each one. The model will learn the periodic and seasonal patterns of the parking status behaviour, and with this knowledge it can predict future status values given a date. The data used comes from the Smart Park Ontinyent and it is about parking occupancy status together with timestamps and it is stored in a database. After data acquisition, data analysis and pre-processing was needed for model implementations. The first test done was with the boosting ensemble classifier, employed over a set of decision trees, created with C5.0 algorithm from a set of training samples, to assign a prediction value to each object. In addition to the predictions, this work has got measurements error that indicates the reliability of the outcome predictions being correct. The second test was done using the function fitting seasonal exponential smoothing tbats model. Finally as the last test, it has been tried a model that is actually a combination of the previous two models, just to see the result of this combination. The results were quite good for all of them, having error averages of 6.2, 6.6 and 5.4 in vacancies predictions for the three models respectively. This means from a parking of 47 places a 10% average error in parking slot predictions. This result could be even better with longer data available. In order to make this kind of information visible and reachable from everyone having a device with internet connection, a web application was made for this purpose. Beside the data displaying, this application also offers different functions to improve the task of searching for parking. The new functions, apart from parking prediction, were: - Park distances from user location. It provides all the distances to user current location to the different parks in the city. - Geocoding. The service for matching a literal description or an address to a concrete location. - Geolocation. The service for positioning the user. - Parking list panel. This is not a service neither a function, is just a better visualization and better handling of the information.

t-­stories: improving and expanding t-­words

versão acessível em http://ace2015.info/wp-content/uploads/2015/11/ACE_2015_submission_148.pdf

Non-immunologic methods of diagnosis of babesiosis

The diagnosis of tick-borne diseases such as babesiosis still depends on observing the parasite in the infected erythrocyte. Microscopic observation is tedious and often problematic in both early and carrier infections. Better diagnostic methods are needed to prevent clinical disease, especially when susceptible cattle are being moved into disease enzootic areas. This study evaluates two techniques for early diagnosis of Babesia bovis infections in cattle, DNA probes specific for the organism and fluorescent probes specific nucleic acid. The radioisotopically labeled DNA probes are used in slot blot hybridizations whith lysed blood samples, not purified DNA. Thusfar, the probe is specific for B. bovis and can detect as few as 1000 B. bovis parasites in 10µl of blood. The specificity of the fluorescent probe depends on the characteristic morphology of the babesia in whole blood samples, as determined microscopically. The fluorescent probe detects as afew as 10,000 B. bovis parasites in 10*l as blood. The application of each method for alboratory and field use is discussed.

Anàlisi de radiació en vaixells i disseny d'una antena en la banda d'HF

El projecte està dividit en dues parts, per una banda l’anàlisi de radiació en vaixells i per altra banda el disseny d’una antena en la banda d’ HF. La primera part s’inicia amb un estudi de l’escenari marítim a nivell de comunicacions, vaixells i antenes i, a continuació, s’estudia el camp proper sobre les superfícies del vaixell per al posicionament d’antenes amb el màxim aïllament. La segona part tracta el disseny d’una antena en HF a 6 MHz partint d’una antena tipus ranura, de baix perfil. Per validar el seu funcionament es construeix i mesura un prototipus en la banda d’UHF (2 GHz).

Multiple causes of the evolution of dispersal in metapopulations

Abstract This work investigates the outcome of the interaction of the multiple causes of selection acting on dispersal in metapopulations. Dispersal, defined here as the ability of individuals to move out of their natal population to reproduce in an other one, has three main causes. First, population variability, as caused by random population extinctions, induces high incentives to disperse through the probability to recolonize an empty population and thus to escape competition for space. This adds to the second cause, kin competition avoidance where individuals in a crowded patch will benefit from the release of competition with relatives caused by dispersal. Dispersal may thus be viewed as an altruistic act. Third, dispersal might evolve as a strategy of avoiding inbred matings which are expected to bear fitness costs due to the presence of a mutation load. The interaction of inbreeding avoidance and kin competition is explored in chapter 2. Conditions conducive to the establishment of a high relatedness within population are expected to induce high dispersal through both kin competition avoidance and inbreeding avoidance. However, the dynamics of inbreeding depression is bound to depend on the level of gene flow as well as on the deleterious mutation parameters. Mutations more prone to settle a high level of inbreeding depression will select for increased dispersal. Chapter 3 investigates the effect of the mating system on the joint dynamics of dispersal and inbreeding depression. Higher inbreeding rates as those found in various mating systems lead to a more efficient purge of the deleterious mutations. However, this decrease in the costs of inbreeding are usually accompanied by a higher within deme relatedness which balances the decreased effect of inbreeding avoidance on the evolution of dispersal. Finally, population turnover, as found in most natural populations has a dual effect on dispersal. Indeed, it increases dispersal by the increased probability of winning a breeding slot in extinct demes it creates but, on the other hand, it counter-selects for dispersal through the slow establishment of unsaturated demic conditions which contribute to lower the local competition for space. Résumé Ce travail se propose d'étudier les effets conjoints des multiples causes de l'évolution de la dispersion en métapopulation. La dispersion, définie ici comme étant la capacité de quitter sa population d'origine pour se reproduire dans une antre population, possède trois principales causes. Premièrement, l'extinction aléatoire de populations sélectionne pour plus de dispersion car elle augmente la Probabilité de recoloniser un patch éteint et donc d'échapper à la compétition locale. La seconde cause, l'évitement de la compétition de parentèle, sélectionne pour plus de dispersion par les bénéfices qu'elle apporte par diminution de la compétition entre individus apparentés. Troisièmement, la dispersion évolue "comme stratégie d'évitement de la dépression de consanguinité présente dans des petites populations isolées. L'interaction entre l'évitement de la consanguinité et de la compétition de parentèle est étudiée dans le chapitre 2. Les conditions conduisant à l'établissement d'un fort apparentement à l'intérieur des populations sont celles qui génèrent le plus de sélection pour la dispersion. Cependant, la dynamique de la dépression de consanguinité est dépendante de la dispersion entre populations ainsi que des paramètres des mutations délétères. Les mutations créant le plus de dépression de consanguinité sont celles qui sélectionneront le plus pour de la dispersion. Le chapitre 3 s'intéresse aux effets du système de reproduction sur la dynamique conjointe du fardeau de mutation et de la dispersion. La purge des mutations délétère étant plus sévère dans des conditions de forte consanguinité, elle diminue les coûts de la consanguinité mais est habituellement accompagné par une augmentation de l'apparentement et donc l'effet peut être neutre sur la dispersion. Finalement, le turnover de populations a un effet dual sur la dispersion. La dispersion est sélectionnée par l'augmentation de la probabilité de gagner une place de reproduction dans des patchs éteints mais elle est également contre sélectionnée par la désaturation des patchs causée par l'extinction et la diminution de la compétition pour l'espace qui intervient dans ce cas.

Beliefs about and attitudes toward gambling in French-speaking Switzerland.

The present study aims to analyze attitudes and beliefs of the French-speaking general Swiss population (n = 2500; female n = 1280; mean age = 43 years) as regards gambling, which are to date almost exclusively studied in the North American and Australian contexts. Beliefs related to gambling include the perception of the effectiveness of preventive measures toward gambling, the comparative risk assessment of different addictive behaviors, the perceived risks of different types of gambling and attitudes are related to the gambler's personality. The general population perceived gambling rather negatively and was conscious of the potential risks of gambling; indeed, 59.0% of the sample identified gambling as an addictive practice. Slot machines were estimated to bear the highest risk. Compared with women and older people, men and young people indicated more positive beliefs about gambling; they perceived gambling as less addictive, supported structural preventive measures less often, and perceived gambling as a less serious problem for society. Gamblers were more likely to put their practices into perspective, perceiving gambling more positively than non-gamblers. General population surveys on such beliefs can deliver insights into preventive actions that should be targeted to young men who showed more favorable views of gambling, which have been shown to be associated with increased risk for problematic gambling.