English
Related papers

Related papers: Capacity of a Class of Linear Binary Field Multi-s…

200 papers

The deterministic channel model for wireless relay networks proposed by Avestimehr, Diggavi and Tse `07 has captured the broadcast and inference nature of wireless communications and has been widely used in approximating the capacity of…

Information Theory · Computer Science 2009-10-01 Cuizhu Shi , Aditya Ramamoorthy

One of the fundamental challenges in the design of distributed wireless networks is the large dynamic range of network state. Since continuous tracking of global network state at all nodes is practically impossible, nodes can only acquire…

Information Theory · Computer Science 2017-04-18 Alireza Vahid , Vaneet Aggarwal , A. Salman Avestimehr , Ashutosh Sabharwal

The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is studied. This problem is first examined in the context of the linear shift deterministic…

Information Theory · Computer Science 2016-11-17 Aydin Sezgin , A. Salman Avestimehr , M. Amin Khajehnejad , Babak Hassibi

A classical result in undirected wireline networks is the near optimality of routing (flow) for multiple-unicast traffic (multiple sources communicating independent messages to multiple destinations): the min cut upper bound is within a…

Information Theory · Computer Science 2011-11-22 Sreeram Kannan , Pramod Viswanath

In this paper, two-hop communication between a source and a destination with the aid of an intermediate relay node is considered. Both the source and intermediate relay node are assumed to operate under statistical quality of service (QoS)…

Information Theory · Computer Science 2010-10-01 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are even greater when nodes perform mutual information…

Information Theory · Computer Science 2009-08-27 Stark C. Draper , Lingjia Liu , Andreas F. Molisch , Jonathan S. Yedidia

The present paper focuses on the problem of broadcasting information in the most efficient manner in a large two-dimensional ad hoc wireless network at low SNR and under line-of-sight propagation. A new communication scheme is proposed,…

Information Theory · Computer Science 2016-11-18 Serj Haddad , Olivier Leveque

In this paper, we study network coding capacity for random wireless networks. Previous work on network coding capacity for wired and wireless networks have focused on the case where the capacities of links in the network are independent. In…

Information Theory · Computer Science 2007-08-23 Zhenning Kong , Salah A. Aly , Emina Soljanin , Edmund M. Yeh , Andreas Klappenecker

This paper focuses on the capacity of peer-to-peer relay communications wherein the transmitter are assisted by an arbitrary number of parallel relays, i.e. there is no link and cooperation between the relays themselves. We detail the…

Information Theory · Computer Science 2014-04-08 Farshad Shams , Marco Luise

An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and…

Networking and Internet Architecture · Computer Science 2018-06-29 Magnus M. Halldorsson , Tigran Tonoyan

One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for bounding the capacity of general networks, but their…

Information Theory · Computer Science 2015-03-17 Michelle Effros , Tracey Ho , Shirin Jalali

We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. The network performance is described by the n2^n-dimensional caching capacity region of the wireless network. We…

Information Theory · Computer Science 2012-09-28 Urs Niesen , Devavrat Shah , Gregory Wornell

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

This paper derives the outage probability and transmission capacity of ad hoc wireless networks with nodes employing multiple antenna diversity techniques, for a general class of signal distributions. This analysis allows system performance…

Information Theory · Computer Science 2016-11-15 Andrew M. Hunter , Jeffrey G. Andrews , Steven Weber

We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact…

Information Theory · Computer Science 2007-10-23 A. S. Avestimehr , S. N. Diggavi , D. N. C. Tse

The linear shift deterministic Y-channel is studied. That is, we have three users and one relay, where each user wishes to broadcast one message to each other user via the relay, resulting in a multi-way relaying setup. The cut-set bounds…

Information Theory · Computer Science 2015-03-19 Anas Chaaban , Aydin Sezgin

We study three capacity problems in the mobile telephone model, a network abstraction that models the peer-to-peer communication capabilities implemented in most commodity smartphone operating systems. The capacity of a network expresses…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-09 Michael Dinitz , Magnús M. Halldórsson , Calvin Newport , Alex Weaver

A linear mesh network is considered in which a single user per cell communicates to a local base station via a dedicated relay (two-hop communication). Exploiting the possibly relevant inter-cell channel gains, rate splitting with…

Information Theory · Computer Science 2007-10-16 O. Simeone , O. Somekh , Y. Bar-Ness , H. V. Poor , S. Shamai

A long standing open problem in the theory of neural networks is the development of quantitative methods to estimate and compare the capabilities of different architectures. Here we define the capacity of an architecture by the binary…

Machine Learning · Computer Science 2019-03-29 Pierre Baldi , Roman Vershynin

In large wireless networks, acquiring full network state information is typically infeasible. Hence, nodes need to flow the information and manage the interference based on partial information about the network. In this paper, we consider…

Information Theory · Computer Science 2015-03-17 Alireza Vahid , Vaneet Aggarwal , Amir Salman Avestimehr , Ashutosh Sabharwal