Game Theory-Based Routing Algorithms for Wireless Multi-hop Networks

DOI

10.2991/iccia.2012.296How to use a DOI?

Keywords

Wireless multi-hop networks, Routing algorithms, Game theory, Cooperation

Abstract

In wireless multi-hop networks, the quality of service provided by the system heavily depends on the cooperation between nodes. However, nodes are reluctant to cooperate with each other to save their limited resources. This tendency will put a limit on the application of the current wireless multi-hop networks. Therefore, game theory, which can analyze the strategic interactions among autonomous decision makers, becomes an ideal candidate to solve the above problem. In this paper, we first introduce the basic concept of game theory. Then, the game-theory-based routing algorithms for wireless multi-hop networks are investigated in detail and their characteristics are compared. Finally, we give the future research directions and concluding remarks.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhi Ren
AU  - Shuang Peng
AU  - Hongjiang Lei
AU  - Jibi Li
PY  - 2014/05
DA  - 2014/05
TI  - Game Theory-Based Routing Algorithms for Wireless Multi-hop Networks
BT  - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012)
PB  - Atlantis Press
SP  - 1199
EP  - 1203
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccia.2012.296
DO  - 10.2991/iccia.2012.296
ID  - Ren2014/05
ER  -