Communicating the Sum of Sources Over a Network

By Aditya Ramamoorthy, Michael Langberg. 2010

83 citations recorded by the source corpus.

We consider the network communication scenario, over directed acyclic networks with unit capacity edges in which a number of sources si each holding independent unit-entropy information X<sub>i</sub> wish to communicate the sum ΣX<sub>i</sub> to a set of terminals t<sub>j</sub>. We show that in the case in which there are only two sources or only two terminals, communication is possible if and only if each source terminal pair s<sub>i</sub>/t<sub>j</sub> is connected by at least a single path. For the more general communication problem in which there are three sources and three terminals, we prove that a single path connecting the source terminal pairs does not suffice to communicate ΣX<sub>i</sub>. We then present an efficient encoding scheme which enables the communication of ΣX<sub>i</sub> for the three sources, three terminals case, given that each source terminal pair is connected by two edge disjoint paths.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Amir Salman Avestimehr
  2. Qian Yu
  3. Mohammad Ali Maddah-Ali
  4. Songze Li
  5. Hariharan Rahul
  6. Omid Salehi-Abari
  7. Dina Katabi
  8. Jungwoo Lee

In Electrical and Electronic Engineering

  1. Hariharan Rahul
  2. Omid Salehi-Abari
  3. Dina Katabi
  4. Amir Salman Avestimehr
  5. Mohammad Ali Maddah-Ali
  6. Songze Li
  7. Syed Ali Jafar
  8. Kaibin Huang

Citations in the corpus