Dynamic location update for PCS networks with consideration of MT mobility patterns

Jie Li, A. Kubota, H. Kameda
{"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.
考虑MT移动模式的PCS网络动态位置更新
本文研究了个人通信服务(PCS)网络的动态位置更新问题。针对目前流行的网格蜂窝结构,提出了四方向移动模型,以研究各种移动终端的移动模式。在动态位置更新方案中,局部区域(LA)的形状和大小是通过最小化总位置管理成本和限制分页成本来确定的。优化问题被转化为在给定LA大小的情况下,使MT在LA中遍历的期望单元数最大化。建立了计算任意MT移动概率的解析模型。提出了一种有效求解优化问题的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信