Date Added: Jun 2012
In today's practical networks, end-to-end information delivery is performed by routing. Network coding generalizes routing by allowing a node to generate output data by mixing (i.e., computing certain functions of) its received data. Network coding techniques are used to find the minimum cost in given network. In wire line network, solving for the optimal coding subgraphs in network coding is equivalent to finding the optimal routing scheme in a multi-commodity flow problem. Multicast is an important factor for the communication in wireless network. This problem is also known as NP-complete. This paper focuses on the solution for the above problem and provides the analytical framework as well as distributed algorithm in multicast session.