A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Fastest Mixing Markov Chain on a Graph
SIAM Review
Hole detection or: "how much geometry hides in connectivity?"
Proceedings of the twenty-second annual symposium on Computational geometry
Connectivity in wireless ad-hoc networks with a log-normal radio model
Mobile Networks and Applications
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
Uniform Data Sampling from a Peer-to-Peer Network
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Raptor packets: a packet-centric approach to distributed raptor code design
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Decentralized coding algorithms for distributed storage in wireless sensor networks
IEEE Journal on Selected Areas in Communications
Modern Coding Theory
Contaminated areas monitoring via distributed rateless coding with constrained data gathering
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Rateless packet approach for data gathering wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In this paper we present a packet-centric approach for distributed coding in decentralized wireless ad hoc networks, for applications in distributed data storage, data persistence and efficient data gathering. We study the setting where each of N network nodes generates an information packet and the goal is to efficiently encode information packets and disseminate produced encoded packets across the network in such fashion that gathering of any subset of slightly more than N encoded packets allows for retrieval of the original information. The process of distributed encoding is performed using packets that randomly walk over the network and sample information packets from network nodes, producing the encoded packets in a simple, elegant, fully decentralized and stateless way. The proposed scheme maintains properties of centralized codes in terms of performance parameters, offering at the same time advantage of robustness to node failures and changes in network topology. We specialize the proposed scheme for several important classes of low-complexity encodable/decodable sparse-graph codes - LDGM, LDPC (IRA), LT, and Raptor codes, evaluating its performance via simulation for various data-gathering scenarios.