Abstract

Network coding is used to improve the throughput of communication networks. In this technique, the intermediate nodes mix packets to increase the information content of each transmission. For each flow, a coding pattern is defined as a set of flows that can be coded together. Finding a suitable coding pattern is a challenge due to much complexity. In this paper, we propose an algorithm to find a suitable coding pattern in intermediate nodes by mapping this problem onto maximum-weight clique. Also, we described time complexity of our algorithm in details. Simulation results show that our proposed method can achieve better performance in terms of throughput and end-to-end delay by increasing coding opportunities.