{"title":"分层寻呼-有效的位置管理","authors":"M. Szalay, S. Imre","doi":"10.1109/ECUMN.2007.26","DOIUrl":null,"url":null,"abstract":"This paper introduces a new location management algorithm called hierarchical paging. A mathematical model for the proposed scheme is also presented. We have compared our solution to two other location management solutions using simulations. The environment, setup, simulation details and results are presented in this paper. It is concluded that there is a wide range of parameters where hierarchical paging is more efficient than the other location management algorithms","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Hierarchical Paging- Efficient Location Management\",\"authors\":\"M. Szalay, S. Imre\",\"doi\":\"10.1109/ECUMN.2007.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a new location management algorithm called hierarchical paging. A mathematical model for the proposed scheme is also presented. We have compared our solution to two other location management solutions using simulations. The environment, setup, simulation details and results are presented in this paper. It is concluded that there is a wide range of parameters where hierarchical paging is more efficient than the other location management algorithms\",\"PeriodicalId\":202819,\"journal\":{\"name\":\"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-02-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECUMN.2007.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECUMN.2007.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper introduces a new location management algorithm called hierarchical paging. A mathematical model for the proposed scheme is also presented. We have compared our solution to two other location management solutions using simulations. The environment, setup, simulation details and results are presented in this paper. It is concluded that there is a wide range of parameters where hierarchical paging is more efficient than the other location management algorithms