Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

Discrete-Time Gaussian Interfere-Relay Channel

  • Moon, Kiryang (Agency for Defense Development (ADD)) ;
  • Yoo, Do-Sik (School of Electronic and Electrical Engineering at Hongik University) ;
  • Oh, Seong-Jun (Graduate School of Information Security at Korea University)
  • Received : 2015.04.12
  • Accepted : 2015.12.06
  • Published : 2016.06.30
⟨ Previous Next ⟩

Abstract

In practical wireless relay communication systems, non-destination nodes are assumed to be idle not receiving signals while the relay sends messages to a particular destination node, which results in reduced bandwidth efficiency. To improve the bandwidth efficiency, we relax the idle assumption of non-destination nodes and assume that non-destination nodes may receive signals from sources. We note that the message relayed to a particular node in such a system gives rise to interference to other nodes. To study such a more general relay system, we consider, in this paper, a relay system in which the relay first listens to the source, then routes the source message to the destination, and finally produces interference to the destination in sending messages for other systems. We obtain capacity upper and lower bounds and study the optimal method to deal with the interference as well as the optimal routing schemes. From analytic results obtained, we find the conditions on which the direct transmission provides higher transmission rate. Next, we find the conditions, by numerical evaluation of the theoretical results, on which it is better for the destination to cancel and decode the interference. Also we find the optimal source power allocation scheme that achieves the lower bound depending on various channel conditions. We believe that the results provided in this paper will provide useful insights to system designers in strategically choosing the optimal routing algorithms depending on the channel conditions.

Keywords

Acknowledgement

Supported by : National Research Foundation of Korea (NRF)

References

  1. T.M. Cover and A.A.E. Gamal, "Capacity theorems for the relay channel," IEEE Trans. Inf. Theory, vol. 25, no. 5, pp. 572-584, Sept. 1979. https://doi.org/10.1109/TIT.1979.1056084
  2. P. Gupta and P.R. Kumar, "Towards an information theory of large networks: An Achievable Rate Region," IEEE Trans. Inf. Theory, vol. 49, no. 8, pp. 1877-1894, Aug. 2003. https://doi.org/10.1109/TIT.2003.814480
  3. J.N. Laneman and G.W. Wornell, "Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2415-2425, Oct. 2003. https://doi.org/10.1109/TIT.2003.817829
  4. J.N. Laneman, D.N.C. Tse, and G.W. Wornell, "Cooperative diversity in wireless networks: Efficient protocols and outage behavior," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3062-3080, Dec. 2004. https://doi.org/10.1109/TIT.2004.838089
  5. J. Cai, X. Shen, J.W. Mark, and A.S. Alfa, "Semi-distributed user relaying algorithm for amplify-and-forward wireless relay networks," IEEE Trans. Wireless Commun., vol. 7, no. 4, pp. 1348-1357, Apr. 2008. https://doi.org/10.1109/TWC.2008.060909
  6. M. Jain et al. "Practical, real-time, full duplex wireless," in Proc. ACM MobiCom, Sept. 2011, pp. 301-312.
  7. D.W. Bliss, P.A. Parker, and A.R. Margetts, "Simultaneous transmission and reception for improved wireless network performance," in Proc. IEEE Workshop on SSP, Aug. 2007, pp. 478-482.
  8. A.H. Madsen, "On the capacity of wireless relaying," in Proc. IEEE VTC, Fall, 2002, pp. 1333-1337.
  9. A.H. Madesen and J. Zhang, "Capacity bounds and power allocation for wireless relay channels," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 89-103, June 2005.
  10. G. Kramer, "Models and theory for relay channels with receive constraints," in Proc. Allerton, Sept. 2004. pp. 1312-1321.
  11. A. Zaidi, S. Shamai, P. Piatanida, and L. Vandendorpe, "Bounds on the capacity of the relay channel with noncausal state at the source," IEEE Trans. Inf. Theory, vol. 59, no. 5, pp. 2639-2672, May, 2013. https://doi.org/10.1109/TIT.2012.2229780
  12. D. Zhixiang, L. Fei, W. Bao-Yun, and Z. Sheng-mei, "Capacity of a class of relay channel with orthogonal components and non-causal channel state," in Proc. IEEE ISIT, July 2013, pp. 2696-2700.
  13. A. Zaidi, S.P. Kotagiri, J.N. Laneman, and L. Vandendorpe, "Cooperative relaying with state available noncausality at the relay," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2272-2298, May 2010. https://doi.org/10.1109/TIT.2010.2043782
  14. S. Sigurjonsson and Y. H. Kim, "On multiple user channels with state information at the transmitters," in Proc. IEEE ISIT, Sept. 2005, pp. 72-76.
  15. IEEE Standard 802.16j, "Standard for local and metropolitan area networks. Part 16: Air interface for broadband wireless access systems. Amendment 1: Multihop relay specification," June 2009.
  16. 3GPP TS 36.116 v11.3.0, "Evolved Universal Terrestrial Radio Access (EUTRA); Relay radio transmission and reception, (Release 11)," July 2013.
  17. 3GPP TS 36.216 v11.0.0, "Evolved Universal Terrestrial Radio Access (EUTRA); Physical layer for relaying operation, (Release 11)," Sept. 2012.
  18. T.M. Cover and J.A. Thomas, "Information Theory," Second Edition, Wilely and Sons INC., 2006.
  19. A.A.E. Gamal and Y.H. Kim, "Network Information Theory," Cambridge University Press, 2011.
  20. H.F. Chong and M. Motani, "On Achievable Rates for the General Relay Channel," IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1249-1266, Mar. 2011. https://doi.org/10.1109/TIT.2011.2104473