Decentralized coding algorithms for distributed storage in wireless sensor networks

Authors:
Zhenning Kong;Salah A. Aly;Emina Soljanin
Affiliations:
Department of Electrical Engineering, Yale University, New Haven, CT;Department of Computer Science, Texas A&M University, College Station, TX;Bell Laboratories, Alcatel-Lucent, Murray Hill, NJ
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2010

Citing 12
Cited 5

Randomized algorithms

Randomized algorithms
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Erasure Coding Vs. Replication: A Quantitative Comparison

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Wireless sensor networks

Wireless 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
Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
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
STAR: an efficient coding scheme for correcting triple storage node failures

FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
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

Doped fountain coding for minimum delay data collection in circular networks

IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Reliable transport and storage protocol with fountain codes for underwater acoustic sensor networks

Proceedings of the Fifth ACM International Workshop on UnderWater Networks
A novel network coding scheme for data collection in WSNs with a mobile BS

DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Distributed data collection and storage algorithms for collaborative learning vision sensor devices with applications to pilgrimage

International Journal of Sensor Networks
Packet-centric approach to distributed sparse-graph coding in wireless ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.07

Visualization

Abstract

We consider large-scale wireless sensor 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 so that the original k source packets can be recovered, locally and in a computationally simple way from any k(1 + Ɛ) nodes for some small Ɛ 0. We develop decentralized Fountain codes based algorithms to solve this problem. Unlike all previously developed schemes, our algorithms are 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.