DocumentCode :
1511495
Title :
Analytical Model of QoS-Based Fast Seamless Handoff in IEEE 802.16j WiMAX Networks
Author :
Liang, Ying-Hsin ; Chang, Ben-Jye ; Hsieh, Sung-Ju ; Wang, De-Yu
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nan Kai Univ. of Technol., Nantou, Taiwan
Volume :
59
Issue :
7
fYear :
2010
Firstpage :
3549
Lastpage :
3561
Abstract :
The IEEE 802.16 standard adopts a centralized resource-allocation mechanism to poll nodes with three polling modes, i.e., the unicast, multicast, and broadcast polling modes, depending on the residual bandwidth of the base station (BS). In the multicast and broadcast polling modes, the BS uses the truncated binary exponential backoff (TBEB) algorithm as the contention-resolution process (CRP) for mobile nodes to access the wireless network while the traffic load increases up to saturation. The random contention-based TBEB used in the initial ranging and bandwidth request suffers from high collision probability under a high traffic load. TBEB thus significantly degrades the grade of service (GoS), particularly while performing handoff in the mobile (IEEE 802.16e) or multihop relay WiMAX (IEEE 802.16j) networks. Additionally, WiMAX´s TBEB exhibits two critical problems. First, TBEB neglects the node priority (i.e., the new or handoff node) and the service flow class (i.e., the real-time or nonreal-time service class); thus, it cannot achieve the optimal network revenue. Second, all different-priority connections immediately transit to the same minimum contention windows (CWs) after winning contentions and then easily lead to high collision probability at succeeding contentions. Therefore, this paper first proposes an efficient contention-resolution algorithm that consists of three key contributions: 1) providing the adaptive minimum-maximum backoff-value algorithm (AM^2) to partition collision domains; 2) supporting a dynamic waiting-penalty algorithm (DWP) for successful contentions; and 3) differentiating the decrements of CWs (DDW) to avoid collisions, even though the contentions randomly choose the same CW value. Second, we model the proposed approach as a discrete-time Markov chain model and then mathematically analyze several important metrics, i.e., the collision probability, access delay, GoS, and throughput. Numerical results indicate that the analytical res- - ults are very close to the simulation results, which justify the accuracy of the analytical model. Additionally, the proposed approach outperforms IEEE 802.16 and all compared approaches in collision probability, delay, GoS, and network throughput.
Keywords :
IEEE standards; Markov processes; WiMax; mobile radio; quality of service; radio access networks; resource allocation; telecommunication congestion control; telecommunication traffic; GoS; IEEE 802.16e; IEEE 802.16j standard; QoS; TBEB algorithm; WiMAX networks; collision avoidance; collision probability; contention resolution process; contention windows; discrete Markov chain model; dynamic waiting penalty algorithm; fast seamless handoff; grade service; mobile networks; multihop relay networks; network traffic; resource allocation; truncated binary exponential backoff algorithm; wireless access network; Analytical models; Bandwidth; Broadcasting; Mathematical model; Partitioning algorithms; Resource management; Telecommunication traffic; Throughput; Unicast; WiMAX; Backoff window; WiMAX; contention-resolution procedure (CRP); grade of service (GoS); handoff; markov chain;
fLanguage :
English
Journal_Title :
Vehicular Technology, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9545
Type :
jour
DOI :
10.1109/TVT.2010.2051825
Filename :
5482145
Link To Document :
بازگشت