Loading...
Search
Search in this resource
sort by

Using Game Theory in Topology Control of Wireless Mobile Networks

Asgarieh, Yashar | 2009

1408 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 39030 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Sarbazi Azad, Hamid
  7. Abstract:
  8. Motivated by the fact of lack of infra-structure in multi-hop wireless networks, there is a controversial issue of assurance in protocols execution. Due to dynamic structure of these networks, local information should be considered for implementing related algorithms implementation. Selecting logical neighbors, named topology control, is one of these algorithms which have to take sanctity of the execution into consideration. To cope with these issues it can be beneficial to explore algorithm design problem in view of independent and rational agents. In other words, in investigating topology control algorithms in the presence of independent nodes, several contradictory problems were observed which may exacerbate network operation. As an exemplification, less power consumption is favorable to every node while preserve its connectivity with other ones. Hence, as a rational agent, nodes prefer to transmit with less power while other nodes prepare data with more energy consumption. Such selfish behavior may eradicate network operation in some ways. Game theory is a suitable tool from applied mathematics which is employed for analyzing interactive situations. Owing to this property, we will apply game theory to investigate cooperation issue for competitive environment where nodes execute topology control algorithm. In this project, the k-closest neighbor algorithm is used as the base algorithm because of its desirable properties in locality of information. We shall modify this algorithm to be adaptive to mobility. Experimental results show improvements in topology control parameters in presence of mobility. Following this improvement, we will focus on assured topology control algorithm design based on repeated games. To this end, the problem is investigated in two distinct sections: 1) Contention-free environments and 2) in the presence of contention. The game model is proposed and several strategies are designed to persuade nodes for cooperation in execution of topology control algorithm. The evaluation results show topology control properties enhancement for cooperative nodes in comparison with non-cooperative ones. Our final section introduces a strategy which tries to preserve cooperation in noisy situations with only local information
  9. Keywords:
  10. Topology Control ; Game Theory ; Nash Equilibrium Point ; Repeated Game ; Nearest Neighbor ; Wireless Multihop Network ; Discounted Utility Function ; Subgame Perfection

 Digital Object List

 Bookmark

No TOC