English
Related papers

Related papers: Intermittent Communication

200 papers

We introduce a simple time-triggered protocol to achieve communication-efficient non-Bayesian learning over a network. Specifically, we consider a scenario where a group of agents interact over a graph with the aim of discerning the true…

Systems and Control · Electrical Eng. & Systems 2019-09-05 Aritra Mitra , John A. Richards , Shreyas Sundaram

We take an information theoretic perspective on a classical sparse-sampling noisy linear model and present an analytical expression for the mutual information, which plays central role in a variety of communications/processing problems.…

Information Theory · Computer Science 2014-03-25 Wasim Huleihel , Neri Merhav , Shlomo Shamai

Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in order to obtain…

Networking and Internet Architecture · Computer Science 2012-08-31 Keren Censor-Hillel , Bernhard Haeupler , Nancy Lynch , Muriel Médard

Traditional asymptotic information-theoretic studies of the fundamental limits of wireless communication systems primarily rely on some ideal assumptions, such as infinite blocklength and vanishing error probability. While these assumptions…

Information Theory · Computer Science 2025-12-29 Junyuan Gao , Shuao Chen , Yongpeng Wu , Liang Liu , Giuseppe Caire , H. Vincent Poor , Wenjun Zhang

This paper analyzes the fundamental limit of the strategic semantic communication problem in which a transmitter obtains a limited number of indirect observation of an intrinsic semantic information source and can then influence the…

Information Theory · Computer Science 2022-08-09 Yong Xiao , Xu Zhang , Yingyu Li , Guangming Shi , Tamer Basar

Randomized backoff protocols, such as exponential backoff, are a powerful tool for managing access to a shared resource, often a wireless communication channel (e.g., [1]). For a wireless device to transmit successfully, it uses a backoff…

Data Structures and Algorithms · Computer Science 2022-07-26 Michael A. Bender , Seth Gilbert , Fabian Kuhn , John Kuszmaul , Muriel Médard

We consider theoretical limits of partial secrecy in a setting where an eavesdropper attempts to causally reconstruct an information sequence with low distortion based on an intercepted transmission and the past of the sequence. The…

Information Theory · Computer Science 2010-08-05 Paul Cuff

This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…

Information Theory · Computer Science 2015-11-20 Ayşe Ünsal , Raymond Knopp

In the context of cellular networks, users located at the periphery of cells are particularly vulnerable to substantial interference from neighbouring cells, which can be represented as a two-user interference channel. This study introduces…

Information Theory · Computer Science 2024-10-29 Shubham Paul , Sudharsan Senthil , Preethi Seshadri , Nambi Seshadri , R David Koilpillai

This work quantifies, for the first time, intersymbol and intercarrier interferences induced by very dispersive channels in OFDM systems. The resulting achievable data rate for \wam{suboptimal} OFDM transmissions is derived based on the…

Signal Processing · Electrical Eng. & Systems 2019-01-25 Wallace Alves Martins , Fernando Cruz-Roldán , Marc Moonen , Paulo Sergio Ramirez Diniz

When several wireless users are sharing the spectrum, packet collision is a simple, yet widely used model for interference. Under this model, when transmitters cause interference at any of the receivers, their collided packets are discarded…

Information Theory · Computer Science 2016-11-17 Alireza Vahid , Mohammad Ali Maddah-Ali , A. Salman Avestimehr

We derive a new upper bound on the reliability function for channel coding over discrete memoryless channels. Our bounding technique relies on two main elements: (i) adding an auxiliary genie-receiver that reveals to the original receiver a…

Information Theory · Computer Science 2022-09-05 Anelia Somekh-Baruch

In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Yan Xin , Hari Krishna Garg

We consider a real-time communication system with noisy feedback consisting of a Markov source, a forward and a backward discrete memoryless channels, and a receiver with finite memory. The objective is to design an optimal communication…

Information Theory · Computer Science 2007-09-25 Aditya Mahajan , Demosthenis Teneketzis

The topological interference management problem refers to the study of the capacity of partially connected linear (wired and wireless) communication networks with no channel state information at the transmitters (no CSIT) beyond the network…

Information Theory · Computer Science 2013-02-19 Hua Sun , Chunhua Geng , Syed A. Jafar

Noncoherent communication is a promising paradigm for future wireless systems where acquiring accurate channel state information (CSI) is challenging or infeasible. It provides methods to bypass the need for explicit channel estimation in…

Information Theory · Computer Science 2025-05-30 Khac-Hoang Ngo , Diego Cuevas , Ruben de Miguel Gil , Victor Monzon Baeza , Ana Garcia Armada , Ignacio Santamaria

Information-theoretic arguments focus on modeling the reliability of information transmission, assuming availability of infinite data at sources, thus ignoring randomness in message generation times at the respective sources. However, in…

Networking and Internet Architecture · Computer Science 2009-09-29 K. C. V. Kalyanarama Sesha Sayee

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

In this paper we consider the task of detecting abnormal communication volume occurring at node-level in communication networks. The signal of the communication activity is modeled by means of a clique stream: each occurring communication…

Machine Learning · Computer Science 2019-02-13 Batiste Le Bars , Argyris Kalogeratos

This paper considers the problem of cognitive radios with partial-message information. Here, an interference channel setting is considered where one transmitter (the "cognitive" one) knows the message of the other ("legitimate" user)…

Information Theory · Computer Science 2008-12-31 G. Chung , S. Sridharan , S. Vishwanath , C. S. Hwang