2012/01/21 by Saber Jafarizadeh, Abbas Jamalipour, Jafarizadeh, Saber +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Cooperative Communication and Network Coding #DNA and Biological Computing #Databases (cs.DB) #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.DB #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1201.4479
9 pages, 4 figures, 2 tables
arxiv created 2012/01/21 · openalex publication_date 2012/01/21 · arxiv updated 2012/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper proposes an algorithm for increasing data persistency in large-scale sensor networks. In the scenario considered here, k out of n nodes sense the phenomenon and produced ? information packets. Due to usually hazardous environment and limited resources, e.g. energy, sensors in the network are vulnerable. Also due to the large size of the network, gathering information from a few central hopes is not feasible. Flooding is not a desired option either due to limited memory of each node. Therefore the best approach to increase data persistency is propagating data throughout the network by random walks. The algorithm proposed here is based on distributed LT (Luby Transform) codes and it benefits from the low complexity of encoding and decoding of LT codes. In previous algorithms the essential global information (e.g., n and k) are estimated based on graph statistics, which requires excessive transmissions. In our proposed algorithm, these values are obtained without additional transmissions. Also the mixing time of random walk is enhanced by proposing a new scheme for generating the probabilistic forwarding table of random walk. The proposed method uses only local information and it is scalable to any network topology. By simulations the improved performance of developed algorithm compared to previous ones has been verified.