68 research outputs found

    Backlog and Delay Reasoning in HARQ Systems

    Full text link
    Recently, hybrid-automatic-repeat-request (HARQ) systems have been favored in particular state-of-the-art communications systems since they provide the practicality of error detections and corrections aligned with repeat-requests when needed at receivers. The queueing characteristics of these systems have taken considerable focus since the current technology demands data transmissions with a minimum delay provisioning. In this paper, we investigate the effects of physical layer characteristics on data link layer performance in a general class of HARQ systems. Constructing a state transition model that combines queue activity at a transmitter and decoding efficiency at a receiver, we identify the probability of clearing the queue at the transmitter and the packet-loss probability at the receiver. We determine the effective capacity that yields the maximum feasible data arrival rate at the queue under quality-of-service constraints. In addition, we put forward non-asymptotic backlog and delay bounds. Finally, regarding three different HARQ protocols, namely Type-I HARQ, HARQ-chase combining (HARQ-CC) and HARQ-incremental redundancy (HARQ-IR), we show the superiority of HARQ-IR in delay robustness over the others. However, we further observe that the performance gap between HARQ-CC and HARQ-IR is quite negligible in certain cases. The novelty of our paper is a general cross-layer analysis of these systems, considering encoding/decoding in the physical layer and delay aspects in the data-link layer

    PPR: Partial Packet Recovery for Wireless Networks

    Get PDF
    Bit errors occur over wireless channels when the signal isn't strongenough to overcome the effects of interference and noise. Currentwireless protocols may use forward error correction (FEC) to correct forsome (small) number of bit errors, but generally retransmit the wholepacket if the FEC is insufficient. We observe that current wirelessmesh network protocols retransmit a number of packets and that most ofthese retransmissions end up sending bits that have already beenreceived multiple times, wasting network capacity. To overcome thisinefficiency, we develop, implement, and evaluate a partial packetrecovery (PPR) system.PPR incorporates three new ideas: (1) SoftPHY, an expandedphysical layer (PHY) interface to provide hints to the higher layersabout how ``close'' the actual received symbol was to the one decoded,(2) a postamble scheme to recover data even when a packet'spreamble is corrupted and not decodable at the receiver, and (3) PP-ARQ, an asynchronous link-layer retransmission protocol that allowsa receiver to compactly encode and request for retransmission only thoseportions of a packet that are likely in error.Our experimental results from a 27-node 802.15.4 testbed that includesTelos motes with 2.4 GHz Chipcon radios and GNU Radio nodes implementingthe Zigbee standard (802.15.4) show that PPR increases the framedelivery rate by a factor of 2x under moderate load, and7x under heavy load when many links have marginal quality

    A random access MAC protocol for MPR satellite networks

    Get PDF
    Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e TecnologiaRandom access approaches for Low Earth Orbit (LEO) satellite networks are usually incompatible with the Quality of Service (QoS) requirements of multimedia tra c, especially when hand-held devices must operate with very low power. Cross-Layered optimization architectures, combined with Multipacket Reception (MPR)schemes are a good choice to enhance the overall performance of a wireless system. Hybrid Network-assisted Diversity Multiple Access (H-NDMA) protocol, exhibits high energy e ciency, with MPR capability, but its use with satellites is limited by the high round trip time. This protocol was adapted to satellites, in Satellite-NDMA, but it required a pre-reservation mechanism that introduces a signi cant delay. This dissertation proposes a random access protocol that uses H-NDMA, for Low Earth Orbit (LEO) satellite networks, named Satellite Random-NDMA (SR-NDMA). The protocol addresses the problem inherent to satellite networks (large round trip time and signi cant energy consumption) de ning a hybrid approach with an initial random access plus possible additional scheduled retransmissions. An MPR receiver combines the multiple copies received, gradually reducing the error rate. Analytical performance models are proposed for the throughput, delay, jitter and energy e ciency considering nite queues at the terminals. It is also addressed the energy e ciency optimization, where the system parameters are calculated to guarantee the QoS requirements. The proposed system's performance is evaluated for a Single-Carrier with Frequency Domain Equalization (SC-FDE) receiver. Results show that the proposed system is energy e cient and can provide enough QoS to support services such as video telephony

    Random Access for Machine-Type Communication based on Bloom Filtering

    Get PDF
    We present a random access method inspired on Bloom filters that is suited for Machine-Type Communications (MTC). Each accessing device sends a \emph{signature} during the contention process. A signature is constructed using the Bloom filtering method and contains information on the device identity and the connection establishment cause. We instantiate the proposed method over the current LTE-A access protocol. However, the method is applicable to a more general class of random access protocols that use preambles or other reservation sequences, as expected to be the case in 5G systems. We show that our method utilizes the system resources more efficiently and achieves significantly lower connection establishment latency in case of synchronous arrivals, compared to the variant of the LTE-A access protocol that is optimized for MTC traffic. A dividend of the proposed method is that it allows the base station (BS) to acquire the device identity and the connection establishment cause already in the initial phase of the connection establishment, thereby enabling their differentiated treatment by the BS.Comment: Accepted for presentation on IEEE Globecom 201

    Distributed Coding and Modulation for 2-hop Communication via Relays

    Get PDF
    The past few decades have seen tremendous growth in the field of wireless communication systems. At this juncture, just before the advent of the 4th Generation of mobile standards, the question asked is how to improve the system in terms of coverage, capacity and reliability for the cell-edge users in a cellular network. Providing answers to this question could result in a significant improvement in the average throughput of the cell. The main purpose of the thesis work is therefore to implement Cooperative Communication via Distributed System of Relays. This concept is derived from the combination of relaying technology and multiple antenna techniques used in MIMO systems. During this thesis work, two transmit diversity schemes: the Delay Diversity Scheme and the Distributed Alamouti Scheme are developed on a 3GPP LTE compliant platform described as the OpenAir Interface. The ultimate objective is basically to improve the system performance by exploiting macro-diversity gains obtained as a result of these schemes. In the process of this development, numerous challenging tasks are provided with efficient solutions and have been implemented. Moreover, the last but the most crucial task of the thesis is to develop an entirely new HARQ protocol for a distributed system of relays. The work has been carried out at Eurecom, France as an initial step to implement the aforementioned schemes on a real-time network

    A hardware spinal decoder

    Get PDF
    Spinal codes are a recently proposed capacity-achieving rateless code. While hardware encoding of spinal codes is straightforward, the design of an efficient, high-speed hardware decoder poses significant challenges. We present the first such decoder. By relaxing data dependencies inherent in the classic M-algorithm decoder, we obtain area and throughput competitive with 3GPP turbo codes as well as greatly reduced latency and complexity. The enabling architectural feature is a novel alpha-beta incremental approximate selection algorithm. We also present a method for obtaining hints which anticipate successful or failed decoding, permitting early termination and/or feedback-driven adaptation of the decoding parameters. We have validated our implementation in FPGA with on-air testing. Provisional hardware synthesis suggests that a near-capacity implementation of spinal codes can achieve a throughput of 12.5 Mbps in a 65 nm technology while using substantially less area than competitive 3GPP turbo code implementations.Irwin Mark Jacobs and Joan Klein Jacobs Presidential FellowshipIntel Corporation (Fellowship)Claude E. Shannon Research Assistantshi

    Time diversity solutions to cope with lost packets

    Get PDF
    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 ComputadoresModern broadband wireless systems require high throughputs and can also have very high Quality-of-Service (QoS) requirements, namely small error rates and short delays. A high spectral efficiency is needed to meet these requirements. Lost packets, either due to errors or collisions, are usually discarded and need to be retransmitted, leading to performance degradation. An alternative to simple retransmission that can improve both power and spectral efficiency is to combine the signals associated to different transmission attempts. This thesis analyses two time diversity approaches to cope with lost packets that are relatively similar at physical layer but handle different packet loss causes. The first is a lowcomplexity Diversity-Combining (DC) Automatic Repeat reQuest (ARQ) scheme employed in a Time Division Multiple Access (TDMA) architecture, adapted for channels dedicated to a single user. The second is a Network-assisted Diversity Multiple Access (NDMA) scheme, which is a multi-packet detection approach able to separate multiple mobile terminals transmitting simultaneously in one slot using temporal diversity. This thesis combines these techniques with Single Carrier with Frequency Division Equalizer (SC-FDE) systems, which are widely recognized as the best candidates for the uplink of future broadband wireless systems. It proposes a new NDMA scheme capable of handling more Mobile Terminals (MTs) than the user separation capacity of the receiver. This thesis also proposes a set of analytical tools that can be used to analyse and optimize the use of these two systems. These tools are then employed to compare both approaches in terms of error rate, throughput and delay performances, and taking the implementation complexity into consideration. Finally, it is shown that both approaches represent viable solutions for future broadband wireless communications complementing each other.Fundação para a Ciência e Tecnologia - PhD grant(SFRH/BD/41515/2007); CTS multi-annual funding project PEst-OE/EEI/UI0066/2011, IT pluri-annual funding project PEst-OE/EEI/LA0008/2011, U-BOAT project PTDC/EEATEL/ 67066/2006, MPSat project PTDC/EEA-TEL/099074/2008 and OPPORTUNISTICCR project PTDC/EEA-TEL/115981/200

    Low-Complexity Multiple-Component Turbo-Decoding-Aided Hybrid ARQ

    Full text link
    • …
    corecore