Packet erasure correcting codes for wireless sensor networks: implementation and field trial measurements

This thesis regards the Wireless Sensor Network (WSN), as one of the most important technologies for the twenty-first century and the implementation of different packet correcting erasure codes to cope with the ”bursty” nature of the transmission channel and the possibility of packet losses during the transmission. The limited battery capacity of each sensor node makes the minimization of the power consumption one of the primary concerns in WSN. Considering also the fact that in each sensor node the communication is considerably more expensive than computation, this motivates the core idea to invest computation within the network whenever possible to safe on communication costs. The goal of the research was to evaluate a parameter, for example the Packet Erasure Ratio (PER), that permit to verify the functionality and the behavior of the created network, validate the theoretical expectations and evaluate the convenience of introducing the recovery packet techniques using different types of packet erasure codes in different types of networks. Thus, considering all the constrains of energy consumption in WSN, the topic of this thesis is to try to minimize it by introducing encoding/decoding algorithms in the transmission chain in order to prevent the retransmission of the erased packets through the Packet Erasure Channel and save the energy used for each retransmitted packet. In this way it is possible extend the lifetime of entire network.

Near-Optimum Coding for q-ary Symmetric Channel with Application to Space Communications

Questa Tesi aspira a mostrare un codice a livello di pacchetto, che abbia performance molto vicine a quello ottimo, per progetti di comunicazioni Satellitari. L’altro scopo di questa Tesi è quello di capire se rimane ancora molto più difficile maneggiare direttamente gli errori piuttosto che le erasures. Le applicazioni per comunicazioni satellitari ora come ora usano tutte packet erasure coding per codificare e decodificare l’informazione. La struttura dell’erasure decoding è molto semplice, perché abbiamo solamente bisogno di un Cyclic Redundancy Check (CRC) per realizzarla. Il problema nasce quando abbiamo pacchetti di dimensioni medie o piccole (per esempio più piccole di 100 bits) perché in queste situazioni il costo del CRC risulta essere troppo dispendioso. La soluzione la possiamo trovare utilizzando il Vector Symbol Decoding (VSD) per raggiungere le stesse performance degli erasure codes, ma senza la necessità di usare il CRC. Per prima cosa viene fatta una breve introduzione su come è nata e su come si è evoluta la codifica a livello di pacchetto. In seguito è stato introdotto il canale q-ary Symmetric Channel (qSC), con sia la derivazione della sua capacità che quella del suo Random Coding Bound (RCB). VSD è stato poi proposto con la speranza di superare in prestazioni il Verification Based Decoding (VBD) su il canale qSC. Infine, le effettive performance del VSD sono state stimate via simulazioni numeriche. I possibili miglioramenti delle performance, per quanto riguarda il VBD sono state discusse, come anche le possibili applicazioni future. Inoltre abbiamo anche risposto alla domande se è ancora così tanto più difficile maneggiare gli errori piuttosto che le erasure.

The behaviour of osteocyte dendritic processes in bone under cyclic load (il comportamento dei processi dendritici degli osteociti nel tessuto osseo sottoposti a carico ciclico)

Bone is continually being removed and replaced through the actions of basic multicellular units (BMU). This constant upkeep is necessary to remove microdamage formed naturally due to fatigue and thus maintain the integrity of the bone. The repair process in bone is targeted, meaning that a BMU travels directly to the site of damage and repairs it. It is still unclear how targeted remodelling is stimulated and directed but it is highly likely that osteocytes play a role. A number of theories have been advanced to explain the microcrack osteocyte interaction but no complete mechanism has been demonstrated. Osteocytes are connected to each other by dendritic processes. The “scissors model" proposed that the rupture of these processes where they cross microcracks signals the degree of damage and the urgency of the necessary repair. In its original form it was proposed that under applied compressive loading, microcrack faces will be pressed together and undergo relative shear movement. If this movement is greater than the width of an osteocyte process, then the process will be cut in a “scissors like" motion, releasing RANKL, a cytokine known to be essential in the formation of osteoclasts from pre-osteoclasts. The main aim of this thesis was to investigate this theoretical model with a specific focus on microscopy and finite element modelling. Previous studies had proved that cyclic stress was necessary for osteocyte process rupture to occur. This was a divergence from the original “scissors model" which had proposed that the cutting of cell material occurred in one single action. The present thesis is the first study to show fatigue failure in cellular processes spanning naturally occurring cracks and it's the first study to estimate the cyclic strain range and relate it to the number of cycles to failure, for any type of cell. Rupture due to shear movement was ruled out as microcrack closing never occurred, as a result of plastic deformation of the bone. Fatigue failure was found to occur due to cyclic tensile stress in the locality of the damage. The strain range necessary for osteocyte process rupture was quantified. It was found that the lower the process strain range the greater the number of cycles to cell process failure. FEM modelling allowed to predict stress in the vicinity of an osteocyte process and to analyse its interaction with the bone surrounding it: simulations revealed evident creep effects in bone during cyclic loading. This thesis confirms and dismisses aspects of the “scissors model". The observations support the model as a viable mechanism of microcrack detection by the osteocyte network, albeit in a slightly modified form where cyclic loading is necessary and the method of rupture is fatigue failure due to cyclic tensile motion. An in depth study was performed focusing on microscopy analysis of naturally occurring cracks in bone and FEM simulation analysis of an osteocyte process spanning a microcrack in bone under cyclic load.

Erasure error correcting codes applied to DTN communications.

The space environment has always been one of the most challenging for communications, both at physical and network layer. Concerning the latter, the most common challenges are the lack of continuous network connectivity, very long delays and relatively frequent losses. Because of these problems, the normal TCP/IP suite protocols are hardly applicable. Moreover, in space scenarios reliability is fundamental. In fact, it is usually not tolerable to lose important information or to receive it with a very large delay because of a challenging transmission channel. In terrestrial protocols, such as TCP, reliability is obtained by means of an ARQ (Automatic Retransmission reQuest) method, which, however, has not good performance when there are long delays on the transmission channel. At physical layer, Forward Error Correction Codes (FECs), based on the insertion of redundant information, are an alternative way to assure reliability. On binary channels, when single bits are flipped because of channel noise, redundancy bits can be exploited to recover the original information. In the presence of binary erasure channels, where bits are not flipped but lost, redundancy can still be used to recover the original information. FECs codes, designed for this purpose, are usually called Erasure Codes (ECs). It is worth noting that ECs, primarily studied for binary channels, can also be used at upper layers, i.e. applied on packets instead of bits, offering a very interesting alternative to the usual ARQ methods, especially in the presence of long delays. A protocol created to add reliability to DTN networks is the Licklider Transmission Protocol (LTP), created to obtain better performance on long delay links. The aim of this thesis is the application of ECs to LTP.

Polar Codes for error correction: Analysis and Decoding Algorithms

I Polar Codes sono la prima classe di codici a correzione d’errore di cui è stato dimostrato il raggiungimento della capacità per ogni canale simmetrico, discreto e senza memoria, grazie ad un nuovo metodo introdotto recentemente, chiamato ”Channel Polarization”. In questa tesi verranno descritti in dettaglio i principali algoritmi di codifica e decodifica. In particolare verranno confrontate le prestazioni dei simulatori sviluppati per il ”Successive Cancellation Decoder” e per il ”Successive Cancellation List Decoder” rispetto ai risultati riportati in letteratura. Al fine di migliorare la distanza minima e di conseguenza le prestazioni, utilizzeremo uno schema concatenato con il polar code come codice interno ed un CRC come codice esterno. Proporremo inoltre una nuova tecnica per analizzare la channel polarization nel caso di trasmissione su canale AWGN che risulta il modello statistico più appropriato per le comunicazioni satellitari e nelle applicazioni deep space. In aggiunta, investigheremo l’importanza di una accurata approssimazione delle funzioni di polarizzazione.