Publications de Dinkar Vasudevan

Cooperative coding on orthogonal information networks

The focus of this thesis is on communication over cooperative information networks. In the first half of the thesis, we consider lossy source coding problems where a relay assists in the communication of a source stream between two terminals. The following ...

EPFL2009

Using Three States for Binary Consensus on Complete Graphs

Etienne Perron, Milan Vojnovic, Dinkar Vasudevan

We consider the binary consensus problem where each node in the network initially observes one of two states and the goal for each node is to eventually decide which one of the two states was initially held by the majority of the nodes. Each node contacts ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Achievable Flows on Orthogonal Information Networks

Dinkar Vasudevan

We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

On Broadcast with a Common Message over Networks

Dinkar Vasudevan, Satish Babu Korada

We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable r ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Broadcast and Slepian-Wolf multicast over Aref Networks

Dinkar Vasudevan, Satish Babu Korada

We consider source coding over Aref networks. In particular we consider the following two problems: (i) multicasting correlated sources to a set of receivers, (ii) broadcasting sources to their respective receivers. For the first problem we show necessary ...

2008

On the Heegard-Berger/Kaspi problem with decoder cooperation

Dinkar Vasudevan

We consider decoder cooperation in the Heegard-Berger/Kaspi problem. The encoder sends a common description of a source to two decoders, one of which has side information. Cooperation between the two decoders is of the form of a limited capacity link from ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Algebraic gossip on Arbitrary Networks

Shrinivas Kudekar, Dinkar Vasudevan

Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, we analyze a gossip based protocol where coded messages are exchanged. This problem was studied by Shah et al where a bound to the ...

IEEE2009