北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2015, Vol. 38 ›› Issue (4): 45-48.doi: 10.13190/j.jbupt.2015.04.010

• 论文 • 上一篇    下一篇

阻塞率约束下的多业务群组切换方法

潘甦1,2, 刘浩1, 刘胜美1   

  1. 1. 南京邮电大学 无线通信江苏省重点实验室, 南京 210003;
    2. 东南大学 移动通信国家重点实验室, 南京 210096
  • 收稿日期:2014-09-05 出版日期:2015-08-28 发布日期:2015-06-26
  • 作者简介:潘甦(1969-),男,教授,博士生导师,E-mail:supan@njupt.edu.cn.
  • 基金资助:

    国家自然科学基金项目(61271235);东南大学移动通信国家重点实验室开放研究基金资助项目(2011D07)

A Multi-Services Group Handover Scheme Under Constraint of Blocking Probability

PAN Su1,2, LIU Hao1, LIU Sheng-mei1   

  1. 1. Jiangsu Key Laboratory of Wireless Communications, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;
    2. National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China
  • Received:2014-09-05 Online:2015-08-28 Published:2015-06-26

摘要:

针对异构网络中多业务场景下群组切换时网络拥塞的问题,提出了阻塞率约束下的多业务群组切换算法.将用户按业务类型进行分类,为不同业务类型的用户分配以不同的切换优先级.对于处在同一优先级的用户,在目标切换阻塞率约束条件下,将这些用户分散到不同的时隙上,从而避免大量用户同时选择同一个网络的情况.仿真结果表明,该算法能保证系统的切换阻塞率在可控范围之内,并且能满足不同业务类型用户的需求.

关键词: 群组切换, 网络选择, 多业务, 优先级队列, 切换阻塞率

Abstract:

A multi-services group handover algorithm under constraint of blocking probability was proposed to solve the network congestion problem in multi-services heterogeneous networks. Users are assigned with different handover priorities according to their service types, and the handover is controlled under blocking probability constraints for the users with same priority. The proposed algorithm disperses the users into different slots to avoid large amount of users selecting the same network at the same time. Simulation shows that the proposed algorithm can keep the handover blocking probability of the system manageable and meet the quality of service requirements of different services.

Key words: group handover, network selection, multi-services, priority queues, handover blocking probability

中图分类号: