An efficient sensor-mission assignment algorithm based on dynamic alliance and quantum genetic algorithm in wireless sensor networks

In wireless sensor networks, there are often several missions that start and finish at different time need to be handled at some time. Schemes that assign sensor resources to mission demands thus become necessary. In order to adapt to the dynamic characteristic of the missions, a management mechanism, named dynamic alliance, is used in the network to organize the nodes. Moreover, since the effective assignment of nodes to missions is a NP-complete problem, a novel quantum genetic algorithm is proposed to solve it. To the best our knowledge, this paper is the first one that researches how to realize the sensor-mission assignment by dynamic alliance and quantum genetic algorithm. Simulation results show that our approach is better than previous algorithms.