ABSTRACT
Diamond relay network is a kind of efficient cooperative network, in which the source user selects two neighbors as relays and cooperates with both of them. In our previous work, we have studied its transmission rates for different coding and relaying schemes and proved that the performance of SRP scheme (Spatial Reuse Pattern) is better than others. To further improve the performance, we incorporated the opportunistic scheduling and studied how to use buffers adapted to the time varying Rayleigh fading channel. However, the position information of users has not been considered yet which actually has a great influence on the performance of the diamond relay channel. Thus, in this paper, it is the first time that we study how to select the position of two relays to guarantee the performance of the throughput and delay constraint. This study facilitates the practical application of diamond relay networks since the source user knows that from where selecting neighbors as relays will bring nice performance. Finally, the simulation results confirm our analysis and some interesting illustrations show much novelty.
- M. Gastpar, G. Kramer, and P. Gupta. The multiple-relay channel: Coding and antenna-clustering capacity. In 2002 IEEE International Symposium on Information Theory, 2002. Proceedings, 2002.Google ScholarCross Ref
- B. Schein and R. Gallager. The Gaussian parallel relay network. In IEEE International Symposium on Information Theory, 2000. Proceedings, 2000.Google ScholarCross Ref
- E. Van Der Meulen. Three-terminal communication channels. Advances in Applied Probability, pages 120--154, 1971.Google Scholar
- Q. Wang, P. Fan, and K. B. Letaief. Throughput improvement and its tradeoff with the queuing delay in the diamond relay networks. Online Published in Wireless Communications and Mobile Computing, 2009. Google ScholarDigital Library
- F. Xue and S. Sandhu. Cooperation in a half-duplex gaussian diamond relay channel. IEEE Transactions on Information Theory, 53(10):3806--3814, 2007. Google ScholarDigital Library
Index Terms
On the selection of relays' positions in diamond relay networks
Recommendations
Analysis and optimization of a rateless coded joint relay system
We consider the code design for a half-duplex 4- node joint relay system with two sources, one relay, and one destination. The relay combines the information from both sources and transmits it to the destination together with both sources. We consider ...
Distributed SR-LDPC codes over multiple-access relay channel and its applications in cloud storage
Digital fountain techniques have received significant academics and industry attention in the past years because of their rateless, robust, and real-time characteristics used in networks and storage systems such as cloud data storage. Semi-Random low-...
Distributed Turbo Code for Relay Channel with Dual-Systematic Bits
CIT '14: Proceedings of the 2014 IEEE International Conference on Computer and Information TechnologyA novel distributed turbo code (DTC), called dual-systematic bits DTC (DS-DTC), is proposed for a two-hop relay system. The source broadcasts a punctured turbo code to both relay and destination. After iterative decoding the received codes, the relay ...
Comments