Randomized algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Sensor Networks
Erasure Codes for Increasing the Availability of Grid Data Storage
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Decentralized erasure codes for distributed networked storage
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Differentiated Data Persistence with Priority Random Linear Codes
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
On the cover time of random geometric graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A packet-centric approach to distributed rateless coding in wireless sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Raptor packets: a packet-centric approach to distributed raptor code design
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Distributed flooding-based storage algorithms for large-scale wireless sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Rateless packet approach for data gathering wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Global design methods for raptor codes using binary and higher-order modulations
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Data preservation under spatial failures in sensor networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Maximizing growth codes utility in large-scale wireless sensor networks
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
In-network coding for resilient sensor data storage and efficient data mule collection
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
International Journal of Sensor Networks
A balance storage nodes assignment for wireless sensor networks
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
| Hi-index | 0.00 |
We consider large-scale networks with n nodes, 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 the n nodes stores one (possibly coded) packet and the original k source packets can be recovered later in a computationally simple way from any (1 + \varepsilon)k nodes for some small \varepsilon 0. We developed two distributed algorithms for solving this problem based on simple random walks and Fountain codes. Unlike all previously developed schemes, our solution is 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. In the first algorithm, all the sensors have the knowledge of n and k. In the second algorithm, each sensor estimates these parameters through the random walk dissemination. We present analysis of the communication/transmission and encoding/decoding complexity of these two algorithms, and provide extensive simulation results as well.