Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
