Application of Game Theory in Ad hoc Networks

OData support
Supervisor:
Dr. Imre Sándor
Department of Networked Systems and Services

In today’s world wireless, self-organising networks which aren’t centrally controlled, so called ad hoc networks, are becoming more widespread. There are enormous opportunities in these networks, however we are presented with serious technical challenges when developing them. An important task, and probably even more important in the future, is optimising them in terms of energy usage. In such networks, due to some individuals’ selfish behaviour, finding states of equilibrium is also important. Janos Neumann’s game theory provides a tool to possibly find these states. With the help of this theory strategies can be defined that take into consideration the selfish behaviour of individuals.

The aim of the report is presenting game theory and discussing certain telecommunication applications for it. The next section’s main goal is discussing the basics of path selection. After this a short summary of ad hoc networks will be carried out, paired with some possible applications of it, with special attention to energy constraints. Finally, by using game theory a promising method will be presented of a packet forwarding strategy found in ad hoc networks, which special attention to energy constraints. The end of the report will evaluate results, and discuss how the model should be further improved.

Downloads

Please sign in to download the files of this thesis.