Abstract—In this paper, the fundamental performance tradeoff of the delay-limited multiple-input multiple-output (MIMO) automatic retransmission request (ARQ) channel is explored. In particular, we extend the diversity–multiplexing tradeoff investigated by Zheng and Tse in standard delay-limited MIMO channels with coherent detection to the ARQ scenario. We establish the three-dimensional tradeoff between reliability (i.e., diversity), throughput (i.e., multiplexing gain), and delay (i.e., maximum number of retransmissions). This tradeoff quantifies the ARQ diversity gain obtained by leveraging the retransmission delay to enhance the reliability for a given multiplexing gain. Interestingly, ARQ diversity appears even in long-term static channels where all the retransmissions take place in the same channel state. Furthermore, by relaxing the input power constraint allowing variable power levels in different retransmissions, we show that power control can be

Abstract—The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission “pipe ” and each user’s utility is a function of transmission rate only. These assumptions break down in many practical systems, where, by adapting the physical layer channel coding or transmission diversity, different tradeoffs between rate and reliability can be achieved. In network utility maximization problems formulated in this paper, the utility for each user depends on both transmission rate and signal quality, with an intrinsic tradeoff between the two. Each link may also provide a higher (or lower) rate on the transmission “pipes ” by allowing a higher (or lower) decoding error probability. Despite nonseparability and nonconvexity of these optimization problems, we propose new price-based distributed algorithms and prove their convergence to the globally optimal rate-reliability tradeoff under

Channel or path diversity is known to improve performance in physical layer designs, channel access strategies, path switching mechanisms, etc. In this paper, we focus on “userlevel” mechanisms that operate simply by distributing packet transmissions across multiple channels. We seek to understand when, why, and to what extent this can be of benefit, and equally important, whether these benefits can be realized with as little of an added cost as possible. In that context, our main contribution is not so much in identifying optimal policies for leveraging channel diversity, but in introducing the concept of channel “equivalence ” and demonstrating that channel diversity yields substantial benefits mostly when channels are approximately equivalent. We build on this finding to investigate the robustness of these improvements against errors in the characterization of the available channels or changes in their characteristics. We also explore the sensitivity of the results as the number of available channels varies. The findings of the paper demonstrate that by allowing packet transmissions from multiple users to intelligently share channels, it is possible to improve overall performance and robustness through simple and portable user-level mechanisms.

We dedicate this paper to Professor Thomas Kailath on the occasion of his 70 th birthday. We have been greatly influenced by his way of attacking engineering prob-lems by exploiting their inherent mathematical structure. This paper is an example of this research paradigm, where nineteenth century mathematics is used to significantly improve the performance of 21 st century wireless infrastructure. Abstract. We present a novel full-rate full-diversity orthogonal space-time block code for QPSK modulation and 4 transmit antennas based on quaternionic algebra. The code does not result in constellation expansion unlike other full-rate full-diversity codes in the literature. The quaternionic structure of the code is exploited to reduce the complexity of maximum likelihood (ML) coherent decoding from a size-256 search to a size-16 search. Furthermore, we show how to modify this low-complexity coherent ML decoding rule to derive a non-coherent differential ML decoding rule. Due to the orthogonality of the code, ML differential decoding results in the minimum SNR loss of 3 dB from coherent ML decoding. Finally, extensive simulation results in a WiMAX 802.16 broadband wireless access environment demonstrate that the proposed code increases the cell coverage area by 1.5 and 2.6 folds compared to single-antenna transmission at 10 −3 bit error rate when combined with 1 and 2 receive antenna(s), respectively. 1. Introduction. WiMAX

Abstract. As more applications migrate to IP networks, ensuring a consistent level of service is increasingly important. One option is for the network to offer service guarantees. Another is to leverage the path diversity that the Internet intrinsically offers. Our focus is on understanding if an when one can indeed take advantage of multiple disjoint paths to improve performance. We consider an environment where loss patterns are bursty and where coding is used to provide robustness against packet losses. We assume that only long-term loss statistics are known about each path, and we seek to identify the best strategy for sending packets over the available paths. Our contributions are two-fold. First we demonstrate that even with minimal knowledge of channel characteristics and using simple transmission policies, path diversity can help significantly improve performance. Second, we derive an efficient method for identifying optimal policies, and more importantly characterize when having access to multiple paths can be of benefit. Keywords: Channel Diversity, Cross-layer designs, Reliability and fault tolerance. 1

Abstract not found

Abstract—Wireless networks suffer from a variety of unique problems such as low throughput, dead spots, and inadequate support for mobility. However, their characteristics such as the broadcast nature of the medium, spatial diversity, and significant data redundancy, provide opportunities for new design principles to address these problems. There has been recent interest in employing network coding in wireless networks. This paper explores the case for network coding as a unifying design paradigm for wireless networks, by describing how it addresses issues of througput, reliability, mobility, and management. We also discuss the practical challenges facing the integration of such a design into the network stack. I.

Abstract — This paper surveys and unifies a number of recent contributions that have collectively developed a metric for decentralized wireless network analysis known as transmission capacity. Although it is notoriously difficult to derive general end-to-end capacity results for multi-terminal or ad hoc networks, the transmission capacity (TC) framework allows for quantification of achievable single-hop rates by focusing on a simplified physical/MAC-layer model. By using stochastic geometry to quantify the multi-user interference in the network, the relationship between the optimal spatial density and success probability of transmissions in the network can be determined, and expressed – often fairly simply – in terms of the key network parameters. The basic model and analytical tools are first discussed and applied to a simple network with path loss only and we present tight upper and lower bounds on transmission capacity (via lower and upper bounds on outage probability). We then introduce random channels (fading/shadowing) and give TC and outage approximations for an arbitrary channel distribution, as well as exact results for the special cases of Rayleigh and Nakagami fading. We then apply these results to show how TC can be used to better understand scheduling, power control, and the deployment of multiple antennas in a decentralized network. The paper closes by discussing shortcomings in the model as well as future research directions. I.

In [1][2][3], opportunistic space-time block codes were presented for flat-fading channels. In this paper, we propose an opportunistic STBC-OFDM for frequency-selective channels with an unequal error protection capability making it attractive for multimedia applications. Our new scheme optimizes the tradeoff between coding gain and peak-to-average ratio while minimizing inter-carrier interference in the presence of carrier frequency offset. We show that our scheme achieves a 2dB reduction in PAR over the conventional scheme.

In this paper, we focus on the throughput analysis, outage evaluation and optimized power allocation for Multiple -Input Multiple-Output (MIMO) pilot-based wireless systems subject to short-term constraints on the radiated power and equipped with a feedback-path for communicating back to the transmitter the imperfect MIMO channel estimates available at the receiver. The case of the ergodic throughput for Gaussian distributed input signals is analyzed, and the conditions for the (asymptotical) achievement of the Shannon capacity are pointed out. The main contributions of this work may be so summarized. First, we develop closed-form analytical expressions for the computation of the ergodic information throughput conveyed by the considered MIMO system for the case of ideal feedback link. Second, we present an iterative algorithm for the optimized power allocation over the transmit antennas that explicitly accounts for the imperfect MIMO channel estimates available at the receiver. Third, after relaxing the assumption of ideal feedback link, we test the sensitivity of the proposed power allocation algorithm on errors possibly introduced by the feedback channel, and then, we numerically evaluate the resulting throughput loss. Finally, we develop closed-form upper and lower bounds on the outage probability that are asymptotically tight.