New achievable rate and a certain capacity result for a stochastic two relay network with no interference

• Published in: IET communications Vol. 3; no. 7; pp. 1153 - 1162
• Main Authors: HODTANI, G. A, AREF, M. R
• Format: Journal Article
• Language: English
• Published: Stevenage Institution of Engineering and Technology 01.07.2009; John Wiley & Sons, Inc
• Subjects: Applied sciences; Channels; Coding; Coding, codes; Consistency; Exact sciences and technology; Information, signal and communications theory; Interference; Networks; Receivers; Relay; Relay networks; Signal and communications theory; Telecommunications and information theory; Performance evaluation; Lower bound; Upper bound; Relay; Relay channel; Coding; Maximin problem; Wireless telecommunication; Broadcast channels; Ad hoc network
• ISSN: 1751-8628; 1751-8636
• DOI: 10.1049/iet-com.2008.0369

Gastpar and Vetterli named the ad hoc networks with one randomly selected source-destination pair as relay networks, and they suggested using arbitrary network coding in order to increase the overall efficiency. In this paper, the relay network is investigated with two relays, no interference and a new achievable rate is obtained using a new network coding (decode-and-broadcast). The obtained achievable rate: 1. gives the lower bound for general relay channel, obtained by Cover and El Gamal, but with a slight difference owing to no interference assumption at the receiver, 2. includes the one relay rates of a two-level relay channel studied by Gupta and Kumar using point-to-point coding, 3. includes the rates of two-relay Aref network and other special two-relay networks, 4. meets the max-flow min-cut upper bound under certain additional assumptions resulting in certain capacity theorems that include the related previous capacities, and 5. is validated by its consistency with previous results relevant to special cases of broadcast channels.