Chinese Journal of Computers   Full Text
Title	Non-Cooperative Game Based Research on Routing Schemes for Wireless Networks
Authors	WANG Yang1) LIN Chuang1) LI Quan-Lin2) WANG Jing-Qi3) JIANG Xin1)
Address	1）(Department of Computer Science and Technology, Tsinghua University, Beijing 100084) 2）(Department of Industrial Engineering, Tsinghua University, Beijing 100084) 3）(Kellogg School of Management, Northeast University, Boston, Masschusetts, USA)
Year	2009
Issue	No.1(54—68)
Abstract &   Background	Abstract Since wireless networks are usually distributed, independent and mobile, their performance could be affected by selfish nodes. In this paper, the authors focus on the issues of selfish nodes in wireless networks. Game based mechanisms are introduced to study the wireless network involving selfish nodes. In the literature, there are mainly two approaches to deal with the selfish nodes: credit based mechanisms and non-cooperative game and incentive based mechanisms. The authors summarize and analyze the typical routing mechanisms in these areas, and especially discuss the non-cooperative game and incentive based routing mechanisms for wireless ad-hoc networks and wireless mesh networks. Network coding as an efficient technology can help to improve network performance. They also study the optimization schemes based on network coding in wireless networks involving selfish nodes. Moreover, the authors discuss the collusion problem in non-cooperative wireless networks. Finally, they present the existing challenges and possible research directions in non-cooperative wireless networks. Keywords wireless network; game theory; routing mechanism; collusion Background This research is partly supported by the National Basic Research Program of China (973 Program) under grant No.2006CB805901, the National Natural Science Foundation of China under grant Nos.60673187, 60803123, 10671107, 10871114 and 60736028. Since wireless networks are usually distributed, independent and mobile, wireless nodes are required to cooperate to complete most transmission functions. Traditionally, people assume that all the wireless nodes are willing to cooperate, and willing to provide service to other nodes. However, it is not in accordance with the reality. In fact, nodes in wireless networks are usually selfish, especially when they belong to different organizations. The selfish nodes would have severe impact on the system performance in wireless networks. Therefore, it is an important and challenging work to deal with the selfish nodes in wireless networks. Game based mechanisms have been introduced to study the wireless network involving selfish nodes. In the literature, there are mainly two approaches to deal with the selfish nodes: credit based mechanisms and non-cooperative game and incentive based mechanisms. The authors summarize and analyze the typical routing mechanisms in this area, and especially discuss the non-cooperative game and incentive based routing mechanisms for wireless ad-hoc networks and wireless mesh networks. Network coding as an efficient technology can help to improve network performance. The authors also study the optimization schemes based on network coding in wireless networks involving selfish nodes. Moreover, they discuss the collusion problem in non-cooperative wireless networks and present the existing challenges and possible research directions in non-cooperative wireless networks.