pith. sign in

arxiv: 0901.0118 · v2 · submitted 2008-12-31 · 💻 cs.IT · math.IT

On the Stability Region of Amplify-and-Forward Cooperative Relay Networks

classification 💻 cs.IT math.IT
keywords amplify-and-forwardrelaynetworknetworksstabilitypacketsregionscheme
0
0 comments X
read the original abstract

This paper considers an amplify-and-forward relay network with fading states. Amplify-and-forward scheme (along with its variations) is the core mechanism for enabling cooperative communication in wireless networks, and hence understanding the network stability region under amplify-and-forward scheme is very important. However, in a relay network employing amplify-and-forward, the interaction between nodes is described in terms of real-valued ``packets'' (signals) instead of discrete packets (bits). This restrains the relay nodes from re-encoding the packets at desired rates. Hence, the stability analysis for relay networks employing amplify-and-forward scheme is by no means a straightforward extension of that in packet-based networks. In this paper, the stability region of a four-node relay network is characterized, and a simple throughput optimal algorithm with joint scheduling and rate allocation is proposed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.