CHANNEL COST OF MOBILITY

被引:67
作者
FOSCHINI, GJ [1 ]
GOPINATH, B [1 ]
MILJANIC, Z [1 ]
机构
[1] RUTGERS UNIV,DEPT ELECT & COMP ENGN,NEW BRUNSWICK,NJ 08903
关键词
D O I
10.1109/25.260771
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We analyze, for mobile users in regular cellular arrays, the probability that a call is blocked from accessing a channel (when originating or when attempting to hand off during an active user's sojourn). This probability, p, is studied here as a function of the originating call load, in Erlangs per cell, with the number of channels and user mobility treated as parameters. Using simulation, we demonstrate that a simple ad hoc Erlang-B formula, based on an equivalent traffic load, gives an excellent approximation to p. The approximation is good regardless of the nature of the user motion or whether the cellular arrays are linear or planar. By the ''cost of mobility,'' we mean the additional channels (in percent) that are needed to meet a required p because the user is mobile. Using the ad hoc formula, we show that the cost of mobility is generally minor, becoming appreciable only for high mobility coupled with low traffic loads. Two of the high-mobility examples consider 105-kmph user movement with only 200 m traversed per cell. Calls are assumed to have a one-minute mean holding time, and the value of p is required to be 1%. For a traffic load of 50 Erlangs per cell, about 10% more channels are needed with mobility than when there is no mobility. In the second example, with only 3 Erlangs per cell, the extra channels needed increase to 25%.
引用
收藏
页码:414 / 424
页数:11
相关论文
共 7 条
[1]  
Bertsekas D., 1987, DATA NETWORKS
[2]  
CIMINI LJ, IN PRESS IEEE T COMM
[3]  
Cooper R.B., 1972, INTRO QUEUEING THEOR
[4]  
Kelly F. P., 1991, ANN APPL PROBAB, V1, P319
[5]  
KELLY FP, 1979, REVERSIBILITY STOCHA, pCH3
[6]  
MASSEY WA, IN PRESS QUEUEING SY
[7]   BLOCKING WHEN SERVICE IS REQUIRED FROM SEVERAL FACILITIES SIMULTANEOUSLY [J].
WHITT, W .
AT&T TECHNICAL JOURNAL, 1985, 64 (08) :1807-1856