Multistage Relaying Using Interference Networks

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, submitted to ISIT 2010

Scientific paper

Wireless networks with multiple nodes that relay information from a source to a destination are expected to be deployed in many applications. Therefore, understanding their design and performance under practical constraints is important. In this work, we propose and study three multihopping decode and forward (MDF) protocols for multistage half-duplex relay networks with no direct link between the source and destination nodes. In all three protocols, we assume no cooperation across relay nodes for encoding and decoding. Numerical evaluation in illustrative example networks and comparison with cheap relay cut-set bounds for half-duplex networks show that the proposed MDF protocols approach capacity in some ranges of channel gains. The main idea in the design of the protocols is the use of coding in interference networks that are created in different states or modes of a half-duplex network. Our results suggest that multistage half-duplex relaying with practical constraints on cooperation is comparable to point-to-point links and full-duplex relay networks, if there are multiple non-overlapping paths from source to destination and if suitable coding is employed in interference network states.

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

Multistage Relaying Using Interference Networks 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 Multistage Relaying Using Interference Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multistage Relaying Using Interference Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-248706

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