Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes
Authors:
- 15 June 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 111-117
Abstract
Consider a large-scale wireless sensor network of n nodes, where a fraction k out of n generate data packets of global interest. Assuming that the individual nodes have limited storage and computational capabilities, we address the problem of how to enable ubiquitous access to the distributed data packets. Specifically, we assume that each node can store at most one data packet, and study the problem of diffusing the data so that by querying any k nodes, it is possible to retrieve all the k data packets of interest (with high probability). We introduce a class of erasure codes and show how to solve this problem efficiently in a completely distributed and robust way. Specifically we show that we can efficiently diffuse the data by "pre-routing" only O(ln n) packets per data node to randomly selected storage nodes. By using the proposed scheme, the distributed data becomes available "at the fingertips" of a potential data collector located anywhere in the network.Keywords
This publication has 21 references indexed in Scilit:
- Distributed data storage in sensor networks using decentralized erasure codes2005
- Query Processing in Sensor Networks2004
- Fractionally cascaded information in a sensor network2004
- An evaluation of multi-resolution storage for sensor networks2003
- LT codes2003
- Distributed source coding using syndromes (DISCUS): design and constructionIEEE Transactions on Information Theory, 2003
- DimensionsACM SIGCOMM Computer Communication Review, 2003
- Disk array storage system reliability2002
- GHT2002
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973