Mobility

Error Performance Bounds for Routing Algorithms in Wireless Cooperative Networks

Free registration required

Executive Summary

Cooperative diversity has emerged as a promising approach to improving reception reliability by realizing spatial diversity gains for nodes with single antenna. The authors 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 their investigation of PHY techniques and cross-layer routing algorithms in such networks. Specifically, they investigate here the optimal relay location for cooperative link in networks with infinite node density. By using this result, they analyze the error performance bound for routing algorithms in infinitely dense networks. Furthermore, they study the performance bounds for regularly dense networks with linear topology.

  • Format: PDF
  • Size: 433.3 KB