English
Related papers

Related papers: Multiple Unicast Capacity of 2-Source 2-Sink Netwo…

200 papers

We study the effects of instantaneous feedback of channel topology on the degrees of freedom (DoF) of the bursty MIMO X channel, where the four transmitter-receiver links are intermittently on-and-off, governed by four independent Bernoulli…

Information Theory · Computer Science 2018-05-08 Shih-Yi Yeh , I-Hsiang Wang

We consider a single hop wireless X network with $K$ transmitters and $J$ receivers, all with single antenna. Each transmitter conveys for each receiver an independent message. The channel is assumed to have constant coefficients. We…

Information Theory · Computer Science 2011-09-15 Zhengdao Wang

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

The sum degrees of freedom (DoF) of the two-transmitter, two-receiver multiple-input multiple-output (MIMO) X-Network ($2 \times 2$ MIMO X-Network) with $M$ antennas at each node is known to be $\frac{4M}{3}$. Transmission schemes which…

Information Theory · Computer Science 2015-01-29 Abhinav Ganesan , K. Pavan Srinath

We show that fully connected two-hop wireless networks with K sources, K relays and K destinations have K degrees of freedom both in the case of time-varying channel coefficients and in the case of constant channel coefficients (in which…

Information Theory · Computer Science 2013-05-16 Ilan Shomorony , A. Salman Avestimehr

A network consisting of a point-to-point (P2P) link and a multiple access channel (MAC) sharing the same medium is considered. The resulting interference network, with three transmitters and two receivers is studied from degrees of freedom…

Information Theory · Computer Science 2011-10-05 Anas Chaaban , Aydin Sezgin

We explore the degrees of freedom (DoF) of three classes of finite state compound wireless networks in this paper. First, we study the multiple-input single-output (MISO) finite state compound broadcast channel (BC) with arbitrary number of…

Information Theory · Computer Science 2009-09-24 Tiangao Gou , Syed A. Jafar , Chenwei Wang

This work explores how degrees of freedom (DoF) results from wireless networks can be translated into capacity results for their finite field counterparts that arise in network coding applications. The main insight is that scalar (SISO)…

Information Theory · Computer Science 2013-04-30 Sundar R. Krishnamurthy , Syed A. Jafar

This paper investigates the many-to-one throughput capacity (and by symmetry, one-to-many throughput capacity) of IEEE 802.11 multi-hop networks. It has generally been assumed in prior studies that the many-to-one throughput capacity is…

Networking and Internet Architecture · Computer Science 2007-07-13 Chi Pan Chan , Soung Chang Liew , An Chan

Recent work has characterized the sum capacity of time-varying/frequency-selective wireless interference networks and $X$ networks within $o(\log({SNR}))$, i.e., with an accuracy approaching 100% at high SNR (signal to noise power ratio).…

Information Theory · Computer Science 2012-04-03 Viveck R. Cadambe , Syed A. Jafar

This paper characterizes the secret message capacity of three networks where two unicast sessions share some of the communication resources. Each network consists of erasure channels with state feedback. A passive eavesdropper is assumed to…

Information Theory · Computer Science 2018-10-16 Gaurav Kumar Agarwal , Martina Cardone , Christina Fragouli

The first result is on the separability of the unicast capacity of stationary multi-channel multi-radio wireless networks, i.e., whether the capacity of such a network is equal to the sum of the capacities of the corresponding…

Information Theory · Computer Science 2009-12-26 Liangping Ma

The degrees of freedom (DoF) of the MIMO Y-channel, a multi-way communication network consisting of 3 users and a relay, are characterized for arbitrary number of antennas. The converse is provided by cut-set bounds and novel genie-aided…

Information Theory · Computer Science 2013-05-15 Anas Chaaban , Karlheinz Ochs , Aydin Sezgin

Degrees of freedom (DoF) is studied in the downlink of a heterogenous wireless network modeled as a two-layered interference network. The first layer of the interference network is the backhaul layer between macro base stations (MB) and…

Information Theory · Computer Science 2016-09-12 Meghana Bande , Venugopal Veeravalli , Antti Tolli , Markku Juntti

We study the sum degrees of freedom (DoF) of a class of multi-layer relay-aided MIMO broadcast networks with delayed channel state information at transmitters (CSIT). In the assumed network a K-antenna source intends to communicate to K…

Information Theory · Computer Science 2012-10-15 Zhao Wang , Ming Xiao , Chao Wang , Mikael Skoglund

A sum-network is a directed acyclic network in which all terminal nodes demand the `sum' of the independent information observed at the source nodes. Many characteristics of the well-studied multiple-unicast network communication problem…

Information Theory · Computer Science 2015-04-23 Ardhendu Tripathy , Aditya Ramamoorthy

We study the impact of delayed channel state information at the transmitters (CSIT) in two-unicast wireless networks with a layered topology and arbitrary connectivity. We introduce a technique to obtain outer bounds to the…

Information Theory · Computer Science 2015-10-06 Alireza Vahid , Ilan Shomorony , Robert Calderbank

We study the degrees of freedom (DoF) of MIMO two-way X relay channels. Previous work studied the case $N < 2M$, where $N$ and $M$ denote the number of antennas at the relay and each source, respectively, and showed that the maximum DoF of…

Information Theory · Computer Science 2018-02-21 Kangqi Liu , Meixia Tao , Zhengzheng Xiang , Xin Long

We consider a data aggregating wireless network where all nodes have data to send to a single destination node, the sink. We consider a linear placement of nodes with the sink at one end. The nodes communicate directly to the sink (single…

Networking and Internet Architecture · Computer Science 2013-02-14 Easwar Vivek Mangipudi , Venkatesh Ramaiyan , Srikrishna Bhashyam

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…

Information Theory · Computer Science 2016-11-17 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj , Kasra Alishahi , Hamed Shah-Mansouri