Improved simulated annealing algorithm for broadcast routing of wireless sensor network

The simulated annealing algorithm has been introduced into the broadcast routing of wireless sensor network so as to reduce the length and energy of broadcast path. However, its new solution is generated by randomly exchanging the location of two sensor nodes of broadcast path. Though the simulated annealing algorithm is better than 2-opt algorithm, its method of generating new solution has still some deficiency, so the improved simulated annealing algorithm is presented by modifying the generating method of new solution. Two generating method of new solution are presented. One is to reverse all node location among two randomly selected nodes; the other is to randomly generating three node location, then place all sensor nodes among two larger random nodes behind the smallest node location. The simulation results show that the presented improved algorithm is superior to existing method in broadcast path choice of wireless sensor network. Copyright © 2013 Binary Information Press.