Multi-hop wireless network are promising techniques in the field ofwireless communication. The dynamic topology of the network and theindependent selfish participants of the network make it difficult tobe modeled by traditional tools. Game theory is one of the mostpowerful tools for such problems. However, most current works havecertain limitations. There has not been widely accepted solution forthe problem yet.In this thesis we propose our solutions for the problem of bandwidthsharing in wireless networks. We assume the nodes are rational,selfish but not malicious independent agents in the game. In ourmodel, nodes are trying to send their data to the access point. Somenodes may require others to forward their package to successfullyconnect to the access point. However, nodes are selfish and do notwish to help others. Therefore it is possible that some nodes mayrefuse the requirement. In that case, the unpleasant nodes maypunish the others by slowing down their traffic, in which case bothparties will suffer. Therefore it is non-trivial to find out theEquilibrium for these nodes after the bargain process. What is theproper distribution of resources among these nodes? We propose asolution based on the game theory. Our solution fulfils the goal offairness and social welfare maximum.
【 预 览 】
附件列表
Files
Size
Format
View
A Cooperative Game Theory Model for Bandwidth Allocation in Community Mesh Networks