Transmission Radius Games on Wireless Networks

Please enable javascript in your browser.

Nafisi Asl, Hossein | 2020

394 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 53802 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Abam, Mohammad Ali
Abstract:
With the daily increase in the volume of information and due to the growth and pervasiveness of wireless networks, the structures and the way of connection of intermediate nodes have become very important in terms of energy, communication speed and communication overhead. In this thesis, we examine the structure of directionless wireless networks assuming nodes are selfish. In these networks, nodes seek to minimize their costs while being required to access all nodes with limited path length. Due to the selfishness of nodes, we used game theory to analyze the structure and behavior of nodes by calculating the Nash equilibrium state and to compare these networks with networks that are managed under central control. In this thesis, we proved that for directionless networks, there is a Nash equilibrium state for all input. We also provide an approximate algorithm for calculating the optimal state - assuming central management. For these two cases, we specified a range for the price of anarchy. In the final section, we introduced some problems for future work
Keywords:
Wireless Networks ; Game Theory ; Nash Equilibrium Point ; Network Structure ; Omnidirectional Networks

No TOC