Randomized algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
Proceedings of the 6th international conference on Information processing in sensor networks
IEEE Transactions on Information Theory
A minimum transmission time encoding algorithm in multi-rate wireless networks
Computer Communications
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
Rateless packet approach for data gathering wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
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
Hi-index | 0.00 |
Storing and disseminating coded information instead of the original data can bring significant performance improvements to sensor network protocols. Such methods reduce the risk of having some data replicated at many nodes, whereas other data is very scarce. This is of particular importance for data persistence in sensor networks. While coding is generally beneficial, coding over all available packets can be detrimental to performance, since coded information might not be decodable after a network failure. In this paper we investigate the suitability of different codeword degree distributions with respect to the dynamics of the underlying wireless network and design a corresponding data management algorithm. We further propose a simple buffer management scheme for continuous data gathering. The performance of the protocols is demonstrated by means of simulation, as well as experiments with an implementation on MICAz motes.