A decentralized approach with fewer coding nodes for network coding multicast
Xiao Sun · 2010
Previous works on network coding have mainly focused on the throughput and the cost of bandwidth, but few cares about saving resources used to code. In this paper we present a decentralized algorithm to construct network coding solutions, which reduces the number of coding nodes. We showed the dynamic topology greatly affected the network coding solutions, which may improve coding solution or reduce the coding nodes and we also analyzed some useful behaviors in feasible network coding solutions. By the nodes independently attempting those behaviors in dynamic topology, we introduce a fully decentralized algorithm of constructing coding solution. By simulation we found our approach has excellent performance, which achieves the approximate throughput compared to completely Randomized Network Coding, but only employing 10%–20% of nodes to code.