Diversity-Multiplexing Tradeoff of Network Coding with Bidirectional Random Relaying

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages, 4 figures, to appear in the Proceedings of Allerton Conference on Communication, Control and Computing, September 200

Scientific paper

This paper develops a diversity-multiplexing tradeoff (DMT) over a bidirectional random relay set in a wireless network where the distribution of all nodes is a stationary Poisson point process. This is a nontrivial extension of the DMT because it requires consideration of the cooperation (or lack thereof) of relay nodes, the traffic pattern and the time allocation between the forward and reverse traffic directions. We then use this tradeoff to compare the DMTs of traditional time-division multihop (TDMH) and network coding (NC). Our main results are the derivations of the DMT for both TDMH and NC. This shows, surprisingly, that if relay nodes collaborate NC does not always have a better DMT than TDMH since it is difficult to simultaneously achieve bidirectional transmit diversity for both source nodes. In fact, for certain traffic patterns NC can have a worse DMT due to suboptimal time allocation between the forward and reverse transmission directions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Diversity-Multiplexing Tradeoff of Network Coding with Bidirectional Random Relaying 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 Diversity-Multiplexing Tradeoff of Network Coding with Bidirectional Random Relaying, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Diversity-Multiplexing Tradeoff of Network Coding with Bidirectional Random Relaying will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-395724

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.