English
Related papers

Related papers: Secure Communications for the Two-user Broadcast C…

200 papers

We consider the two-user interference channel where two independent pairs communicate concurrently and investigate its stable throughput region. First, the stability region is characterized for the general case, i.e., without any specific…

Information Theory · Computer Science 2018-10-02 Nikolaos Pappas , Marios Kountouris

In this paper we consider the two-user broadcast channel and we characterize its stable throughout region. We start the analysis by providing the stability region for the general case without any specific considerations on transmission and…

Information Theory · Computer Science 2016-04-29 Nikolaos Pappas , Marios Kountouris , Anthony Ephremides , Vangelis Angelakis

In this paper, we characterize the stability region of the two-user broadcast channel. First, we obtain the stability region in the general case. Second, we consider the particular case where each receiver treats the interfering signal as…

Information Theory · Computer Science 2016-02-24 Nikolaos Pappas , Marios Kountouris

The stable throughput region of the two-user interference channel is investigated here. First, the stability region for the general case is characterized. Second, we study the cases where the receivers treat interference as noise or perform…

Information Theory · Computer Science 2016-11-15 Nikolaos Pappas , Marios Kountouris , Anthony Ephremides

We characterize stability regions of two-user fading Gaussian multiple access (MAC) and broadcast (BC) networks with centralized scheduling. The data to be transmitted to the users is encoded into codewords of fixed length. The rates of the…

Information Theory · Computer Science 2007-07-13 Viveck R. Cadambe , Syed A. Jafar

This paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…

Information Theory · Computer Science 2015-02-26 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesdropper. We proposed a coding scheme which is based upon the…

Information Theory · Computer Science 2018-10-29 Jin Yeong Tan , Lawrence Ong , Behzad Asadi

A wireless network in which packets are broadcast to a group of receivers through use of a random access protocol is considered in this work. The relation to previous work on networks of interacting queues is discussed and subsequently, the…

Information Theory · Computer Science 2007-11-05 Brooke Shrader , Anthony Ephremides

This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…

Information Theory · Computer Science 2015-12-01 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided…

Information Theory · Computer Science 2019-05-29 Ziv Goldfeld , Gerhard Kramer , Haim H. Permuter , Paul Cuff

In this paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to…

Information Theory · Computer Science 2011-09-27 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless…

Information Theory · Computer Science 2008-07-30 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

The broadcast channel (BC) with one common and two private messages with leakage constraints is studied, where leakage rate refers to the normalized mutual information between a message and a channel symbol string. Each private message is…

Information Theory · Computer Science 2017-05-30 Ziv Goldfeld , Gerhard Kramer , Haim H. Permuter

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

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages to two receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where…

Information Theory · Computer Science 2009-10-20 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

This work investigates the secrecy capacity of the Wiretap Broadcast Channel (WBC) with an external eavesdropper where a source wishes to communicate two private messages over a Broadcast Channel (BC) while keeping them secret from the…

Information Theory · Computer Science 2015-08-21 Meryem Benammar , Pablo Piantanida

In this paper, we study the problem of cooperative communications in cognitive radio systems where the secondary user has limited relaying room for the overheard primary packets. More specifically, we characterize the stable throughput…

Networking and Internet Architecture · Computer Science 2016-11-17 Adel M. Elmahdy , Amr El-Keyi , Tamer ElBatt , Karim G. Seddik

In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the…

Information Theory · Computer Science 2015-03-19 Xiaolin Li , Ryutaroh Matsumoto

The secrecy capacity region for the K-receiver degraded broadcast channel (BC) is given for confidential messages sent to the receivers and to be kept secret from an external wiretapper. Superposition coding and Wyner's random code…

Information Theory · Computer Science 2008-12-22 Li-Chia Choo , Kai-Kit Wong

The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value,…

Information Theory · Computer Science 2009-09-29 KCV Kalyanarama Sesha Sayee , Utpal Mukherji
‹ Prev 1 2 3 10 Next ›