Network coding for distributed storage in wireless networks

Networked Sensing Information and Control

Volumn , Issue , 2008, Pages 115-134

  Dimakis, Alexandros G ^a   Ramchandran, Kannan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78649377956     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-0-387-68845-9_5     Document Type: Chapter

References (46)

1. S. Acedanski, S. Deb, M. Ḿedard, and R. Koetter. How good is random linear coding based distributed networked storage. In NetCod, 2005.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Trans. on Information Theory, 46:1204-1216, 2000.
3. D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. in preparation, 2005. (chapters available online), 2005.
4. N. Alon and J. Spencer. The Probabilistic Method. Wiley Interscience, New York, 2000.
5. B.A. Bash, J.W. Byers, and J. Considine. Approximately uniform random sampling in sensor networks. In Proc. of the 1st Workshop on Data Management in Sensor Networks (DMSN '04), August 2004.
6. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis and applications. In Proceedings of the 24th Conference of the IEEE Communications Society (INFOCOM 2005), 2005.
7. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Mixing times for random walks on geometric random graphs. In Proceedings of SIAM ANALCO, 2005.
8. C. Daskalakis, A.G. Dimakis, R. M. Karp, and M. J. Wainwright. Probabilistic analysis of linear programming decoding. In ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2007.
9. A.G. Dimakis, P.B. Godfrey, M.J. Wainwright, and K. Ramchandran. Network coding for distributed storage systems. In Proceedings of IEEE Infocom, 2007.
10. A.G. Dimakis, V. Prabhakaran, and K. Ramchandran. Ubiquitous Acess to Distributed Data in Large-Scale Sensor Networks through Decentralized Erasure Codes. In IEEE/ACM Int. Symposium on Information Processing in Sensor Networks (IPSN), April 2005.
11. A.G. Dimakis, V. Prabhakaran, and K. Ramchandran. Decentralized erasure codes for distributed networked storage. In IEEE Transactions on Information Theory, June 2006.
12. A.G. Dimakis, V. Prabhakaran, and K. Ramchandran. Distributed fountain codes for networked storage. In Proceedings of IEEE ICASSP, 2006.
13. A.G. Dimakis, A.D. Sarwate, and M.J. Wainwright. Geographic gossip: Efficient aggregation for sensor networks. In IEEE/ACM Int. Symposium on Information Processing in Sensor Networks (IPSN), 2006.
14. D. Donoho. Compressed sensing. IEEE Trans. Info Theory, 52(4):1289-1306, April 2006.
15. C. Fragouli, J.Y. Le Boudec, and J. Widmer. Network coding: An instant primer. ACM SIGCOMM Computer Comm. Review, 2006.
16. D. Ganesan, D. Estrin, and J. Heidemann. Dimensions: Why do we need a new data handling architecture for sensor networks? In Proceedings of ACM Computer Communication Rev., Volume 33, Number 1, 2003.
17. P. Gupta and P.R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388-404, March 2000.
18. T. Ho, M. Ḿedard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong. A random linear network coding approach to multicast. IEEE Transactions on Information Theory, October 2006.
19. C. Huang, M. Chen, and J. Li. Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems. In IEEE International Symposium on Network Computing and Applications (NCA 2007), July 2007.
20. J.Gao, L.J. Guibas, J. Hershberger, and L. Zhang. Fractionally cascaded information in a sensor network. In IEEE/ACM Int. Symposium on Information Processing in Sensor Networks (IPSN), 2004.
21. A. Jiang. Network coding for joint storage and transmission with minimum cost. In International Symposium on Information Theory (ISIT), July 2006.
22. A. Kamra, J. Feldman, V. Misra, and D. Rubenstein. Growth codes: Maximizing sensor network data persistence. Proc. of ACM SIGCOMM, 2006.
23. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and Jon Crowcroft. XORs in the air: Practical wireless network coding. Proc. of ACM SIGCOMM, 2006.
24. R. Koetter and M. Ḿedard. An algebraic approach to network coding. Transactions on Networking, October 2003.
25. S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Trans. on Information Theory, 49:371-381, February 2003.
26. Y. Lin, B. Liang, and B. Li. Data persistence in large-scale sensor networks with decentralized fountain codes. In Proceedings of IEEE Infocom, 2007.
27. M. Luby. LT codes. Proc. IEEE Foundations of Computer Science (FOCS), 2002.
28. M. Luby, M. Mitzenmacher, M.A. Shokrollahi, and D. Spielman. Improved low-density parity check codes using irregular graphs. IEEE Trans. Info. Theory, 47:585-598, February 2001.
29. D.S. Lun, N. Ratnakar, M. Ḿedard, R. Koetter, D.R. Karger, T. Ho, E. Ahmed, and F. Zhao. Minimum-cost multicast over coded packet networks. IEEE Transactions on Information Theory, June 2006.
30. S. Madden and J. Gehrke. Query processing in sensor networks. In Pervasive Computing, 3(1), 2004.
31. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, UK, 1995.
32. D. Petrovíc, K. Ramchandran, and J. Rabaey. Overcoming untuned radios in wireless networks with network coding. IEEE Transactions on Information Theory, June 2006.
33. S. S. Pradhan and K. Ramchandran. Distributed source coding using syndromes (DISCUS): Design and construction. IEEE Trans. Info. Theory, 49(3):626-643, 2003.
34. M. Rabbat, J. Haupt, A. Singh, and R. Nowak. Decentralized compression and predistribution via randomized gossiping. In IEEE/ACM Int. Symposium on Information Processing in Sensor Networks (IPSN), 2006.
35. A. Ramamoorthy, K. Jain, P.A. Chou, and M. Effros. Separating distributed source coding from network coding. In 42nd Allerton Conference on Communication, Control and Computing, 2004.
36. S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker. GHT: A Geographic Hash Table for Data Centric Storage. In Proceedings of the 1st ACM int. workshop on Wireless sensor networks and applications, 2002.
37. I.S. Reed and G. Solomon. Polynomial codes over certain finite fields. In Journal of the SIAM, 1960.
38. Sujay Sanghavi. Intermediate performance of rateless codes. Information Theory and Applications (ITA), 2007.
39. O. Savas, M. Alanyali, and V. Saligrama. Randomized sequential algorithms for data aggregation in wireless sensor networks. In Conference on Information Sciences and Systems (CISS), 2006.
40. A. Shokrollahi. Raptor codes. IEEE Trans. on Information Theory, June 2006.
41. W. Wang, M. Garofalakis, and K. Ramchandran. Distributed sparse random projections for refinable approximation. In IEEE/ACM Int. Symposium on Information Processing in Sensor Networks (IPSN), 2007.
42. Hakim Weatherspoon and John D. Kubiatowicz. Erasure coding vs. replication: A quantitiative comparison. In Proc. IPTPS, 2002.
43. D. H. Wiedemann. Solving sparse linear equations over finite fields. In IEEE Transactions on Information Theory, 1986.
44. C. Wu and B. Li. Echelon: Peer-to-peer network diagnosis with network coding. Fourteenth IEEE International Workshop on Quality of Service (IWQoS), 2006.
45. Y. Wu. On constructive multi-source network coding. In International Symposium on Information Theory (ISIT), July 2006.
46. Y. Wu, V. Stankovic, Z. Xiong, and S.-Y. Kung. on practical design for joint distributed source and network coding. In Proc. 1st Workshop on Network Coding, Theory, and Applications (NetCod), April 2005.