Ant-Like Game Routing Algorithm for Wireless Multimedia Sensor Networks

Autor: Chen Nianshen, Sun Qiang, Ke Zongwu, Li Layuan
Rok vydání: 2008
Předmět:
Routing protocol
Computer Science::Computer Science and Game Theory
Dynamic Source Routing
Equal-cost multi-path routing
Computer science
Routing table
Computer Science::Neural and Evolutionary Computation
Enhanced Interior Gateway Routing Protocol
Wireless Routing Protocol
Geographic routing
ComputingMethodologies_ARTIFICIALINTELLIGENCE
Hop (networking)
Routing Information Protocol
Computer Science::Networking and Internet Architecture
Destination-Sequenced Distance Vector routing
Zone Routing Protocol
Static routing
business.industry
Ant colony optimization algorithms
Quality of service
ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS
Policy-based routing
ComputingMilieux_PERSONALCOMPUTING
Path vector protocol
Distance-vector routing protocol
Link-state routing protocol
Routing domain
Multipath routing
Pheromone
business
Wireless sensor network
Computer network
Efficient energy use
Zdroj: 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.
DOI: 10.1109/wicom.2008.843
Popis: 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.
Databáze: OpenAIRE
Externí odkaz: