A boundary location update strategy for minimizing average cost of paging

Abstract

In this paper, we propose a novel paging strategy based on number of cell in the set of boundary with standard location area (LA) and location update. When compared to conventional paging methods, the propose scheme decreases paging cost but also increases boundary location update cost. The LA boundary location update is performed whenever the MS changes its boundary between the cells set in boundary and the rest of cells in LA. This scheme consider most MS are moving in some cell of LA, with dedicated boundary paging for reduce cost of paging. Therefore, paging cost reduces depending on the number of cell set in the boundary and the scheme was performed by numerical results.