Abstract
This letter introduces a method for minimizing paging costs in wireless systems with delay constraints. An optimal partition algorithm is proposed and the corresponding paging procedure is provided. Numerical results demonstrate that the new scheme outperforms other previous schemes for uniform and nonuniform location probability distributions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have