An algorithm for cooperative data exchange with cost criterion
An algorithm for cooperative data exchange with cost criterion
复制标题
DOI：
10.1109/ita.2011.5743607
复制
发表时间：
2011-04
期刊：
影响因子：
--
通讯作者：
Damla Ozgul;A. Sprintson
中科院分区：
文献类型：
--
作者：
Damla Ozgul;A. Sprintson
我们考虑一组无线客户端之间的合作数据交换的成本最小化的问题。在这个问题中，一组客户端需要通过共享的无损广播通道交换一组数据包。每个客户端最初持有数据包的子集，并且需要获得由其他客户端持有的数据包。在每一轮，客户端之一可以通过信道广播其分组或其组合。每个客户端都与某个传输成本相关联，该传输成本捕获其传输数据包的能力。这种成本可以取决于各种因素，可用电池寿命。在本文中，我们提出了一个有效的随机算法，确保所有客户端接收所有的数据包，并最大限度地减少总的传输成本。我们证明了该算法的最优性，并进行仿真研究，估计使用网络编码技术实现的优势。
We consider the problem of minimizing the cost of cooperative data exchange between a group of wireless clients. In this problem, a group of clients needs to exchange a set of packets over a shared lossless broadcast channel. Each client initially holds a subset of packets and needs to obtain the packets held by other clients. At each round, one of the clients can broadcast its packets or a combination thereof over the channel. Each client is associated with a certain transmission cost that captures its ability to transmit packets. Such cost can depend on various factors, e.g., available battery life. In this paper, we present an efficient randomized algorithm that ensures that all clients receive all packets and minimizes the total transmission cost. We prove the optimality of the algorithm and perform simulation studies to estimate the advantage achievable by using the network coding technique.