Randomized algorithms
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
Multi-hop wireless sensor networks with mobile sink
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Hierarchical spatial gossip for multi-resolution representations in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Sparse data aggregation in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Differentiated Data Persistence with Priority Random Linear Codes
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Foundations and Trends® in Networking
Multiple controlled mobile elements (data mules) for data collection in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
In a sensor network of n nodes in which k of them have sensed interesting data, we perform in-network erasure coding such that each node stores a linear combination of all the network data with random coefficients. This scheme greatly improves data resilience to node failures: as long as there are k nodes that survive an attack, all the data produced in the sensor network can be recovered with high probability. The in-network coding storage scheme also improves data collection rate by mobile mules and allows for easy scheduling of data mules. We show that using spatial gossip we can compute the erasure codes for the entire network with a total of near linear message transmissions, thus improving substantially the communication cost in previous scheme [5]. We also extend the scheme to allow for online data reconstruction, by interleaving spatial gossip steps with mule collection. We present simulation results to demonstrate the performance improvement using erasure codes.