Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks

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 de...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications 2010-02, Vol.28 (2), p.261-267
Main Authors: Zhenning Kong, Aly, S., Soljanin, E.
Format: Article
Language:English
Subjects:
Algorithms
Bandwidth
Batteries
Coding
Computer networks
Decentralized
distributed storage
Fires
Fountain codes
Large-scale systems
LT codes
Monitoring
Networks
Object detection
Raptor codes
Routing
Routing (telecommunications)
Sensor phenomena and characterization
Sensors
Stores
Tables
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2010.100215