A Randomized Algorithm and Performance Bounds for Coded Cooperative Data Exchange
We consider scenarios where wireless clients are missing some packets, but they collectively know every packet. The clients collaborate to exchange missing packets over an error-free broadcast channel with capacity of one packet per channel use. First, we present an algorithm that allows each client to obtain missing packets, with minimum number of transmissions. The algorithm employs random linear coding over a sufficiently large field. Next, we show that the field size can be reduced while...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of IEEE International Symposium on Information Theory (ISIT 2010)|
|01_Sprintson_A_Randomized_Algorithm_and_2010.pdf||211.83 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.