Game Theoretical and Generic approaches for selfish node avoidance in ad hoc networks

In this paper, we review the routing models that use both the Generic and Game theoretical methodologies. A very common assumption in the analysis and development of networking algorithms is the full co-operation of the participating nodes. However, the reality may differ considerably. The existence of multiple domains belonging to different authorities or even the selfishness of the nodes themselves could result in a performance that significantly deviates from the expected one. Even though Game theory is known to be extensively used in the field of economics and biology, it is used for the analysis and modeling of protocols in several layers, including routing. This review aims at providing an elucidation of the terminology and principles behind game theory and the most popular Generic and Game theoretic recent routing models.