A fair routing algorithm for wireless mesh networks based on game theory

F. Ahourai, M. Tabandeh, M. Jahed, B. Afsari

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Knowing the capabilities of game theory in analyzing environment consisting of many decisionmakers 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++.

Original languageEnglish (US)
Title of host publicationProceedings of the 8th International Conference on Networks, ICN 2009
Pages144-149
Number of pages6
DOIs
StatePublished - Jul 23 2009
Externally publishedYes
Event8th International Conference on Networks, ICN 2009 - Gosier, Guadeloupe
Duration: Mar 1 2009Mar 6 2009

Publication series

NameProceedings of the 8th International Conference on Networks, ICN 2009

Other

Other8th International Conference on Networks, ICN 2009
CountryGuadeloupe
CityGosier
Period3/1/093/6/09

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A fair routing algorithm for wireless mesh networks based on game theory'. Together they form a unique fingerprint.

Cite this