Decentralized coding algorithms for distributed storage in wireless sensor networks

IEEE Journal on Selected Areas in Communications

Volumn 28, Issue 2, 2010, Pages 261-267

  Kong, Zhenning ^a   Aly, Salah A ^b   Soljanin, Emina ^c  

^a Yale University   (United States)

^b Texas A and M University   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Distributed storage; Fountain codes; LT codes; Raptor codes; Wireless sensor networks

Indexed keywords

DISTRIBUTED STORAGE; FOUNTAIN CODES; LT CODES; RAPTOR CODES; WIRELESS SENSOR;

ALGORITHMS; CODES (SYMBOLS); FOUNTAINS; SENSORS;

SENSOR NODES;

EID: 78650078536     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2010.100215     Document Type: Article

References (25)

1. C. Raghavendra, K. Sivalingam, and T. Znati, Wireless Sensor Networks. Norwell, MA, USA: Kluwer Academic Publishers, 2004.
2. H. Weatherspoon and J. D. Kubiatowics, "Erasure coding vs. replication: a quantitive comparision," in Proc. 1st International Workshop on Peerto-Peer Systems (IPTPS '02), Cambridge, MA, USA, Springer LNCS, pp. 328-337, March 78 2002.
3. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes," in Proc. 4th IEEE Symposium on Information Processing in Sensor Networks (IPSN '05), Los Angeles, CA, USA, pp. 111-117, April 2005. (Pubitemid 43841222)
4. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Decentralized erasure codes for distributed networked storage," IEEE Trans. Inf. Theory, vol. 52, pp. 2809-2816, 2006. (Pubitemid 43898929)
5. M. Pitkanen, R. Moussa, M. Swany, and T. Niemi, "Erasure codes for increasing the availability of grid data storage," in Proc. Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW), pp. 185-185, 2006.
6. C. Huang and L. Xu, "Star: An efficient coding scheme for correcting triple storage node failures," in Proc. 4th Usenix Conference on File and Storage Technol. (FAST'05), San Francisco, USA, pp. 15-15, 2005.
7. J. S. Plank, "Erasure codes for storage applications," in (Tutorial) Proc. 4th Usenix Conference on File and Storage Technol. (FAST'05), San Francisco, USA, 2005.
8. J. S. Plank and M. G. Thomason, "An exploration of non-asymptotic low-density, parity check erasure codes for wide-area storage applications," Parallel Processing Letters, vol. 17, pp. 103-123, March 2007. (Pubitemid 46573929)
9. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Distributed fountain codes for networked storage," in Proc. 31st IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'06), Toulouse, France, May, 2006.
10. Y. Lin, B. Liang, and B. Li, "Data persistence in large-scale sensor networks with decentralized fountain codes," in Proc. IEEE INFOCOM'07, Anchorage, AK, USA, pp. 1658-1666, May, 2007. (Pubitemid 47334394)
11. A. Kamra, V. Misra, J. Feldman, and D. Rubenstein, "Growth codes: Maximizing sensor network data persistence," in Proc. ACM Sigcom'06, Pisa, Italy, September, 2006.
12. Y. Lin, B. Li, , and B. Liang, "Differentiated data persistence with priority random linear code," in Proc. 27th Int. Conf. on Distributed Computing Systems (ICDCS'07), Toronto, Canada, June, 2007.
13. A. Jiang, "Network coding for joint storage and transmission with minimum cost," in Proc. IEEE International Symposium on Information Theory (ISIT '06), Seattle, WA, USA, pp. 1359-1363, July, 2006. (Pubitemid 351244319)
14. D. Wang, Q. Zhang, and J. Liu, "Partial network coding: thoery and application for continuous sensor data collection," in Proc. IEEE 14th international workshop on quality of service (IWQoS), 2006.
15. S. Acedanski, S. Deb, M. Médard, and R. Koetter, "How good is random linear coding based distributed networked storage?," in Proc. 2nd Workshop on Network Coding (NetCod'05), Pisa, Italy, April, 2005.
16. A. G. Dimakis, P. B. Godfrey, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," in Proc. IEEE INFOCOM' 07, Anchorage, AK, USA, pp. 2000-2008, May, 2007. (Pubitemid 47334432)
17. D. Munaretto, J. Widmer, M. Rossi, and M. Zorzi, "Network coding strategies for data persistence in static and mobile sensor networks," in Proc. Int. Workshop on Wireless Networks: Communication, Cooperation and Competition (WCN3'07), Limassol, Cyprus, April 2007.
18. E. N. Gilbert, "Random plane networks," J. Soc. Indust. Appl. Math., vol. 9, pp. 533-543, 1961.
19. M. Penrose, Random Geometric Graphs. New York: Oxford University Press, 2003.
20. M. Luby, "LT codes," in 43rd Symposium on Foundations of Computer Science (FOCS 2002), Vancouver, Canada, Nov., 2002.
21. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, pp. 2551-2567, 2006. (Pubitemid 43898908)
22. D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs. http://statwww.berkeley.edu/users/aldous/RWG/book.html.
23. S. Ross, Stochastic Processes. New York: Wiley, second ed., 1995.
24. C. Avin and G. Ercal, "On the cover time of random geometric graphs," in Proc. 32nd International Colloquium of Automata, Languages and Programming (ICALP'05), Lisboa, Portugal, pp. 677-689, July, 2005. (Pubitemid 41436138)
25. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.