Deterministic Algorithm for Coded Cooperative Data Exchange
We consider the problem of cooperative data exchange in a group of wireless clients. In this problem each client initially holds a subset of packets and needs to obtain all packets held by other clients. Each client can broadcast its own packets or a comb
|Collections||ANU Research Publications|
|Source:||Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST|
|01_Sprintson_Deterministic_Algorithm_for_2012.pdf||243.16 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.