Game Theory-Based Routing Algorithms for Wireless Multi-hop Networks
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.
Wireless multi-hop networks Routing algorithms Game theory Cooperation
Zhi Ren Shuang Peng Hongjiang Lei Jibi Li
Chongqing Key Lab of Mobile Communications Technology, Chongqing University of Posts and Telecommunications Chongqing, China 400065
国际会议
太原
英文
1199-1203
2012-12-08（万方平台首次上网日期，不代表论文的发表时间）