移动IP网络中基于遗传算法的多步寻呼策略及性能分析  

Genetic Algorithm Based Sequential Paging Schemes and Performance Analysis for Mobile IP Networks

作　　者：李楠[1] 潘建[1] 田贤忠[1] 朱艺华[1] 

机构地区：[1]浙江工业大学信息工程学院,浙江杭州310032

出　　处：《电子学报》2008年第12期2333-2338,共6页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60473097;No.60673177);浙江省自然科学基金重点项目(No.Z105185);浙江省钱江人才计划项目(No.2007R10G2020022)

摘　　要：在移动IP网络中,层次移动IP协议可降低移动IP位置管理的信令消耗.该文研究支持寻呼的HMIPv6,提出了时延限制下的多步寻呼策略以及基于遗传算法的多步寻呼方案——根据移动节点的位置概率分布,采用遗传算法对寻呼区域内的所有子网进行分组,每步寻呼一个组,使平均寻呼信令开销达到或接近最优.此外,对HMIPv6、单步寻呼的HMIPv6以及基于遗传算法的多步HMIPv6寻呼方案的信令开销进行了比较分析,得出寻呼节省信令开销的必要条件.最后,给出一组数值结果以说明所提出的寻呼策略的有效性.Hierarchical Mobile IP （HMIP） is able to reduce signaling cost for location management in mobile IP （MIP） networks. This paper focuses on paging-supported HMIPv6. Sequential paging schemes under limited paging delay are studied. In addition,a genetic algorithm （GA） based sequential paging scheme （GABSP） is proposed,in which all the subnets in a paging area are partitioned into groups by a GA making use of location probabilities of MNs, and then, each group is paged in one paging step. The GABSP can achieve the optimal or near-optimal signaling cost. Moreover, the signaling costs of HMIPv6, the HMIPv6 with single-step paging, and the GABSP are compared, and besides, the prerequisite conditions for single or sequential paging to reduce signaling cost are given. Further, numeric results show that the GABSP occupies the lowest signaling cost.

关 键 词：移动IP IP寻呼 多步寻呼 遗传算法 

分 类 号：TN92[电子电信—通信与信息系统]