Find out how to access previewonly content
Network Coding for Distributed Storage in Wireless Networks
 Alexandros G. Dimakis,
 Kannan Ramchandran
 … show all 2 hide
We will address some of the problems related to storing information in multiple storage devices that are individually unreliable, and connected in a network. As an application consider a sensor network deployment in a remote and inaccessible environment where sensor nodes are taking measurements (possibly after processing) and storing data in the network, over long time periods. A data collector may appear at any location in the network and try to retrieve as much useful data as possible. Another scenario is a sensor network deployed in a timecritical or emergency situation (e.g. fire, flood, earthquake).
 S. Acedanski, S. Deb, M. Médard, and R. Koetter. How good is random linear coding based distributed networked storage. In NetCod, 2005.
 Ahlswede, R, Cai, N, Li, SYR, Yeung, RW (2000) Network information flow. IEEE Trans. on Information Theory 46: pp. 12041216 CrossRef
 D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. in preparation, 2005. (chapters available online), 2005.
 Alon, N, Spencer, J (2000) The Probabilistic Method. Wiley Interscience, New York CrossRef
 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.
 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.
 S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Mixing times for random walks on geometric random graphs. In Proceedings of SIAM ANALCO, 2005.
 C. Daskalakis, A.G. Dimakis, R. M. Karp, and M. J. Wainwright. Probabilistic analysis of linear programming decoding. In ACMSIAM Symposium on Discrete Algorithms (SODA), January 2007.
 A.G. Dimakis, P.B. Godfrey, M.J. Wainwright, and K. Ramchandran. Network coding for distributed storage systems. In Proceedings of IEEE Infocom, 2007.
 A.G. Dimakis, V. Prabhakaran, and K. Ramchandran. Ubiquitous Acess to Distributed Data in LargeScale Sensor Networks through Decentralized Erasure Codes. In IEEE/ACM Int. Symposium on Information Processing in Sensor Networks (IPSN), April 2005.
 A.G. Dimakis, V. Prabhakaran, and K. Ramchandran. Decentralized erasure codes for distributed networked storage. In IEEE Transactions on Information Theory, June 2006.
 A.G. Dimakis, V. Prabhakaran, and K. Ramchandran. Distributed foun tain codes for networked storage. In Proceedings of IEEE ICASSP, 2006.
 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.
 Donoho, D (2006) Compressed sensing. IEEE Trans. Info Theory 52: pp. 12891306 CrossRef
 C. Fragouli, J.Y. Le Boudec, and J. Widmer. Network coding: an instant primer. ACM SIGCOMM Computer Comm. Review, 2006.
 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.
 Gupta, P, Kumar, PR (2000) The capacity of wireless networks. IEEE Transactions on Information Theory 46: pp. 388404 CrossRef
 T. Ho, M. Médard, 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.
 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.
 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.
 A. Jiang. Network coding for joint storage and transmission with minimum cost. In International Symposium on Information Theory (ISIT), July 2006.
 A. Kamra, J. Feldman, V. Misra, and D. Rubenstein. Growth codes: Maximizing sensor network data persistence. Proc. of ACM SIGCOMM, 2006.
 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.
 R. Koetter and M. Médard. An algebraic approach to network coding. Transactions on Networking, October 2003.
 Li, SYR, Yeung, RW, Cai, N (2003) Linear network coding. IEEE Trans. on Information Theory 49: pp. 371381 CrossRef
 Y. Lin, B. Liang, and B. Li. Data persistence in largescale sensor net works with decentralized fountain codes. In Proceedings of IEEE Infocom, 2007.
 M. Luby. LT codes. Proc. IEEE Foundations of Computer Science (FOCS), 2002.
 Luby, M, Mitzenmacher, M, Shokrollahi, MA, Spielman, D (2001) Im proved lowdensity parity check codes using irregular graphs. IEEE Trans. Info. Theory 47: pp. 585598 CrossRef
 D.S. Lun, N. Ratnakar, M. Médard, R. Koetter, D.R. Karger, T. Ho, E. Ahmed, and F. Zhao. Minimumcost multicast over coded packet networks. IEEE Transactions on Information Theory, June 2006.
 S. Madden and J. Gehrke. Query processing in sensor networks. In Pervasive Computing, 3(1), 2004.
 Motwani, R, Raghavan, P (1995) Randomized Algorithms. Cambridge University Press, Cambridge UK
 D. Petrović, K. Ramchandran, and J. Rabaey. Overcoming untuned ra dios in wireless networks with network coding. IEEE Transactions on Information Theory, June 2006.
 Pradhan, SS, Ramchandran, K (2003) Distributed source coding using syn dromes (DISCUS): Design and construction. IEEE Trans. Info. Theory 49: pp. 626643 CrossRef
 M. Rabbat, J. Haupt, A. Singh, and R. Nowak. Decentralized compres sion and predistribution via randomized gossiping. In IEEE/ACM Int. Symposium on Information Processing in Sensor Networks (IPSN), 2006.
 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.
 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.
 I.S. Reed and G. Solomon. Polynomial codes over certain finite fields. In Journal of the SIAM, 1960.
 Sujay Sanghavi. Intermediate performance of rateless codes. Information Theory and Applications (ITA), 2007.
 O. Savas, M. Alanyali, and V. Saligrama. Randomized sequential algo rithms for data aggregation in wireless sensor networks. In Conference on Information Sciences and Systems (CISS), 2006.
 A. Shokrollahi. Raptor codes. IEEE Trans. on Information Theory, June 2006.
 W. Wang, M. Garofalakis, and K. Ramchandran. Distributed sparse ran dom projections for refinable approximation. In IEEE/ACM Int. Symposium on Information Processing in Sensor Networks (IPSN), 2007.
 Hakim Weatherspoon and John D. Kubiatowicz. Erasure coding vs. replication: a quantitiative comparison. In Proc. IPTPS, 2002.
 D. H. Wiedemann. Solving sparse linear equations over finite fields. In IEEE Transactions on Information Theory, 1986.
 C. Wu and B. Li. Echelon: Peertopeer network diagnosis with network coding. Fourteenth IEEE International Workshop on Quality of Service (IWQoS), 2006.
 Y. Wu. On constructive multisource network coding. In International Symposium on Information Theory (ISIT), July 2006.
 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.
 Title
 Network Coding for Distributed Storage in Wireless Networks
 Book Title
 Networked Sensing Information and Control
 Book Part
 2
 Pages
 pp 115134
 Copyright
 2008
 DOI
 10.1007/9780387688459_5
 Print ISBN
 9780387688435
 Online ISBN
 9780387688459
 Publisher
 Springer US
 Copyright Holder
 SpringerVerlag US
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Venkatesh Saligrama ^{(1)}
 Editor Affiliations

 1. Boston University
 Authors

 Alexandros G. Dimakis ^{(2)}
 Kannan Ramchandran ^{(2)}
 Author Affiliations

 2. Department of Electrical Engineering and Computer Science, University of California, 94704, Berkeley, CA, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.