scholarly journals A Quality of Service (QoS) Aware Scheduling Algorithm to Boost QoS of Cell-Edge Users in LTE Networks

2019 ◽  
Vol 8 (2) ◽  
pp. 2589-2594

LTE is the abbreviation of Long Term Evolution. LTE networks are developed to provide enhanced Quality of Service (QoS), as today’s cellular world and its high speed multimedia applications demand variety of QoS along with a high speed data rate. Scheduling is a key feature of any network to achieve QoS requirements. The QoS widely depends on the distance of user from the Evolved- Node-B (eNB). The user near eNB experience good QoS and the user far away from eNB experiences poor QoS. The system performance is widely affected due to this. Hence, the ultimate and supreme goal of this research work is to enhance the QoS of the cell edge user and improve network performance. Proposed scheduling algorithm i.e. Improved Extended Modified Largest Weighted Delay First (IE-MLWDF) improves the cell edge throughput along with QoS of the cell - edge users. The paper compares IE-MLWDF with its previous versions namely Modified Largest Weighted Delay First (MLWDF) and Extended - MLWDF in terms of various network parameters. This paper presents a detailed analysis of a scheduling algorithm to enhance QoS of cell edge users to provide better network goals. This algorithm can further be extended or improved to make it more effective.

Guaranteeing Quality of Service (QoS) to mobile users is the primary aim of cellular broadband system like Long Term Evolution (LTE). Radio resource allocation and scheduling are two important functions in the LTE networks to enhance the quality of service. For increasing the generally user experience, an efficient radio resource allocation and Scheduling algorithm should be used. However, this became a non-trivial task as the demands and requirements of user data changes day-to-day. In these situations, with the limited radio resources, maximum system capacity can be obtained on expense of unfair share of the resources. In this work, high speed cell edge users are considered as they experience poor signal strength and their quality of service degrades when they move away from Evolved-Nodes (e-Nodes). Here, a novel scheduling algorithm has been introduced to extend the cell edge throughput amid during high mobility scenarios. The proposed scheduling scheme will be compared with the conventional schemes like best CQI, RR and PF in terms of throughput and fairness. It is presented that the proposed scheme gives better performance against the conventional ones in the chosen scenario.


Symmetry ◽  
2017 ◽  
Vol 9 (6) ◽  
pp. 81 ◽  
Author(s):  
Hasibur Chayon ◽  
Kaharudin Dimyati ◽  
Harikrishnan Ramiah ◽  
Ahmed Reza

2000 ◽  
Vol 13 (8) ◽  
pp. 764-770 ◽  
Author(s):  
Michael L. Main ◽  
David Foltz ◽  
Michael S. Firstenberg ◽  
Eric Bobinsky ◽  
Debra Bailey ◽  
...  

1995 ◽  
Author(s):  
Ezio Barbero ◽  
Ferruccio Antonelli

2015 ◽  
Vol 14 (6) ◽  
pp. 5809-5813
Author(s):  
Abhishek Prabhakar ◽  
Amod Tiwari ◽  
Vinay Kumar Pathak

Wireless security is the prevention of unauthorized access to computers using wireless networks .The trends in wireless networks over the last few years is same as growth of internet. Wireless networks have reduced the human intervention for accessing data at various sites .It is achieved by replacing wired infrastructure with wireless infrastructure. Some of the key challenges in wireless networks are Signal weakening, movement, increase data rate, minimizing size and cost, security of user and QoS (Quality of service) parameters... The goal of this paper is to minimize challenges that are in way of our understanding of wireless network and wireless network performance.


Author(s):  
Simar Preet Singh ◽  
Rajesh Kumar ◽  
Anju Sharma ◽  
S. Raji Reddy ◽  
Priyanka Vashisht

Background: Fog computing paradigm has recently emerged and gained higher attention in present era of Internet of Things. The growth of large number of devices all around, leads to the situation of flow of packets everywhere on the Internet. To overcome this situation and to provide computations at network edge, fog computing is the need of present time that enhances traffic management and avoids critical situations of jam, congestion etc. Methods: For research purposes, there are many methods to implement the scenarios of fog computing i.e. real-time implementation, implementation using emulators, implementation using simulators etc. The present study aims to describe the various simulation and emulation tools for implementing fog computing scenarios. Results: Review shows that iFogSim is the simulator that most of the researchers use in their research work. Among emulators, EmuFog is being used at higher pace than other available emulators. This might be due to ease of implementation and user-friendly nature of these tools and language these tools are based upon. The use of such tools enhance better research experience and leads to improved quality of service parameters (like bandwidth, network, security etc.). Conclusion: There are many fog computing simulators/emulators based on many different platforms that uses different programming languages. The paper concludes that the two main simulation and emulation tools in the area of fog computing are iFogSim and EmuFog. Accessibility of these simulation/emulation tools enhance better research experience and leads to improved quality of service parameters along with the ease of their usage.


Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1400
Author(s):  
Muhammad Adnan ◽  
Jawaid Iqbal ◽  
Abdul Waheed ◽  
Noor Ul Amin ◽  
Mahdi Zareei ◽  
...  

Modern vehicles are equipped with various sensors, onboard units, and devices such as Application Unit (AU) that support routing and communication. In VANETs, traffic management and Quality of Service (QoS) are the main research dimensions to be considered while designing VANETs architectures. To cope with the issues of QoS faced by the VANETs, we design an efficient SDN-based architecture where we focus on the QoS of VANETs. In this paper, QoS is achieved by a priority-based scheduling algorithm in which we prioritize traffic flow messages in the safety queue and non-safety queue. In the safety queue, the messages are prioritized based on deadline and size using the New Deadline and Size of data method (NDS) with constrained location and deadline. In contrast, the non-safety queue is prioritized based on First Come First Serve (FCFS) method. For the simulation of our proposed scheduling algorithm, we use a well-known cloud computing framework CloudSim toolkit. The simulation results of safety messages show better performance than non-safety messages in terms of execution time.


Sign in / Sign up

Export Citation Format

Share Document