TY - GEN
T1 - A low-complexity protocol for K-parallel-path multihop networks
AU - Hucher, Charlotte
AU - Othman, Ghaya Rekaya Ben
PY - 2010/1/1
Y1 - 2010/1/1
N2 - 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.
AB - 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.
U2 - 10.1109/WCNC.2010.5506701
DO - 10.1109/WCNC.2010.5506701
M3 - Conference contribution
AN - SCOPUS:77955017276
SN - 9781424463985
T3 - IEEE Wireless Communications and Networking Conference, WCNC
BT - 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010
Y2 - 18 April 2010 through 21 April 2010
ER -