Capacity (Cut-Set) Bounds for Multi-Hop Relay Networks in Erasure Channels
Source: K L University
This paper deals with the finding of capacity bounds for multi-hop relay networks in erasure channels. As importance of complex networks of nodes and relays and significance of erasure channels are well identified, this paper gives the way of finding upper and lower capacity bounds by using mutual information concept with respect to information theory aspects. A multi-relay network is considered in which communication from source to relays takes place over a channel, the channel connecting these nodes is supposed to be an erasure channel where symbols are received correctly without any error, or lost due to buffer overflows or excessive delays.