Performance Analysis of Distributed Raptor Codes in Wireless Sensor Networks
Journal article, 2013

In this paper, we propose a distributed network coding (DNC) scheme based on the Raptor codes for wireless sensor networks (WSNs), where a group of sensor nodes, acting as source nodes, communicate with a single sink through some other sensor nodes, serving as relay nodes, in a multi-hop fashion. At the sink, a graph-based Raptor code is formed on the fly. After receiving a sufficient number of encoded packets, the sink begins to decode. The main contributions of this paper are the derivation of a bit error rate (BER) lower bound for the LT-based DNC scheme over Rayleigh fading channels under maximum-likelihood (ML) decoding, and the derivations of upper and lower BER bounds for the proposed Raptor-based DNC scheme on the basis of the derived BER bound of LT codes.

wireless sensor networks

GRAPH

Raptor codes

PARITY-CHECK CODES

RATELESS

Quasi-static Rayleigh fading channel

upper and lower bounds

STORAGE

Distributed network coding

Author

J. Yue

Xidian University

Zihuai Lin

The University of Sydney

B. Vucetic

The University of Sydney

G. Q. Mao

The University of Sydney

Tor Aulin

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

IEEE Transactions on Communications

0090-6778 (ISSN)

Vol. 61 10 4357-4368

Subject Categories

Electrical Engineering, Electronic Engineering, Information Engineering

DOI

10.1109/tcomm.2013.090513.120913

More information

Created

10/7/2017