Decentralized coding algorithm in Data Centric Storage for wireless sensor networks
Khandakar Entenam Unayes Ahmed, Mark A Gregory · 2013
For robust data recovery in catastrophic scenarios in wireless sensor networks, obtaining reliable storage over unreliable nodes is desirable. A distributed Data Centric Storage (DCS) system provides reliable access to data through redundancy spread over individually unreliable nodes. However, instead of using simple replication, it is possible to achieve a similar level of reliability with less redundancy by utilizing erasure encoding. In this paper, a Decentralized Distributed Erasure Coding (DDEC) algorithm is implemented in a Disk Based Data Centric Storage (DBDCS) architecture dividing the rectangular field into a matrix of storage cells (referred to as sectors) where row and column represent track (Ti) and sector (Sj) respectively. The acquired information is encoded into n fragments and disseminated across n nodes inside a sector so that the original source packets can be recovered from any k surviving nodes. The performance of DDEC was analyzed and found to provide an improvement over comparable approaches.