Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Data Dissemination Problem in Wireless Networks   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, in which data dissemination can be achieved in $r > 0$ communications
rounds. We show that the optimum number of transmissions for any one-round
communications scheme is given by the minimum rank of a certain constrained
family of matrices. For a special case of this problem, called bipartite data
dissemination problem, we present lower and upper graph-theoretic bounds on the
optimum number of transmissions. For general $r$-solvable networks, we derive
an upper bound on the minimum number of transmissions in any scheme with $\geq
r$ rounds. We experimentally compare the obtained upper bound to a simple lower
bound.

14
The categories of this paper are: math-ph
7
The categories of this paper are: hep-th
12
The categories of this paper are: nucl-th
27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org
34
The categories of this paper are: chem-ph
33
The categories of this paper are: plasm-ph
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
37
The categories of this paper are: supr-con
0
The categories of this paper are: hep-ph
13
The categories of this paper are: quant-ph
22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
36
The categories of this paper are: cmp-lg
35
The categories of this paper are: mtrl-th