Rateless packet approach for data gathering wireless sensor networks

Authors:
Dejan Vukobratović;Čedomir Stefanović;Vladimir Cmojević;Francesco Chiti;Romano Fantacci
Affiliations:
Department of Power, Electronics and Communication Engineering, University of Novi Sad, Novi Sad, Serbia;Department of Power, Electronics and Communication Engineering, University of Novi Sad, Novi Sad, Serbia;Department of Power, Electronics and Communication Engineering, University of Novi Sad, Novi Sad, Serbia;Department of Electronics and Communication Engineering, University of Florence, Florence, Italy;Department of Electronics and Communication Engineering, University of Florence, Florence, Italy
Venue:
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Year:
2010

Citing 15
Cited 2

Approximate counting, uniform generation and rapidly mixing Markov chains

Information and Computation
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
Analysis of random processes via And-Or tree evaluation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
LT Codes

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
Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
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
Energy-scalable algorithms and protocols for wireless microsensor networks

ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06
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
Network information flow

IEEE Transactions on Information Theory
Rateless Codes With Unequal Error Protection Property

IEEE Transactions on Information Theory

Contaminated areas monitoring via distributed rateless coding with constrained data gathering

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Packet-centric approach to distributed sparse-graph coding in wireless ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 channels with packet erasures, which motivates their application in distributed network scenarios such as WSN. Recently proposed distributed rateless coding techniques for WSN are node-centric, i.e., collecting sufficient number of different sensor data packets and performing rateless encoding is the task of sensor nodes. In the proposed packet-centric approach, this task is assigned to encoded packets called rateless packets. While randomly moving through the network, rateless packets collect and encode into their content required number of uniformly sampled sensor data packets, completing 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 comparison with the performance of centralized rateless codes are demonstrated by simulation results.