English
Related papers

Related papers: Achievable Secrecy Sum-Rate in a Fading MAC-WT wit…

200 papers

In this paper, we consider the achievable sum secrecy rate in full-duplex wiretap channel in the presence of an eavesdropper and imperfect channel state information (CSI). We assume that the users participating in full-duplex communication…

Information Theory · Computer Science 2014-01-17 Sanjay Vishwakarma , A. Chockalingam

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper who is as capable as the…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

The General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT) and the Gaussian Two-Way Wire-Tap Channel (GTW-WT) are considered. In the GGMAC-WT, multiple users communicate with an intended receiver in the presence of an eavesdropper who…

Information Theory · Computer Science 2008-01-28 Ender Tekin , Aylin Yener

In this paper, we consider the achievable sum secrecy rate in MISO (multiple-input-single-output) {\em full-duplex} wiretap channel in the presence of a passive eavesdropper and imperfect channel state information (CSI). We assume that the…

Information Theory · Computer Science 2015-03-26 Sanjay Vishwakarma , A. Chockalingam

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is…

Information Theory · Computer Science 2007-07-16 Praveen Kumar Gopala , Lifeng Lai , Hesham El Gamal

In this paper, we introduce two new achievable schemes for the fading multiple access wiretap channel (MAC-WT). In the model that we consider, we assume that perfect knowledge of the state of all channels is available at all the nodes in a…

Information Theory · Computer Science 2010-10-29 Raef Bassily , Sennur Ulukus

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

We consider the problem of finding optimal, fair and distributed power-rate strategies to achieve the sum capacity of the Gaussian multiple-access block-fading channel. In here, the transmitters have access to only their own fading…

Information Theory · Computer Science 2012-08-24 Sibi Raj B. Pillai , Bikash K. Dey , Yash Deshpande , Krishnamoorthy Iyer

We consider the problem of secure communication with multi-antenna transmission in fading channels. The transmitter simultaneously transmits an information bearing signal to the intended receiver and artificial noise to the eavesdroppers.…

Information Theory · Computer Science 2010-07-01 Xiangyun Zhou , Matthew R. McKay

This paper considers wireless-powered cooperative jamming (CJ) to secure communication between a transmitter (Tx) and an information receiver (IR), in the presence of an energy receiver (ER) which is termed as a potential eavesdropper. The…

Information Theory · Computer Science 2017-02-21 Mengyu Liu , Yuan Liu

We consider two fundamental multi-user channel models: the multiple-input multiple-output (MIMO) wiretap channel with one helper (WTH) and the MIMO multiple access wiretap channel (MAC-WT). In each case, the eavesdropper has $K$ antennas…

Information Theory · Computer Science 2016-10-14 Pritam Mukherjee , Sennur Ulukus

The secrecy rate represents the amount of information per unit time that can be securely sent on a communication link. In this work, we investigate the achievable secrecy rates in an energy harvesting communication system composed of a…

Information Theory · Computer Science 2016-11-17 Alessandro Biason , Nicola Laurenti , Michele Zorzi

In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical…

Information Theory · Computer Science 2014-01-16 Sanjay Vishwakarma , A. Chockalingam

In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a…

Information Theory · Computer Science 2018-02-19 Tianyu Yang , Omid Taghizadeh , Rudolf Mathar

This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the…

Information Theory · Computer Science 2020-01-14 Hao Xu , Giuseppe Caire , Cunhua Pan

This paper investigates the secrecy capacity region of multiple access wiretap (MAC-WT) channels where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate…

Information Theory · Computer Science 2021-07-30 Hao Xu , Tianyu Yang , Kai-Kit Wong , Giuseppe Caire

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 paper studies secrecy transmission with the aid of a group of wireless energy harvesting (WEH)-enabled amplify-and-forward (AF) relays performing cooperative jamming (CJ) and relaying. The source node in the network does simultaneous…

Information Theory · Computer Science 2015-11-13 Hong Xing , Kai-Kit Wong , Arumugam Nallanathan , Rui Zhang

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of…

Information Theory · Computer Science 2016-11-15 Karim Khalil , Moustafa Youssef , O. Ozan Koyluoglu , Hesham El Gamal

Secrecy transmission is investigated for a cooperative jamming scheme, where a multi-antenna jam-mer generates artificial noise (AN) to confuse eavesdroppers. Two kinds of eavesdroppers are considered: passive eavesdroppers who only…

Signal Processing · Electrical Eng. & Systems 2020-02-19 Jiangbo Si , Zihao Cheng , Zan Li , Julian Cheng , Hui-Ming Wang , Naofal Al-Dhahir
‹ Prev 1 2 3 10 Next ›