Abstract
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.
The work of Alex Sprintson was supported by NSF grant CNS-0954153. The work of Parastoo Sadeghi was supported under Australian Research Councils Discovery Projects funding scheme (project no. DP0984950).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network Information Flow. IEEE Trans. Inf. Theory 46(4), 1204–1216 (2000)
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)
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)
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)
Blasiak, A., Kleinberg, R., Lubetzky, E.: Index Coding via Linear Programming. IEEE Trans. Inf. Theory (April 2010) (submitted for publication), http://arxiv.org/abs/1004.1379
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)
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)
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)
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)
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)
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)
Koetter, R., Médard, M.: An Algebraic Approach to Network Coding. IEEE/ACM Trans. on Networking 11(5), 782–795 (2003)
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)
Minsky, Y., Trachtenberg, A., Zippel, R.: Set Reconciliation with Nearly Optimal Communication Complexity. IEEE Trans. Inf. Theory 49(9), 2213–2218 (2003)
Sendonaris, A., Erkip, E., Aazhang, B.: User Cooperation Diversity–Part I: System Description. IEEE Trans. Commun. 51(11), 1927–1938 (2003)
Shah, D.: Gossip algorithms. Foundations and Trends in Networking 3(1) (2007)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Sprintson, A., Sadeghi, P., Booker, G., El Rouayheb, S. (2012). Deterministic Algorithm for Coded Cooperative Data Exchange. In: Zhang, X., Qiao, D. (eds) Quality, Reliability, Security and Robustness in Heterogeneous Networks. QShine 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29222-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-29222-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29221-7
Online ISBN: 978-3-642-29222-4
eBook Packages: Computer ScienceComputer Science (R0)