We consider large-scale networks withnnodes, out of which k are in possession, (e.g.,have sensed or collected in some other way) k information packets. In the scenarios in which network nodes are vulnerable because of, for example, limited energy or a hostile environment, it is desirable to disseminate the acquired information throughout the network so that each of thennodes stores one (possibly coded) packet so that the originalksource packets can be recovered later, locally and in a computationally simple way from any k(1 +ž) nodes for some small ž >0. We developed Fountain codes based distributed algorithms solving this problem. Unlike all previously developed schemes, our algorithms are truly distributed, that is, nodes do not know n,k or connectivity in the network, except in their own neighborhoods, and they do not maintain any routing tables.January 27, 2009 DRAFT