Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ICC.2007.865
Title: | Single and multiple parameters sensitivity study of location management area partitioning for GSM networks | Authors: | Chew, Y.H. Yeo, B.S. Kuan, D.C.M. |
Issue Date: | 2007 | Citation: | Chew, Y.H., Yeo, B.S., Kuan, D.C.M. (2007). Single and multiple parameters sensitivity study of location management area partitioning for GSM networks. IEEE International Conference on Communications : 5229-5234. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2007.865 | Abstract: | To obtain optimal location area (LA) partitioning in cellular radio networks is important since it maximizes the usable bandwidth to support services. However, we feel that the solution is insufficient to the problem, since values taken by the parameters of a mathematical model at the time of its formulation are only estimates of the practical scenarios. The optimal solution should instead be treated as a starting point for sensitivity study of the problem. This is particularly important in helping to identify any vast deviation of the parameters that affect the performance of the networks. We present the approach to perform sensitivity study on the LA design of GSM networks which is modeled as a nonlinear binary programming problem. The sensitivity of the total signaling cost when either one or more of the parameters: cell crossing rates, call arrival rates, paging and update costs, deviate from the designed values are investigated. Examples are given to illustrate how these bounds are obtained, within which the parameters can change but the LA partitioning remains optimal. © 2007 IEEE. | Source Title: | IEEE International Conference on Communications | URI: | http://scholarbank.nus.edu.sg/handle/10635/130473 | ISBN: | 1424403537 | ISSN: | 05361486 | DOI: | 10.1109/ICC.2007.865 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.