Error performance bounds for routing algorithms in wireless cooperative networks

Abstract

Cooperative diversity has emerged as a promising approach to improving reception reliability by realizing spatial diversity gains for nodes with single antenna. We consider here cooperative ad-hoc wireless networks where communications between two nodes can be assisted by a single relay using two time slots. This paper continues our investigation of PHY techniques and cross-layer routing algorithms in such networks. Specifically, we investigate here the optimal relay location for cooperative link in networks with infinite node density. By using this result, we analyze the error performance bound for routing algorithms in infinitely dense networks. Furthermore, we study the performance bounds for regularly dense networks with linear topology. Theoretical analysis shows that the proposed routing algorithm performs close to the optimal error performance.