A Fair Routing Algorithm for Wireless Mesh Networks Based on Game Theory

Knowing the capabilities of game theory in analyzing environment consisting of many decision-makers or agents, it has been the goal of many researchers to apply game theory analyses in computer and telecommunication networks. One of the main subjects in the networks based on the viewpoint of Game Theory is routing problems in special networks. In this paper, routing in Wireless Mesh Networks, which are growing and developing rapidly, is studied as an example for routing in computer and telecommunication networks and a new model for such networks is proposed based on Non-cooperative Game Theory. It is proposed to solve this model by a heuristic method essentially based on simulated annealing in order to obtain a better routing method than traditional methods. This routing is implemented in OMNET++ simulator and compared with available routing methods in OMNET++.