2009/04/26 by Zhenning Kong, Kong, Zhenning, Salah A. Aly +3
Computer Science · #Caching and Content Delivery #Cooperative Communication and Network Coding #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI)
paper · pdf · doi:10.48550/arxiv.0904.4057
openalex publication_date 2009/04/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider large-scale wireless sensor networks with n nodes, out of which k are in possession, (e.g., have sensed or collected in some other way) k information packets. In the scenarios in which network nodes are vulnerable because of, for example, limited energy or a hostile environment, it is desirable to disseminate the acquired information throughout the network so that each of the n nodes stores one (possibly coded) packet so that the original k source packets can be recovered, locally and in a computationally simple way from any k(1 + ε) nodes for some small ε> 0. We develop decentralized Fountain codes based algorithms to solve this problem. Unlike all previously developed schemes, our algorithms are truly distributed, that is, nodes do not know n, k or connectivity in the network, except in their own neighborhoods, and they do not maintain any routing tables.