Resource Allocation in IEEE 802.16j Transparent Relay Networks: A Game Theory Approach

碩士 === 國立成功大學 === 電腦與通信工程研究所 === 98 === This thesis addresses the downlink subframe resource allocation problem in IEEE 802.16j transparent relay networks. The problem is formulated as a two-stage bargaining game. In the first stage bargaining game, this study will allocate resource to each individu...

Full description

Bibliographic Details
Main Authors: Tsung-HanYang, 楊宗翰
Other Authors: Hui-Tang Lin
Format: Others
Language:zh-TW
Published: 2010
Online Access:http://ndltd.ncl.edu.tw/handle/84577050492443464707
id ndltd-TW-098NCKU5652064
record_format oai_dc
spelling ndltd-TW-098NCKU56520642015-11-06T04:03:59Z http://ndltd.ncl.edu.tw/handle/84577050492443464707 Resource Allocation in IEEE 802.16j Transparent Relay Networks: A Game Theory Approach 基於賽局理論之IEEE802.16j穿透式無線網路的資源分配機制 Tsung-HanYang 楊宗翰 碩士 國立成功大學 電腦與通信工程研究所 98 This thesis addresses the downlink subframe resource allocation problem in IEEE 802.16j transparent relay networks. The problem is formulated as a two-stage bargaining game. In the first stage bargaining game, this study will allocate resource to each individual traffic class based on its minimum requirement so as to achieve proportional fairness between classes. Then in the second stage bargaining game, this study ensure that users in the same traffic class have equal gain. The proposed game-theoretic approach achieves both a high system utilization while provides fairness guarantee for service flows with different requirements and conditions. The simulation results confirm the efficiency and fairness of the proposed approach. Hui-Tang Lin 林輝堂 2010 學位論文 ; thesis 66 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立成功大學 === 電腦與通信工程研究所 === 98 === This thesis addresses the downlink subframe resource allocation problem in IEEE 802.16j transparent relay networks. The problem is formulated as a two-stage bargaining game. In the first stage bargaining game, this study will allocate resource to each individual traffic class based on its minimum requirement so as to achieve proportional fairness between classes. Then in the second stage bargaining game, this study ensure that users in the same traffic class have equal gain. The proposed game-theoretic approach achieves both a high system utilization while provides fairness guarantee for service flows with different requirements and conditions. The simulation results confirm the efficiency and fairness of the proposed approach.
author2 Hui-Tang Lin
author_facet Hui-Tang Lin
Tsung-HanYang
楊宗翰
author Tsung-HanYang
楊宗翰
spellingShingle Tsung-HanYang
楊宗翰
Resource Allocation in IEEE 802.16j Transparent Relay Networks: A Game Theory Approach
author_sort Tsung-HanYang
title Resource Allocation in IEEE 802.16j Transparent Relay Networks: A Game Theory Approach
title_short Resource Allocation in IEEE 802.16j Transparent Relay Networks: A Game Theory Approach
title_full Resource Allocation in IEEE 802.16j Transparent Relay Networks: A Game Theory Approach
title_fullStr Resource Allocation in IEEE 802.16j Transparent Relay Networks: A Game Theory Approach
title_full_unstemmed Resource Allocation in IEEE 802.16j Transparent Relay Networks: A Game Theory Approach
title_sort resource allocation in ieee 802.16j transparent relay networks: a game theory approach
publishDate 2010
url http://ndltd.ncl.edu.tw/handle/84577050492443464707
work_keys_str_mv AT tsunghanyang resourceallocationinieee80216jtransparentrelaynetworksagametheoryapproach
AT yángzōnghàn resourceallocationinieee80216jtransparentrelaynetworksagametheoryapproach
AT tsunghanyang jīyúsàijúlǐlùnzhīieee80216jchuāntòushìwúxiànwǎnglùdezīyuánfēnpèijīzhì
AT yángzōnghàn jīyúsàijúlǐlùnzhīieee80216jchuāntòushìwúxiànwǎnglùdezīyuánfēnpèijīzhì
_version_ 1718126142660018176