Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes

Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the scenario where sinks are not present in large-scale sensor networks, and unreliable sensors have to collectively resort to storing sensed data over time on themselves. At a time of convenience, such cached data from a small subset of live sensors may be collected by a centralized (possibly mobile) collector. In this paper, we propose a decentralized algorithm using fountain codes to guarantee the persistence and reliability of cached data on unreliable sensors. With fountain codes, the collector is able to recover all data as long as a sufficient number of sensors are alive. We use random walks to disseminate data from a sensor to a random subset of sensors in the network. Our algorithms take advantage of the low decoding complexity of fountain codes, as well as the scalability of the dissemination process via...

• Type: Conference
• Year: 2007
• Where: INFOCOM
• Authors: Yunfeng Lin, Ben Liang, Baochun Li
• Keywords: Communications, Fountain Code, INFOCOM 2007, Random Walks, Sensors