版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Natl Tech Univ Athens Div Comp Sci GR-15773 Athens Greece
出 版 物:《WIRELESS PERSONAL COMMUNICATIONS》 (无线个人通信)
年 卷 期:2000年第12卷第1期
页 面:83-109页
核心收录:
学科分类:0810[工学-信息与通信工程] 0809[工学-电子科学与技术(可授工学、理学学位)] 08[工学]
主 题:UMTS location update location area paging paging area 0-1 programming
摘 要:Efficient resource utilisation in future cellular systems is partly related to the location update and paging operations, which rely on proper planning of location and paging areas, and the application of efficient paging schemes. Important is the design of low complexity planning algorithms that may enable the system to dynamically adapt to new traffic and mobility conditions. In this paper we define and solve versions of the location and paging area planning problems focusing also on algorithms that are applicable in real-time. Thus, they can be used to adapt location and paging areas to traffic and mobility conditions. Starting from a formal definition and an optimal formulation, we solve efficiently by means of a low complexity heuristic, a general version of the location area planning problem. Regarding paging area planning, we provide a low complexity algorithm, under the assumption that the scheme applied falls within the last interaction based paging (LIBP) category. The results presented, and the low cost and complexity induced by the proposed schemes, indicates that the real-time application of the schemes is feasible.