A multi-hop resource scheduling algorithm for IEEE 802.16j relay networks

doi:10.1016/j.comnet.2014.03.030

Chia Nan University of Pharmacy & Science Institutional Repository > 智慧生活學院 > 多媒體與遊戲發展系 > 期刊論文 > Item 310902800/28487

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://ir.cnu.edu.tw/handle/310902800/28487

標題:	A multi-hop resource scheduling algorithm for IEEE 802.16j relay networks
作者:	Liu, I-Hsien Liu, Chuan-Gang Lu, Chien-Tung Kuo, Yi-Tsen Li, Jung-Shian
貢獻者:	資訊多媒體應用系
關鍵字:	EEE 802.16j Non-transparent relay Resource scheduling Zone boundary adjustment
日期:	2014-07
上傳時間:	2015-05-06 21:18:04 (UTC+8)
出版者:	Elsevier Science Bv
摘要:	The IEEE 802.16j standard defines both transparent and non-transparent relay transmission mode. The present study formulates and optimizes the relay resource scheduling problem for the case of a non-transparent relay network. It is shown that the resource scheduling problem is NP-Complete. A method is proposed for optimizing the position of the zone boundary adaptively during the resource scheduling process in order to maximize the system throughput. In addition, a low time complexity algorithm designated as MRRS (multi-hop relay resource scheduling) is proposed to obtain an approximate solution for the NP-Complete scheduling problem. In the proposed algorithm, the zone boundary is adjusted adaptively in accordance with the user distribution and the channel state information in such a way as to improve the utilization of the available slots. The simulation results show that MRRS achieves a higher throughput than existing relay resource scheduling algorithms (GenArgMax and Eliminate-Repeat) with no significant loss in fairness. In addition, it is shown that the performance improvement provided by MRRS increases as the hop-count is increased. (C) 2014 Elsevier B.V. All rights reserved.
關聯:	Computer Networks, v.67 n., pp.164-179
显示于类别:	[多媒體與遊戲發展系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	1588	检视/开启

在CNU IR中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....