Title :
A Low-Complexity Protocol for K-Parallel-Path Multihop Networks
Author :
Hucher, Charlotte ; Othman, Ghaya Rekaya-Ben
Author_Institution :
TELECOM Paris Tech, Paris, France
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 space-time 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.
Keywords :
MIMO communication; multiplexing; protocols; space-time codes; K-parallel-path multihop channel; K-parallel-path multihop networks; low-complexity protocol; optimum diversity-multiplexing; space-time code; Communications Society; Decoding; Interference; MIMO; OFDM modulation; Peer to peer computing; Power system modeling; Protocols; Relays; Spread spectrum communication;
Conference_Titel :
Wireless Communications and Networking Conference (WCNC), 2010 IEEE
Conference_Location :
Sydney, NSW
Print_ISBN :
978-1-4244-6396-1
DOI :
10.1109/WCNC.2010.5506701
