Myopic Coding in Multiple Relay Channels
<|reference_start|>Myopic Coding in Multiple Relay Channels: 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.<|reference_end|>
@article{ong2005myopic,
    title={Myopic Coding in Multiple Relay Channels},
    author={Lawrence Ong and Mehul Motani},
    journal={Proceedings of the 2005 IEEE International Symposium on
  Information Theory (ISIT 2005), Adelaide Convention Centre, Adelaide,
  Australia, pp. 1091-1095, Sep. 4-9 2005.},
    year={2005},
    doi={10.1109/ISIT.2005.1523508},
    archivePrefix={arXiv},
    eprint={cs/0508076},
    primaryClass={cs.IT math.IT}
}