Decentralized erasure codes for distributed networked storage

Decentralized erasure codes for distributed networked storage

Decentralized erasure codes for distributed networked storage

Abstract—In this correspondence, we consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are storage nodes with limited memory and sources generating the data. We want a data collector, who can appear anywhere in the network, to query any storage nodes and be able to retrieve the data. We introduce decentralized erasure codes, which are linear codes with a specific randomized structure inspired by network coding on random bipartite graphs. We show that decentralized erasure codes are optimally sparse, and lead to reduced communication, storage and computation cost over random linear coding.

Published in: IEEE Transactions on Information Theory ( Volume: 52, Issue: 6, June 2006 )
Date of Publication: 05 June 2006
ISSN Information:
INSPEC Accession Number: 8943049
Publisher: IEEE

What we provide:

Complete Research Assistance

Technology Involved:-

MATLAB, Simulink, MATPOWER, GRIDLAB-D,OpenDSS, ETAP, GAMS

Deliverables:-  

  • Complete Code of this paper
  • Complete Code of the approach to be propose
  • A document containing complete explanation of code and research approach
  • All materials used for this research
  • Solution to all your queries related to your work

Data storage placement in sensor networks

Data storage placement in sensor networks

Data storage placement in sensor networks

Abstract:-

Data storage has become a important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces storage nodes to store the data collected from the sensors in their proximities. The storage nodes alleviate the heavy load of transmitting all the data to a central place for archiving and reduce the communicatio cost induced by the network query. This paper considers the storage node placement problem aiming to minimize the total energy cost for gathering data to the storage nodes and replying queries. We examine deterministic placement of storage odes and present optimal algorithms based on dy amic programming. Further, we give stochastic analysis for random deployment and conduct simulatio evaluatio for both deterministic and random placements of storage nodes.

Publication Date:    2006-05-22 (yyyy-mm-dd)
Sponsors:    SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM Association for Computing Machinery
Publisher: ACM New York, NY, USA ©2006
ISBN: 1-59593-368-9 Order Number: 533066 doi>10.1145/1132905.1132943
Conference    MobiHocMobile and Ad Hoc Networking and Computing


What we provide:

Complete Research Assistance

Technology Involved:-

MATLAB, Simulink, MATPOWER, GRIDLAB-D,OpenDSS, ETAP, GAMS

Deliverables:-  

  • Complete Code of this paper
  • Complete Code of the approach to be propose
  • A document containing complete explanation of code and research approach
  • All materials used for this research
  • Solution to all your queries related to your work