Name
Title | ||
|---|---|---|
Maximum Lifetime Data Regeneration for Persistent Storage in Wireless Sensor Networks |
Abstract | ||
|---|---|---|
Erasure codes have been employed to achieve persistent storage in distributed storage networks. Recent work has shown that, in addition to reduction in storage space requirements, the communication bandwidth in the data regeneration process can be further reduced by using Regenerating Codes. In this paper, we consider the issue of energy- efficient data regeneration in wireless sensor networks with the objective of minimizing energy expenditure and thereby maximizing network lifetime. We formally prove the NP-hardness of finding the optimal set of source nodes and corresponding routes for data regeneration in general networks, and devise an optimal polynomial algorithm, TROY, for acyclic networks; the cardinality of the set is pre- defined. Building upon TROY, we devise a heuristic algorithm for general networks and show, through extensive simulation studies, that this heuristic is near-optimal. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/GLOCOM.2011.6134478 | Global Telecommunications Conference |
Keywords | Field | DocType |
codes,optimisation,wireless sensor networks,NP-hardness,TROY,acyclic networks,communication bandwidth,distributed storage networks,erasure codes,heuristic algorithm,maximum lifetime data regeneration,network lifetime,optimal polynomial algorithm,persistent storage,regenerating codes,source nodes,wireless sensor networks | Heuristic,Heuristic (computer science),Computer science,Distributed data store,Cardinality,Computer network,Bandwidth (signal processing),Distributed database,Wireless sensor network,Erasure code,Distributed computing | Conference |
ISSN | ISBN | Citations |
1930-529X E-ISBN : 978-1-4244-9267-1 | 978-1-4244-9267-1 | 1 |
PageRank | References | Authors |
0.37 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Soji Omiwade | 1 | 1 | 0.37 |
| Rong Zheng | 2 | 970 | 71.12 |