{"title":"区位区域规划,交通完全同质","authors":"L. Shuguang, X. Xiao","doi":"10.1109/ICCSE.2009.5228439","DOIUrl":null,"url":null,"abstract":"Mobility tracking is concerned with finding mobile users within the area serviced by the wireless network. The two basic operations for tracking mobile users, location updating and paging, constitute a necessary overhead on the network. A central problem in the design phase of the system is Location Area Planning: optimally divide the service area into location areas to minimize the total cost of updating and paging. This paper examines complete homogeneous traffic, i.e., the number of mobile users that move between any pair of cells per time unit is a constant, and presents a polynomial time approximation scheme.","PeriodicalId":303484,"journal":{"name":"2009 4th International Conference on Computer Science & Education","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Location Area Planning with complete homogenous traffic\",\"authors\":\"L. Shuguang, X. Xiao\",\"doi\":\"10.1109/ICCSE.2009.5228439\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobility tracking is concerned with finding mobile users within the area serviced by the wireless network. The two basic operations for tracking mobile users, location updating and paging, constitute a necessary overhead on the network. A central problem in the design phase of the system is Location Area Planning: optimally divide the service area into location areas to minimize the total cost of updating and paging. This paper examines complete homogeneous traffic, i.e., the number of mobile users that move between any pair of cells per time unit is a constant, and presents a polynomial time approximation scheme.\",\"PeriodicalId\":303484,\"journal\":{\"name\":\"2009 4th International Conference on Computer Science & Education\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 4th International Conference on Computer Science & Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSE.2009.5228439\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 4th International Conference on Computer Science & Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE.2009.5228439","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Location Area Planning with complete homogenous traffic
Mobility tracking is concerned with finding mobile users within the area serviced by the wireless network. The two basic operations for tracking mobile users, location updating and paging, constitute a necessary overhead on the network. A central problem in the design phase of the system is Location Area Planning: optimally divide the service area into location areas to minimize the total cost of updating and paging. This paper examines complete homogeneous traffic, i.e., the number of mobile users that move between any pair of cells per time unit is a constant, and presents a polynomial time approximation scheme.