Computer Science – Information Theory
Scientific paper
2007-02-18
Computer Science
Information Theory
13 pages, submitted to IEEE Trans. Information Theory
Scientific paper
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.
Hajek Bruce
Mitzel Kevin
Yang Sichao
No associations
LandOfFree
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-566967