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 combinations thereof to other clients via an error-free broadcast channel. Assuming that clients know which packets are available to other clients, our goal is to minimize the total number of transmissions needed to satisfy the demands of all clients. We present a deterministic algorithm that computes an optimal solution to this problem in polynomial time.


Linear Code Network Code Deterministic Algorithm Annual IEEE Symposium User Cooperation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network Information Flow. IEEE Trans. Inf. Theory 46(4), 1204–1216 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Alon, N., Hassidim, A., Lubetzky, E., Stav, U., Weinstein, A.: Broadcasting with Side Information. In: Proc. of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 823–832 (2008)Google Scholar
  3. 3.
    Bar-Yossef, Z., Birk, Y., Jayram, T.S., Kol, T.: Index Coding With Side Information. In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 197–206 (2006)Google Scholar
  4. 4.
    Birk, Y., Kol, T.: Coding-On-Demand by an Informed Source (ISCOD) for Efficient Broadcast of Different Supplemental Data to Caching Clients. IEEE Trans. Inf. Theory 52(6), 2825–2830 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Blasiak, A., Kleinberg, R., Lubetzky, E.: Index Coding via Linear Programming. IEEE Trans. Inf. Theory (April 2010) (submitted for publication),
  6. 6.
    Courtade, T., Wesel, R.: Efficient Universal Recovery in Broadcast Networks. In: 48th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA (September-October 2010)Google Scholar
  7. 7.
    Courtade, T., Wesel, R.D.: A Deterministic Approach to Rate-Compatible Fountain Communication. In: Information Theory and Applications Workshop (ITA), San Diego, CA, USA (January/February 2010)Google Scholar
  8. 8.
    El Rouayheb, S., Sprintson, A., Georghiades, C.: On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory. IEEE Transactions on Information Theory 56(7), 3187–3195 (2010)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Hong, Y.-W., Huang, W.-J., Chiu, F.-H., Kuo, C.-C.J.: Cooperative Communications in Resource-Constrained Wireless Networks. IEEE Signal Process. Mag. 24(3), 47–57 (2007)CrossRefGoogle Scholar
  10. 10.
    Jaggi, S., Sanders, P., Chou, P.A., Effros, M., Egner, S., Jain, K., Tolhuizen, L.: Polynomial Time Algorithms for Multicast Network Code Construction. IEEE Trans. Inf. Theory 51(6), 1973–1982 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Katti, S., Rahul, H., Hu, W., Katabi, D., Médard, M., Crowcroft, J.: XORs in The Air: Practical Wireless Network Coding. In: Proc. of ACM SIGCOMM, Pisa, Italy (2006)Google Scholar
  12. 12.
    Koetter, R., Médard, M.: An Algebraic Approach to Network Coding. IEEE/ACM Trans. on Networking 11(5), 782–795 (2003)CrossRefGoogle Scholar
  13. 13.
    Laneman, J.N., Tse, D.N.C., Wornell, G.W.: Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior. IEEE Trans. Inf. Theory 50(12), 3062–3080 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Minsky, Y., Trachtenberg, A., Zippel, R.: Set Reconciliation with Nearly Optimal Communication Complexity. IEEE Trans. Inf. Theory 49(9), 2213–2218 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Sendonaris, A., Erkip, E., Aazhang, B.: User Cooperation Diversity–Part I: System Description. IEEE Trans. Commun. 51(11), 1927–1938 (2003)CrossRefGoogle Scholar
  16. 16.
    Shah, D.: Gossip algorithms. Foundations and Trends in Networking 3(1) (2007)Google Scholar
  17. 17.
    Sprintson, A., Sadeghi, P., Booker, G., El Rouayheb, S.: A Randomized Algorithm and Performance Bounds for Coded Cooperative Data Exchange. In: Proceedings of 2010 IEEE International Symposium on Information Theory (ISIT 2010), Austin, Texas, USA (June 2010)Google Scholar

Copyright information

© ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2012

Authors and Affiliations

  • Alex Sprintson
    • 1
  • Parastoo Sadeghi
    • 2
  • Graham Booker
    • 1
  • Salim El Rouayheb
    • 3
  1. 1.Texas A&M UniversityCollege StationUSA
  2. 2.Australian National UniversityCanberraAustralia
  3. 3.University of CaliforniaBerkeleyUSA

Personalised recommendations