The Impact of Channel Feedback on Opportunistic Relay Selection for Hybrid-ARQ in Wireless Networks

This paper presents a decentralized relay selection protocol for a dense wireless network and describes channel feedback strategies that improve its performance. The proposed selection protocol supports hybrid automatic-repeat-request transmission where relays forward parity information to the destination in the event of a decoding error. Channel feedback is employed for refining the relay selection process and for selecting an appropriate transmission mode in a proposed adaptive modulation transmission framework. An approximation of the throughput of the proposed adaptive modulation strategy is presented, and the dependence of the throughput on system parameters such as the relay contention probability and the adaptive modulation switching point is illustrated via maximization of this approximation. Simulations show that the throughput of the proposed selection strategy is comparable to that yielded by a centralized selection approach that relies on geographic information.Comment: 30 pages, 9 figures, submitted to the IEEE Transactions on Vehicular Technology, revised March 200

The SoftPHY Abstraction: from Packets to Symbols in Wireless Network Design

At ever-increasing rates, we are using wireless systems to communicatewith others and retrieve content of interest to us. Current wirelesstechnologies such as WiFi or Zigbee use forward error correction todrive bit error rates down when there are few interferingtransmissions. However, as more of us use wireless networks toretrieve increasingly rich content, interference increases inunpredictable ways. This results in errored bits, degradedthroughput, and eventually, an unusable network. We observe that thisis the result of higher layers working at the packet granularity,whereas they would benefit from a shift in perspective from wholepackets to individual symbols.From real-world experiments on a 31-node testbed of Zigbee andsoftware-defined radios, we find that often, not all of the bitsin corrupted packets share fate. Thus, today's wireless protocolsretransmit packets where only a small number of the constituent bitsin a packet are in error, wasting network resources. In thisdissertation, we will describe a physical layer that passesinformation about its confidence in each decoded symbol up to higherlayers. These SoftPHY hints have many applications, one ofwhich, more efficient link-layer retransmissions, we will describe indetail. PP-ARQ is a link-layer reliable retransmission protocolthat allows a receiver to compactly encode a request forretransmission of only the bits in a packet that are likely in error.Our experimental results show that PP-ARQ increases aggregate networkthroughput by a factor of approximately 2x under variousconditions. Finally, we will place our contributions in the contextof related work and discuss other uses of SoftPHY throughout thewireless networking stack

Energy-efficient wireless communication

In this chapter we present an energy-efficient highly adaptive network interface architecture and a novel data link layer protocol for wireless networks that provides Quality of Service (QoS) support for diverse traffic types. Due to the dynamic nature of wireless networks, adaptations in bandwidth scheduling and error control are necessary to achieve energy efficiency and an acceptable quality of service. In our approach we apply adaptability through all layers of the protocol stack, and provide feedback to the applications. In this way the applications can adapt the data streams, and the network protocols can adapt the communication parameters

Cooperative diversity techniques for future wireless communications systems.

Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2013.Multiple-input multiple-output (MIMO) systems have been extensively studied in the past decade. The attractiveness of MIMO systems is due to the fact that they drastically reduce the deleterious e ects of multipath fading leading to high system capacity and low error rates. In situations where wireless devices are restrained by their size and hardware complexity, such as mobile phones, transmit diversity is not achievable. A new paradigm called cooperative communication is a viable solution. In a cooperative scenario, a single-antenna device is assisted by another single-antenna device to relay its message to the destination or base station. This creates a virtual multiple-input multiple-output (MIMO) system. There exist two cooperative strategies: amplify-and-forward (AF) and decode-and-forward (DF). In the former, the relay ampli es the noisy signal received from the source before forwarding it to the destination. No form of demodulation is required. In the latter, the relay rst decodes the source signal before transmitting an estimate to the destination. In this work, focus is on the DF method. A drawback of an uncoded DF cooperative strategy is error propagation at the relay. To avoid error propagation in DF, various relay selection schemes can be used. Coded cooperation can also be used to avoid error propagation at the relay. Various error correcting codes such as convolutional codes or turbo codes can be used in a cooperative scenario. The rst part of this work studies a variation of the turbo codes in cooperative diversity, that further reduces error propagation at the relay, hence lowering the end-to-end error rate. The union bounds on the bit-error rate (BER) of the proposed scheme are derived using the pairwise error probability via the transfer bounds and limit-before-average techniques. In addition, the outage analysis of the proposed scheme is presented. Simulation results of the bit error and outage probabilities are presented to corroborate the analytical work. In the case of outage probability, the computer simulation results are in good agreement with the the analytical framework presented in this chapter. Recently, most studies have focused on cross-layer design of cooperative diversity at the physical layer and truncated automatic-repeat request (ARQ) at the data-link layer using the system throughput as the performance metric. Various throughput optimization strategies have been investigated. In this work, a cross-relay selection approach that maximizes the system throughput is presented. The cooperative network is comprised of a set of relays and the reliable relay(s) that maximize the throughput at the data-link layer are selected to assist the source. It can be shown through simulation that this novel scheme outperforms from a throughput point of view, a system throughput where the all the reliable relays always participate in forwarding the source packet. A power optimization of the best relay uncoded DF cooperative diversity is investigated. This optimization aims at maximizing the system throughput. Because of the non-concavity and non-convexity of the throughput expression, it is intractable to derive a closed-form expression of the optimal power through the system throughput. However, this can be done via the symbol-error rate (SER) optimization, since it is shown that minimizing the SER of the cooperative system is equivalent to maximizing the system throughput. The SER of the retransmission scheme at high signal-to-noise ratio (SNR) was obtained and it was noted that the derived SER is in perfect agreement with the simulated SER at high SNR. Moreover, the optimal power allocation obtained under a general optimization problem, yields a throughput performance that is superior to non-optimized power values from moderate to high SNRs. The last part of the work considers the throughput maximization of the multi-relay adaptive DF over independent and non-identically distributed (i.n.i.d.) Rayleigh fading channels, that integrates ARQ at the link layer. The aim of this chapter is to maximize the system throughput via power optimization and it is shown that this can be done by minimizing the SER of the retransmission. Firstly, the closed-form expressions for the exact SER of the multi-relay adaptive DF are derived as well as their corresponding asymptotic bounds. Results showed that the optimal power distribution yields maximum throughput. Furthermore, the power allocated at a relay is greatly dependent of its location relative to the source and destination

On feedback-based rateless codes for data collection in vehicular networks

The ability to transfer data reliably and with low delay over an unreliable service is intrinsic to a number of emerging technologies, including digital video broadcasting, over-the-air software updates, public/private cloud storage, and, recently, wireless vehicular networks. In particular, modern vehicles incorporate tens of sensors to provide vital sensor information to electronic control units (ECUs). In the current architecture, vehicle sensors are connected to ECUs via physical wires, which increase the cost, weight and maintenance effort of the car, especially as the number of electronic components keeps increasing. To mitigate the issues with physical wires, wireless sensor networks (WSN) have been contemplated for replacing the current wires with wireless links, making modern cars cheaper, lighter, and more efficient. However, the ability to reliably communicate with the ECUs is complicated by the dynamic channel properties that the car experiences as it travels through areas with different radio interference patterns, such as urban versus highway driving, or even different road quality, which may physically perturb the wireless sensors. This thesis develops a suite of reliable and efficient communication schemes built upon feedback-based rateless codes, and with a target application of vehicular networks. In particular, we first investigate the feasibility of multi-hop networking for intra-car WSN, and illustrate the potential gains of using the Collection Tree Protocol (CTP), the current state of the art in multi-hop data aggregation. Our results demonstrate, for example, that the packet delivery rate of a node using a single-hop topology protocol can be below 80% in practical scenarios, whereas CTP improves reliability performance beyond 95% across all nodes while simultaneously reducing radio energy consumption. Next, in order to migrate from a wired intra-car network to a wireless system, we consider an intermediate step to deploy a hybrid communication structure, wherein wired and wireless networks coexist. Towards this goal, we design a hybrid link scheduling algorithm that guarantees reliability and robustness under harsh vehicular environments. We further enhance the hybrid link scheduler with the rateless codes such that information leakage to an eavesdropper is almost zero for finite block lengths. In addition to reliability, one key requirement for coded communication schemes is to achieve a fast decoding rate. This feature is vital in a wide spectrum of communication systems, including multimedia and streaming applications (possibly inside vehicles) with real-time playback requirements, and delay-sensitive services, where the receiver needs to recover some data symbols before the recovery of entire frame. To address this issue, we develop feedback-based rateless codes with dynamically-adjusted nonuniform symbol selection distributions. Our simulation results, backed by analysis, show that feedback information paired with a nonuniform distribution significantly improves the decoding rate compared with the state of the art algorithms. We further demonstrate that amount of feedback sent can be tuned to the specific transmission properties of a given feedback channel