无线网络中的数据分发问题
Data Dissemination Problem in Wireless Networks
摘要：
在这项工作中，我们制定和研究的数据传播问题，这可以被看作是一个推广的索引编码问题和数据交换问题的网络与任意拓扑结构。我们定义$r$ -可解网络，其中数据传播可以在$r > 0$通信回合中实现。我们表明，任何一轮通信方案的最佳传输次数是由一定的约束矩阵族的最小秩。对于这个问题的一个特殊情况，称为二分数据传播问题，我们提出了最佳传输次数的上下限图论。对于一般的$r$可解网络，我们推导出一个上限的最小传输次数在任何计划与$\geq r$轮。我们实验比较得到的上限到一个简单的下限。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
