DocumentCode :
3440481
Title :
Ant-Like Game Routing Algorithm for Wireless Multimedia Sensor Networks
Author :
Ke Zongwu ; Li Layuan ; Sun Qiang ; Chen Nianshen
Author_Institution :
Sch. of Comput. Sci., Wuhan Univ. of Technol., Wuhan
fYear :
2008
fDate :
12-14 Oct. 2008
Firstpage :
1
Lastpage :
4
Abstract :
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.
Keywords :
game theory; quality of service; telecommunication network routing; wireless sensor networks; Nash equilibrium; QoS routing problem; ant colony algorithm; ant-like game routing algorithm; routing game; wireless multimedia sensor networks; Computer science; Energy efficiency; Game theory; Nash equilibrium; Probability; Relays; Routing; Sensor phenomena and characterization; Sun; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
Conference_Location :
Dalian
Print_ISBN :
978-1-4244-2107-7
Electronic_ISBN :
978-1-4244-2108-4
Type :
conf
DOI :
10.1109/WiCom.2008.843
Filename :
4678751
Link To Document :
بازگشت