A Low-Complexity Protocol for K-Parallel-Path Multihop Networks

Abstract

In this paper, a low-complexity protocol for the K-parallel-path multihop channel is proposed. This protocol is based on a smart path selection combined with a small spacetime code. It is proven to achieve full rate and full diversity, and to reach the optimum diversity-multiplexing gain tradeoff d * (r) = K(1−r) + . Some implementation issues such as the frame length or interferences between paths are further discussed.