Exchanging Third-Party Information with Minimum Transmission Cost
Abstract
In this paper, we consider the problem of minimizing the total transmission cost for exchanging channel state information. We proposed a network coded cooperative data exchange scheme, such that the total transmission cost is minimized while each client can decode all the channel information held by all other clients. In this paper, we first derive a necessary and sufficient condition for a feasible transmission. Based on the derived condition, there exists a feasible code design to guarantee that each client can decode the complete information. We further formulate the problem of minimizing the total transmission cost as an integer linear programming. Finally, we discuss the probability that each client can decode the complete information with distributed random linear network coding.
Cite
@article{arxiv.1207.0877,
title = {Exchanging Third-Party Information with Minimum Transmission Cost},
author = {Xiumin Wang and Wentu Song and Chau Yuen and Jing Li},
journal= {arXiv preprint arXiv:1207.0877},
year = {2012}
}
Comments
6 pages, Globecom'12