ICSI 2015: Advances in Swarm and Computational Intelligence pp 346-353 | Cite as
Research on Network Coding Optimization Using Differential Evolution Based on Simulated Annealing
Abstract
Network coding can reduce the data transmission time and improves the throughput and transmission efficiency. However, network coding technique increases the complexity and overhead of network because of extra coding operation for information from different links. Therefore, network coding optimization problem becomes more and more important. In this paper, a differential evolution algorithm based on simulated annealing (SDE) is proposed to solve the network coding optimization problem. SDE introduces individual acceptance mechanism based on simulated annealing into canonical differential evolution algorithm. SDE finds out the optimal solution and keeps the population diversity during the process of evolution and avoids falling into local optimum as far as possible. Simulation experiments show that SDE can improve the local optimum of DE and finds network coding scheme with less coding edges.
Keywords
Network coding Differential evolution Simulated annealing SDEPreview
Unable to display preview. Download preview PDF.
References
- 1.Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. on Information Theory 46, 1204–1206 (2000)CrossRefMATHMathSciNetGoogle Scholar
- 2.Deng, Z.L., Zhao, J., Wang, X.: Genetic Algorithm Solution of Network Coding Optimization. Journal of Software 20, 2269–2279 (2009)CrossRefGoogle Scholar
- 3.Yang, L., Zheng, G., Hu, X.H.: Research on Network Coding: A Survey. Journal of Computer Research and Development 45, 400–407 (2008)Google Scholar
- 4.Kim, M., Ahn, C.W., Medard, M., Effros, M.: On minimizing network coding resources: an evolutionary approach. In: Proc. Of the NetCod (2006)Google Scholar
- 5.Ye, H.T., Luo, F., Xu, Y.G.: Differential evolution for solving multi-objective optimization problems: a survey of the state-of-the-art. Control Theory & Applications 30, 922–928 (2013)Google Scholar
- 6.Li, Y.H., Mo, L., Zuo, J.: Shuffled differential evolution algorithm based on optimal scheduling of cascade hydropower stations. Computer Engineering and Application 48, 228–231 (2012)Google Scholar
- 7.Storn, R., Price, K.: Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11, 341–359 (1997)CrossRefMATHMathSciNetGoogle Scholar
- 8.Hu, Z.B., Xiong, C.W.: Study of hybrid differential evolution based on simulated annealing. Computer Engineering and Design 28, 1989–1992 (2007)Google Scholar
- 9.Kirkpatrick, S., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)CrossRefMATHMathSciNetGoogle Scholar
- 10.Cao, X.J.: Two types of network optimization problems. Master thesis of Beijing University of Posts and Telecommunications (2014)Google Scholar
- 11.Kim, M., Medard, M., Aggarwal, V.: Evolutionary approaches to minimizing network coding resources. In: Proc. of the IEEE INFOCOM 2007, pp. 1991-1999 (2007)Google Scholar
- 12.Shao, X., Wang, R.C., Huang, H.P., Sun, L.J.: Research of network coding optimization based on simulated annealing genetic algorithm. Journal of Nanjing University of Posts and Telecommunications (Natural Science) 33, 80–85 (2013)Google Scholar
- 13.Zhao, X., Lin, W., Yu, C., et al.: A new hybrid differential evolution with simulated annealing and self-adaptive immune operation. Computers & Mathematics with Applications 66, 1948–1960 (2013)CrossRefMathSciNetGoogle Scholar