### Abstract

Jointly optimal paging and registration policies are identified for a cellular network composed of a linear array of cells. Motion is modeled as a random walk with a symmetric, unimodal step size distribution. Minimization of the discounted, infinite-horizon average cost is addressed. The jointly optimal pair of paging and registration policies is found. The optimal registration policy is a distance threshold type: the mobile station. registers whenever its distance from the previous reporting point exceeds a-threshold. The paging policy is ping-pong type: cells are searched in an order of increasing distance from the cell in which the previous report occurred.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002 |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 20-23 |

Number of pages | 4 |

ISBN (Electronic) | 0780376293, 9780780376298 |

DOIs | |

State | Published - Jan 1 2002 |

Event | 2002 IEEE Information Theory Workshop, ITW 2002 - Bangalore, India Duration: Oct 20 2002 → Oct 25 2002 |

### Publication series

Name | Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002 |
---|

### Other

Other | 2002 IEEE Information Theory Workshop, ITW 2002 |
---|---|

Country | India |

City | Bangalore |

Period | 10/20/02 → 10/25/02 |

### ASJC Scopus subject areas

- Information Systems
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'Jointly optimal paging and registration for a symmetric random walk'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002*(pp. 20-23). [1115405] (Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2002.1115405