Myopic Coding in Multiple Relay Channels

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-

Scientific paper

10.1109/ISIT.2005.1523508

In this paper, we investigate achievable rates for data transmission from sources to sinks through multiple relay networks. We consider myopic coding, a constrained communication strategy in which each node has only a local view of the network, meaning that nodes can only transmit to and decode from neighboring nodes. We compare this with omniscient coding, in which every node has a global view of the network and all nodes can cooperate. Using Gaussian channels as examples, we find that when the nodes transmit at low power, the rates achievable with two-hop myopic coding are as large as that under omniscient coding in a five-node multiple relay channel and close to that under omniscient coding in a six-node multiple relay channel. These results suggest that we may do local coding and cooperation without compromising much on the transmission rate. Practically, myopic coding schemes are more robust to topology changes because encoding and decoding at a node are not affected when there are changes at remote nodes. Furthermore, myopic coding mitigates the high computational complexity and large buffer/memory requirements of omniscient coding.

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

Myopic Coding in Multiple Relay Channels 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 Myopic Coding in Multiple Relay Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Myopic Coding in Multiple Relay Channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-138685

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