A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Game Theory-Based Routing Algorithms for Wireless Multi-hop Networks
2012
Proceedings of the 2012 2nd International Conference on Computer and Information Applications (ICCIA 2012)
unpublished
Preserved Fulltext
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
doi:10.2991/iccia.2012.296
fatcat:5kdtzsjdbrhtlgrsfesvxaayje