Distributed opportunistic and diffused coding with multiple decoders in wireless mesh networks
Résumé
In wireless mesh networks for unicast traffic, opportunistic network coding are specifically introduced for improved network utilization. Some recent practical implementations like COPE, BEND, DCAR and DODE have shown the promising results over the original 802.11 conventional forwarding mechanism. For better performance, the aim of all mentioned network coding implementations is trying to find more and more coding chances in network topologies. However, they restricted the finding within a simple rule "a pair of coder and decoder". For every coded packet (the combination of natives packets of traffic flows) sent on the traffic flow, we always have one coder (which creates the coded packet) and one decoder (which retrieves the desired packet for the destination). The trivial rule limited coding chances much. In this paper, we are loosing this noose: we decouple the coding and decoding functions from strictly a pair of coder and decoder. For one coder, we can have multiple decoders on the path (up to the number of other traffic flows involved in the coding). With this, more coding chances are found, thus, improving the network performance. We extend our proposed DODE with this new idea, called Distributed Opportunistic and Diffused Coding with Multiple Decoders - DODEX. We implement DODEX system in NS-2. The simulation results show that DODEX can outperform its previous introducing systems.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...