Randomized cooperation in asynchronous dispersive links

Recently, we proposed a decentralized cooperative communication scheme [1]. In this paper we show that randomized decentralized schemes perform well even when the cooperating nodes are asynchronous. In particular we study the attainable diversity for frequency selective channels, and the coding gain in comparison to a centralized scheme.