Mac protocols for linear wireless (sensor) networks

Wireless sensor networks (WSNs) consist of a large number of sensor nodes, characterized by low power constraint, limited transmission range and limited computational capabilities [1][2].The cost of these devices is constantly decreasing, making it possible to use a large number of sensor devices in a wide array of commercial, environmental, military, and healthcare fields. Some of these applications involve placing the sensors evenly spaced on a straight line for example in roads, bridges, tunnels, water catchments and water pipelines, city drainages, oil and gas pipelines etc., making a special class of these networks which we define as a Linear Wireless Network (LWN). In LWNs, data transmission happens hop by hop from the source to the destination, through a route composed of multiple relays. The peculiarity of the topology of LWNs, motivates the design of specialized protocols, taking advantage of the linearity of such networks, in order to increase reliability, communication efficiency, energy savings, network lifetime and to minimize the end-to-end delay [3]. In this thesis a novel contention based Medium Access Control (MAC) protocol called L-CSMA, specifically devised for LWNs is presented. The basic idea of L-CSMA is to assign different priorities to nodes based on their position along the line. The priority is assigned in terms of sensing duration, whereby nodes closer to the destination are assigned shorter sensing time compared to the rest of the nodes and hence higher priority. This mechanism speeds up the transmission of packets which are already in the path, making transmission flow more efficient. Using NS-3 simulator, the performance of L-CSMA in terms of packets success rate, that is, the percentage of packets that reach destination, and throughput are compared with that of IEEE 802.15.4 MAC protocol, de-facto standard for wireless sensor networks. In general, L-CSMA outperforms the IEEE 802.15.4 MAC protocol.

On arc-routing problems

Das Basisproblem von Arc-Routing Problemen mit mehreren Fahrzeugen ist das Capacitated Arc-Routing Problem (CARP). Praktische Anwendungen des CARP sind z.B. in den Bereichen Müllabfuhr und Briefzustellung zu finden. Das Ziel ist es, einen kostenminimalen Tourenplan zu berechnen, bei dem alle erforderlichen Kanten bedient werden und gleichzeitig die Fahrzeugkapazität eingehalten wird. In der vorliegenden Arbeit wird ein Cut-First Branch-and-Price Second Verfahren entwickelt. In der ersten Phase werden Schnittebenen generiert, die dem Master Problem in der zweiten Phase hinzugefügt werden. Das Subproblem ist ein kürzeste Wege Problem mit Ressourcen und wird gelöst um neue Spalten für das Master Problem zu liefern. Ganzzahlige CARP Lösungen werden durch ein neues hierarchisches Branching-Schema garantiert. Umfassende Rechenstudien zeigen die Effektivität dieses Algorithmus. Kombinierte Standort- und Arc-Routing Probleme ermöglichen eine realistischere Modellierung von Zustellvarianten bei der Briefzustellung. In dieser Arbeit werden jeweils zwei mathematische Modelle für Park and Loop und Park and Loop with Curbline vorgestellt. Die Modelle für das jeweilige Problem unterscheiden sich darin, wie zulässige Transfer Routen modelliert werden. Während der erste Modelltyp Subtour-Eliminationsbedingungen verwendet, werden bei dem zweiten Modelltyp Flussvariablen und Flusserhaltungsbedingungen eingesetzt. Die Rechenstudie zeigt, dass ein MIP-Solver den zweiten Modelltyp oft in kürzerer Rechenzeit lösen kann oder bei Erreichen des Zeitlimits bessere Zielfunktionswerte liefert.

Sperimentazione di protocolli di routing ip su piattaforme raspberry pi.

Tesi mirata allo studio dei protocolli di routing IP utilizzati per l'inoltro dei pacchetti in una topologia non banale. Sono state utilizzate macchine Linux Raspberry Pi per il loro costo e ingombro per costruire la rete. In particolare, è stata implementata una rete caratterizzata da sette router divisi in tre aree distinte, ai quali sono state connesse sette LAN. Si è installato e utilizzato il software quagga per attivare il protocollo OSPF (Open Shortest Path First). Per limitare i dispositivi fisici si è utilizzato il software Mininet per virtualizzare switch e LAN. Infine, sono stati trattati elementi teorici del routing su Internet, applicati alla rete creata per verificarne il funzionamento.

DTN discovery and routing: from space applications to terrestrial networks.

L'argomento di questa tesi è l'architettura di rete Delay-/Disruption-Tolerant Networking (DTN), progettata per operare nelle reti “challenged”, dove la suite di protocolli TCP/IP risulta inefficace a causa di lunghi ritardi di propagazione del segnale, interruzioni e disturbi di canale, ecc. Esempi di reti “challenged” variano dalle reti interplanetarie alle Mobile Ad-Hoc Networks (MANETs). Le principali implementazioni dell'architettura DTN sono DTN2, implementazione di riferimento, e ION, sviluppata da NASA JPL per applicazioni spaziali. Una grande differenza tra reti spaziali e terrestri è che nello spazio i movimenti dei nodi sono deterministici, mentre non lo sono per i nodi mobili terrestri, i quali generalmente non conoscono la topologia della rete. Questo ha portato allo sviluppo di diversi algoritmi di routing: deterministici per le reti spaziali e opportunistici per quelle terrestri. NASA JPL ha recentemente deciso di estendere l'ambito di applicazione di ION per supportare anche scenari non deterministici. Durante la tesi, svolta presso NASA JPL, mi sono occupato di argomenti diversi, tutti finalizzati a questo obiettivo. Inizialmente ho testato la nuova implementazione dell'algoritmo IP Neighbor Discovery (IPND) di ION, corretti i bug e prodotta la documentazione ufficiale. Quindi ho contribuito ad integrare il Contact Graph Routing (CGR) di ION nel simulatore DTN “ONE” utilizzando la Java Native Interface (JNI) come ponte tra il codice Java di ONE e il codice C di ION. In particolare ho adattato tutte le librerie di ION necessarie per far funzionare CGR all'interno dell'ambiente di ONE. Infine, dopo aver analizzato un dataset di tracce reali di nodi mobili, ho contribuito a progettare e a sviluppare OCGR, estensione opportunistica del CGR, quindi ne ho curato l'integrazione in ONE. I risultati preliminari sembrano confermare la validità di OCGR che, una volta messo a punto, può diventare un valido concorrente ai più rinomati algoritmi opportunistici.

Dental arch relationship in children with complete unilateral cleft lip and palate following one-stage and three-stage surgical protocols

The objective of this study is to compare dental arch relationship following one-stage and three-stage surgical protocols of unilateral cleft lip and palate. Dental casts of 61 children (mean age, 11.2 years; SD, 1.7), consecutively treated in one center with one-stage closure of the complete cleft at 9.2 months (SD, 2.0), were compared with a sample of 97 patients (mean age, 8.7 years; SD, 0.9), consecutively treated with a three-stage protocol including delayed hard palate closure in another center. The dental casts were assigned random numbers to blind their origin. Four raters graded dental arch relationship and palatal morphology using the EUROCRAN index. The strength of agreement of rating was assessed with kappa statistics. Independent t tests were run to compare the EUROCRAN scores between one-stage and three-stage samples, and Fisher's exact tests were performed to evaluate differences of distribution of the EUROCRAN grades. The intra- and inter-rater agreement was moderate to very good. Dental arch relationship in the one-stage sample was less favorable than in three-stage group (mean scores, 2.58 and 1.97 for one-stage and three-stage samples, respectively; p?

Delivery room management of very low birth weight infants in Germany, Austria and Switzerland--a comparison of protocols

Surveys from the USA, Australia and Spain have shown significant inter-institutional variation in delivery room (DR) management of very low birth weight infants (VLBWI, <1500g) at birth, despite regularly updated international guidelines.

Confocal imaging protocols for live/dead staining in three-dimensional carriers

In tissue engineering, a variety of methods are commonly used to evaluate survival of cells inside tissues or three-dimensional (3D) carriers. Among these methods confocal laser scanning microscopy opened accessibility of 3D tissue using live cell imaging into the tissue or 3D scaffolds. However, although this technique is ideally applied to 3D tissue or scaffolds with thickness up to several millimetres, this application is surprisingly rare and scans are often done on slices with thickness <20 μm. Here, we present novel protocols for the staining of 3D tissue (e.g. intervertebral disc tissue) and scaffolds, such as fibrin gels or alginate beads.

Effect of two beta-alanine dosing protocols on muscle carnosine synthesis and washout

Carnosine (β-alanyl-L-histidine) is found in high concentrations in skeletal muscle and chronic β-alanine (BA) supplementation can increase carnosine content. This placebo-controlled, double-blind study compared two different 8-week BA dosing regimens on the time course of muscle carnosine loading and 8-week washout, leading to a BA dose-response study with serial muscle carnosine assessments throughout. Thirty-one young males were randomized into three BA dosing groups: (1) high-low: 3.2 g BA/day for 4 weeks, followed by 1.6 g BA/day for 4 weeks; (2) low-low: 1.6 g BA/day for 8 weeks; and (3) placebo. Muscle carnosine in tibialis-anterior (TA) and gastrocnemius (GA) muscles was measured by 1H-MRS at weeks 0, 2, 4, 8, 12 and 16. Flushing symptoms and blood clinical chemistry were trivial in all three groups and there were no muscle carnosine changes in the placebo group. During the first 4 weeks, the increase for high-low (TA 2.04 mmol/kgww, GA 1.75 mmol/kgww) was ~twofold greater than low-low (TA 1.12 mmol/kgww, GA 0.80 mmol/kgww). 1.6 g BA/day significantly increased muscle carnosine within 2 weeks and induced continual rises in already augmented muscle carnosine stores (week 4-8, high-low regime). The dose-response showed a carnosine increase of 2.01 mmol/kgww per 100 g of consumed BA, which was only dependent upon the total accumulated BA consumed (within a daily intake range of 1.6-3.2 g BA/day). Washout rates were gradual (0.18 mmol/kgww and 0.43 mmol/kgww/week; ~2%/week). In summary, the absolute increase in muscle carnosine is only dependent upon the total BA consumed and is not dependent upon baseline muscle carnosine, the muscle type, or the daily amount of supplemented BA.