40 research outputs found
Rateless-Coding-Assisted Multi-Packet Spreading over Mobile Networks
A novel Rateless-coding-assisted Multi-Packet Relaying (RMPR) protocol is
proposed for large-size data spreading in mobile wireless networks. With this
lightweight and robust protocol, the packet redundancy is reduced by a factor
of , while the spreading time is reduced at least by a factor of . Closed-form bounds and explicit non-asymptotic results are presented,
which are further validated through simulations. Besides, the packet
duplication phenomenon in the network setting is analyzed for the first time
Near-capacity fixed-rate and rateless channel code constructions
Fixed-rate and rateless channel code constructions are designed for satisfying conflicting design tradeoffs, leading to codes that benefit from practical implementations, whilst offering a good bit error ratio (BER) and block error ratio (BLER) performance. More explicitly, two novel low-density parity-check code (LDPC) constructions are proposed; the first construction constitutes a family of quasi-cyclic protograph LDPC codes, which has a Vandermonde-like parity-check matrix (PCM). The second construction constitutes a specific class of protograph LDPC codes, which are termed as multilevel structured (MLS) LDPC codes. These codes possess a PCM construction that allows the coexistence of both pseudo-randomness as well as a structure requiring a reduced memory. More importantly, it is also demonstrated that these benefits accrue without any compromise in the attainable BER/BLER performance. We also present the novel concept of separating multiple users by means of user-specific channel codes, which is referred to as channel code division multiple access (CCDMA), and provide an example based on MLS LDPC codes. In particular, we circumvent the difficulty of having potentially high memory requirements, while ensuring that each user’s bits in the CCDMA system are equally protected. With regards to rateless channel coding, we propose a novel family of codes, which we refer to as reconfigurable rateless codes, that are capable of not only varying their code-rate but also to adaptively modify their encoding/decoding strategy according to the near-instantaneous channel conditions. We demonstrate that the proposed reconfigurable rateless codes are capable of shaping their own degree distribution according to the nearinstantaneous requirements imposed by the channel, but without any explicit channel knowledge at the transmitter. Additionally, a generalised transmit preprocessing aided closed-loop downlink multiple-input multiple-output (MIMO) system is presented, in which both the channel coding components as well as the linear transmit precoder exploit the knowledge of the channel state information (CSI). More explicitly, we embed a rateless code in a MIMO transmit preprocessing scheme, in order to attain near-capacity performance across a wide range of channel signal-to-ratios (SNRs), rather than only at a specific SNR. The performance of our scheme is further enhanced with the aid of a technique, referred to as pilot symbol assisted rateless (PSAR) coding, whereby a predetermined fraction of pilot bits is appropriately interspersed with the original information bits at the channel coding stage, instead of multiplexing pilots at the modulation stage, as in classic pilot symbol assisted modulation (PSAM). We subsequently demonstrate that the PSAR code-aided transmit preprocessing scheme succeeds in gleaning more information from the inserted pilots than the classic PSAM technique, because the pilot bits are not only useful for sounding the channel at the receiver but also beneficial for significantly reducing the computational complexity of the rateless channel decoder
Scalable Video Streaming with Prioritised Network Coding on End-System Overlays
PhDDistribution over the internet is destined to become a standard approach for live broadcasting
of TV or events of nation-wide interest. The demand for high-quality live video
with personal requirements is destined to grow exponentially over the next few years. Endsystem
multicast is a desirable option for relieving the content server from bandwidth bottlenecks
and computational load by allowing decentralised allocation of resources to the users
and distributed service management. Network coding provides innovative solutions for a
multitude of issues related to multi-user content distribution, such as the coupon-collection
problem, allocation and scheduling procedure. This thesis tackles the problem of streaming
scalable video on end-system multicast overlays with prioritised push-based streaming.
We analyse the characteristic arising from a random coding process as a linear channel
operator, and present a novel error detection and correction system for error-resilient decoding,
providing one of the first practical frameworks for Joint Source-Channel-Network
coding. Our system outperforms both network error correction and traditional FEC coding
when performed separately. We then present a content distribution system based on endsystem
multicast. Our data exchange protocol makes use of network coding as a way to
collaboratively deliver data to several peers. Prioritised streaming is performed by means
of hierarchical network coding and a dynamic chunk selection for optimised rate allocation
based on goodput statistics at application layer. We prove, by simulated experiments, the
efficient allocation of resources for adaptive video delivery. Finally we describe the implementation
of our coding system. We highlighting the use rateless coding properties, discuss
the application in collaborative and distributed coding systems, and provide an optimised
implementation of the decoding algorithm with advanced CPU instructions. We analyse
computational load and packet loss protection via lab tests and simulations, complementing
the overall analysis of the video streaming system in all its components
Application of network coding in satellite broadcast and multiple access channels
Satellite broadcasting and relaying capabilities enable mobile broadcast systems over wide geographical areas, which opens large market possibilities for handheld, vehicular and fixed user terminals. The geostationary (GEO) satellite orbit is highly suited for such applications, as it spares the need for satellite terminals to track the movement of the spacecraft, with important savings in terms of complexity and cost. The large radius of the GEO orbit (more than 40000 km) has two main drawbacks. One is the large free space loss experienced by a signal traveling to or from the satellite, which limits the signal-to-noise ratio (SNR) margins in the link budget with respect to terrestrial systems. The second drawback of the GEO orbit is the large propagation delay (about 250 msec) that limits the use of feedback in both the forward (satellite to satellite terminal) and the reverse (satellite terminal to satellite) link. The limited margin protection causes loss of service availability in environments where there is no direct line of sight to the satellite, such as urban areas. The large propagation delay on its turn, together with the large terminal population size usually served by a GEO satellite, limit the use of feedback, which is at the basis of error-control. In the reverse link, especially in the case of fixed terminals, packet losses are mainly due to collisions, that severely limit the access to satellite services in case a random access scheme is adopted. The need for improvements and further understanding of these setups lead to the development of our work. In this dissertation we study the application of network coding to counteract the above mentioned channel impairments in satellite systems. The idea of using network coding stems from the fact that it allows to efficiently exploit the diversity, either temporal or spatial, present in the system.
In the following we outline the original contributions included in each of the chapters of the dissertation.
Chapter 3. This chapter deals with channel impairments in the forward link, and specifically with the problem of missing coverage in Urban environments for land mobile satellite (LMS) networks. By applying the Max-flow Min-cut theorem we derive a lower bound on the maximum coverage that can be achieved through cooperation. Inspired by this result, we propose a practical scheme, keeping in mind the compatibility with the DVB-SH standard. We developed a simulator in Matlab/C++ based on the physical layer abstraction and used it to test the performance gain of our scheme with a benchmark relaying scheme that does allow coding at packet level.
Chapter 4. The second chapter of contributions is devoted to the information theoretical
study of real-time streaming transmissions over fading channels with channel state information at the transmitter only. We introduce this new channel model and propose several transmission schemes, one of which is proved to be asymptotically optimal in terms of throughput. We also provide an upper bound on the achievable throughput for the proposed channel model and compare it numerically with the proposed schemes over a Rayleigh fading channel.
Chapter 5. Chapter 5 is devoted to the study of throughput and delay in non-real-time streaming transmission over block fading channels. We derive bounds on the throughput and the delay for this channel and propose different coding techniques based on time-sharing. For each of them we carry out an analytical study of the performance. Finally, we compare numerically the performance of the proposed schemes over a Rayleigh fading channel.
Chapter 6. In the last technical chapter we propose a collision resolution method for the return link based on physical layer network coding over extended Galois field (EGF). The proposed scheme extracts information from the colliding signals and achieves important gains with respect to Slotted ALOHA systems as well as with respect to other collision resolution schemes.Una de les característiques mes importants de les plataformes de comunicacions per satèl.lit és la seva capacitat de retransmetre senyals rebuts a un gran número de terminals. Això es fonamental en contextes com la difusió a terminals mòbils o la comunicació entre màquines.
Al mateix temps, la disponibilitat d’un canal de retorn permet la creació de sistemes de comunicacions per satèl.lit interactius que, en principi, poden arribar a qualsevol punt del planeta. Els satèl.lits Geoestacionaris son particularment adequats per a complir amb aquesta tasca. Aquest tipus de satèl.lits manté una posició fixa respecte a la Terra, estalviant als terminals terrestres la necessitat de seguir el seu moviment en el cel. Per altra banda, la gran distància que separa la Terra dels satèl.lits Geoestacionaris introdueix grans retrassos en les
comunicacions que, afegit al gran número de terminals en servei, limita l’ús de tècniques de retransmissió basades en acknowledgments en cas de pèrdua de paquets. Per tal de sol.lucionar el problema de la pèrdua de paquets, les tècniques més utilitzades son el desplegament de
repetidors terrestres, anomenats gap fillers, l’ús de codis de protecció a nivell de paquet i mecanismes proactius de resolució de col.lisions en el canal de retorn.
En aquesta tesi s’analitzen i s’estudien sol.lucions a problemes en la comunicació per satèl.lit tant en el canal de baixada com el de pujada. En concret, es consideren tres escenaris diferents.
El primer escenari es la transmissió a grans poblacions de terminals mòbils en enorns urbans, que es veuen particularment afectats per la pèrdua de paquets degut a l’obstrucció, per part dels edificis,
de la línia de visió amb el satèl.lit. La sol.lució que considerem consisteix en la utilització de la cooperació entre terminals. Una vegada obtinguda una mesura del guany que es pot assolir mitjançant cooperació en un model bàsic de xarxa, a través del teorema Max-flow Min-cut, proposem un esquema de cooperació compatible amb estàndards de comunicació existents.
El segon escenari que considerem es la transmissió de vídeo, un tipus de tràfic particularment sensible a la pèrdua de paquets i retards endògens als sistemes de comunicació per satèl.lit. Considerem els casos de transmissió en temps real i en diferit, des de la perspectiva de teoria de la informació, i estudiem diferents tècniques de codificació analítica i numèrica. Un dels resultats principals obtinguts es l’extensió del límit assolible de la capacitat ergòdica del canal en cas que el transmissor rebi les dades de manera gradual, enlloc de rebre-les totes a l’inici de la transmissió.
El tercer escenari que considerem es l’accés aleatori al satèl.lit. Desenvolupem un esquema de recuperació dels paquets perduts basat en la codificació de xarxa a nivell físic i en extensions a camps de Galois, amb resultats molt prometedors en termes de rendiment.
També estudiem aspectes relacionats amb la implementació pràctica d’aquest esquema
Recommended from our members
Improving the performance and efficiency of wireless networks using rate adaptation
Recent years have seen a staggering increase in the deployment and utilization of wireless networks. More and more devices are being equipped with Wireless LAN (WLAN) cards to take advantage of the omnipresence of WLAN networks. Therefore, it has become necessary that the protocols used by WLANs are efficient and provide good performance. Rate Adaptation protocols are an important mechanism employed by WLANs to improve network performance. This dissertation develops three complementary techniques, which use rate adaptation to optimize and improve performance by i) performing rate adaptation to optimize energy consumption, ii) developing a more accurate technique to predict the frame delivery ratio that is used by rate adaptation protocols, and iii) jointly optimizing rate adaptation with data retransmission to maximize throughput.
More specifically, in i), we use extensive measurements to develop a simple yet accurate energy consumption model for 802.11n wireless cards. We use the model to drive the design of an energy aware rate adaptation scheme. A major benefit of a model-based rate adaptation is that applying a model allows us to eliminate frequent probes required in many existing rate adaptation schemes.
In ii), we find that the accuracy of existing delivery ratio calculation techniques is still limited due to bursty errors inherent to the wireless channel. We develop a new method for computing packet delivery rate that captures the burstiness of errors. Furthermore, we propose a new data interleaving technique, which leverages our framework to reduce the burstiness of errors, thereby improving frame delivery ratio.
Finally, in iii), we address the susceptibility of wireless networks to transmission failures due to dynamic channel conditions and unpredictable interference. To efficiently recover from failures, we propose a retransmission scheme where the receiver combines information received from multiple failed transmissions associated with the same frame. The protocol has two distinguishing features. First, it simultaneously supports partial retransmission and combines bits with low confidence. Second, it jointly optimizes the data rate of the retransmission and the information to be retransmitted to maximize throughput.Electrical and Computer Engineerin