Adaptive hierarchical polling and Markov decision process based CAC for increasing network reward and reducing average delay in IEEE 802.16 WiMAX networks

Authors:
Ben-Jye Chang;Yan-Ling Chen
Affiliations:
Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung, Taiwan, ROC;Graduate Institute of Networking & Communication Engineering, Chaoyang University of Technology, Taichung, Taiwan, ROC
Venue:
Computer Communications
Year:
2008

Citing 10
Cited 5

MDP routing for multi-rate loss networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis of adaptive cost functions for dynamic update policies for QoS routing in hierarchical networks

Information Sciences—Informatics and Computer Science: An International Journal
Performance analysis for hierarchical multirate loss networks

IEEE/ACM Transactions on Networking (TON)
Performance Analysis of the IEEE 802.16 Wireless Metropolitan Area Network

DFMA '05 Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications
The Analysis of the Optimal Contention Period for Broadband Wireless Access Network

PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Queue-Aware Uplink Bandwidth Allocation and Rate Control for Polling Service in IEEE 802.16 Broadband Wireless Networks

IEEE Transactions on Mobile Computing
A Queuing-Theoretic and Optimization-Based Model for Radio Resource Management in IEEE 802.16 Broadband Wireless Networks

IEEE Transactions on Computers
Performance Evaluation of the IEEE 802.16 MAC for QoS Support

IEEE Transactions on Mobile Computing
IEEE 802.16 based last mile broadband wireless military networks with quality of service support

MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Quality of service support in IEEE 802.16 networks

IEEE Network: The Magazine of Global Internetworking

Downlink resource management for QoS scheduling in IEEE 802.16 WiMAX networks

Computer Communications
Adaptive Cost-Based with Max---Min AMC Routing Algorithm for Increasing Utilization and Reducing Blocking in IEEE 802.16j WiMAX Networks

Wireless Personal Communications: An International Journal
Using GI-G-1 queuing model for rtPS performance evaluation in 802.16 networks

International Journal of Communication Systems
Media Independent Handover-based Competitive On-Line CAC for Seamless Mobile Wireless Networks

Wireless Personal Communications: An International Journal
Performance Analysis of WiMAX Networks AC

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.24

Visualization

Abstract

The IEEE 802.16 standard, namely WiMAX, adopts a polling MAC to support real-time transmissions in wireless metropolitan area networks. Although WiMAX overcomes access contentions by using unicast polling, it suffers from long polling delay and wastes bandwidth used for polling when the polled SSs have no packets to be sent. Additionally, WiMAX supports various service-classes for guaranteeing QoS transmission, but obtains reward only from high-class services because WiMAX doesn't differentiate the priorities of nodes. However, today's network providers have already supported different customer-priorities and service-classes simultaneously for increasing network reward. This paper thus proposes the adaptive hierarchical polling (i.e., AHP) approach that consists of three schemes. First, AHP supports multiple node-priorities with different classes of service flow to maximize network reward. Second, a two-mode pending mechanism is proposed for the BS and SSs to dynamically change any SSs state between the active and idle states. Third, we propose the MDP-based CAC to increase network reward by accepting high-priority nodes and real-time polling services first. Numerical results indicate that the proposed approach outperforms IEEE 802.16 in FRL and polling delay while yielding competitive utilization. Furthermore, the worst-case running time of AHP is analyzed and deduced to O(N.W.R).