English
Related papers

Related papers: Reliable Throughput of Generalized Collision Chann…

200 papers

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme…

Information Theory · Computer Science 2013-04-04 Parthajit Mohapatra , Chandra R. Murthy

A full-duplex wireless network with three users that want to establish full message-exchange via a relay is considered. Thus, the network known as the Y-channel has a total of 6 messages, 2 outgoing and 2 incoming at each user. The users…

Information Theory · Computer Science 2013-10-08 Anas Chaaban , Aydin Sezgin

In this paper, we consider the effect of feedback channel error on the throughput of one-hop wireless networks under the random connection model. The transmission strategy is based on activating source-destination pairs with strongest…

Information Theory · Computer Science 2013-08-13 Seyed Pooya Shariatpanahi , Hamed Shah-Mansouri , Babak Hossein Khalaj

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

We study private broadcasting of two messages to two groups of receivers over independent parallel channels. One group consists of an arbitrary number of receivers interested in a common message, whereas the other group has only one…

Information Theory · Computer Science 2013-01-01 Ashish Khisti , Tie Liu

This paper studies multi-antenna-aided covert communications coexisting with randomly located wardens and interferers, considering both centralized and distributed antenna systems (CAS/DAS). The throughput performance of the covert…

Information Theory · Computer Science 2019-02-20 Tong-Xing Zheng , Hui-Ming Wang , Derrick Wing Kwan Ng , Jinhong Yuan

Recently there has been considerable interest in the design of efficient carrier sense multiple access(CSMA) protocol for wireless network. The basic assumption underlying recent results is availability of perfect carrier sense information.…

Information Theory · Computer Science 2010-03-16 Devavrat Shah , Jinwoo Shin

Physical layer security has recently been regarded as an emerging technique to complement and improve the communication security in future wireless networks. The current research and development in physical layer security is often based on…

Information Theory · Computer Science 2013-10-02 Biao He , Xiangyun Zhou

Robust transceiver design against unresolvable system uncertainties is of crucial importance for reliable communication. For instance, full-duplex communication suffers from such uncertainties when canceling the self-interference, since…

Information Theory · Computer Science 2020-01-01 Hossein Esmaeili , Ali Kariminezhad , Aydin Sezgin

We present a capacity-achieving coding scheme for unicast or multicast over lossy packet networks. In the scheme, intermediate nodes perform additional coding yet do not decode nor even wait for a block of packets before sending out coded…

Information Theory · Computer Science 2008-04-11 Desmond S. Lun , Muriel Medard , Ralf Koetter , Michelle Effros

Given two unidirectionally coupled nonlinear systems, we speak of generalized synchronization when the responder \textquotedblleft follows\textquotedblright\ the driver. Mathematically, this situation is implemented by a map from the driver…

Chaotic Dynamics · Physics 2025-02-13 José M. Amigó , Roberto Dale , Juan C. King , Klaus Lehnertz

This paper studies the two-user Gaussian interference channel with half-duplex causal cognition. This channel model consists of two source-destination pairs sharing a common wireless channel. One of the sources, referred to as the…

Information Theory · Computer Science 2016-11-15 Martina Cardone , Daniela Tuninetti , Raymond Knopp , Umer Salim

We consider a cache-aided communications system in which a transmitter communicates with many receivers over an erasure broadcast channel. The system serves as a basic model for communicating on-demand content during periods of high network…

Information Theory · Computer Science 2015-05-06 Roy Timo , Michele Wigger

We study a scenario in which multiple uncoordinated devices aim to achieve reliable transmissions within a given time frame. The devices are intermittently active and access a shared pool of channel resources in a grant-free manner by…

Information Theory · Computer Science 2024-04-19 Radosław Kotaba , Roope Vehkalahti , Čedomir Stefanović , Olav Tirkkonen , Petar Popovski

We consider the discrete memoryless symmetric primitive relay channel, where, a source $X$ wants to send information to a destination $Y$ with the help of a relay $Z$ and the relay can communicate to the destination via an error-free…

Information Theory · Computer Science 2016-03-31 Xiugang Wu , Ayfer Ozgur , Liang-Liang Xie

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…

Information Theory · Computer Science 2018-05-08 Yanru Tang , Faeze Heydaryan , Jie Luo

A network consisting of $n$ source-destination pairs and $m$ relays is considered. Focusing on the large system limit (large $n$), the throughput scaling laws of two-hop relaying protocols are studied for Rayleigh fading channels. It is…

Information Theory · Computer Science 2008-04-29 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor

The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…

Physics and Society · Physics 2015-07-10 Filippo Radicchi

This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where $K_n:=e^{n\nu}$ different users transmit a randomly selected message among $M_n:=e^{nR}$ ones within a strong asynchronous window of length…

Information Theory · Computer Science 2018-07-27 Sara Shahi , Daniela Tuninetti , Natasha Devroye

In this paper we consider a stochastic model for a frequency-agile CSMA protocol for wireless networks where multiple orthogonal frequency channels are available. Even when the possible interference on the different channels is described by…

Probability · Mathematics 2018-08-13 Alessandro Zocca
‹ Prev 1 8 9 10 Next ›