Ant-Like Game Routing Algorithm for Wireless Multimedia Sensor Networks

The QoS routing problem of wireless multimedia sensor networks has great challenging. A notion using routing game and ant colony algorithm to solve this problem is proposed in this paper. A mixed strategy routing game model is proposed too, and proves the routing game has Nash equilibrium. In the routing game, we used the probabilities which are calculated on the basis of the pheromone trails left by previous ants to define payoffs of game players, and we change the ant colony algorithm with routing game. In our ant-like routing algorithm, all ant select next hop with the probabilities of mixed strategy Nash equilibrium of routing game except the first generation ants. Obviously, this algorithm is convergent, and because the node selected by routing game is equilibrium of energy consumes and the overall benefit of network, so the algorithm is energy efficient. In the future work, we will simulate this algorithm and compare with other algorithms.