蜂窝网络中的寻呼和注册：联合优化策略和迭代算法
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm
摘要：
本文探讨了蜂窝网络中寻呼和注册策略的优化。运动被建模为离散时间马尔可夫过程，并最小化的折扣，无限时域的平均成本。联合最优的寻呼和注册策略的结构进行了研究，通过使用动态规划部分可观察马尔可夫过程。结果表明，存在的政策与某种简单的形式，是联合最优的，虽然动态规划方法并没有直接提供一个有效的方法来找到的政策。提出并研究了一种简单形式策略的迭代算法。该算法在寻呼策略优化和注册策略优化之间交替。它发现了一对单独的最优策略，但一个例子表明，政策不需要联合最优。利用优控理论和Riesz重排不等式证明了在对称随机游走模型和高斯随机游走模型下，最近位置优先寻呼策略和距离门限注册策略都能给出联合最优的寻呼和注册策略.
英文摘要：
This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discounted, infinite-horizon average cost is addressed. The structure of jointly optimal paging and registration policies is investigated through the use of dynamic programming for partially observed Markov processes. It is shown that there exist policies with a certain simple form that are jointly optimal, though the dynamic programming approach does not directly provide an efficient method to find the policies. An iterative algorithm for policies with the simple form is proposed and investigated. The algorithm alternates between paging policy optimization and registration policy optimization. It finds a pair of individually optimal policies, but an example is given showing that the policies need not be jointly optimal. Majorization theory and Riesz's rearrangement inequality are used to show that jointly optimal paging and registration policies are given for symmetric or Gaussian random walk models by the nearest-location-first paging policy and distance threshold registration policies.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
