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
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Resilient coding algorithms for sensor network data persistence
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Hi-index | 0.00 |
In this paper, we propose a novel approach for data gathering in wireless sensor networks (WSN) based on distributed rateless codes. Rateless codes are an efficient, low-complexity solution for coded data transmission over erasure channels, which motivates their application in distributed network scenarios such as WSN. Recently proposed distributed rateless coding techniques for WSN are node-centric, i.e., the task of collecting sufficient number of different sensor data packets and performing rateless encoding is responsibility of sensor nodes. In the proposed packet-centric approach, this task is assigned to encoded data packets called rateless packets. While randomly moving through the network, rateless packets collect required number of uniformly sampled sensor data packets, finishing their paths in randomly selected network nodes. Using this approach, any degree distribution of rateless codes can be exactly obtained. The problem of uniform combining of sensor data into rateless packets, and uniform dispersion throughout the network is addressed. The efficiency of the proposed scheme and its comparison with the performance of centralized rateless codes are demonstrated by simulation results.