Reliable and energy-efficient delivery of multimedia to mobile terminals in dynamic networks is a very challenging problem. In this thesis, we focus on a cooperative extension to the Digital Video Broadcasting – Handheld (DVB-H) standard, forming a cooperative broadcast network whereby terminal-to-terminal cooperation creates a distributed form of multi-input-multi-output (MIMO) that supplements existing fixed network infrastructure. First, we develop a novel and computationally-efficient hierarchical Markov model that is able to accurately perform a cross-layer packet error mapping between the physical and transport layers of the DVB-H/IPDC (IP DataCast) protocol stack. We then construct a discrete-event simulator in MATLAB® that incorporates all of the necessary modules to conduct dynamic multiterminal network simulations. Next, the convergence of cooperative wireless communication, Raptor application layer forward error correction (AL-FEC) and Network Coding (NC) is examined. Originally proposed for broadcasting over the Internet, the application of Raptor codes to wireless cooperative communications networks has been limited to date, but they have been mandated for use in DVB-H. Network coding is used to reduce energy consumption by opportunistically recombining and rebroadcasting required combinations of packets. Two novel coding-enabled cooperative relaying protocols are developed for multicast and multiple unicast file distribution scenarios that are transparent, fully distributed, and backwards compatible with today's systems. Our protocols are able to exploit several different forms of diversity inherent to modern wireless networks, including spatial diversity, radio interface diversity, and symbol diversity. Extensive simulations show that our protocols simultaneously achieve breakthroughs in network energy efficiency and reliability for different terminal classes and densities, allowing greatly improved user experiences. / Thesis (Master, Electrical & Computer Engineering) -- Queen's University, 2010-08-03 19:45:54.943

Luby Transform Codes were the first class of universal erasure codes introduced to fully realize the concept of scalable and fault‐tolerant distribution of data over computer networks, also called Digital Fountain. Later Raptor codes, a generalization of the LT codes were introduced to trade off complexity with performance. In this work, we show that an even broader class of codes exists that are near optimal for the erasure channel and that the Raptor codes form a special case. More precisely, Raptorlike codes can be designed based on an iterative (joint) decoding schedule wherein information is transferred between the LT decoder and an outer decoder in an iterative manner. The design of these codes can be formulated as a LP problem using EXIT Charts and density evolution. In our work, we show the existence of codes, other than the Raptor codes, that perform as good as the existing ones. We extend this framework of joint decoding of the component codes to the additive white Gaussian noise channels and introduce the design of Rateless codes for these channels. Under this setting, for asymptotic lengths, it is possible to design codes that work for a class of channels defined by the signal‐to‐noise ratio. In our work, we show that good profiles can be designed using density evolution and Gaussian approximation. EXIT charts prove to be an intuitive tool and aid in formulating the code design problem as a LP problem. EXIT charts are not exact because of the inherent approximations. Therefore, we use density evolution to analyze the performance of these codes. In the Gaussian case, we show that for asymptotic lengths, a range of designs of Rateless codes exists to choose from based on the required complexity and the overhead. Moreover, under this framework, we can design incrementally redundant schemes for already existing outer codes to make the communication system more robust to channel noise variations.

Long Term Evolution (LTE) είναι το όνομα που έδωσε το 3GPP στο πρόγραμμα εξέλιξης των κινητών συστημάτων επικοινωνιών τρίτης γενιάς UMTS, με στόχο την αντιμετώπιση των μελλοντικών απαιτήσεων της αγοράς των κινητών δικτύων. Βασικοί στόχοι του νέου προτύπου LTE αποτελούν η αυξημένη απόδοση, το μικρότερο κόστος υλοποίησης, η μείωση της πολυπλοκότητας λειτουργίας και η παροχή νέων εξελιγμένων υπηρεσιών, κάνοντας χρήση νέων φασμάτων λειτουργίας. Οι προσδοκίες από το LTE είναι ιδιαίτερα υψηλές και βασίζονται στην παροχή υπηρεσιών απαλλαγμένων από τις απώλειες. Συνεπώς, η επιτυχία του LTE θα καθοριστεί από την ικανότητα παροχής κινητών συσκευών και ασύρματης υποδομής που θα ανταποκρίνονται στα πρότυπα του 3GPP και θα είναι ιδιαίτερα ανθεκτικά στις απώλειες της ασύρματης μετάδοσης, ώστε να προσφέρονται βελτιωμένες υπηρεσίες υψηλής απόδοσης. Μία βασική πτυχή των προδιαγραφών του συστήματος LTE είναι η ενίσχυση της υπηρεσίας Multimedia Broadcast/Multicast Services, όπου το ίδιο περιεχόμενο μεταδίδεται σε πολλαπλούς χρήστες που βρίσκονται σε μία συγκεκριμένη περιοχή μετάδοσης της υπηρεσίας. Η υπηρεσία MBMS πρωτοπαρουσιάστηκε σαν ένα νέο χαρακτηριστικό στην έκδοση 6 του 3GPP, ώστε να προσφέρει broadcast και multicast μετάδοση πολυμεσικού περιεχομένου σε κινητούς χρήστες μέσω MBMS ασύρματων φορέων μετάδοσης. Η υπηρεσία MBMS παρέχει δύο διαφορετικές μεθόδους διανομής περιεχομένου, τη μέθοδο download και τη μέθοδο streaming. Για να υποστηρίξει την αποδοτική διανομή MBMS περιεχομένου, το 3GPP συμπεριέλαβε ένα μηχανισμό Forward Error Correction στο επίπεδο εφαρμογών (AL-FEC). Το FEC είναι μία μέθοδος που προσφέρει έλεγχο λαθών κατά τη μετάδοση δεδομένων, η οποία χρησιμοποιείται για να υποστηρίξει ή να αντικαταστήσει άλλες μεθόδους παροχής αξιοπιστίας. Στο FEC, ο αποστολέας εισάγει πλεονάζουσα πληροφορία στη μετάδοση δεδομένων. Αυτή η πληροφορία επιτρέπει στο δέκτη να ανακατασκευάσει τα αρχικά δεδομένα. Τέτοια σχήματα αναπόφευκτα προσθέτουν ένα σταθερό overhead στα μεταδιδόμενα δεδομένα με αποτέλεσμα να είναι υπολογιστικά ακριβά. Παρόλα αυτά στα multicast πρωτόκολλα, η χρήση FEC τεχνικών προσφέρει πολύ ισχυρά κίνητρα. Η κωδικοποίηση μπορεί να εξαλείψει τις ανεξάρτητες απώλειες στους διαφορετικούς δέκτες. Επιπρόσθετα, η δραματική μείωση του ρυθμού απώλειας πακέτων μειώνει κατά ένα μεγάλο μέρος την ανάγκη επαναποστολής των χαμένων πακέτων από τον αποστολέα. Επομένως, οι FEC τεχνικές είναι πολύ εύκολο να εκπληρώσουν έναν πρωταρχικό σκοπό των multicast κινητών υπηρεσιών, που είναι η προσαρμοστικότητα σε εφαρμογές με μεγάλο αριθμό δεκτών. Αυτός είναι ο λόγος που το 3GPP συνιστά τη χρήση του AL-FEC για την υπηρεσία MBMS και πιο συγκεκριμένα, υιοθετεί τη χρήση των συστηματικών κωδίκων Raptor. Λαμβάνοντας υπόψιν τα παραπάνω, στόχος της παρούσας μεταπτυχιακής διπλωματικής εργασίας είναι η μελέτη της απόδοσης του AL-FEC πάνω σε υπηρεσίες MBMS, εστιάζοντας στην υπηρεσία της streaming μεθόδου παράδοσης δεδομένων. Προς αυτή την κατεύθυνση, στην παρούσα εργασία μελετάμε την εφαρμογή του μηχανισμού AL-FEC πάνω σε multicast streaming υπηρεσίες των LTE, διερευνώντας πως το ποσό της πλεονάζουσας πληροφορίας ποικίλλει σε πολλαπλούς χρήστες χρησιμοποιώντας ρεαλιστικά περιβάλλοντα προσομοίωσης. Επίσης, εξετάζουμε την απόδοση του AL-FEC για διάφορες διατάξεις του δικτύου ασύρματης πρόσβασης, διάφορα μοντέλα κινητικότητας των χρηστών καθώς και διάφορες παραμέτρους της FEC κωδικοποίησης. / Long Term Evolution (LTE) is the name given to a project within the Third Generation Partnership Project (3GPP) to improve the UMTS 3G mobile system standard to cope with future requirements. Goals include improving efficiency, lowering cost, reducing complexity and improving services, making use of new spectrum opportunities. Expectations are high for LTE and are based on the premise of fault-free performance. Therefore, LTE’s initial success will be determined by the ability of handset and radio infrastructure manufacturers to deliver products that conform to 3GPP standards and are robust enough to allow operators to introduce improved services. A key aspect of LTE specifications is the enhancement of Multimedia Broadcast/Multicast Services (MBMS), where the same content is transmitted to multiple users located in a specific service area. MBMS was firstly standardized as a new feature in 3GPP Release 6, in order to broadcast and multicast multimedia content to mobile terminals via MBMS radio bearer. The MBMS provides two different delivery methods, the download delivery and the streaming delivery method. To support efficient download and streaming delivery, 3GPP has included Application Layer Forward Error Correction (AL-FEC) in the MBMS standard. FEC is a method for error control for data transmission that is used to augment or replace other reliability methods. In FEC, the sender introduces redundant information in the data transmitted. This information allows the receiver to reconstruct the source data. Such schemes inevitably add a constant overhead in the transmitted data and are computationally expensive. In multicast protocols however, the use of FEC techniques has very strong motivations. The encoding eliminates the effect of independent losses at different receivers. This makes these schemes able to scale irrespectively of the actual loss pattern at each receiver. Additionally, the dramatic reduction in the packet loss rate largely reduces the need for retransmission of lost data from the sender. FEC schemes are therefore so simple as to meet a prime objective for mobile multicast services, which is scalability to applications with thousands of receivers. This is the reason why 3GPP recommends the use of AL-FEC for MBMS and, more specifically, adopts the use of systematic Raptor code. After taking into account the above analysis, objective of this master thesis is the study of AL-FEC in MBMS, focusing on the streaming delivery method. To this direction, in this work we study the application of AL-FEC for the streaming delivery method over LTE networks. We investigate how the amount of FEC overhead varies at multiple receivers using realistic simulation scenarios and we investigate the performance of AL-FEC overhead considering different cell deployments, user mobility models and FEC encoding parameters.

Metabolic disorders are commonly associated with obesity, a condition where excess caloric intake leads to massive adipose tissue (AT) expansion and eventual dysfunction. When adipose tissue loses its ability to store excess energy properly, lipids accumulate in non-adipose tissues such as liver, and muscle. This ectopic lipid deposition is a significant risk factor in the development of a collection of disorders described as metabolic syndrome. While metabolic syndrome is typically linked with obesity, patients who have an inability to develop adipose tissue depots (lipodystrophy) develop similar clinical outcomes. There is evidence that aberrant mTORC1 signaling may occur in both settings, and may be a factor that contributes to adipose dysfunction. I find that adipocyte specific loss of Raptor, a key mTORC1 subunit, leads to progressive lipoatrophy, and associated metabolic dysfunction including AT inflammation, hepatosteatosis, and insulin resistance. Interestingly, inhibition of autophagy, a pathway upregulated during Raptordeletion, prevents lipoatrophy but does not protect from ectopic lipid deposition and AT inflammation. These results suggest that outputs of mTORC1 in adipocytes individually regulate adipocyte storage capacity, and AT health. Furthermore, ablation of the amino acid sensing RagGTPases, thought to be necessary for mTORC1 activity, does not phenocopy Raptor KO, suggesting RagGTPase independent functions of mTORC1 in adipocytes. RagA/B deletion, however, did consistently increase Ucp1 expression in WAT, indicating a possible noncanonical role of the Rags in regulating Ucp1. Overall, these studies advance our understanding of regulation of adipose tissue metabolism, and shed light on previously unstudied nutrient specific signaling pathways in adipocytes.

No description available.

Tesis por compendio / Products related with Intelligent Transportation Systems (ITS) are becoming a reality on our roads. All car manufacturers are starting to include Internet access in their vehicles and to integrate smartphones directly from the dashboard, but more and more services will be introduced in the near future. Connectivity through "vehicular networks" will become a cornerstone of every new proposal, and offering an adequate quality of service is obviously desirable. However, a lot of work is needed for vehicular networks to offer performances similar to those of the wired networks. Vehicular networks can be characterized by two main features: high variability due to mobility levels that can reach up to 250 kilometers per hour, and heterogeneity, being that various competing versions from different vendors have and will be released. Therefore, to make the deployment of efficient services possible, an extensive study must be carried out and adequate tools must be proposed and developed. This PhD thesis addresses the service deployment problem in these networks at three different levels: (i) the physical and link layer, showing an exhaustive analysis of the physical channel and models; (ii) the network layer, proposing a forwarding protocol for IP packets; and (iii) the transport layer, where protocols are proposed to improve data delivery. First of all, the two main wireless technologies used in vehicular networks where studied and modeled, namely the 802.11 family of standards, particularly 802.11p, and the cellular networks focusing on LTE. Since 802.11p is a quite mature standard, we defined (i) a propagation and attenuation model capable of replicating the transmission range and the fading behavior of real 802.11p devices, both in line-of-sight conditions and when obstructed by small obstacles, and (ii) a visibility model able to deal with large obstacles, such as buildings and houses, in a realistic manner. Additionally, we proposed a model based on high-level performance indicators (bandwidth and delay) for LTE, which makes application validation and evaluation easier. At the network layer, a hybrid protocol called AVE is proposed for packet forwarding by switching among a set of standard routing strategies. Depending on the specific scenario, AVE selects one out of four different routing solutions: a) two-hop direct delivery, b) Dynamic MANET On-demand (DYMO), c) greedy georouting, and d) store-carry-and-forward technique, to dynamically adapt its behavior to the specific situation. At the transport layer, we proposed a content delivery protocol for reliable and bidirectional unicast communication in lossy links that improves content delivery in situations where the wireless network is the bottleneck. It has been designed, validated, optimized, and its performance has been analyzed in terms of throughput and resource efficiency. Finally, at system level, we propose an edge-assisted computing model that allows reducing the response latency of several queries by placing a computing unit at the network edge. This way, traffic traversal through the Internet is avoided when not needed. This scheme could be used in both 802.11p and cellular networks, and in this thesis we decided to focus on its evaluation using LTE networks. The platform presented in this thesis combines all the individual efforts to create a single efficient platform. This new environment could be used by any provider to improve the quality of the user experience obtainable through the proposed vehicular network-based services. / Los productos relacionados con los Sistemas Inteligentes de Transporte (ITS) se están transformando en una realidad en nuestras carreteras. Todos los fabricantes de coches comienzan a incluir acceso a internet en sus vehículos y a facilitar su integración con los teléfonos móviles, pero más y más servicios se introducirán en el futuro. La conectividad usando las "redes vehiculares" se convertirá en la piedra angular de cada nueva propuesta, y ofrecer una calidad de servicio adecuada será, obviamente, deseable. Sin embargo, se necesita una gran cantidad de trabajo para que las redes vehiculares ofrezcan un rendimiento similar al de las redes cableadas. Las redes vehiculares quedan definidas por sus dos características básicas: alto dinamismo, pues los nodos pueden alcanzar una velocidad relativa de más de 250 km/h; y heterogeneidad, por la gran cantidad de propuestas diferentes que los fabricantes están lanzando al mercado. Por ello, para hacer posible el despliegue de servicios sobre ellas, se impone la necesidad de hacer un estudio en profundidad de este entorno, y deben de proponerse y desarrollarse las herramientas adecuadas. Esta tesis ataca la problemática del despliegue de servicios en estas redes a tres niveles diferentes: (i) el nivel físico y de enlace, mostrando varios análisis en profundidad del medio físico y modelos derivados para su simulación; (ii) el nivel de red, proponiendo un protocolo de difusión de la información para los paquetes IP; y (iii) el nivel de transporte, donde otros protocolos son propuestos para mejorar el rendimiento del transporte de datos. En primer lugar, se han estudiado y modelado las dos principales tecnologías inalámbricas que se utilizan para la comunicación en redes vehiculares, la rama de estándares 802.11, en concreto 802.11p; y la comunicación celular, en particular LTE. Dado que el estándar 802.11p es un estándar bastante maduro, nos centramos en crear (i) un modelo de propagación y atenuación capaz de replicar el rango de transmisión de dispositivos 802.11p reales, en condiciones de visión directa y obstrucción por pequeños obstáculos, y (ii) un modelo de visibilidad capaz de simular el efecto de grandes obstáculos, como son los edifcios, de una manera realista. Además, proponemos un modelo basado en indicadores de rendimiento de alto nivel (ancho de banda y retardo) para LTE, que facilita la validación y evaluación de aplicaciones. En el plano de red, se propone un protocolo híbrido, llamado AVE, para el encaminamiento y reenvío de paquetes usando un conjunto de estrategias estándar de enrutamiento. Dependiendo del escenario, AVE elige entre cuatro estrategias diferentes: a) entrega directa a dos saltos, b) Dynamic MANET On-demand (DYMO) c) georouting voraz, y d) una técnica store-carry-and- forward, para adaptar su comportamiento dinámicamente a cada situación. En el plano de transporte, se propone un protocolo bidireccional de distribución de contenidos en canales con pérdidas que mejora la entrega de contenidos en situaciones en las que la red es un cuello de botella, como las redes inalámbricas. Ha sido diseñado, validado, optimizado, y su rendimiento ha sido analizado en términos de productividad y eficiencia en la utilización de recursos. Finalmente, a nivel de sistema, proponemos un modelo de computación asistida que permite reducir la latencia en la respuesta a muchas consultas colocando una unidad de computación en el borde de la red, i.e., la red de acceso. Este esquema podría ser usado en redes basadas en 802.11p y en redes celulares, si bien en esta tesis decidimos centrarnos en su evaluación usando redes LTE. La plataforma presentada en esta tesis combina todos los esfuerzos individuales para crear una plataforma única y eficiente. Este nuevo entorno puede ser usado por cualquier proveedor para mejorar la calidad de la experiencia de usuario en los servicios desplegados sobre redes vehiculares. / Els productes relacionats amb els sistemes intel · ligents de transport (ITS) s'estan transformant en una realitat en les nostres carreteres. Tots els fabri- cants de cotxes comencen a incloure accés a internet en els vehicles i a facilitar- ne la integració amb els telèfons mòbils, però en el futur més i més serveis s'hi introduiran. La connectivitat usant les xarxes vehicular esdevindrà la pedra angular de cada nova proposta, i oferir una qualitat de servei adequada serà, òbviament, desitjable. No obstant això, es necessita una gran quantitat de treball perquè les xarxes vehiculars oferisquen un rendiment similar al de les xarxes cablejades. Les xarxes vehiculars queden definides per dues característiques bàsiques: alt dinamisme, ja que els nodes poden arribar a una velocitat relativa de més de 250 km/h; i heterogeneïtat, per la gran quantitat de propostes diferents que els fabricants estan llançant al mercat. Per això, per a fer possible el desplegament de serveis sobre aquestes xarxes, s'imposa la necessitat de fer un estudi en profunditat d'aquest entorn, i cal proposar i desenvolupar les eines adequades. Aquesta tesi ataca la problemàtica del desplegament de serveis en aquestes xarxes a tres nivells diferents: (i) el nivell físic i d'enllaç , mostrant diverses anàlisis en profunditat del medi físic i models derivats per simular-lo; (ii) el nivell de xarxa, proposant un protocol de difusió de la informació per als paquets IP; i (iii) el nivell de transport, on es proposen altres protocols per a millorar el rendiment del transport de dades. En primer lloc, s'han estudiat i modelat les dues principals tecnologies sense fils que s'utilitzen per a la comunicació en xarxes vehiculars, la branca d'estàndards 802.11, en concret 802.11p; i la comunicació cel · lular, en partic- ular LTE. Atès que l'estàndard 802.11p és un estàndard bastant madur, ens centrem a crear (i) un model de propagació i atenuació capaç de replicar el rang de transmissió de dispositius 802.11p reals, en condicions de visió directa i obstrucció per petits obstacles, i (ii) un model de visibilitat capaç de simular l'efecte de grans obstacles, com són els edificis, d'una manera realista. A més, proposem un model basat en indicadors de rendiment d'alt nivell (ample de banda i retard) per a LTE, que facilita la validació i l'avaluació d'aplicacions. En el pla de xarxa, es proposa un protocol híbrid, anomenat AVE, per a l'encaminament i el reenviament de paquets usant un conjunt d'estratègies estàndard d'encaminament. Depenent de l'escenari , AVE tria entre quatre estratègies diferents: a) lliurament directe a dos salts, b) Dynamic MANET On-demand (DYMO) c) georouting voraç, i d) una tècnica store-carry-and- forward, per a adaptar-ne el comportament dinàmicament a cada situació. En el pla de transport, es proposa un protocol bidireccional de distribució de continguts en canals amb pèrdues que millora el lliurament de continguts en situacions en què la xarxa és un coll de botella, com les xarxes sense fils. Ha sigut dissenyat, validat, optimitzat, i el seu rendiment ha sigut analitzat en termes de productivitat i eficiència en la utilització de recursos. Finalment, a nivell de sistema, proposem un model de computació assistida que permet reduir la latència en la resposta a moltes consultes col · locant una unitat de computació a la vora de la xarxa, és a dir, la xarxa d'accés. Aquest esquema podria ser usat en xarxes basades en 802.11p i en xarxes cel · lulars, si bé en aquesta tesi decidim centrar-nos en la seua avaluació usant xarxes LTE. La plataforma presentada en aquesta tesi combina tots els esforços indi- viduals per a crear una plataforma única i eficient. Aquest nou entorn pot ser usat per qualsevol proveïdor per a millorar la qualitat de l'experiència d'usuari en els serveis desplegats sobre xarxes vehiculars. / Báguena Albaladejo, M. (2017). Design and implementation of simulation tools, protocols and architectures to support service platforms on vehicular networks [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/85333 / Compendio

The White-bellied Sea-Eagle Haliaeetus leucogaster is widespread in Australia, but has been the subject of conservation concern due to suggested localised declines and extinctions. Regionalised monitoring programmes have addressed some aspects of local concern, however a broader approach is needed to gain an understanding of large-scale processes affecting long-term persistence at scales equivalent to the species Australian range. Ultimately, the ability to predict change in population size over time accurately depends on the scale of analysis. By necessity, ecological studies using direct sampling techniques are often made across spatial scales smaller than a species geographic range and across relatively short time frames. This seems counter-intuitive considering that long-term species persistence is often dependent on large-scale processes. The principal aim of this thesis was to identify historical and contemporary forces responsible for the current pattern of population structure in H. leucogaster. This required a multi-scale approach, and the resulting research uses genetic, distributional and morphometric data. Haliaeetus leucogaster is a large territorial raptor that historically has been associated with coastal regions, lakes and perennial river systems. It has an extensive worldwide distribution from the western coast of India throughout the Indomalaysian region, Papua New Guinea and Australia. By virtue of the species' large-scale distribution, in Australia it is fairly cosmopolitan in its use of habitat and prey types. Haliaeetus leucogaster is monomorphic for adult plumage colouration, but in body size displays reversed sexual dimorphism with female birds significantly larger. A discriminant function based on 10 morphometric characters was 100% effective in discriminating between 19 males and 18 females that had been sexed using molecular genetic methods. Re-classification using a jackknife procedure correctly identified 92% of individuals. The discriminant function should be a viable alternative to genetic sexing or laparoscopy for a large proportion of individuals within the Australo-Papuan range of this species; and can also be used to identify a small proportion of "ambiguous" individuals for which reliable sexing will require those other techniques. I used mitochondrial (mtDNA) control region sequence data to investigate the current distribution of genetic variation in this species at the continental level and within and between specified regional units. I was specifically interested in identifying breaks in genetic connectivity between the west and east of the continent and between Tasmania and the Australian mainland. Overall, genetic diversity was low and there was no significant level of genetic subdivision between regions. The observed genetic distribution suggests that the population expanded from a bottleneck approximately 160 000 years ago during the late Pleistocene, and spread throughout the continent through a contiguous range expansion. There is insufficient evidence to suggest division of the population into different units for conservation management purposes based on the theoretical definition of the 'evolutionary significant unit'. It is clear from the analysis that there are signatures of both historical and contemporary processes affecting the current distribution. Given the suggestion that population expansion has been relatively recent, additional sampling and confirmation of the perceived pattern of population structure using a nuclear marker is recommended to validate conservation monitoring and management at a continental scale. To determine the existence of perceived population declines across ecological time scales, I analysed the Australian Bird Atlas Data to identify the extent and pattern of change in range and density of the species between three Atlas Periods (1901-1976, 1977-1981 and 1998-2001) using a new standardised frequency measure, the Occupancy Index (OI) for 1° blocks (approx. 100km2) across the continent. At the continental scale, there was no significant difference in the spatial extent of occupancy between Atlas Periods. However, there were considerable changes in frequency and range extent between defined regions, and there were distinct differences in the pattern of change in OI between coastal and inland blocks over time. Coastal blocks showed much more change than inland blocks, with a clear increase in the use of coastal blocks, accompanied by a decrease in inland blocks, during the 1977-1981 Atlas Period, relative to both other Atlas Periods. The over-riding factor associated with distributional shifts and frequency changes was apparently climatic fluctuation (the 1977-1981 period showing the influence of El Nino associated drought). The impression of abundance was strongly dependent on both the temporal and spatial scale of analysis. To test for correspondence between geographic variation in morphology and geographic variation in mtDNA I analysed morphometric data from 95 individuals from Australia and Papua New Guinea. First, the degree of morphometric variation between specified regions was determined. This was then compared with the pattern of genetic differentiation. There was a strong latitudinal cline in body dimensions. However, there was no relationship between morphometric variation and patterns of genetic variation at least for mtDNA. Females showed a pattern of isolation by distance based on morphometric characters whereas males did not. Three hypotheses to explain the pattern of morphometric variation were considered: phenotypic plasticity, natural selection and secondary contact between previously isolated populations. I conclude that the pattern of morphometric variation is best explained by the suggestion that there is sufficient local recruitment for natural selection to maintain the observed pattern of morphometric variation. This implies that gene flow may not be as widespread as the mtDNA analysis suggested. In this instance either the relatively recent colonisation history of the species or the inability of the mtDNA marker to detect high mutation rates among traits responsible for maintaining morphometric variation may be overestimating the levels of mixing among regions. As might be expected given the physical scale over which this study was conducted, the pattern of genetic, morphometric and physical distribution varied dependent on the scale of analysis. Regional patterns of genetic variation, trends in occupancy and density and morphometric variation did not reflect continental patterns, reinforcing the contention that extrapolation of data from local or regional levels is often inappropriate. The combined indirect methodologies applied in this study circumvent the restrictions imposed by direct ecological sampling, because they allow survey across large geographic and temporal scales effectively covering the entire Australian range of H. leucogaster. They also allow exploration of the evolutionary factors underpinning the species' current distribution.

The area of cooperative communications has received tremendous research interest in recent years. This interest is not unwarranted, since cooperative communications promises the ever-so-sought after diversity and multiplexing gains typically associated with multiple-input multiple-output (MIMO) communications, without actually employing multiple antennas. In this dissertation, we consider several cooperative communication channels, and for each one of them, we develop information theoretic coding schemes and derive their corresponding performance limits. We next develop and design practical coding strategies which perform very close to the information theoretic limits. The cooperative communication channels we consider are: (a) The Gaussian relay channel, (b) the quasi-static fading relay channel, (c) cooperative multiple-access channel (MAC), and (d) the cognitive radio channel (CRC). For the Gaussian relay channel, we propose a compress-forward (CF) coding strategy based on Wyner-Ziv coding, and derive the achievable rates specifically with BPSK modulation. The CF strategy is implemented with low-density parity-check (LDPC) and irregular repeataccumulate codes and is found to operate within 0.34 dB of the theoretical limit. For the quasi-static fading relay channel, we assume that no channel state information (CSI) is available at the transmitters and propose a rateless coded protocol which uses rateless coded versions of the CF and the decode-forward (DF) strategy. We implement the protocol with carefully designed Raptor codes and show that the implementation suffers a loss of less than 10 percent from the information theoretical limit. For the MAC, we assume quasi-static fading, and consider cooperation in the low-power regime with the assumption that no CSI is available at the transmitters. We develop cooperation methods based on multiplexed coding in conjunction with rateless codes and find the achievable rates and in particular the minimum energy per bit to achieve a certain outage probability. We then develop practical coding methods using Raptor codes, which performs within 1.1 dB of the performance limit. Finally, we consider a CRC and develop a practical multi-level dirty-paper coding strategy using LDPC codes for channel coding and trellis-coded quantization for source coding. The designed scheme is found to operate within 0.78 dB of the theoretical limit. By developing practical coding strategies for several cooperative communication channels which exhibit performance close to the information theoretic limits, we show that cooperative communications not only provide great benefits in theory, but can possibly promise the same benefits when put into practice. Thus, our work can be considered a useful and necessary step towards the commercial realization of cooperative communications.

Fountain codes have demonstrated great results for the binary erasure channel and have already been incorporated into several international standards to recover lost packets at the application layer. These include multimedia broadcast/multicast sessions and digital video broadcasting on global internet-protocol. The rateless property of Fountain codes holds great promise for noisy channels. These are more sophisticated mathematical models representing errors on communications links rather than only erasures. The practical implementation of Fountain codes for these channels, however, is hampered by high decoding cost and delay. In this work we study trapping sets in Fountain codes over noisy channels and their effect on the decoding process. While trapping sets have received much attention for low-density parity-check (LDPC) codes, to our knowledge they have never been fully explored for Fountain codes. Our study takes into account the different code structure and the dynamic nature of Fountain codes. We show that 'error-free' trapping sets exist for Fountain codes. When the decoder is caught in an error-free trapping set it actually has the correct message estimate, but is unable to detect this is the case. Thus, the decoding process continues, increasing the decoding cost and delay for naught. The decoding process for rateless codes consists of one or more decoding attempts. We show that trapping sets may reappear as part of other trapping sets on subsequent decoding attempts or be defeated by the reception of more symbols. Based on our observations we propose early termination methods that use trapping set detection to obtain improvements in realized rate, latency, and decoding cost for Fountain codes. / Thesis (Master, Electrical & Computer Engineering) -- Queen's University, 2009-10-29 14:33:06.548

One of the most important technologies used in modern communication systems is channel coding. Channel coding dates back to a paper published by Shannon in 1948 [1] entitled “A Mathematical Theory of Communication”. The basic idea behind channel coding is to send redundant information (parity) together with a message to make the transmission more error resistant. There are different types of codes that can be used to generate the parity required, including block, convolutional and concatenated codes. A special subclass of codes consisting of the codes mentioned in the previous paragraph, is sparse graph codes. The structure of sparse graph codes can be depicted via a graphical representation: the factor graph which has sparse connections between its elements. Codes belonging to this subclass include Low-Density-Parity-Check (LDPC) codes, Repeat Accumulate (RA), Turbo and fountain codes. These codes can be decoded by using the belief propagation algorithm, an iterative algorithm where probabilistic information is passed to the nodes of the graph. This dissertation focuses on noisy decoding of fountain codes using belief propagation decoding. Fountain codes were originally developed for erasure channels, but since any factor graph can be decoded using belief propagation, noisy decoding of fountain codes can easily be accomplished. Three fountain codes namely Tornado, Luby Transform (LT) and Raptor codes were investigated during this dissertation. The following results were obtained: <ol> <li>The Tornado graph structure is unsuitable for noisy decoding since the code structure protects the first layer of parity instead of the original message bits (a Tornado graph consists of more than one layer).</li> <li> The successful decoding of systematic LT codes were verified.</li> <li>A systematic Raptor code was introduced and successfully decoded. The simulation results show that the Raptor graph structure can improve on its constituent codes (a Raptor code consists of more than one code).</li></ol> Lastly an LT code was used to replace the convolutional incremental redundancy scheme used by the 2G mobile standard Enhanced Data Rates for GSM Evolution (EDGE). The results show that a fountain incremental redundancy scheme outperforms a convolutional approach if the frame lengths are long enough. For the EDGE platform the results also showed that the fountain incremental redundancy scheme outperforms the convolutional approach after the second transmission is received. Although EDGE is an older technology, it still remains a good platform for testing different incremental redundancy schemes, since it was one of the first platforms to use incremental redundancy. / Dissertation (MEng)--University of Pretoria, 2008. / Electrical, Electronic and Computer Engineering / MEng / unrestricted