Network Spread Coding
Chadi Khirallah, Vladimir Stanković, Lina Stanković, Dimitris Poutouris · 2008
Data streaming over wireless ad hoe and peer-to-peer networks faces the problem of high level of inference, fading, and noise, which limits the feasibility of attractive real-time multimedia applications. One classical solution to reduce those effects is to employ the spread spectrum technique, which usually leads to unacceptable increase in the required bandwidth. On the other hand, network coding has recently been proposed as an efficient method for bandwidth reduction. In this paper, we describe a complete complementary coding based scheme, termed network spread coding (NSC) that brings together spread spectrum and network coding. NSC offers robustness to inference and noise, together with reduction in the required bandwidth. We develop two practical NSC designs that show competitive or better performance with respect to traditional spread spectrum schemes at lower complexity while achieving huge bandwidth savings both in AWGN and fading channels.