An Efficient Scheduling Algorithm for Maximizing Throughput in WiMAX Mesh Networks

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Proceeding > Item 987654321/73026

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/73026

Title:	An Efficient Scheduling Algorithm for Maximizing Throughput in WiMAX Mesh Networks
Authors:	Chang, Chih-yung;Li, Ming-Hsien;Huang, Wen-Chuan;Chen, Cheng-Chang
Contributors:	淡江大學資訊工程學系
Keywords:	WiMAX;802.16 Mesh Networks;Scheduling;Dynamic Programming;Spatial Reuse
Date:	2009-06-21
Issue Date:	2011-10-24 11:24:59 (UTC+8)
Abstract:	WiMAX Mesh Network architecture is defined in IEEE 802.16 for increasing the network coverage and improving the communication performance. In the past few years, many greedy or heuristic approaches have been proposed to cope with the scheduling problem in WiMAX mesh networks. However, their performances highly depend on the network topology and the bandwidth requests and none of them achieves optimal for all cases. This paper proposes an efficient scheduling algorithm that exploits the opportunities of spatial reuse and maximize the network throughput based on the network topology and the uplink transmission requests of each Subscriber Station(SS). Simulation study reveals that the proposed efficient scheduling algorithm provides the WiMAX mesh network with maximal throughput and shortest transmission time.
Relation:	Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, pp.542-546
DOI:	10.1145/1582379.1582497
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Proceeding

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	352	View/Open