Paging and registration in cellular networks: jointly optimal policies and an iterative algorithm

Abstract

Abstract-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.

Mobility management for efficient data delivery in infrastructure-to-vehicle networks

“…Mobility management systems have been studied extensively in the context of cellular networks [5,6]. The service area of a cellular network is divided into so-called location areas where a mobile terminal can be located.…”

“…It is a location management technique that improves the data transmission between base stations and vehicles in I2V systems through multihop communication. While such techniques have been developed in the context of cellular networks [5,6], they are not readily applicable for VANETs because the structure and organization of communication is quite different from that in cellular systems. Communication in cellular networks is strictly between nodes and base stations.…”

Optimal state estimation in the presence of communication costs and packet drops

“…Comparison with the state of the art Previous work has been done in the field of distributed estimation and in filtering, such as the work of Hajek [1], which explores the optimization of paging and registration policies in mobile cellular networks. In [1], motion is modeled as a discrete-time Markov process, and minimization of the discounted, infinite-horizon average cost is addressed.…”

“…Comparison with the state of the art Previous work has been done in the field of distributed estimation and in filtering, such as the work of Hajek [1], which explores the optimization of paging and registration policies in mobile cellular networks. In [1], motion is modeled as a discrete-time Markov process, and minimization of the discounted, infinite-horizon average cost is addressed. 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.…”

“…An iterative algorithm is proposed and investigated, which alternates between the optimization of paging and registration policies. In comparison with the work in [1], which considers random walks, our work addresses the optimal estimation in the expected square error sense for scalar linear time invariant systems (stable or unstable).…”