English
Related papers

Related papers: Reliable Throughput of Generalized Collision Chann…

200 papers

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 present report deals with the modeling of the long-term throughput, a.k.a., send rate, of the Transmission Control Protocol (TCP) under the following assumptions. (i) We consider a single 'infinite source' using a network path from…

Networking and Internet Architecture · Computer Science 2014-02-03 Daniel Zaragoza

In this paper, we consider multiple cache-enabled end-users connected to multiple transmitters through a linear network. We also prevent a totally passive eavesdropper, who sniffs the packets in the delivery phase, from obtaining any…

Information Theory · Computer Science 2022-11-29 Mohammad Javad Sojdeh , Mehdi Letafati , Seyed Pooya Shariatpanahi , Babak Hossein Khalaj

Full-duplex multi-way relaying is a potential solution for supporting high data rates in future Internet-of-Things (IoT) and 5G networks. Thus, in this paper the full-duplex MIMO multi-way channel consisting of 3 users (Y-channel) with $M$…

Information Theory · Computer Science 2014-12-03 Anas Chaaban , Aydin Sezgin

Consider a time slotted communication channel shared by $K$ active users and a single receiver. It is assumed that the receiver has the ability of the multiple-packet reception (MPR) to correctly receive at most $\gamma$ ($1 \leq \gamma <…

Information Theory · Computer Science 2014-09-29 Yijin Zhang , Yuan-Hsun Lo , Feng Shu , Wing Shing Wong

Compound channel models offer a simple and straightforward way of analyzing the stability of decoder design under model variations. With this work we provide a coding theorem for a large class of practically relevant compound channel…

Information Theory · Computer Science 2021-05-11 Andrea Cacioppo , Janis Nötzel , Matteo Rosati

This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two…

Information Theory · Computer Science 2009-10-09 Yi Cao , Biao Chen

A general information transmission model, under independent and identically distributed Gaussian codebook and nearest neighbor decoding rule with processed channel output, is investigated using the performance metric of generalized mutual…

Information Theory · Computer Science 2019-08-23 Wenyi Zhang , Yizhu Wang , Cong Shen , Ning Liang

We consider the classical contention resolution problem where nodes arrive over time, each with a message to send. In each synchronous slot, each node can send or remain idle. If in a slot one node sends alone, it succeeds; otherwise, if…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-11-15 Yonggang Jiang , Chaodong Zheng

It is known that the capacity of parallel (multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. In…

Information Theory · Computer Science 2016-11-17 Viveck R. Cadambe , Syed A. Jafar

Gaussian networks are fundamental objects in network information theory. Here many senders and receivers are connected by physically motivated Gaussian channels while auxiliary Gaussian components, such as Gaussian relays, are entailed.…

Quantum Physics · Physics 2022-09-09 Masoud Ghalaii , Panagiotis Papanastasiou , Stefano Pirandola

In wireless ad hoc networks, distributed nodes can collaboratively form an antenna array for long-distance communications to achieve high energy efficiency. In recent work, Ochiai, et al., have shown that such collaborative beamforming can…

Information Theory · Computer Science 2007-07-13 Athina P. Petropulu , Lun Dong , H. Vincent Poor

In this paper, we analyze the coexistence of a primary and a secondary (cognitive) network when both networks use the IEEE 802.11 based distributed coordination function for medium access control. Specifically, we consider the problem of…

Networking and Internet Architecture · Computer Science 2013-09-11 Santhosh Kumar , Nirmal Shende , Chandra R. Murthy , Arun Ayyagari

We study and compare the Shannon capacity region and the stable throughput region for a random access system in which source nodes multicast their messages to multiple destination nodes. Under an erasure channel model which accounts for…

Information Theory · Computer Science 2007-09-20 Brooke Shrader , Anthony Ephremides

Classical information theory typically assumes reliable receiver-side processing. We study remote inference when communication is noisy and the receiver itself is built from unreliable components under a finite redundancy budget. Under a…

Information Theory · Computer Science 2026-04-22 Zhenyu Liu , Yi Ma , Rahim Tafazolli

In this paper, the Gaussian many-to-one X channel, which is a special case of general multiuser X channel, is studied. In the Gaussian many-to-one X channel, communication links exist between all transmitters and one of the receivers, along…

Information Theory · Computer Science 2016-11-17 Ranga Prasad , Srikrishna Bhashyam , A. Chockalingam

This work considers reliable transmission of general correlated sources over the multiple-access relay channel (MARC) and the multiple-access broadcast relay channel (MABRC). In MARCs only the destination is interested in a reconstruction…

Information Theory · Computer Science 2012-07-02 Yonathan Murin , Ron Dabora , Deniz Gündüz

This paper contributes to the modeling and analysis of unsignalized intersections. In classical gap acceptance models vehicles on the minor road accept any gap greater than the CRITICAL gap, and reject gaps below this threshold, where the…

Probability · Mathematics 2018-02-13 Abhishek , Marko Boon , Michel Mandjes

We consider a cognitive network consisting of n random pairs of cognitive transmitters and receivers communicating simultaneously in the presence of multiple primary users. Of interest is how the maximum throughput achieved by the cognitive…

Information Theory · Computer Science 2016-11-18 Mai Vu , Natasha Devroye , Masoud Sharif , Vahid Tarokh

Wireless systems are increasingly used for Machine-Type Communication (MTC), where the users sporadically send very short messages. In such a setting, the overhead imposed by channel estimation is substantial, thereby demanding noncoherent…

Information Theory · Computer Science 2016-11-18 Zoran Utkovski , Tome Eftimov , Petar Popovski