Asymptotic Capacity of Large Relay Networks with Conferencing Links

Details Asymptotic Capacity of Large Relay Networks with Conferencing Links Asymptotic Capacity of Large Relay Networks with Conferencing Links

2011-04-19

arxiv.org/abs/1104.3662v1

Computer Science

Information Theory

submitted to IEEE Transactions on Communications

Scientific paper

In this correspondence, we consider a half-duplex large relay network, which consists of one source-destination pair and $N$ relay nodes, each of which is connected with a subset of the other relays via signal-to-noise ratio (SNR)-limited out-of-band conferencing links. The asymptotic achievable rates of two basic relaying schemes with the "$p$-portion" conferencing strategy are studied: For the decode-and-forward (DF) scheme, we prove that the DF rate scales as $\mathcal{O} (\log (N))$; for the amplify-and-forward (AF) scheme, we prove that it asymptotically achieves the capacity upper bound in some interesting scenarios as $N$ goes to infinity.

Affiliated with

Also associated with

No associations

Rating

Asymptotic Capacity of Large Relay Networks with Conferencing Links does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic Capacity of Large Relay Networks with Conferencing Links, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Capacity of Large Relay Networks with Conferencing Links will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-182521