000 03983nas|a2200421 a 4500
005 20260818175916.0
008 100315s2009 th uu|m rtt 0| a1eng d
035 _a.b12074275
099 9 _aAIT RSPR no.ICT-09-06
100 1 _aNazir, Muhammad Mohsin
245 1 0 _aRelay selection techniques in cooperative communication using game theory
260 _aPathum Thani, Thailand :
_bAsian Institute of Technology,
_c2009
300 _a26 leaves :
_bill.
490 1 _aResearch studies project report ;
_vno. ICT-09-06
500 _aA research report submitted in partial fulfillment of the requirements for the degree of Master of Science in Information and Communications Technologies, School of Engineering and Technology
502 _aResearch Studies Project Report (M. Eng.) - Asian Institute of Technology, 2009
520 _aIn this research work the optimized routing or relay selection is discussed for the Cooperative Communication wireless networks. The whole network system performance or Quality of Service (QoS) can not be achieved without the optimal selection of the relay nodes. For this research study, the network performance is analysed for m number of relays for n number of source nodes. The simulation results are measured by considering four nodes only in half duplex mode. The mentioned techniques can further be applied to more than four nodes in full duplex mode. So, by considering the optimal performance routing for a subset of problem, which can be further applied to whole wireless network. There have been a lot of works in this domain taking advantages from the traditional techniques and algorithms from Game Theory and Algorithms. This research study discusses the scenario of three types of nodes (Source, Relay & Destination). There are many common scenarios in which the additional relay selection or route leads to degrade in the system performance [Braesss Paradox]. And these type of scenarios can be analysed by using techniques from traditional traffic engineering domain. Dynamic relay selection plays an important role for the increase in system performance. The greedy approach in the wireless network approach leads toward the Nash Equilibrium which may be suboptimal but not optimal. The relay selection procedure can be optimized with application of game theoretic approach to increase the system performance, as a whole. So, the main objective is to present and algorithmic approach to solving the Relay Selection in Cooperative Communication using techniques from Optimization and Game Theory for amplify-and-forward case. The results shows the bandwidth allocation and Nash Equilibrium among the competing users represented as buyer/seller in the open competition market
650 0 _aGame theory
700 1 _aRajatheva, R.M.A.P,
_eChairperson
700 0 _aPoompat Saengudomlert,
_eExamination Committee
700 0 _aWinai Wongsurawat,
_eExamination Committee
710 2 _aHEC - Asian Institute of Technology Fellowship,
_eScholarship donor
810 2 _aAsian Institute of Technology.
_tResearch studies project report ;
_vno. ICT-09-06
856 _3Full-Text
_uhttp://203.159.5.9/ait-thesis/detail.php?q=B01399
907 _a.b12074275
_bmnait
_cu
902 _a240329
998 _b0
_c100315
_dm
_ea
_fu
_g0
945 _lmnait
945 _lmnait
945 _lmnarc
942 _c22
942 _c40
942 _c20
909 _aBarcode : 30050120724504
_bCREATED : 2012-10-10
_cRECORD # : i12702316
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050160110473
_bCREATED : 2016-08-04
_cRECORD # : i12931214
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050211022420
_bCREATED : 2022-08-02
_cRECORD # : i13363980
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
999 _c99126
_d99126