IEICE TRANSACTIONS on Communications
Fair Scheduling and Throughput Maximization for IEEE 802.16 Mesh Mode Broadband Wireless Access Networks
Summary :
Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the spatio-temporal bandwidth reuse to further enhance the network throughput. The proposed mechanism reduces the length of a transmission round by increasing the number of non-contending links that can be scheduled simultaneously. We also propose a greedy algorithm that runs in polynomial time. Performance of the proposed algorithms is evaluated by extensive simulations. Results show that our algorithms achieve higher throughput than that of the existing ones and reduce the computational complexity.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.6 pp.1459-1474
- Publication Date
- 2010/06/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.1459
- Type of Manuscript
- PAPER
- Category
- Wireless Communication Technologies
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Muhammad Mahbub ALAM, Md. Abdul HAMID, Md. Abdur RAZZAQUE, Choong Seon HONG, "Fair Scheduling and Throughput Maximization for IEEE 802.16 Mesh Mode Broadband Wireless Access Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 6, pp. 1459-1474, June 2010, doi: 10.1587/transcom.E93.B.1459.
Abstract: Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the spatio-temporal bandwidth reuse to further enhance the network throughput. The proposed mechanism reduces the length of a transmission round by increasing the number of non-contending links that can be scheduled simultaneously. We also propose a greedy algorithm that runs in polynomial time. Performance of the proposed algorithms is evaluated by extensive simulations. Results show that our algorithms achieve higher throughput than that of the existing ones and reduce the computational complexity.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1459/_p
Copy
@ARTICLE{e93-b_6_1459,
author={Muhammad Mahbub ALAM, Md. Abdul HAMID, Md. Abdur RAZZAQUE, Choong Seon HONG, },
journal={IEICE TRANSACTIONS on Communications},
title={Fair Scheduling and Throughput Maximization for IEEE 802.16 Mesh Mode Broadband Wireless Access Networks},
year={2010},
volume={E93-B},
number={6},
pages={1459-1474},
abstract={Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the spatio-temporal bandwidth reuse to further enhance the network throughput. The proposed mechanism reduces the length of a transmission round by increasing the number of non-contending links that can be scheduled simultaneously. We also propose a greedy algorithm that runs in polynomial time. Performance of the proposed algorithms is evaluated by extensive simulations. Results show that our algorithms achieve higher throughput than that of the existing ones and reduce the computational complexity.},
keywords={},
doi={10.1587/transcom.E93.B.1459},
ISSN={1745-1345},
month={June},}
Copy
TY - JOUR
TI - Fair Scheduling and Throughput Maximization for IEEE 802.16 Mesh Mode Broadband Wireless Access Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1459
EP - 1474
AU - Muhammad Mahbub ALAM
AU - Md. Abdul HAMID
AU - Md. Abdur RAZZAQUE
AU - Choong Seon HONG
PY - 2010
DO - 10.1587/transcom.E93.B.1459
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2010
AB - Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the spatio-temporal bandwidth reuse to further enhance the network throughput. The proposed mechanism reduces the length of a transmission round by increasing the number of non-contending links that can be scheduled simultaneously. We also propose a greedy algorithm that runs in polynomial time. Performance of the proposed algorithms is evaluated by extensive simulations. Results show that our algorithms achieve higher throughput than that of the existing ones and reduce the computational complexity.
ER -
English
