Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigate the problem of constructing fountain codes for distributed storage in sensor networks. Specifically,  assume that there are n storage nodes with limited memory and k < n data nodes generating the data by sensing the environment.  want a data collector who can appear anywhere in the network, to query any k + epsi storage nodes and be able to retrieve almost all the data packets.  demonstrate how it is possible to solve this problem by using a specific kind of fountain code that requires only linear communication and decoding complexity. Further, for a grid topology,  propose a randomized algorithm that constructs the fountain code over a network using only geographical knowledge and local decisions. A key step in the analysis of our algorithm is a novel result concerning random walks on finite grids with traps
['Alexandros G. Dimakis', 'Vinod M. Prabhakaran', 'Kannan Ramchandran']
I am writing a research paper on a idea Distributed Fountain Codes for Networked Storage
[{"from": "human", "value": "I am writing a research paper on a idea Distributed Fountain Codes for Networked Storage"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigate the problem of constructing fountain codes for distributed storage in sensor networks. Specifically,  assume that there are n storage nodes with limited memory and k < n data nodes generating the data by sensing the environment.  want a data collector who can appear anywhere in the network, to query any k + epsi storage nodes and be able to retrieve almost all the data packets.  demonstrate how it is possible to solve this problem by using a specific kind of fountain code that requires only linear communication and decoding complexity. Further, for a grid topology,  propose a randomized algorithm that constructs the fountain code over a network using only geographical knowledge and local decisions. A key step in the analysis of our algorithm is a novel result concerning random walks on finite grids with traps"}]