中文

Journal of Applied Sciences >

2014 , Vol. 32 >Issue 2: 119 - 124

DOI: https://doi.org/10.3969/j.issn.0255-8297.2014.02.002

Communication Engineering

Optimal Relay Function and Achievable Secrecy Rate in Orthogonal Relay-Eavesdropper Channel

Expand
  • 1. College of Communication and Information Engineering, Nanjing University of Posts and
    Telecommunications, Nanjing 210003, China
    2. National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China
    3. College of Automation, Nanjing University of Posts and Telecommunications, Nanjing 210003, China

Received date: 2012-05-18

  Revised date: 2013-01-14

  Online published: 2013-01-14

Fold

Abstract

In this paper, secret communication in an orthogonal relay-eavesdropper channel is studied in view of information-theoretical security. For an orthogonal relay-eavesdropper channel with instantaneous relay in which the present output depends only on the currently received signal, the achievable secrecy rate is
formulated. The achievable secrecy rate with piecewise linear(PL) relaying function is derived and computed numerically. A sub-optimal solution to this secrecy rate is obtained by optimizing the parameters of the piecewise linear function with an iterative grid search algorithm. The achievable secrecy rate with PL relaying is compared to that with amplify-and-forward (AF) relaying and decode-and-forward (DF) relaying by simulation. The results show that PL always outperforms AF, and outperforms DF when the source-relay link is poor. Meanwhile, compared with DF, PL relaying has lower complexity and lower time-delay.

Key words： orthogonal relay-eavesdropper channel; secrecy rate; piecewise linear relaying

Cite this article

CHEN Chi-yang1,2, DENG Zhi-xiang1, WANG Bao-yun2,3 . Optimal Relay Function and Achievable Secrecy Rate in Orthogonal Relay-Eavesdropper Channel[J]. Journal of Applied Sciences, 2014 , 32(2) : 119 -124 . DOI: 10.3969/j.issn.0255-8297.2014.02.002

References

[1]SHANNON C E. Communication theory of secrecy systems [J]. Bell Systems Technical Journal, 1949, 28: 656-715.

[2]WYNER A. The wire-tap channel [J]. Bell Systems Technical Journal, 1975, 54(8): 1355-1387.

[3]CSISZÁR I, KÖRNER J. Broadcast channels with confidential messages [J]. IEEE Transactions on Information Theory, 1978, 24(3):  339-348.

[4]Van Der MEULEN E C . Three-terminal communication channels[J]. Adv. Appl. Prob（全拼？）. 1971, 3: 120-154.

[5]COVER T M, A. GAMAL El A G. Capacity theorems for the relay channel [J]. IEEE Transactions on Information Theory, 1979, 25(5): 572-584.

[6]LAI L, GAMAL El  （这位作者与上面文献是同一人吗？究竟姓什么？名什么？）. The relay-eavesdropper channel: Cooperation for secrecy [J]. IEEE Transactions on Information Theory, 2008, 54(9): 4005-4019.

[7]陈莹，王保云. 多级中继窃听信道的可达安全速率[J]，应用科学学报，2011, 29(3) 243-250.

CHEN Ying, WANG Baoyun. Achievable secrecy rate of multiple-level relay-eavesdropper channel [J]. Journal of Applied Sciences, 2011, 29(3) 243-250.

[8]SENDONARIS A, ERKIP E, AAZHANG B. User cooperation diversity-part I: system description [J]. IEEE Trans. on Communications, 2003, 51(11): 1927-1938.

[9]LANEMAN J N, TSE D N C, WORNEL G W. Cooperative diversity in wireless networks: Efficient protocols and outage behavior [J]. IEEE Trans. on Inf.（全拼？） Theory, 2004, 50(12): 3062-3080.

[10]KRAMER G, GASTPAR M, GUPTA P. Cooperative strategies and capacity theorems for relay networks [J]. IEEE Transactions on Information Theory, 2005, 51(9): 3037-3063.

[11]DONG Lun, HAN Zhu, PETROPULU A. P., POOR H. V. Amplify-and-forward based cooperation for secure wireless communications [C]//IEEE International Conference on ASSP, 2009 (ICASSP 2009), Taipei, 2009: 2613-2616.

[12]EKREM E, ULUKUS S. Secrecy in cooperative relay broadcast channels [J].  IEEE Transactions on Information Theory, 2011, 57(1): 137-155.

[13]KHORMUJI M N, SKOGLUND M. On instantaneous relaying [J]. IEEE Transactions on Information Theory, 2010, 56(7):3378-3394.

[14]DENG Zhixiang, WANG Baoyun, LANG Fei, MA Yayan, LIU Chen. Two-hop gaussian relay channel with linear relaying: achievable rate and optimization design [J], China Communication, 2012, 9(2): 96-104.
Options
Outlines

/

〈 〉