Computer Science – Information Theory
Scientific paper
2009-04-26
Computer Science
Information Theory
Accepted for publication in IEEE JSAC, 2010
Scientific paper
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 + \epsilon) nodes for some small \epsilon > 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.
Aly Salah A.
Kong Zhenning
Soljanin Emina
No associations
LandOfFree
Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-322006