异构无线网络中动态优先级接纳控制算法研究  

Study on Dynamic Priority Admission Control Algorithm in Heterogeneous Wireless Networks

作　　者：陶洋[1] 纪瑞娟 杨理 王进 TAO Yang;JI Rui-juan;YANG Li;WANG Jin(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)

机构地区：[1]重庆邮电大学通信与信息工程学院

出　　处：《计算机科学》2020年第3期242-247,共6页Computer Science

基　　金：重庆市基础科学与前沿技术研究(一般)项目(cstc2017jcyjAX0135)~~

摘　　要：针对在应急情况下的异构网络环境中不同类型业务在群组切换时出现的网络拥塞问题,以及现有研究中较少考虑不同类型用户所进行的业务的重要性和紧急性不同,从而不能合理分配有限的网络资源的情况,提出了一种异构无线网络中动态优先级接纳控制算法。首先,根据用户类型和业务类型对业务设定初始优先级;然后,根据业务的执行紧迫性和业务的剩余价值密度对业务优先级进行动态调整,并提出了一种基于业务优先级的抢占调度算法;最后为避免在业务优先级进行动态调整过程中出现颠簸调度现象,给出了避免颠簸调度的条件。所提算法考虑了实际情况中不同用户类型所进行的业务重要程度的不同,对业务进行了优先级设定,使初始优先级高的业务能够优先得到服务,在此基础上为尽量满足整体用户的用网需求,对业务的优先级进行了动态调整。为验证所提方法的有效性,将基于优先级队列调度算法和基于阻塞率约束的群组切换方法作为对比算法,在MATLAB软件环境下进行仿真分析。结果表明,所提方法相较于对比算法能够在减少业务切换的阻塞率的同时,使总体业务的完成率提高10%左右,证明了该算法在使初始优先级高的业务能够优先得到服务的同时,为初始优先级低的业务提供了网络切换的条件,从而提高了网络资源分配的合理性和公平性。Aiming at the network congestion problem of different types of services in the heterogeneous network environment in emergency situation,and the fact that the importance and urgency of the services performed by different types of users are seldom considered in the existing research,so the limited network resources cannot be reasonably allocated,this paper proposed a dynamic priority admission control algorithm for heterogeneous wireless networks.Firstly,the initial priority is set according to the type of users and service types.Then,the priority of the service is dynamically adjusted according to the urgency of the service and the residual value density,and a preemption scheduling algorithm based on service priority is proposed.In order to avoid the bumpy scheduling phenomenon during the dynamic adjustment of service priority in the network,the conditions for avoiding bumpy scheduling are given.The proposed algorithm takes into account the importance of the services performed by different user types in the actual situation,and prioritizes the services so that the services with the highest initial priority can be preferentially served.On this basis,in order to meet the needs of overall users,the priority of the business is dynamically adjusted.In order to verify the effectiveness of the proposed method,a priority queue scheduling algorithm and a group handover algorithm based on blocking rate constraint are used as reference in MATLAB.The simulation results show that compared with the other two algorithms,this algorithm can increase the overall service completion rate by about 10%while reducing the blocking rate of the service switching.It proves that the proposed algorithm can enable the service with high initial priority to obtain the service preferentially,and provide the conditions for network switching for the service with low initial priority,which improves the rationality and fairness of network resource allocation.

关 键 词：异构无线网络 群组切换 动态优先级 切换阻塞率 网络接纳控制 

分 类 号：TN393[电子电信—物理电子学]