By Topic

Game theory for routing modeling in communication networks — A survey

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pavlidou, Fotini-Niovi ; Department of Electrical and Computer Engineering, Faculty of Engineering, Aristotle University of Thessaloniki, Thessaloniki, Greece ; Koltsidas, Georgios

In this work, we review the routing models that use game theoretical methodologies. A very common assumption in the analysis and development of networking algorithms is the full cooperation of the participating nodes. Most of the analytical tools are based on this assumption. 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 it is known to be extensively used in the fields of economics and biology, game theory has attracted the interest of researchers in the field of communication networking as well. Nowadays, game theory is used for the analysis and modeling of protocols in several layers, routing included. This review aims at providing an elucidation of the terminology and principles behind game theory and the most popular and recent routing models. The examined networks are both the traditional networks where latency is of paramount importance and the emerging ad hoc and sensor networks, where energy is the main concern.

Published in:

Communications and Networks, Journal of  (Volume:10 ,  Issue: 3 )