Distributed flooding-based storage algorithms for large-scale wireless sensor networks

IEEE International Conference on Communications

Volumn , Issue , 2009, Pages

  Aly, Salah A ^a   Youssef, Moustafa ^b   Darwish, Hager S ^a   Zidan, Mahmoud ^c  

^a Cairo University   (Egypt)

^b NILE UNIVERSITY   (Egypt)

^c Ain Shams University   (Egypt)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS AND SIMULATION; DISTRIBUTED STORAGE; ENCODING AND DECODING; ITS DATA; LARGE-SCALE WIRELESS SENSOR NETWORKS; MIXING TIME; NETWORK GRAPH; THEORETICAL RESULT;

ALGORITHMS; ANALOG DIFFERENTIAL ANALYZERS; ENCODING (SYMBOLS); LARGE SCALE SYSTEMS; ROUTING PROTOCOLS; SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 70449476153     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2009.5198919     Document Type: Conference Paper

References (10)

1. S. A. Aly, Z. Kong, and E. Soljanin. Fountain codes based distributed storage algorithms for wireless sensor networks. In Proc. 2008 IEEE/ACM Information Processing of Sensor Networks (IPSN08), St. Louis, Missouri, USA, pp 171-182, April 2008.
2. S. A. Aly, Z. Kong, and E. Soljanin. Raptor codes based distributed storage algorithms for wireless sensor networks. In Proc. 2008 IEEE International Symposium on Information Theory (ISIT08), Toronto, Canada, pp 2051-2055, July, 2008.
3. A. G. Dimakis, P. B. Godfrey, M. Wainwright, and K. Ramchandran. Network coding for peer-to-peer storage. In Proc. of Infocom, 2007.
4. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran. Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes. In Proc. of 4th IEEE Symposium on Information Processing in Sensor Networks (IPSN '05), Los Angeles, CA, USA, April, 2005.
5. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran. Distributed fountain codes for networked storage. Acoustics, Speech and Signal Processing, ICASSP 2006, may 2006.
6. A. Kamra, V. Misra, J. Feldman, and D. Rubenstein. Growth codes: Maximizing sensor network data persistence. In Proc. of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, Sigcomm06, pages 255-266, Pisa, Italy, 2006.
7. Y. Lin, B. Liang, and B. Li. Data persistence in large-scale sensor networks with decentralized fountain codes. In Proc. of the 26th IEEE INFOCOM07, Anchorage, Alaska, May 6-12, 2007.
8. M. Luby. LT codes. In Proc. 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, 2002.
9. M. Penrose. Random Geometric Graphs. Oxford University Press, New York, 2003.
10. I. Stojmenovic. Handbook of sensor networks, algorithms and architechtrues. Wiley series on parallel and distributed computing, 2005.