Sreeram, K and Birenjith, S and Kumar, P Vijay (2008) DMT of Multi-hop Cooperative Networks-Part I: K-Parallel-Path Networks. In: IEEE International Symposium on Information Theory, JUL 06-11, 2008, Toronto.
PDF
getPDF.pdf - Published Version Restricted to Registered users only Download (363kB) | Request a copy |
Abstract
We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single-antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: K-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K >= 4, and KPP(I) networks with K >= 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.
Item Type: | Conference Paper |
---|---|
Publisher: | IEEE |
Additional Information: | Copyright 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
Date Deposited: | 11 Mar 2010 12:10 |
Last Modified: | 19 Sep 2010 05:56 |
URI: | http://eprints.iisc.ac.in/id/eprint/26124 |
Actions (login required)
View Item |