An approach for location area planning in a personal communication services network (PCSN)

被引:23
作者
Bhattacharjee, PS
Saha, D
Mukherjee, A
机构
[1] Bharat Sanchar Nigam Ltd, Kolkata 700001, W Bengal, India
[2] Indian Inst Management, Kolkata 700104, W Bengal, India
[3] IBM Global Serv, Kolkata 700091, W Bengal, India
[4] Univ New S Wales, Sch Comp Sci & Engn, Sydney, NSW 2052, Australia
关键词
call-to-mobility ratios (CMRs); cost optimization; heuristic; location area (LA); location update (LU); paging; personal communication services network (PCSN);
D O I
10.1109/TWC.2004.830821
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper deals with an approach for planning location areas (LAs) in a personal communication services network (PCSN) to be overlaid on an existing wired network. Given the average speed of mobile terminals, the number of mobile switching centers (MSCs), their locations, call handling capacity of each MSC, handoff cost between adjacent cells and call arrival rate, an important consideration in a PCSN is to identify the cells in every LA to be connected to the corresponding NISC in a cost effective manner. In this work, while planning a location area, we present a two-step approach, namely optimization of total system recurring cost (subproblem I) and optimization of hybrid cost (subproblem II). The planning first determines the optimum number of cells in an LA from subproblem I. Then, it finds out the exact LAs by assigning cells to the switches, while optimizing the hybrid cost which comprises the handoff cost and the cable cost, in subproblem II. This divide-and-conquer strategy provides a practical way for designing LAs. As our approach toward LA planning takes into accounts both cost and network planning factors, this unique combination will be of great interest to PCSN designers. It develops an optimum network planning method for a wide range of call-to-mobility ratios that minimizes the total system recurring cost while still ensuring a good system performance. Our study shows that acceptable results are achievable with a reasonable computational effort, which supports the engineered planning of a PCSN.
引用
收藏
页码:1176 / 1187
页数:12
相关论文
共 36 条
[1]   Paging strategy optimization in personal communication systems [J].
Abutaleb, Ahmed ;
Li, Victor O. K. .
WIRELESS NETWORKS, 1997, 3 (03) :195-204
[2]   Dynamic mobile user location update for wireless PCS networks [J].
Akyildiz, Ian F. ;
Ho, Joseph S. M. .
WIRELESS NETWORKS, 1995, 1 (02) :187-196
[3]   Movement-based location update and selective paging for PCS networks [J].
Akyildiz, IF ;
Ho, JSM ;
Lin, YB .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1996, 4 (04) :629-638
[4]   A new random walk model for PCS networks [J].
Akyildiz, IF ;
Lin, YB ;
Lai, WR ;
Chen, RJ .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (07) :1254-1260
[5]  
AKYILDIZ IF, 2002, IEEE T WIRELESS JAN, P178
[6]  
Alonso E., 1992, P 8 INT TEL SEM SANT, P261
[7]   Mobile users: To update or not to update? [J].
Bar-Noy, Amotz ;
Kessler, Ilan ;
Sidi, Moshe .
WIRELESS NETWORKS, 1995, 1 (02) :175-185
[8]   Heuristics for assignment of cells to switches in a PCSN: A comparative study [J].
Bhattacharjee, PS ;
Saha, D ;
Mukherjee, A .
1999 IEEE INTERNATIONAL CONFERENCE ON PERSONAL WIRELESS COMMUNICATIONS, 1999, :331-334
[9]  
BHATTACHARYA PS, 1999, P PERS WIR COMM LYNG
[10]  
BOUCHARD RJ, 1965, HWY RES REC, V88, P1