Analytical Model of QoS-Based Fast Seamless Handoff in IEEE 802.16j WiMAX Networks

被引:11
作者
Liang, Ying-Hsin [1 ]
Chang, Ben-Jye [2 ]
Hsieh, Sung-Ju [3 ]
Wang, De-Yu [3 ]
机构
[1] Nan Kai Univ Technol, Dept Comp Sci & Informat Engn, Nantou 542, Taiwan
[2] Natl Yunlin Univ Sci & Technol, Dept Comp Sci & Informat Engn, Yunlin 64002, Taiwan
[3] Chaoyang Univ Technol, Dept Comp Sci & Informat Engn, Taichung 41349, Taiwan
关键词
Backoff window; contention-resolution procedure (CRP); grade of service (GoS); handoff; markov chain; WiMAX; ACCESS; DELAY;
D O I
10.1109/TVT.2010.2051825
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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 results 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.
引用
收藏
页码:3549 / 3561
页数:13
相关论文
共 28 条
[1]  
[Anonymous], 80216E IEEE
[2]  
[Anonymous], RES J MICROBIOL, DOI DOI 10.1007/S00418-006-0143-Z
[3]  
[Anonymous], 80216 IEEE
[4]  
[Anonymous], 80216J IEEE
[5]  
BHANDARI BN, 2006, P IEEE TENCON NOV, P14
[6]   Adaptive channel allocation for wireless PCN [J].
Boumerdassi, S ;
Beylot, AL .
MOBILE NETWORKS & APPLICATIONS, 1999, 4 (02) :111-116
[7]  
Chance B., 2006, P 7 INT C TEACHING S, P1
[8]   Adaptive hierarchical polling and Markov decision process based CAC for increasing network reward and reducing average delay in IEEE 802.16 WiMAX networks [J].
Chang, Ben-Jye ;
Chen, Yan-Ling .
COMPUTER COMMUNICATIONS, 2008, 31 (10) :2280-2292
[9]   Cross-layer based delay-constraint adaptive polling for high density subscribers in IEEE 802.16 WiMAX networks [J].
Chang, Ben-Jye ;
Chou, Chien-Ming .
WIRELESS PERSONAL COMMUNICATIONS, 2008, 46 (03) :285-304
[10]   Quality of service support in IEEE 802.16 networks [J].
Cicconetti, C ;
Lenzini, L ;
Mingozzi, E ;
Eklund, C .
IEEE NETWORK, 2006, 20 (02) :50-55