{"title":"Dynamic location update for PCS networks with consideration of MT mobility patterns","authors":"Jie Li, A. Kubota, H. Kameda","doi":"10.1109/ISPAN.2004.1300532","DOIUrl":null,"url":null,"abstract":"This paper addresses the dynamic location update for personal communication service (PCS) networks. The four-direction mobility model for the popular grid cellular architectures is introduced to exploit the mobility patterns of all kinds of mobile terminals (MTs). The shape and size of the local area (LA) in the dynamic location update scheme is determined by minimizing the total location management cost with bounding the paging cost. The optimization problem is transferred to maximize expected number of cells traversed by the MT in the LA with a given size of the LA. The analytic model of calculating the probabilities of any MT's moving is established. An algorithm is proposed to solve the optimization problem efficiently.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2004.1300532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
This paper addresses the dynamic location update for personal communication service (PCS) networks. The four-direction mobility model for the popular grid cellular architectures is introduced to exploit the mobility patterns of all kinds of mobile terminals (MTs). The shape and size of the local area (LA) in the dynamic location update scheme is determined by minimizing the total location management cost with bounding the paging cost. The optimization problem is transferred to maximize expected number of cells traversed by the MT in the LA with a given size of the LA. The analytic model of calculating the probabilities of any MT's moving is established. An algorithm is proposed to solve the optimization problem efficiently.