Abstract
A network consisting of n source-destination pairs and m relays with no direct link between source and destination nodes, is considered. Focusing on the large system limit (large n), the throughput scaling laws of two-hop relaying protocols are studied for Rayleigh fading channels. It is shown that, under the practical constraints of single-user encoding-decoding scheme, and partial channel state information (CSI) at the transmitters (via integer-value feedback from the receivers), the maximal throughput scales as log n even if joint scheduling among relays is allowed. Furthermore, a novel opportunistic relaying scheme with receiver CSI, partial transmitter CSI, and decentralized relay scheduling, is shown to achieve the optimal throughput scaling law of log n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
