Partially observed stochastic shortest path problem - application to sequential paging in cellular networks

TitlePartially observed stochastic shortest path problem - application to sequential paging in cellular networks
Publication TypeConference Paper
Year of Publication2001
AuthorsSingh, S., and V. Krishnamurthy
Conference NameDecision and Control, 2001. Proceedings of the 40th IEEE Conference on
Pagination1053 -1058 vol.2
Keywordscellular network, cellular radio, limited wireless resources, Markov processes, Markovian target, mobile station, multiple mobile stations, optimal paging algorithms, optimal sequential search problem, paging, paging communication, partially observed stochastic shortest path problem, radio networks, roaming mobile user, scalable sequential paging architecture, search problems, suboptimal paging algorithms
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

URLhttp://dx.doi.org/10.1109/.2001.981024
DOI10.1109/.2001.981024

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia