A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks
A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks
复制标题
DOI：
10.1016/j.ejor.2006.01.039
复制
发表时间：
2007-04
期刊：
影响因子：
--
通讯作者：
C. Paik;Samit Soni
中科院分区：
文献类型：
--
作者：
C. Paik;Samit Soni
提出了一种基于模拟退火法的移动通信网络最优位置更新和寻呼区配置的数学模型和求解方法。我们使用基于区域的两层位置注册和寻呼方案，其中通过引入两步寻呼过程来降低位置更新和寻呼信令流量的成本。首先描述了两层方案中的位置更新和寻呼过程，并且基于小区形状和移动站的移动模式的假设，提供了计算寻呼相关信令量所需的测量的近似值。设计了一种基于模拟退火法和贪婪启发式算法的求解方法，并通过计算实验验证了该方法相对于其他求解方法的优越性。
This paper presents a mathematical model and simulated annealing based solution approach for finding optimal location updates and paging area configuration for mobile communication networks. We use a two-layered zone-based location registration and paging scheme in which the costs of location updates and paging signaling traffic are reduced by introducing a two-step paging process. The location updates and paging procedures in a two-layered scheme are first described, and an approximation of the measure required for calculating the paging-related signaling volume is provided based on assumptions of cell shapes and mobile stations’ movement patterns. A simulated annealing (SA)-based solution method is devised along with a greedy heuristic, and computational experiments are conducted to illustrate the superiority of the proposed SA-based method over other solution methods.