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 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 access point. Some
nodes may require others to forward their package to successfully
connect to the access point. 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 bargain process. What is the
proper distribution of resources among these nodes? We propose a
solution based on the game theory. Our solution fulfils the goal of
fairness and social welfare maximum.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OWTU.10012/3014 |
| Date | 14 May 2007 |
| Creators | Jiang, Miao |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | 602758 bytes, application/pdf |
Page generated in 0.0583 seconds