| Multi-hop wireless network are promising techniques in the field of wireless communication. The dynamic topology of the network and the independent selfish participants of the network make it difficult to be modeled by traditional tools. Game theory is one of the most powerful tools for such problems. However, most current works have certain limitations. There has not been a widely accepted solution for the problem yet.;In this thesis we propose our solutions for the problem of bandwidth sharing in wireless networks. We assume the nodes are rational, selfish, but not malicious, independent agents in the game. In our model, nodes are trying to send their data to the gateway. Some nodes may require others to forward their packets to successfully connect to the gateway. However, nodes are selfish and do not wish to help others. Therefore it is possible that some nodes may refuse the requirement. In that case, the unpleasant nodes may punish the others by slowing down their traffic, in which case both parties will suffer. Therefore it is non-trivial to find out the equilibrium for these nodes after the bargaining process. What is the proper distribution of resources among these nodes? We propose a solution based on the game theory. Our solution fulfills the goal of fairness and social-welfare maximization. |
