Performance evaluation of opportunistic schedulers based on fairness and throughput in new-generation mobile networks

被引:1
作者
Kabaou, Mohamed Ouwais [1 ]
Nesrine, Zoghlami [2 ]
Hassen, Hamouda [3 ]
Fatma, Baabou [4 ]
机构
[1] Univ Gabes, High Inst Comp & Multimedia, BP 122, Gabes 6033, Tunisia
[2] Univ Tunis El Manar, Preparotry Inst Engn Studies El Manar, BP 244, Tunis 2092, Tunisia
[3] Al Majmaah Univ, Coll Sci & Humanities, Comp Sci, Al Majmaah 11952, Saudi Arabia
[4] Univ Gabes, High Inst Management Gabes, ISG, Gabes 6002, Tunisia
关键词
Scheduling; Opportunistic; Fairness; Throughput; Performance evaluation; Wireless networks; POWER-CONTROL; ROUND-ROBIN; WIRELESS; SUPPORT; SCHEME; QOS;
D O I
10.1007/s11227-023-05308-x
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper discusses radio resource management in the telecommunications industry that utilizes opportunistic scheduling approaches and methods. It proposes a new scheduler called IFMR (Improved Fairness of MaxRate) to extend the opportunistic approach with the proposition of a new scheduling solution that enables to significantly maximize the system throughput. Our goal is to ensure better results that maximize system throughput, ensure perfect fairness at three levels and maximize the number of satisfied users who have achieved their desired throughput. Similarly, the performance of the proposed algorithm is evaluated and compared with reference algorithms: round robin, MaxSNR and proportional fair (PF). The focus of this study is to evaluate and analyze the quality of service guaranteed to each network subscriber, considering the heterogeneous data traffic based on simulations. The algorithms presented in this paper are programmed and simulated using the MATLAB simulation software. The study aims to effectively analyze the impact of radio resource management algorithms and schedulers, including the round robin algorithm, MaxSNR and PF, among others, with the main objective of evaluating the performance of the schedulers used by telecommunication and cellphone network operators. The scheduling phase, which precedes resource allocation and assignment, is a critical aspect of the study. The impact of these schedulers on throughput and fairness will also be evaluated and analyzed based on specific criteria.
引用
收藏
页码:18053 / 18088
页数:36
相关论文
共 46 条
[1]   Round Opportunistic Fair Wireless Downlink Scheduling with Performance Guarantees [J].
Banat, Mohammad M. ;
Shatnawi, Razan F. .
2022 13TH INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION SYSTEMS (ICICS), 2022, :448-451
[2]   An Opportunistic Power Control Scheme for Mitigating User Location Tracking Attacks in Cellular Networks [J].
Bang, Inkyu ;
Kim, Taehoon ;
Jang, Han Seung ;
Sung, Dan Keun .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2022, 17 :1131-1144
[3]   Cognitive radio based spectrum sharing models for multicasting in 5G cellular networks: A survey [J].
Bhattacharjee, Sangeeta ;
Acharya, Tamaghna ;
Bhattacharya, Uma .
COMPUTER NETWORKS, 2022, 208
[4]   Next generation opportunistic networking in beyond 5G networks [J].
Coll-Perales, Baldomero ;
Pescosolido, Loreto ;
Gozalvez, Javier ;
Passarella, Andrea ;
Conti, Marco .
AD HOC NETWORKS, 2021, 113
[5]   Performance analysis of wireless powered sensor network with opportunistic scheduling over generalized κ - μ shadowed fading channels [J].
Deepan, N. ;
Rebekka, B. .
PHYSICAL COMMUNICATION, 2022, 53
[6]  
Dekeris B, 2007, ITI, P597
[7]  
Do VL, 2003, HPSR 2003: WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, P103
[8]   An Energy-Saving Scheduling Algorithm for Multipath TCP in Wireless Networks [J].
Dong, Pingping ;
Shen, Rongcheng ;
Li, Yajing ;
Nie, Cheng ;
Xie, Jingyun ;
Gao, Kai ;
Zhang, Lianming .
ELECTRONICS, 2022, 11 (03)
[9]  
Francini A, 2001, GLOB TELECOMM CONF, P1821, DOI 10.1109/GLOCOM.2001.965890
[10]   Packet transfer scheduling scheme with throughput compensated considering wireless conditions [J].
Fukui, Y ;
Yamagaki, N ;
Tode, H ;
Murakami, K .
ICCCN 2003: 12TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2003, :11-16