{"title":"部分观察随机最短路径问题——在蜂窝网络中顺序寻呼中的应用","authors":"Sumeetpal S. Singh, V. Krishnamurthy","doi":"10.1109/CDC.2001.981024","DOIUrl":null,"url":null,"abstract":"Polling a roaming mobile user in a cellular network to determine its location is called paging and it requires the use of limited wireless resources. We formulate the paging problem as an optimal sequential search problem for a Markovian target and show that the resulting problem is an instance of a Partially Observed Stochastic Shortest Path (POSSP) problem. Using the theory of POSSP problems, we propose optimal and suboptimal paging algorithms with performance bounds. We then propose a scalable sequential paging architecture for paging multiple mobile stations simultaneously using a finite number of paging resources.","PeriodicalId":131411,"journal":{"name":"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Partially observed stochastic shortest path problem - application to sequential paging in cellular networks\",\"authors\":\"Sumeetpal S. Singh, V. Krishnamurthy\",\"doi\":\"10.1109/CDC.2001.981024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Polling a roaming mobile user in a cellular network to determine its location is called paging and it requires the use of limited wireless resources. We formulate the paging problem as an optimal sequential search problem for a Markovian target and show that the resulting problem is an instance of a Partially Observed Stochastic Shortest Path (POSSP) problem. Using the theory of POSSP problems, we propose optimal and suboptimal paging algorithms with performance bounds. We then propose a scalable sequential paging architecture for paging multiple mobile stations simultaneously using a finite number of paging resources.\",\"PeriodicalId\":131411,\"journal\":{\"name\":\"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.2001.981024\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2001.981024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Partially observed stochastic shortest path problem - application to sequential paging in cellular networks
Polling a roaming mobile user in a cellular network to determine its location is called paging and it requires the use of limited wireless resources. We formulate the paging problem as an optimal sequential search problem for a Markovian target and show that the resulting problem is an instance of a Partially Observed Stochastic Shortest Path (POSSP) problem. Using the theory of POSSP problems, we propose optimal and suboptimal paging algorithms with performance bounds. We then propose a scalable sequential paging architecture for paging multiple mobile stations simultaneously using a finite number of paging resources.