English
Related papers

Related papers: Secrecy Rate Maximization with Outage Constraint i…

200 papers

This paper studies the design and secrecy performance of linear multihop networks, in the presence of randomly distributed eavesdroppers in a large-scale two-dimensional space. Depending on whether there is feedback from the receiver to the…

Information Theory · Computer Science 2017-11-07 Jianping Yao , Xiangyun Zhou , Yuan Liu , Suili Feng

In this paper, we study the problem of secure routing in a multihop wireless ad-hoc network in the presence of randomly distributed eavesdroppers. Specifically, the locations of the eavesdroppers are modeled as a homogeneous Poisson point…

Information Theory · Computer Science 2016-11-17 Jianping Yao , Suili Feng , Xiangyun Zhou , Yuan Liu

This paper investigates on the problem of combining routing scheme and physical layer security in multihop wireless networks with cooperative diversity. We propose an ad-hoc natured hop-by-hop best secure relay selection in a multihop…

Information Theory · Computer Science 2018-07-20 Anish Prasad Shrestha , Kyung Sup Kwak

Unicast communication over a network of $M$-parallel relays in the presence of an eavesdropper is considered. The relay nodes, operating under individual power constraints, amplify and forward the signals received at their inputs. The…

Information Theory · Computer Science 2015-04-21 Siddhartha Sarma , Samar Agnihotri , Joy Kuri

In this paper, we consider the problem of joint secure routing and transmit power optimization for a multi-hop ad-hoc network under the existence of randomly distributed eavesdroppers following a Poisson point process (PPP). Secrecy…

Information Theory · Computer Science 2018-05-04 Hui-Ming Wang , Yan Zhang , Derrick Wing Kwan Ng , Moon Ho Lee

We propose a secure transmission scheme for a relay wiretap channel, where a source communicates with a destination via a decode-and-forward relay in the presence of spatially random-distributed eavesdroppers. We assume that the source is…

Information Theory · Computer Science 2016-11-17 Chenxi Liu , Nan Yang , Jinhong Yuan , Robert Malaney

This paper considers secure communication in buffer-aided cooperative wireless networks in the presence of one eavesdropper, which can intercept the data transmission from both the source and relay nodes. A new max-ratio relaying protocol…

Information Theory · Computer Science 2020-05-18 Jiayu Zhou , Deli Qiao , Haifeng Qian

A MIMO secure two-hop wireless communication system is considered in this paper. In this model, there are no direct links between the source-destination and the source-eavesdropper. The problem is maximizing the secrecy capacity of the…

Information Theory · Computer Science 2011-10-18 Ghadamali Bagherikaram , Konstantinos N. Plataniotis

This paper studies the secrecy rate maximization problem of a secure wireless communication system, in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming, with the help of…

Information Theory · Computer Science 2017-01-13 Kanapathippillai Cumanan , George C. Alexandropoulos , Zhgiuo Ding , George K. Karagiannidis

This work considers the secure and reliable information transmission in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While the previous work on this problem mainly studied infinite…

Networking and Internet Architecture · Computer Science 2012-12-03 Yulong Shen , Xiaohong Jiang , Jianfeng Ma , Weisong Shi

In this paper, we address the problem of optimal power allocation at the relay in two-hop secure communications under practical conditions. To guarantee secure communication during the long-distance transmission, the massive MIMO (M-MIMO)…

Information Theory · Computer Science 2015-09-01 Jian Chen , Xiaoming Chen , Wolfgang Gerstacker

We have evaluated the optimal secrecy rate for Amplify-and-Forward (AF) relay networks with multiple eavesdroppers. Assuming i.i.d. Gaussian noise at the destination and the eavesdroppers, we have devised technique to calculate optimal…

Information Theory · Computer Science 2014-06-02 Siddhartha Sarma , Samar Agnihotri , Joy Kuri

This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node…

Information Theory · Computer Science 2015-12-18 Pedro H. J. Nardelli , Hirley Alves , Carlos H. M. de Lima , Matti Latva-aho

The deployment of unmanned aerial vehicle (UAV) for surveillance and monitoring gives rise to the confidential information leakage challenge in both civilian and military environments. The security and covert communication problems for a…

Information Theory · Computer Science 2019-10-22 Hui-Ming Wang , Yan Zhang , Xu Zhang , Zhetao Li

This work considers the problem of secure and reliable information transmission via relay cooperation in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While previous work on this…

Cryptography and Security · Computer Science 2012-12-04 Yulong Shen , Xiaohong Jiang , Jianfeng Ma , Weisong Shi

In this paper, we investigate opportunistic relaying and jamming techniques and develop relay selection algorithms that maximize the secrecy rate for multiuser buffer-aided relay networks. We develop an approach to maximize the secrecy rate…

Information Theory · Computer Science 2020-11-19 X. Lu , R. C. de Lamare

By taking a variety of realistic hardware imperfections into consideration, we propose an optimal power allocation (OPA) strategy to maximize the instantaneous secrecy rate of a cooperative wireless network comprised of a source, a…

Cryptography and Security · Computer Science 2017-09-06 Ali Kuhestani , Abbas Mohammadi , Kai-Kit Wong , Phee Lep Yeoh , Majid Moradikia , Muhammad Ruhul Amin Khandaker

This work considers load-balance control among the relays under the secure transmission protocol via relay cooperation in two-hop wireless networks without the information of both eavesdropper channels and locations. The available two-hop…

Information Theory · Computer Science 2013-01-01 Yulong Shen , Xiaohong Jiang , Jianfeng Ma

We analyze the secrecy performance of a two-hop mixed radio frequency (RF)/underwater wireless optical communication (UWOC) system using a decode-and-forward (DF) relay. All RF and UWOC links are modeled by the $\alpha-\mu$ and…

Information Theory · Computer Science 2020-09-02 Yi Lou , Ruofan Sun , Julian Cheng , Donghu Nie , Gang Qiao

In this paper, we study the performance of an amplify-and-forward (AF) based analog network coding (ANC) relay scheme in a multi-hop wireless network under individual power constraints. In the first part, a unicast scenario is considered.…

Information Theory · Computer Science 2012-03-23 Binyue Liu , Ning Cai
‹ Prev 1 2 3 10 Next ›