{'fraction_non_alphanumeric': 0.009689922480620155, 'fraction_numerical': 0.0, 'mean_word_length': 5.298780487804878, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An optimal search strategy for mobile stations in wireless networks

Efficient abstractions for location management is a key consideration in wireless networks that support universal personal communications. Location management involves a tracking component that maintains dynamic data on the location of mobile stations through a distributed database, and a search component that prescribes the manner in which the wireless network is to be paged so as to determine the location of mobile stations whose whereabouts are unknown. In this paper, we focus on the search component of location management. We employ techniques from statistical search theory and describe a stochastic sequential framework that systematically determines the location of mobile stations situated within a group of cells. This strategy is optimal in the sense that it minimizes the expected cost of search. Based on this optimal policy, we construct two search algorithms. The first is based on a tableau approach while the second has a Bayesian character.