{"title":"基于最佳位置面积的个人通信服务网络(PCSN)的设计","authors":"Debashis Saha, A. Mukherjee, P. Bhattacharya","doi":"10.1109/ICPWC.1997.655551","DOIUrl":null,"url":null,"abstract":"We have considered a design algorithm for a personal communication services (PCS) network. The algorithm is based on the fluid flow model of mobility analysis and a subgradient heuristic. The design objective is to optimize the location area size subject to the constraint of minimum boundary crossings per unit time because the low frequency of the crossings implies less handovers and less updates in the location database registers. Mathematically, the design task has been formulated as a two-variable non-linear optimization problem which has been solved with the help of Lagrangean relaxation combined with an efficient subgradient heuristic. The experimental results indicate that, for a fixed number of location areas, the optimum location area size does not change significantly with the terminal velocity. Moreover, by selecting the proper density and optimum location area size, the number of crossings can be restricted to the order of tens per hour, which is quite manageable.","PeriodicalId":166667,"journal":{"name":"1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338)","volume":" 42","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Design of a personal communication services network (PCSN) for optimum location area size\",\"authors\":\"Debashis Saha, A. Mukherjee, P. Bhattacharya\",\"doi\":\"10.1109/ICPWC.1997.655551\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have considered a design algorithm for a personal communication services (PCS) network. The algorithm is based on the fluid flow model of mobility analysis and a subgradient heuristic. The design objective is to optimize the location area size subject to the constraint of minimum boundary crossings per unit time because the low frequency of the crossings implies less handovers and less updates in the location database registers. Mathematically, the design task has been formulated as a two-variable non-linear optimization problem which has been solved with the help of Lagrangean relaxation combined with an efficient subgradient heuristic. The experimental results indicate that, for a fixed number of location areas, the optimum location area size does not change significantly with the terminal velocity. Moreover, by selecting the proper density and optimum location area size, the number of crossings can be restricted to the order of tens per hour, which is quite manageable.\",\"PeriodicalId\":166667,\"journal\":{\"name\":\"1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338)\",\"volume\":\" 42\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPWC.1997.655551\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPWC.1997.655551","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Design of a personal communication services network (PCSN) for optimum location area size
We have considered a design algorithm for a personal communication services (PCS) network. The algorithm is based on the fluid flow model of mobility analysis and a subgradient heuristic. The design objective is to optimize the location area size subject to the constraint of minimum boundary crossings per unit time because the low frequency of the crossings implies less handovers and less updates in the location database registers. Mathematically, the design task has been formulated as a two-variable non-linear optimization problem which has been solved with the help of Lagrangean relaxation combined with an efficient subgradient heuristic. The experimental results indicate that, for a fixed number of location areas, the optimum location area size does not change significantly with the terminal velocity. Moreover, by selecting the proper density and optimum location area size, the number of crossings can be restricted to the order of tens per hour, which is quite manageable.