CALL BLOCKING PERFORMANCE OF DISTRIBUTED ALGORITHMS FOR DYNAMIC CHANNEL ALLOCATION IN MICROCELLS

被引:60
作者
CIMINI, LJ [1 ]
FOSCHINI, GJ [1 ]
I, CL [1 ]
MILJANIC, Z [1 ]
机构
[1] NEC USA INC,C&C RES LABS,PRINCETON,NJ 08504
关键词
D O I
10.1109/26.310620
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We determine the call blocking performance of channel-allocation algorithms where every channel is available for use in every cell and where decisions are made by mobiles/portables based only on local observations. Using a novel Erlang-B approximation method, together with simulation, we demonstrate that even the simplest algorithm, the timid, compares favorably with impractical, centrally administered fixed channel allocation. Our results suggest that an aggressive algorithm, that is, one requiring call reconfigurations, could provide a substantially reduced blocking probability. We also present some algorithms which take major steps toward achieving the excellent blocking performance of the hypothetical aggressive algorithm but having the stability of the timid algorithm.
引用
收藏
页码:2600 / 2607
页数:8
相关论文
共 18 条
[1]  
AMITAY N, P VTC 91, P904
[2]  
CIMINI LJ, P VTC 92, P641
[3]  
CIMINI LJ, IN PRESS IEEE T COMM
[4]  
Cooper R. B., 1972, INTRO QUEUEING THEOR
[5]  
Everitt D. E., 1983, British Telecom Technology Journal, V1, P37
[6]   CHANNEL COST OF MOBILITY [J].
FOSCHINI, GJ ;
GOPINATH, B ;
MILJANIC, Z .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 1993, 42 (04) :414-424
[7]  
FOSCHINI GJ, IN PRESS DISTRIBUTED
[8]  
I CL, 1993, WIRELESS COMMUNICATI
[9]  
KEELER K, IN PRESS IEEE T COMM
[10]  
KELLY FP, 1985, J ROY STAT SOC B MET, V47, P379