English
Related papers

Related papers: Secure Analog Network Coding in Layered Networks

200 papers

We consider the problem of finding secrecy rate of a multiple-input multiple-output (MIMO) wire-tap channel. A transmitter, a legitimate receiver, and an eavesdropper are all equipped with multiple antennas. The channel states from the…

Information Theory · Computer Science 2014-11-04 Arash Khabbazibasmenj , Maksym A. Girnyk , Sergiy A. Vorobyov , Mikko Vehkaperä , Lars K. Rasmussen

Reliable and secure communication is an important aspect of modern fiber optic communication. In this work we consider a multi-mode fiber (MMF) channel wiretapped by an eavesdropper. We assume the transmitter knows the legitimate channel,…

Information Theory · Computer Science 2021-10-22 Eduard Jorswieck , Andrew Lonnstrom , Karl-Ludwig Besser , Stefan Rothe , Juergen W. Czarske

Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional…

Information Theory · Computer Science 2011-04-19 Rafael F. Wyrembelski , Holger Boche

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

Physical-layer Network Coding (PNC) can significantly improve the throughput of two-way relay channels. An interesting variant of PNC is Analog Network Coding (ANC). Almost all ANC schemes proposed to date, however, operate in a symbol by…

Information Theory · Computer Science 2011-10-17 Shengli Zhang , Soung-Chang Liew , Qingfeng Zhou , Lu Lu , Hui Wang

We consider a set of $n$ messages and a group of $k$ clients. Each client is privileged for receiving an arbitrary subset of the messages over a broadcast erasure channel, which generalizes scenario of a previous work. We propose a method…

Information Theory · Computer Science 2013-05-07 Shahriar Etemadi Tajbakhsh , Parastoo Sadeghi

In this paper, we present nontrivial upper and lower bounds on the secrecy capacity of the degraded Gaussian diamond-wiretap channel and identify several ranges of channel parameters where these bounds coincide with useful intuitions.…

Information Theory · Computer Science 2015-04-23 Si-Hyeon Lee , Ashish Khisti

Terahertz (THz) communications have naturally promising physical layer security (PLS) performance in the angular domain due to the high directivity feature brought by the ultra-massive multiple-antenna techniques. However, traditional…

Information Theory · Computer Science 2022-07-26 Weijun Gao , Xuyang Lu , Chong Han , Zhi Chen

Wireless communication provides a wide coverage at the cost of exposing information to unintended users. As an information-theoretic paradigm, secrecy rate derives bounds for secure transmission when the channel to the eavesdropper is…

Information Theory · Computer Science 2016-11-17 Ashkan Kalantari , Mojtaba Soltanalian , Sina Maleki , Symeon Chatzinotas , Björn Ottersten

A visible light communication broadcast channel is considered, in which a transmitter luminaire communicates with two legitimate receivers in the presence of an external eavesdropper. A number of trusted cooperative half-duplex relay…

Information Theory · Computer Science 2019-05-13 Ahmed Arafa , Erdal Panayirci , H. Vincent Poor

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived.…

Information Theory · Computer Science 2009-01-21 Mustafa Cenk Gursoy

One of the fundamental challenges in the design of distributed wireless networks is the large dynamic range of network state. Since continuous tracking of global network state at all nodes is practically impossible, nodes can only acquire…

Information Theory · Computer Science 2017-04-18 Alireza Vahid , Vaneet Aggarwal , A. Salman Avestimehr , Ashutosh Sabharwal

An efficient analog network coding transmission protocol is proposed in this letter for a MIMO two way cellular network. Block signal alignment is first proposed to null the inter-user interference for multi-antenna users, which makes the…

Information Theory · Computer Science 2013-08-19 Ming Gan , Zhiguo Ding , Xuchu Dai

A Gaussian multiple-input multiple-output wiretap channel in which the eavesdropper and legitimate receiver are equipped with arbitrary numbers of antennas and the transmitter has two antennas is studied in this paper. Under an average…

Information Theory · Computer Science 2017-07-21 Mojtaba Vaezi , Wonjae Shin , H. Vincent Poor

An intelligent reflecting surface (IRS) can adaptively adjust the phase shifts of its reflecting units to strengthen the desired signal and/or suppress the undesired signal. In this letter, we investigate an IRS-aided secure wireless…

Information Theory · Computer Science 2019-05-28 Miao Cui , Guangchi Zhang , Rui Zhang

Unmanned aerial vehicles (UAVs) have been widely employed to enhance the end-to-end performance of wireless communications since the links between UAVs and terrestrial nodes are line-of-sight (LoS) with high probability. However, the…

Information Theory · Computer Science 2022-04-22 Hongjiang Lei , Haosi Yang , Ki-Hong Park , Imran Shafique Ansari , Jing Jiang , Mohamed-Slim Alouini

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

Recent results on source-channel coding for secure transmission show that separation holds in several cases under some less-noisy conditions. However, it has also been proved through a simple counterexample that pure analog schemes can be…

Information Theory · Computer Science 2011-09-06 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

Information-theoretic security -- widely accepted as the strictest notion of security -- relies on channel coding techniques that exploit the inherent randomness of the propagation channels to significantly strengthen the security of…

Information Theory · Computer Science 2010-01-22 Pedro C. Pinto , Joao Barros , Moe Z. Win