Computer Science

Computer Science ›› 2020, Vol. 47 ›› Issue (3): 242-247.doi: 10.11896/jsjkx.190100089

• Computer Network • Previous Articles     Next Articles

Study on Dynamic Priority Admission Control Algorithm in Heterogeneous Wireless Networks

TAO Yang,JI Rui-juan,YANG Li,WANG Jin   

  1. (School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China)
  • Received:2019-01-11 Online:2020-03-15 Published:2020-03-30
  • About author:TAO Yang,born in 1964,postdoctor,professor.His main research interests include wireless sensor networks.
  • Supported by:
    This work was supported by the Chongqing Municpal Basic Science and Frontier Technology Research Commission (cstc2017jcyjAX0135).

PDF (PC)

729

Abstract: 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 adynamicpriority 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.

Key words: Dynamic priority, Group handover, Handover blocking rate, Heterogeneous wireless networks, Network admission control

CLC Number: 

  • TN393
[1]YU H W,ZHANG B.A heterogeneous network selection algorithm based on network attribute and user preference[J].Ad Hoc Networks,2018,72(1):68-80.
[2]KELLOKOSKI J,KOSKINEN J,et al.Always Best Connected Heterogeneous Network Concept[J].Wireless Personal Communications,2014,75(1):63-80.
[3]OBAYIUWANA E,FALOWO O E.Network selection in heterogeneous wireless networks using multi-criteria decision-making algorithms:a review[J].Wireless Networks,2017,23(8):2617-2649.
[4]LIANG G,YU H W.Network selection algorithm for heterogeneous wireless networks based on service characteristics and user preferences[J].Wireless Communications and Networking,2018,32(7):1-16.
[5]BAGHLA S,BANSAL S.An approach to energy efficient vertical handover technique for heterogeneous networks[J].International Journal of Information Technology,2018,10(3):359-366.
[6]JIANG Q,REN X F,ZHANG J X.A vertical handoff algrithm based on priority for heterogeneous wirelaee networks[J].Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition),2014,26(6):826-831.
[7]SHI W X,ZHAO J,CHI X F,et al.Fast dynamic channel alloction algorithm based on priority channel reservation[J].Journal on Communications,2009,30(7):59-66.
[8]LI Y,ZHANG J,ZHOU S Y.A Novel Group Vertical Handover Scheme Based on Maximum Blocking Probability in Heteroge-neous Networks[J].Journal of Information and Computational Science,2015,12(18):6813-6821.
[9]GUI N,QIN L J,CHEN S Q,et al.The Call Admission control Algorithm in the Wireless Cell Network Based on Customer Differentiating[J].Computer Engineering and Applications,2006,42(1):125-127.
[10]RADEV D,RADEVA S,KURTEV I,et al. Priority Handover Schemes in Wireless Mobile Networks[C]∥Proceedings of the 18 th Telecommunications Forum TELFOR.2010:320-324.
[11]ZHANG J,SUN S J,FAN H B,et al.An Improved Least Slack First Real-time Scheduling Algorithm with High Return[J].Computer Engineering,2017,43(3):55-61.
[12]WANG P C.Research on highest value-rate first scheduling algorithm for real-time system under overload conditions[D].Anhui:Anhui University,2016.
[13]AMARO-ORTEGA V,DÍAZ-RAMÍREZ A,FLORES-RÍOS B L,et al.A scheduling extension scheme of the earliest deadline first policy for hard real-time uniprocessor systems integrated on POSIX threads based on Linux[J].Computer Systems Science and Engineering,2018,33(1):31-40.
[14]EZEMA C N,OKAFOR E C,OKEZIE C C.Optimization Modeling and Scheduling of Production Control Schemes for Complex JIT Manufacturing Systems[J].Journal of Scientific and Engineering Research,2016,3(6):252-261.
[15]LAHBY M,BAGHLA S,et al.Survey and comparison of MADM methods for network selection access in heterogeneous networks[C]∥International Conference on New Technologies.Paris,France:IEEE,2015:1-6.
[16]AMALI C,RAMACHANDRAN B.Complexity-consistency trade-off in multi-attribute decision making for vertical handover in heterogeneous wireless networks[J].IET Networks,2016,5(1):13-21.
[17]ZHANG Y,LIU S M.Network Selection Algorithm Based on Multi-attribute Decision[J].Computer Science,2015,42(6):120-124.
[18]XIA J L,CHEN H,YANG B.A Real-Time Tasks Scheduling Algorithm Based on Dynaminc Priority[J].Chinese Journal of Computers,2012,35(12):2687-2695.
[1] ZHANG Yi-wen, LIN Ming-wei. Devices Low Energy Consumption Scheduling Algorithm Based on Dynamic Priority [J]. Computer Science, 2021, 48(11A): 471-475.
[2] JI Xiao-xiang, SHEN Hang, BAI Guang-wei. Non-orthogonal Multiple Access Enabled Scalable Video Multicast in HetNets [J]. Computer Science, 2021, 48(11): 356-362.
[3] GUO Bin, YU Dan-dan, LU Wei, HUANG Ming-he, ZENG Ya-lin. Selective Network Coding Strategy Based on Packet Loss Prediction [J]. Computer Science, 2019, 46(11A): 399-404.
[4] DONG Yu-long,YANG Lian-he,MA Xin. Study on Active Acquisition of Distributed Web Crawler Cluster [J]. Computer Science, 2018, 45(6A): 428-432.
[5] WANG Xi-bo, GE Hong-shuai, WANG Rui-quan and LIN Hai. Design of High Concurrent Communication Server of Elevator Remote Monitoring System [J]. Computer Science, 2017, 44(4): 157-160.
[6] ZHANG Yuan-yuan, WANG Jian and XIAO Chuang-bai. Optimal and Dynamic Resource Management Scheme for Inter-domain Heterogeneous Wireless Networks [J]. Computer Science, 2016, 43(Z11): 290-295.
[7] CHEN Shou-guo, FU An-min and QIN Ning-yuan. Non-repudiable Billing Protocol Based on Self-updating Hash Chain for Heterogeneous Wireless Networks [J]. Computer Science, 2015, 42(3): 111-116.
[8] GE Qing,BAI Guang-wei,SHEN Hang,ZHANG Peng and CAO Lei. Link-quality-aware Opportunistic Network Coding Mechanism in Wireless Networks [J]. Computer Science, 2013, 40(11): 29-34.
[9] LIU Jun-rui,CHEN Ying-tu,FAN Xiao-ya. Two Dimensional Dynamic Priority-based FCFS Token-Queuing Algorithm [J]. Computer Science, 2011, 38(5): 89-92.
[10] . [J]. Computer Science, 2008, 35(9): 45-47.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.