English
Related papers

Related papers: Reception Capacity: Definitions, Game Theory and H…

200 papers

Real-time applications are performance critical applications that require bounded service latency. In multi-hop wireless ad-hoc and sensor networks, communication delays are dominant over processing delays. Therefore, to enable real-time…

Networking and Internet Architecture · Computer Science 2012-01-25 Deepali Virmani , Satbir Jain

Studying the capacity of wireless multi-hop networks is an important problem and extensive research has been done in the area. In this letter, we sift through various capacity-impacting parameters and show that the capacity of both static…

Networking and Internet Architecture · Computer Science 2012-07-06 Guoqiang Mao

We consider the problem of data exchange by a group of closely-located wireless nodes. In this problem each node holds a set of packets and needs to obtain all the packets held by other nodes. Each of the nodes can broadcast the packets in…

Information Theory · Computer Science 2016-11-15 Salim El Rouayheb , Alex Sprintson , Parastoo Sadeghi

We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Keerthi S. K. Arumugam , Matthieu R. Bloch

Full exploitation of the bandwidth resources of Wireless Networks is challenging because of the sharing of the radio medium among neighboring nodes. Practical algorithms and distributed schemes that tries to optimising the use of the…

Networking and Internet Architecture · Computer Science 2009-04-09 Raffaele Bruno , Vania Conan , Stephane Rousseau

In recent years, the application of artificial intelligence (AI) in wireless communications has demonstrated inherent robustness against wireless channel distortions. Most existing works empirically leverage this robustness to yield…

Information Theory · Computer Science 2025-07-09 Yangshuo He , Guanding Yu , Huaiyu Dai

In this work, we formulate and study a data dissemination problem, which can be viewed as a generalization of the index coding problem and of the data exchange problem to networks with an arbitrary topology. We define $r$-solvable networks,…

Information Theory · Computer Science 2015-10-12 Ivo Kubjas , Vitaly Skachek

The subject of this paper is the long-standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundamental performance limits of mobile ad hoc networks (MANETs). A…

We consider the problem of broadcast with common messages, and focus on the case that the common message rate $R_{\mathcal{A}}$, i.e., the rate of the message intended for all the receivers in the set $\mathcal{A}$, is the same for all the…

Information Theory · Computer Science 2016-11-17 Chao Tian

We study the transmission capacities of two coexisting wireless networks (a primary network vs. a secondary network) that operate in the same geographic region and share the same spectrum. We define transmission capacity as the product…

Information Theory · Computer Science 2016-11-17 Changchuan Yin , Long Gao , Tie Liu , Shuguang Cui

This paper demonstrates fundamental limits of sensor networks for detection problems where the number of hypotheses is exponentially large. Such problems characterize many important applications including detection and classification of…

Information Theory · Computer Science 2016-11-17 Yaron Rachlin , Rohit Negi , Pradeep Khosla

We consider three capacity definitions for general channels with channel side information at the receiver, where the channel is modeled as a sequence of finite dimensional conditional distributions not necessarily stationary, ergodic, or…

Information Theory · Computer Science 2016-11-17 Michelle Effros , Andrea Goldsmith , Yifan Liang

Given a set of wireless links, a fundamental problem is to find the largest subset that can transmit simultaneously, within the SINR model of interference. Significant progress on this problem has been made in recent years. In this note, we…

Data Structures and Algorithms · Computer Science 2012-03-15 Magnus M. Halldorsson , Pradipta Mitra

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

Wireless connectivity creates a computing paradigm that merges communication and inference. A basic operation in this paradigm is the one where a device offloads classification tasks to the edge servers. We term this remote classification,…

Information Theory · Computer Science 2020-07-31 Qiao Lan , Yuqing Du , Petar Popovski , Kaibin Huang

We investigate robust linear consensus over networks under capacity-constrained communication. The capacity of each edge is encoded as an upper bound on the number of state variables that can be communicated instantaneously. When the edge…

Systems and Control · Electrical Eng. & Systems 2021-05-25 Yasin Yazicioglu , Alberto Speranzon

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower…

Information Theory · Computer Science 2013-02-08 Yuxin Chen , Jeffrey G. Andrews

This paper studies the capacity of a general multiple-input multiple-output (MIMO) free-space optical intensity channel under a per-input-antenna peak-power constraint and a total average-power constraint over all input antennas. The focus…

Information Theory · Computer Science 2020-02-04 Longguang Li , Stefan M. Moser , Ligong Wang , Michèle Wigger

An overview of game-theoretic approaches to energy-efficient resource allocation in wireless networks is presented. Focusing on multiple-access networks, it is demonstrated that game theory can be used as an effective tool to study resource…

Information Theory · Computer Science 2016-11-18 Farhad Meshkati , H. Vincent Poor , Stuart C. Schwartz

We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to…

Information Theory · Computer Science 2008-11-24 Vivek P. Mhatre , Catherine P. Rosenberg , Ravi R. Mazumdar